Algorithms for the Character Theory of the Symmetric Group. - Ömer Egecioglu (European Conference on Computer Algebra (2), 1985)

Bijections for Cayley trees, spanning trees, and their q-analogues. - Ömer Egecioglu; Jeffrey B. Remmel (J. Comb. Theory A, 1986)

Prefix algorithms for tridiagonal systems on hypercube multiprocessors. - Ömer Egecioglu; Çetin Kaya Koç; Alan J. Laub (C³P, 1988)

Parallel Hermite interpolation: An algebraic approach. - Ömer Egecioglu; Efstratios Gallopoulos; Çetin Kaya Koç (Computing, 1989)

Approximating the Diameter of a Set of Points in the Euclidean Space. - Ömer Egecioglu; Bahman Kalantari (Inf. Process. Lett., 1989)

Fast computation of divided differences and parallel hermite interpolation. - Ömer Egecioglu; Efstratios Gallopoulos; Çetin Kaya Koç (J. Complex., 1989)

The monomial symmetric functions and the Frobenius map. - Ömer Egecioglu; Jeffrey B. Remmel (J. Comb. Theory A, 1990)

Brick tabloids and the connection matrices between bases of symmetric functions. - Ömer Egecioglu; Jeffrey B. Remmel (Discret. Appl. Math., 1991)

Topology preservation for speech recognition. - Gregory R. De Haan; Ömer Egecioglu (ICSLP, 1992)

A parallel algorithm for generating discrete orthogonal polynomials. - Ömer Egecioglu; Çetin Kaya Koç (Parallel Comput., 1992)

A Combinatorial View of Visibility Graphs of Simple Polygons. - James Abello; Krishna Kumar; Ömer Egecioglu (ICCI, 1993)

Visibility graphs of staircase polygons with uniform step length. - James Abello; Ömer Egecioglu (Int. J. Comput. Geom. Appl., 1993)

Optimal Parallel Prefix on Mesh Architectures. - Ömer Egecioglu; Ashok Srinivasan (Parallel Algorithms Appl., 1993)

Naming Symmetric Processes Using Shared Variables. - Ömer Egecioglu; Ambuj K. Singh (Distributed Comput., 1994)

Exponentiation Using Canonical Recoding. - Ömer Egecioglu; Çetin Kaya Koç (Theor. Comput. Sci., 1994)

Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. - James Abello; Ömer Egecioglu; Krishna Kumar (Discret. Comput. Geom., 1995)

Scalability Issues for High Performance Digital Libraries on the World Wide Web. - Daniel Andresen; Tao Yang 009; Ömer Egecioglu; Oscar H. Ibarra; Terence R. Smith (ADL, 1996)

Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (Data Compression Conference, 1996)

Domain Decomposition for Particle Methods on the Sphere. - Ömer Egecioglu; Ashok Srinivasan (IRREGULAR, 1996)

Parallel algorithms for fast computation of normalized edit distances. - Ömer Egecioglu; Maximilian Ibel (SPDP, 1996)

A Computationally Intractable Problem on Simplicial Complexes. - Ömer Egecioglu; Teofilo F. Gonzalez (Comput. Geom., 1996)

A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (COCOON, 1997)

Billiard Quorums on the Grid. - Divyakant Agrawal; Ömer Egecioglu; Amr El Abbadi (Inf. Process. Lett., 1997)

Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. - Divyakant Agrawal; Ömer Egecioglu; Amr El Abbadi (IEEE Trans. Parallel Distributed Syst., 1997)

Iterated DFT Based Techniques for Join Size Estimation. - Kamil Saraç; Ömer Egecioglu; Amr El Abbadi (CIKM, 1998)

Algorithms for Almost-uniform Generation with an Unbiased Binary Source. - Ömer Egecioglu; Marcus Peinado (COCOON, 1998)

Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. - M. Cemil Azizoglu; Ömer Egecioglu (IPPS/SPDP, 1998)

Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. - Peter R. Cappello; Ömer Egecioglu (Int. J. Found. Comput. Sci., 1998)

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. - Daniel Andresen; Tao Yang 009; Oscar H. Ibarra; Ömer Egecioglu (J. Parallel Distributed Comput., 1998)

An Efficient Uniform-Cost Normalized Edit Distance Algorithm. - Abdullah N. Arslan; Ömer Egecioglu (SPIRE/CRIWG, 1999)

The Isoperimetric Number of d-Dimensional k-Ary Arrays. - M. Cemil Azizoglu; Ömer Egecioglu (Int. J. Found. Comput. Sci., 1999)

DFT Techniques for Size Estimation of Database Join Operations. - Kamil Saraç; Ömer Egecioglu; Amr El Abbadi (Int. J. Found. Comput. Sci., 1999)

Dimensionality Reduction and Similarity Computation by Inner Product Approximations. - Ömer Egecioglu; Hakan Ferhatosmanoglu (CIKM, 2000)

