Ömer Egecioglu

Ömer Egecioglu, Benedek Nagy, László Hegedüs, 2010, 2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA).

Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata

Ömer Egecioglu, Benedek Nagy, László Hegedüs, 2011, IWANN.

The Isoperimetric Number and The Bisection Width of Generalized Cylinders

Ömer Egecioglu, M. Cemil Azizoglu, 2002, Electron. Notes Discret. Math..

Privacy-Preserving Certification of Sustainability Metrics

Ömer Egecioglu, Amr El Abbadi, Cetin Sahin, 2018, CODASPY.

Exponentiation Using Canonical Recoding

Ömer Egecioglu, Çetin Kaya Koç, Ö. Eğecioğlu, 1994, Theor. Comput. Sci..

Efficient Computation of Long Similar Subsequences

Ömer Egecioglu, Abdullah N. Arslan, 2002, SPIRE.

Visibility graphs of staircase polygons with uniform step length

Ömer Egecioglu, James Abello, 1993, Int. J. Comput. Geom. Appl..

Algorithms For The Constrained Longest Common Subsequence Problems

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 2005, Int. J. Found. Comput. Sci..

On Stateless Multicounter Machines

Oscar H. Ibarra, Ömer Egecioglu, O. Ibarra, 2009, CiE.

Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching

Ömer Egecioglu, Timothy Sherwood, Ryan Dixon, 2009, Int. J. Found. Comput. Sci..

A q-Analogue of the Parikh Matrix Mapping

Oscar H. Ibarra, Ömer Egecioglu, 2007, Formal Models, Languages and Applications.

Counting disjoint hypercubes in Fibonacci cubes

Ömer Egecioglu, Elif Saygi, 2016, Discret. Appl. Math..

Approximating the Diameter of a Set of Points in the Euclidean Space

Ömer Egecioglu, Bahman Kalantari, 1989, Inf. Process. Lett..

Image compression for fast wavelet-based subregion retrieval

Oscar H. Ibarra, Tao Yang, Ömer Egecioglu, 2000, Theor. Comput. Sci..

Hierarchies and Characterizations of Stateless Multicounter Machines

Oscar H. Ibarra, Ömer Egecioglu, O. Ibarra, 2009, COCOON.

Almost Product Evaluation of Hankel Determinants

Ömer Egecioglu, Timothy Redmond, Charles Ryavec, 2007, Electron. J. Comb..

A Matrix q-Analogue of the Parikh Map

Oscar H. Ibarra, Ömer Egecioglu, 2004, IFIP TCS.

Reducing the Complexity of Normal Basis Multiplication

Ömer Egecioglu, Çetin Kaya Koç, Ö. Eğecioğlu, 2014, WAIFI.

Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems

Ömer Egecioglu, Peter Damaschke, Leonid Molokov, 2013, WALCOM.

Dimensionality reduction and similarity computation by inner-product approximations

Ömer Egecioglu, Ümit Y. Ogras, Hakan Ferhatosmanoglu, 2000, IEEE Transactions on Knowledge and Data Engineering.

Multitape NFA: Weak Synchronization of the Input Heads

Oscar H. Ibarra, Ömer Egecioglu, Nicholas Q. Trân, 2012, SOFSEM.

Fast computation of divided differences and parallel hermite interpolation

Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç, 1989, J. Complex..

Dictionary Look-Up within Small Edit Distance

Ömer Egecioglu, Abdullah N. Arslan, 2002, COCOON.

Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion

Ömer Egecioglu, Divyakant Agrawal, Amr El Abbadi, 1995, COCOON.

Optimal Data-Space Partitioning of Spatial Data for Parallel I/O

Ömer Egecioglu, Divyakant Agrawal, Amr El Abbadi, 2004, Distributed and Parallel Databases.

q-cube enumerator polynomial of Fibonacci cubes

Ömer Egecioglu, Elif Saygi, Ö. Eğecioğlu, 2017, Discret. Appl. Math..

On Bottcher's mysterious identity

Ömer Egecioglu, 2009, Australas. J Comb..

Iterated DFT based techniques for join size estimation

