Ömer Egecioglu

	2010
65		Ö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)
	2009
64		Oscar H. Ibarra, Ömer Egecioglu: Hierarchies and Characterizations of Stateless Multicounter Machines. COCOON 2009: 408-417
63		Ömer Egecioglu, Oscar H. Ibarra: On Stateless Multicounter Machines. CiE 2009: 178-187
62		Ömer Egecioglu: Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Developments in Language Theory 2009: 207-220
61		Krishna Puttaswamy, Alessandra Sala, Ömer Egecioglu, Ben Y. Zhao: Rome: Performance and Anonymity using Route Meshes. INFOCOM 2009: 2861-2865
60		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)
59		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)
	2008
58		Ryan Dixon, Ömer Egecioglu, Timothy Sherwood: Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. CIAA 2008: 141-150
	2007
57		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
56		Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. ICDE 2007: 486-495
	2005
55		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)
54		Abdullah N. Arslan, Ömer Egecioglu: Algorithms For The Constrained Longest Common Subsequence Problems. Int. J. Found. Comput. Sci. 16(6): 1099-1109 (2005)
	2004
53		Ömer Egecioglu, Oscar H. Ibarra: A Matrix q-Analogue of the Parikh Map. IFIP TCS 2004: 125-138
52		Abdullah N. Arslan, Ömer Egecioglu: Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32
51		Ö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)
50		Abdullah N. Arslan, Ömer Egecioglu: Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. INFORMS Journal on Computing 16(4): 441-458 (2004)
49		Abdullah N. Arslan, Ömer Egecioglu: Dictionary Look-Up Within Small Edit Distance. Int. J. Found. Comput. Sci. 15(1): 57-71 (2004)
48		Ö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)
47		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)
	2003
46		Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena: Characterizations of Catalytic Membrane Computing Systems. MFCS 2003: 480-489
	2002
45		Abdullah N. Arslan, Ömer Egecioglu: Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136
44		Peter R. Cappello, Ömer Egecioglu: Automatic Processor Lower Bound Formulas for Array Computations. ISPAN 2002: 59-64
43		Abdullah N. Arslan, Ömer Egecioglu: Algorithms for Local Alignment with Length Constraints. LATIN 2002: 38-51
42		Abdullah N. Arslan, Ömer Egecioglu: Efficient Computation of Long Similar Subsequences. SPIRE 2002: 77-90
41		M. Cemil Azizoglu, Ömer Egecioglu: The Isoperimetric Number and The Bisection Width of Generalized Cylinders. Electronic Notes in Discrete Mathematics 11: 53-62 (2002)
40		Abdullah N. Arslan, Ömer Egecioglu: Approximation Algorithms for Local Alignment with Length Constraints. Int. J. Found. Comput. Sci. 13(5): 751-767 (2002)
	2001
39		Abdullah N. Arslan, Ömer Egecioglu: An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON 2001: 111-120
38		Ömer Egecioglu: Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. PKDD 2001: 79-90
37		Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner: A new approach to sequence comparison: normalized sequence alignment. RECOMB 2001: 2-11
36		Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner: A new approach to sequence comparison: normalized sequence alignment. Bioinformatics 17(4): 327-337 (2001)
35		Ömer Egecioglu, Timothy Redmond, Charles Ryavec: From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. Electr. J. Comb. 8(1): (2001)
	2000
34		Ömer Egecioglu, Hakan Ferhatosmanoglu: Dimensionality Reduction and Similarity Computation by Inner Product Approximations. CIKM 2000: 219-226
33		M. Cemil Azizoglu, Ömer Egecioglu: Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. IEEE Trans. Computers 49(3): 259-266 (2000)
32		Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman: Processor-time-optimal systolic arrays. Parallel Algorithms Appl. 15(3-4): 167-199 (2000)
31		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)
	1999
30		Abdullah N. Arslan, Ömer Egecioglu: An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG 1999: 8-15
29		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)
28		M. Cemil Azizoglu, Ömer Egecioglu: The Isoperimetric Number of d-Dimensional k-Ary Arrays. Int. J. Found. Comput. Sci. 10(3): 289-300 (1999)
	1998
27		Kamil Saraç, Ömer Egecioglu, Amr El Abbadi: Iterated DFT Based Techniques for Join Size Estimation. CIKM 1998: 348-355
26		Ömer Egecioglu, Marcus Peinado: Algorithms for Almost-uniform Generation with an Unbiased Binary Source. COCOON 1998: 117-126
25		Peter R. Cappello, Ömer Egecioglu: Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. IPPS/SPDP 1998: 105-109
24		M. Cemil Azizoglu, Ömer Egecioglu: Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. IPPS/SPDP 1998: 460-464
23		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)
22		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)
	1997
