Ömer Egecioglu

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 14

Top Venues

Discret. Appl. Math.

IACR Cryptol. ePrint Arch.

Int. J. Found. Comput. Sci.

CODASPY

Publications

Ömer Egecioglu, Elif Saygi, Zülfükar Saygi
Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes. Discret. Math. Algorithms Appl. 16 (3) (2024)
Ömer Egecioglu, Benedek Nagy
On Languages Generated by Signed Grammars. NCMA (2023)
Ömer Egecioglu, Vesna Irsic
Fibonacci-run graphs I: Basic properties. Discret. Appl. Math. 295 (2021)
Ömer Egecioglu, Vesna Irsic
Fibonacci-run graphs II: Degree sequences. Discret. Appl. Math. 300 (2021)
Ömer Egecioglu, Elif Saygi, Zülfükar Saygi
Alternate Lucas Cubes. Int. J. Found. Comput. Sci. 32 (7) (2021)
Ömer Egecioglu, Elif Saygi, Zülfükar Saygi
The number of short cycles in Fibonacci cubes. Theor. Comput. Sci. 871 (2021)
Ömer Egecioglu, Elif Saygi, Zülfükar Saygi
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes. Int. J. Found. Comput. Sci. 31 (5) (2020)
Elif Saygi, Ömer Egecioglu
Boundary enumerator polynomial of hypercubes in Fibonacci cubes. Discret. Appl. Math. 266 (2019)
Cetin Sahin, Brandon Kuczenski, Ömer Egecioglu, Amr El Abbadi
Privacy-Preserving Certification of Sustainability Metrics. CODASPY (2018)
Elif Saygi, Ömer Egecioglu
q-cube enumerator polynomial of Fibonacci cubes. Discret. Appl. Math. 226 (2017)
Ömer Egecioglu
A note on iterated galileo sequences. Discret. Math. Algorithms Appl. 9 (2) (2017)
Cetin Sahin, Brandon Kuczenski, Ömer Egecioglu, Amr El Abbadi
Towards Practical Privacy-Preserving Life Cycle Assessment Computations. CODASPY (2017)
Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IEEE Trans. Computers 65 (11) (2016)
Elif Saygi, Ömer Egecioglu
Counting disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. 215 (2016)
Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IACR Cryptol. ePrint Arch. 2015 (2015)
Ömer Egecioglu, Çetin Kaya Koç
Reducing the Complexity of Normal Basis Multiplication. IACR Cryptol. ePrint Arch. 2014 (2014)
Ömer Egecioglu, Çetin Kaya Koç
Reducing the Complexity of Normal Basis Multiplication. WAIFI (2014)
Peter Damaschke, Ömer Egecioglu, Leonid Molokov
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM (2013)
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs. IEEE Trans. Knowl. Data Eng. 24 (4) (2012)
Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân
Multitape NFA: Weak Synchronization of the Input Heads. SOFSEM (2012)
Oscar H. Ibarra, Ömer Egecioglu
A Survey of Results on Stateless Multicounter Automata. Fundam. Informaticae 116 (1-4) (2012)
László Hegedüs, Benedek Nagy, Ömer Egecioglu
Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. Nat. Comput. 11 (3) (2012)
Benedek Nagy, László Hegedüs, Ömer Egecioglu
Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. IWANN (1) (2011)
Ömer Egecioglu, László Hegedüs, Benedek Nagy
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Informaticae 110 (1-4) (2011)
Ömer Egecioglu, Timothy Redmond, Charles Ryavec
A multilinear operator for almost product evaluation of Hankel determinants. J. Comb. Theory, Ser. A 117 (1) (2010)
Ömer Egecioglu, László Hegedüs, Benedek Nagy
Stateless multicounter 5′ → 3′ Watson-Crick automata. BIC-TA (2010)
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs CoRR (2010)
Ömer Egecioglu, B. Siddik Yarman
Stable Factorization of Strictly Hurwitz Polynomials. Int. J. Comput. Commun. Control 5 (5) (2010)
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
Anonymizing weighted social network graphs. ICDE (2010)
Ömer Egecioglu
Bessel Polynomials and the Partial Sums of the Exponential Series. SIAM J. Discret. Math. 24 (4) (2010)
Krishna P. N. Puttaswamy, Alessandra Sala, Ömer Egecioglu, Ben Y. Zhao
Rome: Performance and Anonymity using Route Meshes. INFOCOM (2009)
Oscar H. Ibarra, Ömer Egecioglu
Hierarchies and Characterizations of Stateless Multicounter Machines. COCOON (2009)
Ömer Egecioglu
Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Developments in Language Theory (2009)
Ömer Egecioglu, Oscar H. Ibarra
On Stateless Multicounter Machines. CiE (2009)
Ömer Egecioglu
Uniform generation of anonymous and neutral preference profiles for social choice rules. Monte Carlo Methods Appl. 15 (3) (2009)
Ryan Dixon, Ömer Egecioglu, Timothy Sherwood
Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. Int. J. Found. Comput. Sci. 20 (4) (2009)
Ömer Egecioglu
On Bottcher's mysterious identity. Australas. J Comb. 43 (2009)
Matteo Cavaliere, Oscar H. Ibarra, Gheorghe Paun, Ömer Egecioglu, Mihai Ionescu, Sara Woodworth
Asynchronous spiking neural P systems. Theor. Comput. Sci. 410 (24-25) (2009)
Ömer Egecioglu, Timothy Redmond, Charles Ryavec
Almost Product Evaluation of Hankel Determinants. Electron. J. Comb. 15 (1) (2008)
Ryan Dixon, Ömer Egecioglu, Timothy Sherwood
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. CIAA (2008)
Ömer Egecioglu, Oscar H. Ibarra
A q-Analogue of the Parikh Matrix Mapping. Formal Models, Languages and Applications (2007)
Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. ICDE (2007)
Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ibarra, Mihai Ionescu, Gheorghe Paun, Sara Woodworth
Asynchronous Spiking Neural P Systems: Decidability and Undecidability. DNA (2007)
Hakan Ferhatosmanoglu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
Optimal Data-Space Partitioning of Spatial Data for Parallel I/O. Distributed Parallel Databases 17 (1) (2005)
Abdullah N. Arslan, Ömer Egecioglu
Algorithms For The Constrained Longest Common Subsequence Problems. Int. J. Found. Comput. Sci. 16 (6) (2005)
Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. Int. J. Found. Comput. Sci. 15 (4) (2004)
Ömer Egecioglu, Oscar H. Ibarra
A Matrix q-Analogue of the Parikh Map. IFIP TCS (2004)
Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu
Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312 (2-3) (2004)
Abdullah N. Arslan, Ömer Egecioglu
Dictionary Look-Up Within Small Edit Distance. Int. J. Found. Comput. Sci. 15 (1) (2004)
Abdullah N. Arslan, Ömer Egecioglu
Algorithms for the Constrained Longest Common Subsequence Problems. Stringology (2004)
Ömer Egecioglu, Hakan Ferhatosmanoglu, Ümit Y. Ogras
Dimensionality Reduction and Similarity Computation by Inner-Product Approximations. IEEE Trans. Knowl. Data Eng. 16 (6) (2004)
Abdullah N. Arslan, Ömer Egecioglu
Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. INFORMS J. Comput. 16 (4) (2004)
Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena
Characterizations of Catalytic Membrane Computing Systems. MFCS (2003)
Abdullah N. Arslan, Ömer Egecioglu
Algorithms for Local Alignment with Length Constraints. LATIN (2002)
Abdullah N. Arslan, Ömer Egecioglu
Efficient Computation of Long Similar Subsequences. SPIRE (2002)
Abdullah N. Arslan, Ömer Egecioglu
Dictionary Look-Up within Small Edit Distance. COCOON (2002)
Peter R. Cappello, Ömer Egecioglu
Automatic Processor Lower Bound Formulas for Array Computations. ISPAN (2002)
M. Cemil Azizoglu, Ömer Egecioglu
The Isoperimetric Number and The Bisection Width of Generalized Cylinders. Electron. Notes Discret. Math. 11 (2002)
Abdullah N. Arslan, Ömer Egecioglu
Approximation Algorithms for Local Alignment with Length Constraints. Int. J. Found. Comput. Sci. 13 (5) (2002)
Abdullah N. Arslan, Ömer Egecioglu
An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON (2001)
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner
A new approach to sequence comparison: normalized sequence alignment. RECOMB (2001)
Ömer Egecioglu
Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. PKDD (2001)
Ömer Egecioglu, Timothy Redmond, Charles Ryavec
From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. Electron. J. Comb. 8 (1) (2001)
Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner
A new approach to sequence comparison: normalized sequence alignment. Bioinform. 17 (4) (2001)
Ömer Egecioglu, Hakan Ferhatosmanoglu
Dimensionality Reduction and Similarity Computation by Inner Product Approximations. CIKM (2000)
Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman
Processor-time-optimal systolic arrays. Parallel Algorithms Appl. 15 (3-4) (2000)
Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
Image compression for fast wavelet-based subregion retrieval. Theor. Comput. Sci. 240 (2) (2000)
M. Cemil Azizoglu, Ömer Egecioglu
Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. IEEE Trans. Computers 49 (3) (2000)
M. Cemil Azizoglu, Ömer Egecioglu
The Isoperimetric Number of d-Dimensional k-Ary Arrays. Int. J. Found. Comput. Sci. 10 (3) (1999)
Kamil Saraç, Ömer Egecioglu, Amr El Abbadi
DFT Techniques for Size Estimation of Database Join Operations. Int. J. Found. Comput. Sci. 10 (1) (1999)
Abdullah N. Arslan, Ömer Egecioglu
An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG (1999)
Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. J. Parallel Distributed Comput. 49 (1) (1998)
Peter R. Cappello, Ömer Egecioglu
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. IPPS/SPDP (1998)
Ömer Egecioglu, Marcus Peinado
Algorithms for Almost-uniform Generation with an Unbiased Binary Source. COCOON (1998)
Kamil Saraç, Ömer Egecioglu, Amr El Abbadi
Iterated DFT Based Techniques for Join Size Estimation. CIKM (1998)
M. Cemil Azizoglu, Ömer Egecioglu
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. IPPS/SPDP (1998)
Peter R. Cappello, Ömer Egecioglu
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. Int. J. Found. Comput. Sci. 9 (4) (1998)
Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
Billiard Quorums on the Grid. Inf. Process. Lett. 64 (1) (1997)
Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. COCOON (1997)
Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. IEEE Trans. Parallel Distributed Syst. 8 (5) (1997)
Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval. Data Compression Conference (1996)
Ömer Egecioglu, Maximilian Ibel
Parallel algorithms for fast computation of normalized edit distances. SPDP (1996)
Daniel Andresen, Tao Yang, Ömer Egecioglu, Oscar H. Ibarra, Terence R. Smith
Scalability Issues for High Performance Digital Libraries on the World Wide Web. ADL (1996)
Ömer Egecioglu, Teofilo F. Gonzalez
A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6 (1996)
Ömer Egecioglu, Ashok Srinivasan
Domain Decomposition for Particle Methods on the Sphere. IRREGULAR (1996)
Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. COCOON (1995)
James Abello, Ömer Egecioglu, Krishna Kumar
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. Discret. Comput. Geom. 14 (3) (1995)
Ömer Egecioglu, Ambuj K. Singh
Naming Symmetric Processes Using Shared Variables. Distributed Comput. 8 (1) (1994)
Ömer Egecioglu, Çetin Kaya Koç
Exponentiation Using Canonical Recoding. Theor. Comput. Sci. 129 (2) (1994)
James Abello, Krishna Kumar, Ömer Egecioglu
A Combinatorial View of Visibility Graphs of Simple Polygons. ICCI (1993)
Ömer Egecioglu, Ashok Srinivasan
Optimal Parallel Prefix on Mesh Architectures. Parallel Algorithms Appl. 1 (3) (1993)
James Abello, Ömer Egecioglu
Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geom. Appl. 3 (1) (1993)
Gregory R. De Haan, Ömer Egecioglu
Topology preservation for speech recognition. ICSLP (1992)
Ömer Egecioglu, Çetin Kaya Koç
A parallel algorithm for generating discrete orthogonal polynomials. Parallel Comput. 18 (6) (1992)
Ömer Egecioglu, Jeffrey B. Remmel
Brick tabloids and the connection matrices between bases of symmetric functions. Discret. Appl. Math. 34 (1-3) (1991)
Ömer Egecioglu, Jeffrey B. Remmel
The monomial symmetric functions and the Frobenius map. J. Comb. Theory, Ser. A 54 (2) (1990)
Ömer Egecioglu, Bahman Kalantari
Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32 (4) (1989)
Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç
Parallel Hermite interpolation: An algebraic approach. Computing 42 (4) (1989)
Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç
Fast computation of divided differences and parallel hermite interpolation. J. Complex. 5 (4) (1989)
Ömer Egecioglu, Çetin Kaya Koç, Alan J. Laub
Prefix algorithms for tridiagonal systems on hypercube multiprocessors. C³P (1988)

Ömer Egecioglu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ömer Egecioglu