Processor-time-optimal systolic arrays. - Peter R. Cappello; Ömer Egecioglu; Chris J. Scheiman (Parallel Algorithms Appl., 2000)

Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. - M. Cemil Azizoglu; Ömer Egecioglu (IEEE Trans. Computers, 2000)

Image compression for fast wavelet-based subregion retrieval. - Athanassios S. Poulakidas; Ashok Srinivasan; Ömer Egecioglu; Oscar H. Ibarra; Tao Yang 009 (Theor. Comput. Sci., 2000)

An Improved Upper Bound on the Size of Planar Convex-Hulls. - Abdullah N. Arslan; Ömer Egecioglu (COCOON, 2001)

Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. - Ömer Egecioglu (PKDD, 2001)

A new approach to sequence comparison: normalized sequence alignment. - Abdullah N. Arslan; Ömer Egecioglu; Pavel A. Pevzner (Bioinform., 2001)

From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. - Ömer Egecioglu; Timothy Redmond; Charles Ryavec (Electron. J. Comb., 2001)

Automatic Processor Lower Bound Formulas for Array Computations. - Peter R. Cappello; Ömer Egecioglu (ISPAN, 2002)

Algorithms for Local Alignment with Length Constraints. - Abdullah N. Arslan; Ömer Egecioglu (LATIN, 2002)

Efficient Computation of Long Similar Subsequences. - Abdullah N. Arslan; Ömer Egecioglu (SPIRE, 2002)

The Isoperimetric Number and The Bisection Width of Generalized Cylinders. - M. Cemil Azizoglu; Ömer Egecioglu (Electron. Notes Discret. Math., 2002)

Approximation Algorithms for Local Alignment with Length Constraints. - Abdullah N. Arslan; Ömer Egecioglu (Int. J. Found. Comput. Sci., 2002)

Characterizations of Catalytic Membrane Computing Systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu; Gaurav Saxena (MFCS, 2003)

A Matrix q-Analogue of the Parikh Map. - Ömer Egecioglu; Oscar H. Ibarra (IFIP TCS, 2004)

Dictionary Look-Up Within Small Edit Distance. - Abdullah N. Arslan; Ömer Egecioglu (Int. J. Found. Comput. Sci., 2004)

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. - Ömer Egecioglu; Jeffrey B. Remmel; S. G. Williamson (Int. J. Found. Comput. Sci., 2004)

Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. - Abdullah N. Arslan; Ömer Egecioglu (INFORMS J. Comput., 2004)

Catalytic P systems, semilinear sets, and vector addition systems. - Oscar H. Ibarra; Zhe Dang; Ömer Egecioglu (Theor. Comput. Sci., 2004)

Dimensionality Reduction and Similarity Computation by Inner-Product Approximations. - Ömer Egecioglu; Hakan Ferhatosmanoglu; Ümit Y. Ogras (IEEE Trans. Knowl. Data Eng., 2004)

Optimal Data-Space Partitioning of Spatial Data for Parallel I/O. - Hakan Ferhatosmanoglu; Divyakant Agrawal; Ömer Egecioglu; Amr El Abbadi (Distributed Parallel Databases, 2005)

Algorithms For The Constrained Longest Common Subsequence Problems. - Abdullah N. Arslan; Ömer Egecioglu (Int. J. Found. Comput. Sci., 2005)

A q-Analogue of the Parikh Matrix Mapping. - Ömer Egecioglu; Oscar H. Ibarra (Formal Models, Languages and Applications, 2007)

Asynchronous Spiking Neural P Systems: Decidability and Undecidability. - Matteo Cavaliere; Ömer Egecioglu; Oscar H. Ibarra; Mihai Ionescu; Gheorghe Paun; Sara Woodworth (DNA, 2007)

DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. - Ping Wu; Divyakant Agrawal; Ömer Egecioglu; Amr El Abbadi (ICDE, 2007)

Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. - Ömer Egecioglu; Abdullah N. Arslan (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. - Ryan Dixon; Ömer Egecioglu; Timothy Sherwood (CIAA, 2008)

Almost Product Evaluation of Hankel Determinants. - Ömer Egecioglu; Timothy Redmond; Charles Ryavec (Electron. J. Comb., 2008)

On Stateless Multicounter Machines. - Ömer Egecioglu; Oscar H. Ibarra (CiE, 2009)

Hierarchies and Characterizations of Stateless Multicounter Machines. - Oscar H. Ibarra; Ömer Egecioglu (COCOON, 2009)

Strongly Regular Grammars and Regular Approximation of Context-Free Languages. - Ömer Egecioglu (Developments in Language Theory, 2009)

Rome: Performance and Anonymity using Route Meshes. - Krishna P. N. Puttaswamy; Alessandra Sala; Ömer Egecioglu; Ben Y. Zhao (INFOCOM, 2009)

On Bottcher's mysterious identity. - Ömer Egecioglu (Australas. J Comb., 2009)

Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. - Ryan Dixon; Ömer Egecioglu; Timothy Sherwood (Int. J. Found. Comput. Sci., 2009)

Uniform generation of anonymous and neutral preference profiles for social choice rules. - Ömer Egecioglu (Monte Carlo Methods Appl., 2009)

Asynchronous spiking neural P systems. - Matteo Cavaliere; Oscar H. Ibarra; Gheorghe Paun; Ömer Egecioglu; Mihai Ionescu; Sara Woodworth (Theor. Comput. Sci., 2009)

Stateless multicounter 5′ → 3′ Watson-Crick automata. - Ömer Egecioglu; László Hegedüs; Benedek Nagy (BIC-TA, 2010)

Anonymizing weighted social network graphs. - Sudipto Das; Ömer Egecioglu; Amr El Abbadi (ICDE, 2010)

Stable Factorization of Strictly Hurwitz Polynomials. - Ömer Egecioglu; B. Siddik Yarman (Int. J. Comput. Commun. Control, 2010)

A multilinear operator for almost product evaluation of Hankel determinants. - Ömer Egecioglu; Timothy Redmond; Charles Ryavec (J. Comb. Theory A, 2010)

Bessel Polynomials and the Partial Sums of the Exponential Series. - Ömer Egecioglu (SIAM J. Discret. Math., 2010)

Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. - Benedek Nagy; László Hegedüs; Ömer Egecioglu (IWANN (1), 2011)

Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. - Ömer Egecioglu; László Hegedüs; Benedek Nagy (Fundam. Informaticae, 2011)

Multitape NFA: Weak Synchronization of the Input Heads. - Ömer Egecioglu; Oscar H. Ibarra; Nicholas Q. Trân (SOFSEM, 2012)

A Survey of Results on Stateless Multicounter Automata. - Oscar H. Ibarra; Ömer Egecioglu (Fundam. Informaticae, 2012)

Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. - László Hegedüs; Benedek Nagy; Ömer Egecioglu (Nat. Comput., 2012)

Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs. - Sudipto Das; Ömer Egecioglu; Amr El Abbadi (IEEE Trans. Knowl. Data Eng., 2012)

Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. - Peter Damaschke; Ömer Egecioglu; Leonid Molokov (WALCOM, 2013)

Reducing the Complexity of Normal Basis Multiplication. - Ömer Egecioglu; Çetin Kaya Koç (IACR Cryptol. ePrint Arch., 2014)

Counting disjoint hypercubes in Fibonacci cubes. - Elif Saygi; Ömer Egecioglu (Discret. Appl. Math., 2016)

A Matrix Decomposition Method for Optimal Normal Basis Multiplication. - Can Kizilkale; Ömer Egecioglu; Çetin Kaya Koç (IEEE Trans. Computers, 2016)

Towards Practical Privacy-Preserving Life Cycle Assessment Computations. - Cetin Sahin; Brandon Kuczenski; Ömer Egecioglu; Amr El Abbadi (CODASPY, 2017)

q-cube enumerator polynomial of Fibonacci cubes. - Elif Saygi; Ömer Egecioglu (Discret. Appl. Math., 2017)

A note on iterated galileo sequences. - Ömer Egecioglu (Discret. Math. Algorithms Appl., 2017)

Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. - Abdullah N. Arslan; Ömer Egecioglu (Handbook of Approximation Algorithms and Metaheuristics (2), 2018)

Privacy-Preserving Certification of Sustainability Metrics. - Cetin Sahin; Brandon Kuczenski; Ömer Egecioglu; Amr El Abbadi (CODASPY, 2018)

Boundary enumerator polynomial of hypercubes in Fibonacci cubes. - Elif Saygi; Ömer Egecioglu (Discret. Appl. Math., 2019)

k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes. - Ömer Egecioglu; Elif Saygi; Zülfükar Saygi (Int. J. Found. Comput. Sci., 2020)

Fibonacci-run graphs I: Basic properties. - Ömer Egecioglu; Vesna Irsic (Discret. Appl. Math., 2021)

Fibonacci-run graphs II: Degree sequences. - Ömer Egecioglu; Vesna Irsic (Discret. Appl. Math., 2021)

Alternate Lucas Cubes. - Ömer Egecioglu; Elif Saygi; Zülfükar Saygi (Int. J. Found. Comput. Sci., 2021)

The number of short cycles in Fibonacci cubes. - Ömer Egecioglu; Elif Saygi; Zülfükar Saygi (Theor. Comput. Sci., 2021)

Fibonacci Cubes with Applications and Variations - Ömer Egecioglu; Sandi Klavzar; Michel Mollard (WorldScientific, 2023)

On Languages Generated by Signed Grammars. - Ömer Egecioglu; Benedek Nagy (NCMA, 2023)

Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes. - Ömer Egecioglu; Elif Saygi; Zülfükar Saygi (Discret. Math. Algorithms Appl., 2024)