21		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
20		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)
19		Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: Billiard Quorums on the Grid. Inf. Process. Lett. 64(1): 9-16 (1997)
	1996
18		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
17		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
16		Ömer Egecioglu, Ashok Srinivasan: Domain Decomposition for Particle Methods on the Sphere. IRREGULAR 1996: 119-130
15		Ömer Egecioglu, Teofilo F. Gonzalez: A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (1996)
	1995
14		Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi: Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. COCOON 1995: 161-170
13		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)
	1994
12		Ömer Egecioglu, Ambuj K. Singh: Naming Symmetric Processes Using Shared Variables. Distributed Computing 8(1): 19-38 (1994)
11		Ömer Egecioglu, Çetin Kaya Koç: Exponentiation Using Canonical Recoding. Theor. Comput. Sci. 129(2): 407-417 (1994)
	1993
10		James Abello, Krishna Kumar, Ömer Egecioglu: A Combinatorial View of Visibility Graphs of Simple Polygons. ICCI 1993: 87-92
9		James Abello, Ömer Egecioglu: Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geometry Appl. 3(1): 27-37 (1993)
8		Ömer Egecioglu, Ashok Srinivasan: Optimal Parallel Prefix on Mesh Architectures. Parallel Algorithms Appl. 1(3): 191-209 (1993)
	1992
7		Ömer Egecioglu, Çetin Kaya Koç: A parallel algorithm for generating discrete orthogonal polynomials. Parallel Computing 18(6): 649-659 (1992)
	1991
6		Ö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)
	1990
5		Ömer Egecioglu, Jeffrey B. Remmel: The monomial symmetric functions and the Frobenius map. J. Comb. Theory, Ser. A 54(2): 272-295 (1990)
	1989
4		Ömer Egecioglu, Bahman Kalantari: Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32(4): 205-211 (1989)
3		Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç: Fast computation of divided differences and parallel hermite interpolation. J. Complexity 5(4): 417-437 (1989)
	1986
2		Ö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)
	1985
1		Ömer Egecioglu: Algorithms for the Character Theory of the Symmetric Group. European Conference on Computer Algebra (2) 1985: 206-224

Coauthor Index

1	Amr El Abbadi	[14] [19] [20] [27] [29] [55] [56]
2	James Abello	[9] [10] [13]
3	Divyakant Agrawal	[14] [19] [20] [55] [56]
4	Daniel Andresen	[18] [22]
5	Abdullah N. Arslan	[30] [36] [37] [39] [40] [42] [43] [45] [49] [50] [52] [54]
6	M. Cemil Azizoglu	[24] [28] [33] [41]
7	Peter R. Cappello	[23] [25] [32] [44]
8	Matteo Cavaliere	[57] [59]
9	Zhe Dang	[46] [47]
10	Ryan Dixon	[58] [60]
11	Hakan Ferhatosmanoglu	[34] [51] [55]
12	Efstratios Gallopoulos	[3]
13	Teofilo F. Gonzalez	[15]
14	Oscar H. Ibarra	[17] [18] [21] [22] [31] [46] [47] [53] [57] [59] [63] [64]
15	Mihai Ionescu (Armand-Mihai Ionescu)	[57] [59]
16	Bahman Kalantari	[4]
17	Çetin Kaya Koç	[3] [7] [11]
18	Krishna Kumar	[10] [13]
19	Ümit Y. Ogras	[51]
20	Gheorghe Paun	[57] [59]
21	Marcus Peinado	[26]
22	Pavel A. Pevzner	[36] [37]
23	Athanassios S. Poulakidas	[17] [21] [31]
24	Krishna Puttaswamy	[61]
25	Timothy Redmond	[35] [65]
26	Jeffrey B. Remmel	[2] [5] [6] [48]
27	Charles Ryavec	[35] [65]
28	Alessandra Sala	[61]
29	Kamil Saraç	[27] [29]
30	Gaurav Saxena	[46]
31	Chris J. Scheiman	[32]
32	Timothy Sherwood	[58] [60]
33	Ambuj K. Singh	[12]
34	Terence R. Smith	[18]
35	Ashok Srinivasan	[8] [16] [17] [21] [31]
36	S. Gill Williamson (S. G. Williamson)	[48]
37	Sara Woodworth	[57] [59]
38	Ping Wu	[56]
39	Tao Yang	[17] [18] [21] [22] [31]
40	Ben Y. Zhao	[61]

Colors in the list of coauthors