Ömer Egecioglu, Amr El Abbadi, Kamil Saraç, 1998, CIKM '98.

Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems

Peter R. Cappello, Ömer Egecioglu, 1998, Int. J. Found. Comput. Sci..

Asynchronous spiking neural P systems

Oscar H. Ibarra, Ömer Egecioglu, Gheorghe Paun, 2009, Theor. Comput. Sci..

Visibility graphs of staircase polygons and the weak Bruhat order, I: From visibility graphs to maximal chains

Ömer Egecioglu, James Abello, Krishna Kumar, 1995, Discret. Comput. Geom..

Parallel Hermite interpolation: An algebraic approach

Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç, 1989, Computing.

Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages

Ömer Egecioglu, Benedek Nagy, László Hegedüs, 2011, Fundam. Informaticae.

Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval

Oscar H. Ibarra, Tao Yang, Ömer Egecioglu, 1996, Data Compression Conference.

Towards Practical Privacy-Preserving Life Cycle Assessment Computations

Ömer Egecioglu, Amr El Abbadi, Cetin Sahin, 2017, CODASPY.

A Survey of Results on Stateless Multicounter Automata

Oscar H. Ibarra, Ömer Egecioglu, 2012, Fundam. Informaticae.

Boundary enumerator polynomial of hypercubes in Fibonacci cubes

Ömer Egecioglu, Elif Saygi, 2019, Discret. Appl. Math..

An efficient uniform-cost normalized edit distance algorithm

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 1999, 6th International Symposium on String Processing and Information Retrieval. 5th International Workshop on Groupware (Cat. No.PR00268).

Dimensionality Reduction and Similarity Computation by Inner-Product Approximations

Ömer Egecioglu, Ümit Y. Ogras, Hakan Ferhatosmanoglu, 2004, IEEE Trans. Knowl. Data Eng..

Stable Factorization of Strictly Hurwitz Polynomials

Ömer Egecioglu, B. Siddik Yarman, 2010, Int. J. Comput. Commun. Control.

Algorithms for Almost-uniform Generation with an Unbiased Binary Source

Ömer Egecioglu, Marcus Peinado, 1998, COCOON.

Processor lower bound formulas for array computations and parametric Diophantine systems

Peter R. Cappello, Ömer Egecioglu, Ö. Eğecioğlu, 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

A parallel algorithm for generating discrete orthogonal polynomials

Ömer Egecioglu, Çetin Kaya Koç, 1992, Parallel Comput..

Algorithms for the Character Theory of the Symmetric Group

Ömer Egecioglu, Ö. Eğecioğlu, 1985, European Conference on Computer Algebra.

From a Polynomial Riemann Hypothesis to Alternating Sign Matrices

Ömer Egecioglu, Timothy Redmond, Charles Ryavec, 2001, Electron. J. Comb..

Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 2004, INFORMS J. Comput..

Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion

Ömer Egecioglu, Divyakant Agrawal, Amr El Abbadi, 1997, IEEE Trans. Parallel Distributed Syst..

Asynchronous Spiking Neural P Systems: Decidability and Undecidability

Oscar H. Ibarra, Ömer Egecioglu, Gheorghe Paun, 2007, DNA.

Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning

Ömer Egecioglu, Timothy Sherwood, Ryan Dixon, 2008, CIAA.

Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity

Ömer Egecioglu, Ö. Eğecioğlu, 2001, PKDD.

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance

Oscar H. Ibarra, Daniel Andresen, Tao Yang, 1998, J. Parallel Distributed Comput..

Characterizations of Catalytic Membrane Computing Systems

Oscar H. Ibarra, Ömer Egecioglu, Zhe Dang, 2003, MFCS.

Dictionary Look-Up Within Small Edit Distance

Ömer Egecioglu, Abdullah N. Arslan, 2004, Int. J. Found. Comput. Sci..

Bijections for Cayley trees, spanning trees, and their q-analogues

Ömer Egecioglu, Jeffrey B. Remmel, Ö. Eğecioğlu, 1986, J. Comb. Theory, Ser. A.

