Ömer Egecioglu

Peter Damaschke, Ömer Egecioglu, Leonid Molokov: Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM 2013: 245-256

Oscar H. Ibarra, Ömer Egecioglu: A Survey of Results on Stateless Multicounter Automata. Fundam. Inform. 116(1-4): 129-140 (2012)

László Hegedüs, Benedek Nagy, Ömer Egecioglu: Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. Natural Computing 11(3): 361-368 (2012)

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): 590-604 (2012)

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

Ömer Egecioglu, László Hegedüs, Benedek Nagy: Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Inform. 110(1-4): 111-123 (2011)

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

Ömer Egecioglu, Timothy Redmond, Charles Ryavec: A multilinear operator for almost product evaluation of Hankel determinants. J. Comb. Theory, Ser. A 117(1): 77-103 (2010)

Ömer Egecioglu: Bessel Polynomials and the Partial Sums of the Exponential Series. SIAM J. Discrete Math. 24(4): 1753-1762 (2010)

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

Sudipto Das, Ömer Egecioglu, Amr El Abbadi: Anonymizing weighted social network graphs. ICDE 2010: 904-907

Sudipto Das, Ömer Egecioglu, Amr El Abbadi: Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs. CoRR abs/1004.0048 (2010)

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): 597-612 (2009)

Ömer Egecioglu: Uniform generation of anonymous and neutral preference profiles for social choice rules. Monte Carlo Meth. and Appl. 15(3): 241-255 (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): 2352-2364 (2009)

Ömer Egecioglu, Oscar H. Ibarra: On Stateless Multicounter Machines. CiE 2009: 178-187

Oscar H. Ibarra, Ömer Egecioglu: Hierarchies and Characterizations of Stateless Multicounter Machines. COCOON 2009: 408-417

Ömer Egecioglu: Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Developments in Language Theory 2009: 207-220

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

Ömer Egecioglu, Timothy Redmond, Charles Ryavec: Almost Product Evaluation of Hankel Determinants. Electr. J. Comb. 15(1) (2008)

Ryan Dixon, Ömer Egecioglu, Timothy Sherwood: Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. CIAA 2008: 141-150

Ömer Egecioglu, Oscar H. Ibarra: A q-Analogue of the Parikh Matrix Mapping. Formal Models, Languages and Applications 2007: 97-111

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

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

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

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

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

Ö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): 619-648 (2004)

Abdullah N. Arslan, Ömer Egecioglu: Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. INFORMS Journal on Computing 16(4): 441-458 (2004)

Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu: Catalytic P systems, semilinear sets, and vector addition systems. Theor. Comput. Sci. 312(2-3): 379-399 (2004)

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

Ömer Egecioglu, Oscar H. Ibarra: A Matrix q-Analogue of the Parikh Map. IFIP TCS 2004: 125-138

Abdullah N. Arslan, Ömer Egecioglu: Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32

Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena: Characterizations of Catalytic Membrane Computing Systems. MFCS 2003: 480-489

M. Cemil Azizoglu, Ömer Egecioglu: The Isoperimetric Number and The Bisection Width of Generalized Cylinders. Electronic Notes in Discrete Mathematics 11: 53-62 (2002)

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

Abdullah N. Arslan, Ömer Egecioglu: Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136

Peter R. Cappello, Ömer Egecioglu: Automatic Processor Lower Bound Formulas for Array Computations. ISPAN 2002: 59-64

Abdullah N. Arslan, Ömer Egecioglu: Algorithms for Local Alignment with Length Constraints. LATIN 2002: 38-51

Abdullah N. Arslan, Ömer Egecioglu: Efficient Computation of Long Similar Subsequences. SPIRE 2002: 77-90

Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner: A new approach to sequence comparison: normalized sequence alignment. Bioinformatics 17(4): 327-337 (2001)

Ömer Egecioglu, Timothy Redmond, Charles Ryavec: From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. Electr. J. Comb. 8(1) (2001)

Abdullah N. Arslan, Ömer Egecioglu: An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON 2001: 111-120

Ömer Egecioglu: Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. PKDD 2001: 79-90

Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner: A new approach to sequence comparison: normalized sequence alignment. RECOMB 2001: 2-11

Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman: Processor-time-optimal systolic arrays. Parallel Algorithms Appl. 15(3-4): 167-199 (2000)

M. Cemil Azizoglu, Ömer Egecioglu: Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. IEEE Trans. Computers 49(3): 259-266 (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): 447-469 (2000)

Ömer Egecioglu, Hakan Ferhatosmanoglu: Dimensionality Reduction and Similarity Computation by Inner Product Approximations. CIKM 2000: 219-226

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

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

Abdullah N. Arslan, Ömer Egecioglu: An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG 1999: 8-15

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

Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu: Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. J. Parallel Distrib. Comput. 49(1): 57-85 (1998)

Kamil Saraç, Ömer Egecioglu, Amr El Abbadi: Iterated DFT Based Techniques for Join Size Estimation. CIKM 1998: 348-355

Ömer Egecioglu, Marcus Peinado: Algorithms for Almost-uniform Generation with an Unbiased Binary Source. COCOON 1998: 117-126

Peter R. Cappello, Ömer Egecioglu: Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. IPPS/SPDP 1998: 105-109

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

Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: Billiard Quorums on the Grid. Inf. Process. Lett. 64(1): 9-16 (1997)

Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. IEEE Trans. Parallel Distrib. Syst. 8(5): 533-537 (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: 353-362

Ömer Egecioglu, Teofilo F. Gonzalez: A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (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: 139-148

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: 465

Ömer Egecioglu, Ashok Srinivasan: Domain Decomposition for Particle Methods on the Sphere. IRREGULAR 1996: 119-130

James Abello, Ömer Egecioglu, Krishna Kumar: Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. Discrete & Computational Geometry 14(3): 331-358 (1995)

Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. COCOON 1995: 161-170

Ömer Egecioglu, Ambuj K. Singh: Naming Symmetric Processes Using Shared Variables. Distributed Computing 8(1): 19-38 (1994)

Ömer Egecioglu, Çetin Kaya Koç: Exponentiation Using Canonical Recoding. Theor. Comput. Sci. 129(2): 407-417 (1994)

James Abello, Ömer Egecioglu: Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geometry Appl. 3(1): 27-37 (1993)

Ömer Egecioglu, Ashok Srinivasan: Optimal Parallel Prefix on Mesh Architectures. Parallel Algorithms Appl. 1(3): 191-209 (1993)

James Abello, Krishna Kumar, Ömer Egecioglu: A Combinatorial View of Visibility Graphs of Simple Polygons. ICCI 1993: 87-92

Ömer Egecioglu, Çetin Kaya Koç: A parallel algorithm for generating discrete orthogonal polynomials. Parallel Computing 18(6): 649-659 (1992)

Gregory R. De Haan, Ömer Egecioglu: Topology preservation for speech recognition. ICSLP 1992

Ömer Egecioglu, Jeffrey B. Remmel: Brick tabloids and the connection matrices between bases of symmetric functions. Discrete Applied Mathematics 34(1-3): 107-120 (1991)

Ömer Egecioglu, Jeffrey B. Remmel: The monomial symmetric functions and the Frobenius map. J. Comb. Theory, Ser. A 54(2): 272-295 (1990)

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

Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç: Fast computation of divided differences and parallel hermite interpolation. J. Complexity 5(4): 417-437 (1989)

Ömer Egecioglu, Jeffrey B. Remmel: Bijections for Cayley trees, spanning trees, and their q-analogues. J. Comb. Theory, Ser. A 42(1): 15-30 (1986)

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