Ömer Egecioglu

Loading Google Thumbnails...
2012
69Multitape NFA: Weak Synchronization of the Input Heads. Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân. SOFSEM 2012, 238-250. Web SearchBibTeXDownload
2010
68Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs. Sudipto Das, Ömer Egecioglu, Amr El Abbadi. CoRR (abs/1004.0048) (2010). Web SearchBibTeXDownload
67Anonymizing weighted social network graphs. Sudipto Das, Ömer Egecioglu, Amr El Abbadi. ICDE 2010, 904-907. Web SearchBibTeXDownload
66A multilinear operator for almost product evaluation of Hankel determinants. Ömer Egecioglu, Timothy Redmond, Charles Ryavec. J. Comb. Theory, Ser. A (117): 77-103 (2010). Web SearchBibTeXDownload
65Bessel Polynomials and the Partial Sums of the Exponential Series. Ömer Egecioglu. SIAM J. Discrete Math. (24): 1753-1762 (2010). Web SearchBibTeXDownload
2009
64On Stateless Multicounter Machines. Ömer Egecioglu, Oscar H. Ibarra. CiE 2009, 178-187. Web SearchBibTeXDownload
63Hierarchies and Characterizations of Stateless Multicounter Machines. Oscar H. Ibarra, Ömer Egecioglu. COCOON 2009, 408-417. Web SearchBibTeXDownload
62Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Ömer Egecioglu. Developments in Language Theory 2009, 207-220. Web SearchBibTeXDownload
61Rome: Performance and Anonymity using Route Meshes. Krishna P. N. Puttaswamy, Alessandra Sala, Ömer Egecioglu, Ben Y. Zhao. INFOCOM 2009, 2861-2865. Web SearchBibTeXDownload
60Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching. Ryan Dixon, Ömer Egecioglu, Timothy Sherwood. Int. J. Found. Comput. Sci. (20): 597-612 (2009). Web SearchBibTeXDownload
59Asynchronous spiking neural P systems. Matteo Cavaliere, Oscar H. Ibarra, Gheorghe Paun, Ömer Egecioglu, Mihai Ionescu, Sara Woodworth. Theor. Comput. Sci. (410): 2352-2364 (2009). Web SearchBibTeXDownload
2008
58Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. Ryan Dixon, Ömer Egecioglu, Timothy Sherwood. CIAA 2008, 141-150. Web SearchBibTeXDownload
57Almost Product Evaluation of Hankel Determinants. Ömer Egecioglu, Timothy Redmond, Charles Ryavec. Electr. J. Comb. (15) (2008). Web SearchBibTeXDownload
2007
56Asynchronous Spiking Neural P Systems: Decidability and Undecidability. Matteo Cavaliere, Ömer Egecioglu, Oscar H. Ibarra, Mihai Ionescu, Gheorghe Paun, Sara Woodworth. DNA 2007, 246-255. Web SearchBibTeXDownload
55DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. ICDE 2007, 486-495. Cited by 18Web SearchBibTeXDownload
2005
54Optimal Data-Space Partitioning of Spatial Data for Parallel I/O. Hakan Ferhatosmanoglu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. Distributed and Parallel Databases (17): 75-101 (2005). Web SearchBibTeXDownload
53Algorithms For The Constrained Longest Common Subsequence Problems. Abdullah N. Arslan, Ömer Egecioglu. Int. J. Found. Comput. Sci. (16): 1099-1109 (2005). Web SearchBibTeXDownload
2004
52Dimensionality Reduction and Similarity Computation by Inner-Product Approximations. Ömer Egecioglu, Hakan Ferhatosmanoglu, Ümit Y. Ogras. IEEE Trans. Knowl. Data Eng. (16): 714-726 (2004). Cited by 33Web SearchBibTeXDownload
51A Matrix q-Analogue of the Parikh Map. Ömer Egecioglu, Oscar H. Ibarra. IFIP TCS 2004, 125-138. Web SearchBibTeX
50Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. Abdullah N. Arslan, Ömer Egecioglu. INFORMS Journal on Computing (16): 441-458 (2004). Web SearchBibTeXDownload
49Dictionary Look-Up Within Small Edit Distance. Abdullah N. Arslan, Ömer Egecioglu. Int. J. Found. Comput. Sci. (15): 57-71 (2004). Web SearchBibTeXDownload
48A 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. (15): 619-648 (2004). Web SearchBibTeXDownload
47Algorithms for the Constrained Longest Common Subsequence Problems. Abdullah N. Arslan, Ömer Egecioglu. Stringology 2004, 24-32. Web SearchBibTeXDownload
46Catalytic P systems, semilinear sets, and vector addition systems. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu. Theor. Comput. Sci. (312): 379-399 (2004). Web SearchBibTeXDownload
2003
45Characterizations of Catalytic Membrane Computing Systems. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena. MFCS 2003, 480-489. Web SearchBibTeXDownload
2002
44Dictionary Look-Up within Small Edit Distance. Abdullah N. Arslan, Ömer Egecioglu. COCOON 2002, 127-136. Web SearchBibTeXDownload
43The Isoperimetric Number and The Bisection Width of Generalized Cylinders. M. Cemil Azizoglu, Ömer Egecioglu. Electronic Notes in Discrete Mathematics (11): 53-62 (2002). Web SearchBibTeXDownload
42Approximation Algorithms for Local Alignment with Length Constraints. Abdullah N. Arslan, Ömer Egecioglu. Int. J. Found. Comput. Sci. (13): 751-767 (2002). Web SearchBibTeXDownload
41Automatic Processor Lower Bound Formulas for Array Computations. Peter R. Cappello, Ömer Egecioglu. ISPAN 2002, 59-64. Web SearchBibTeXDownload
40Algorithms for Local Alignment with Length Constraints. Abdullah N. Arslan, Ömer Egecioglu. LATIN 2002, 38-51. Web SearchBibTeXDownload
39Efficient Computation of Long Similar Subsequences. Abdullah N. Arslan, Ömer Egecioglu. SPIRE 2002, 77-90. Web SearchBibTeXDownload
2001
38An Improved Upper Bound on the Size of Planar Convex-Hulls. Abdullah N. Arslan, Ömer Egecioglu. COCOON 2001, 111-120. Web SearchBibTeXDownload
37From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. Ömer Egecioglu, Timothy Redmond, Charles Ryavec. Electr. J. Comb. (8) (2001). Web SearchBibTeXDownload
36Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. Ömer Egecioglu. PKDD 2001, 79-90. Web SearchBibTeXDownload
35A new approach to sequence comparison: normalized sequence alignment. Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner. RECOMB 2001, 2-11. Web SearchBibTeXDownload
2000
34Dimensionality Reduction and Similarity Computation by Inner Product Approximations. Ömer Egecioglu, Hakan Ferhatosmanoglu. CIKM 2000, 219-226. Cited by 9Web SearchBibTeXDownload
33Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. M. Cemil Azizoglu, Ömer Egecioglu. IEEE Trans. Computers (49): 259-266 (2000). Web SearchBibTeXDownload
32Processor-time-optimal systolic arrays. Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman. Parallel Algorithms Appl. (15): 167-199 (2000). Web SearchBibTeXDownload
31Image compression for fast wavelet-based subregion retrieval. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang. Theor. Comput. Sci. (240): 447-469 (2000). Web SearchBibTeXDownload
1999
30DFT Techniques for Size Estimation of Database Join Operations. Kamil Saraç, Ömer Egecioglu, Amr El Abbadi. Int. J. Found. Comput. Sci. (10): 81-102 (1999). Web SearchBibTeX
29The Isoperimetric Number of d-Dimensional k-Ary Arrays. M. Cemil Azizoglu, Ömer Egecioglu. Int. J. Found. Comput. Sci. (10): 289-300 (1999). Web SearchBibTeX
28An Efficient Uniform-Cost Normalized Edit Distance Algorithm. Abdullah N. Arslan, Ömer Egecioglu. SPIRE/CRIWG 1999, 8-15. Web SearchBibTeXDownload
1998
27Iterated DFT Based Techniques for Join Size Estimation. Kamil Saraç, Ömer Egecioglu, Amr El Abbadi. CIKM 1998, 348-355. Cited by 1Web SearchBibTeXDownload
26Algorithms for Almost-uniform Generation with an Unbiased Binary Source. Ömer Egecioglu, Marcus Peinado. COCOON 1998, 117-126. Web SearchBibTeXDownload
25Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. Peter R. Cappello, Ömer Egecioglu. IPPS/SPDP 1998, 105-109. Web SearchBibTeXDownload
24Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. M. Cemil Azizoglu, Ömer Egecioglu. IPPS/SPDP 1998, 460-464. Web SearchBibTeXDownload
23Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu. J. Parallel Distrib. Comput. (49): 57-85 (1998). Web SearchBibTeXDownload
1997
22A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang. COCOON 1997, 353-362. Web SearchBibTeXDownload
21Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. IEEE Trans. Parallel Distrib. Syst. (8): 533-537 (1997). Cited by 19Web SearchBibTeXDownload
20Billiard Quorums on the Grid. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. Inf. Process. Lett. (64): 9-16 (1997). Cited by 19Web SearchBibTeXDownload
1996
19Scalability Issues for High Performance Digital Libraries on the World Wide Web. Daniel Andresen, Tao Yang, Ömer Egecioglu, Oscar H. Ibarra, Terence R. Smith. ADL 1996, 139-148. Web SearchBibTeXDownload
18A Computationally Intractable Problem on Simplicial Complexes. Ömer Egecioglu, Teofilo F. Gonzalez. Comput. Geom. (6): 85-98 (1996). Web SearchBibTeXDownload
17Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang. Data Compression Conference 1996, 465. Web SearchBibTeX
16Domain Decomposition for Particle Methods on the Sphere. Ömer Egecioglu, Ashok Srinivasan. IRREGULAR 1996, 119-130. Web SearchBibTeXDownload
1995
15Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi. COCOON 1995, 161-170. Cited by 19Web SearchBibTeXDownload
14Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. James Abello, Ömer Egecioglu, Krishna Kumar. Discrete & Computational Geometry (14): 331-358 (1995). Web SearchBibTeXDownload
1994
13Naming Symmetric Processes Using Shared Variables. Ömer Egecioglu, Ambuj K. Singh. Distributed Computing (8): 19-38 (1994). Web SearchBibTeXDownload
12Exponentiation Using Canonical Recoding. Ömer Egecioglu, Çetin Kaya Koç. Theor. Comput. Sci. (129): 407-417 (1994). Web SearchBibTeXDownload
1993
11A Combinatorial View of Visibility Graphs of Simple Polygons. James Abello, Krishna Kumar, Ömer Egecioglu. ICCI 1993, 87-92. Web SearchBibTeX
10Visibility graphs of staircase polygons with uniform step length. James Abello, Ömer Egecioglu. Int. J. Comput. Geometry Appl. (3): 27-37 (1993). Web SearchBibTeX
9Optimal Parallel Prefix on Mesh Architectures. Ömer Egecioglu, Ashok Srinivasan. Parallel Algorithms Appl. (1): 191-209 (1993). Web SearchBibTeXDownload
1992
8Topology preservation for speech recognition. Gregory R. De Haan, Ömer Egecioglu. ICSLP 1992. Web SearchBibTeXDownload
7A parallel algorithm for generating discrete orthogonal polynomials. Ömer Egecioglu, Çetin Kaya Koç. Parallel Computing (18): 649-659 (1992). Web SearchBibTeXDownload
1991
6Brick tabloids and the connection matrices between bases of symmetric functions. Ömer Egecioglu, Jeffrey B. Remmel. Discrete Applied Mathematics (34): 107-120 (1991). Web SearchBibTeXDownload
1990
5The monomial symmetric functions and the Frobenius map. Ömer Egecioglu, Jeffrey B. Remmel. J. Comb. Theory, Ser. A (54): 272-295 (1990). Web SearchBibTeXDownload
1989
4Approximating the Diameter of a Set of Points in the Euclidean Space. Ömer Egecioglu, Bahman Kalantari. Inf. Process. Lett. (32): 205-211 (1989). Web SearchBibTeXDownload
3Fast computation of divided differences and parallel hermite interpolation. Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç. J. Complexity (5): 417-437 (1989). Web SearchBibTeXDownload
1986
2Bijections for Cayley trees, spanning trees, and their q-analogues. Ömer Egecioglu, Jeffrey B. Remmel. J. Comb. Theory, Ser. A (42): 15-30 (1986). Web SearchBibTeXDownload
1985
1Algorithms for the Character Theory of the Symmetric Group. Ömer Egecioglu. European Conference on Computer Algebra (2) 1985, 206-224. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research