Brick tabloids and the connection matrices between bases of symmetric functions

Ömer Egecioglu, Jeffrey B. Remmel, 1991, Discret. Appl. Math..

Domain Decomposition for Particle Methods on the Sphere

Ömer Egecioglu, Ashok Srinivasan, 1996, IRREGULAR.

Stateless multicounter 5′ → 3′ Watson–Crick automata: the deterministic case

Ömer Egecioglu, Benedek Nagy, László Hegedüs, 2011, Natural Computing.

Topology preservation for speech recognition

Ömer Egecioglu, Gregory R. De Haan, 1992, ICSLP.

Naming symmetric processes using shared variables

Ambuj K. Singh, Ömer Egecioglu, 2005, Distributed Computing.

Billiard Quorums on the Grid

Ömer Egecioglu, Divyakant Agrawal, Amr El Abbadi, 1997, Inf. Process. Lett..

An Improved Upper Bound on the Size of Planar Convex-Hulls

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 2001, COCOON.

Approximation Algorithms for Local Alignment with Length Constraints

Ömer Egecioglu, Abdullah N. Arslan, 2002, Int. J. Found. Comput. Sci..

Lower bounds on communication loads and optimal placements in torus networks

Ömer Egecioglu, M. Cemil Azizoglu, 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

A Computationally Intractable Problem on Simplicial Complexes

Ömer Egecioglu, Teofilo F. Gonzalez, T. Gonzalez, 1996, Comput. Geom..

A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval

Oscar H. Ibarra, Tao Yang, Ömer Egecioglu, 1997, COCOON.

A combinatorial view of visibility graphs of simple polygons

Ömer Egecioglu, James Abello, Krishna Kumar, 1993, Proceedings of ICCI'93: 5th International Conference on Computing and Information.

Lower Bounds on Communication Loads with Optimal Placements in Torus Networks

Ömer Egecioglu, M. Cemil Azizoglu, 2000, IEEE Trans. Computers.

Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 2007, Handbook of Approximation Algorithms and Metaheuristics.

A multilinear operator for almost product evaluation of Hankel determinants

Ömer Egecioglu, Timothy Redmond, Charles Ryavec, 2010, J. Comb. Theory, Ser. A.

Anonymizing weighted social network graphs

Ömer Egecioglu, Amr El Abbadi, Sudipto Das, 2010, 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010).

The monomial symmetric functions and the Frobenius map

Ömer Egecioglu, Jeffrey B. Remmel, 1990, J. Comb. Theory, Ser. A.

Automatic processor lower bound formulas for array computations

Peter R. Cappello, Ömer Egecioglu, Ö. Eğecioğlu, 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

Algorithms for Local Alignment with Length Constraints

Ömer Egecioglu, Abdullah N. Arslan, Ö. Eğecioğlu, 2002, LATIN.

A new approach to sequence comparison: normalized sequence alignment

Ömer Egecioglu, Pavel A. Pevzner, Abdullah N. Arslan, 2001, Bioinform..

DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation

Ömer Egecioglu, Ping Wu, Divyakant Agrawal, 2007, 2007 IEEE 23rd International Conference on Data Engineering.

PROCESSOR-TIME-OPTIMAL SYSTOLIC ARRAYS

Chris J. Scheiman, Peter R. Cappello, Ömer Egecioglu, 2000, Parallel Algorithms Appl..

Uniform generation of anonymous and neutral preference profiles for social choice rules

Ömer Egecioglu, 2009, Monte Carlo Methods Appl..

Parallel algorithms for fast computation of normalized edit distances

Ömer Egecioglu, Maximilian Ibel, Ö. Eğecioğlu, 1996, Proceedings of SPDP '96: 8th IEEE Symposium on Parallel and Distributed Processing.

A new approach to sequence comparison: normalized sequence alignment

Ömer Egecioglu, Pavel A. Pevzner, Abdullah N. Arslan, 2001, RECOMB.

The number of short cycles in Fibonacci cubes

Ömer Egecioglu, Elif Saygi, Zülfükar Saygi, 2021, Theor. Comput. Sci..