BİDB | Veri Yönetim Sistemi

HIZLI ERİŞİM

DOKTOR ÖĞRETİM ÜYESİ GÖKÇE ÇAYLAK KAYATURAN

ORDU ÜNİVERSİTESİ/FEN-EDEBİYAT FAKÜLTESİ/MATEMATİK BÖLÜMÜ/CEBİR VE SAYILAR TEORİSİ ANABİLİM DALI/ (Araştırmacı ID : 295659) - (ORCID : 0000-0001-6823-7686) gokcekayaturan@odu.edu.tr

Fen Bilimleri ve Matematik Temel Alanı Matematik

1	Graph-Theoretical Approaches to Routing Problems in Computer Networks with Path-Coding Methods: Bloom Filter vs Cuckoo Filter ÇAYLAK KAYATURAN GÖKÇE (04.09.2024 - 07.09.2024) , Yayın Yeri: 10th International IFS and Contemporary Mathematics and Engineering Conference ,07.09.2024 Uluslararası Özet bildiri
2	Almost Shortest Paths: To Alternate Routes for Security Reasons in Graphs ÇAYLAK KAYATURAN GÖKÇE (10.05.2023 - 13.05.2023) , Yayın Yeri: 6th International HYBRID Conference on Mathematical Advances and Applications ,13.05.2023 Uluslararası Özet bildiri
3	TO ALTERNATE THE ROUTES ENCODED BY BLOOM FILTERS IN COMPUTER NETWORKS REPRESENTED BY GRAPHS ÇAYLAK KAYATURAN GÖKÇE (20.05.2022 - 22.05.2022) , Yayın Yeri: THE SIXTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL MATHEMATICS AND ENGINEERING SCIENCES (CMES-2022) ,22.05.2022 Uluslararası Özet bildiri
4	Dikdörtgensel Izgara Graarda Yönlendirme Senaryolar Altnda Hatasz Kodlama Yöntemleri ÇAYLAK KAYATURAN GÖKÇE (30.08.2021 - ) , Yayın Yeri: UMS 2021 , Ulusal Özet bildiri
5	Encoding Shortest Paths in Triangular Grids for Delivery Without Errors ÇAYLAK KAYATURAN GÖKÇE (19.07.2017 - ) , Yayın Yeri: ICFNDS2017 ,19.07.2017 Uluslararası Tam metin bildiri
6	Routing in Hexagonal Computer Networks: How to Present Paths by Bloom Filters Without False Positives ÇAYLAK KAYATURAN GÖKÇE (28.09.2016 - ) , Yayın Yeri: 2016 8th Computer Science and Electronic Engineering Conference (CEEC) ,30.01.2017 Uluslararası Tam metin bildiri
7	A Way of Eliminating Errors When Using Bloom Filters for Routing in Computer Networks ÇAYLAK KAYATURAN GÖKÇE (21.02.2016 - ) , Yayın Yeri: The Fifteenth International Conference on Networks: ICN 2016 ,21.02.2016 Uluslararası Tam metin bildiri

1	Graph-Theoretical Approaches to Routing Problems in Computer Networks with Path-Coding Methods: Bloom Filter vs Cuckoo Filter ÇAYLAK KAYATURAN GÖKÇE (04.09.2024 - 07.09.2024) , Yayın Yeri: 10th International IFS and Contemporary Mathematics and Engineering Conference ,07.09.2024 Uluslararası Özet bildiri
2	Almost Shortest Paths: To Alternate Routes for Security Reasons in Graphs ÇAYLAK KAYATURAN GÖKÇE (10.05.2023 - 13.05.2023) , Yayın Yeri: 6th International HYBRID Conference on Mathematical Advances and Applications ,13.05.2023 Uluslararası Özet bildiri
3	TO ALTERNATE THE ROUTES ENCODED BY BLOOM FILTERS IN COMPUTER NETWORKS REPRESENTED BY GRAPHS ÇAYLAK KAYATURAN GÖKÇE (20.05.2022 - 22.05.2022) , Yayın Yeri: THE SIXTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL MATHEMATICS AND ENGINEERING SCIENCES (CMES-2022) ,22.05.2022 Uluslararası Özet bildiri
4	Encoding Shortest Paths in Triangular Grids for Delivery Without Errors ÇAYLAK KAYATURAN GÖKÇE (19.07.2017 - ) , Yayın Yeri: ICFNDS2017 ,19.07.2017 Uluslararası Tam metin bildiri
5	Routing in Hexagonal Computer Networks: How to Present Paths by Bloom Filters Without False Positives ÇAYLAK KAYATURAN GÖKÇE (28.09.2016 - ) , Yayın Yeri: 2016 8th Computer Science and Electronic Engineering Conference (CEEC) ,30.01.2017 Uluslararası Tam metin bildiri
6	A Way of Eliminating Errors When Using Bloom Filters for Routing in Computer Networks ÇAYLAK KAYATURAN GÖKÇE (21.02.2016 - ) , Yayın Yeri: The Fifteenth International Conference on Networks: ICN 2016 ,21.02.2016 Uluslararası Tam metin bildiri

1	Dikdörtgensel Izgara Graarda Yönlendirme Senaryolar Altnda Hatasz Kodlama Yöntemleri ÇAYLAK KAYATURAN GÖKÇE (30.08.2021 - ), Yayın Yeri: UMS 2021 , Ulusal Özet bildiri

2019 © ORDU ÜNİVERSİTESİ