The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ömer Egecioglu: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daniel Andresen, Tao Yang, Ömer Egecioglu, Oscar H. Ibarra, Terence R. Smith
    Scalability Issues for High Performance Digital Libraries on the World Wide Web. [Citation Graph (2, 0)][DBLP]
    ADL, 1996, pp:139-148 [Conf]
  2. Ömer Egecioglu, Hakan Ferhatosmanoglu
    Dimensionality Reduction and Similarity Computation by Inner Product Approximations. [Citation Graph (0, 0)][DBLP]
    CIKM, 2000, pp:219-226 [Conf]
  3. Kamil Saraç, Ömer Egecioglu, Amr El Abbadi
    Iterated DFT Based Techniques for Join Size Estimation. [Citation Graph (0, 0)][DBLP]
    CIKM, 1998, pp:348-355 [Conf]
  4. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:161-170 [Conf]
  5. Abdullah N. Arslan, Ömer Egecioglu
    An Improved Upper Bound on the Size of Planar Convex-Hulls. [Citation Graph (0, 0)][DBLP]
    COCOON, 2001, pp:111-120 [Conf]
  6. Abdullah N. Arslan, Ömer Egecioglu
    Dictionary Look-Up within Small Edit Distance. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:127-136 [Conf]
  7. Ömer Egecioglu, Marcus Peinado
    Algorithms for Almost-uniform Generation with an Unbiased Binary Source. [Citation Graph (0, 0)][DBLP]
    COCOON, 1998, pp:117-126 [Conf]
  8. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
    A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:353-362 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:465- [Conf]
  10. Ömer Egecioglu
    Algorithms for the Character Theory of the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:206-224 [Conf]
  11. James Abello, Krishna Kumar, Ömer Egecioglu
    A Combinatorial View of Visibility Graphs of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:87-92 [Conf]
  12. Ömer Egecioglu, Oscar H. Ibarra
    A Matrix q-Analogue of the Parikh Map. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:125-138 [Conf]
  13. M. Cemil Azizoglu, Ömer Egecioglu
    Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:460-464 [Conf]
  14. Peter R. Cappello, Ömer Egecioglu
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:105-109 [Conf]
  15. Ömer Egecioglu, Ashok Srinivasan
    Domain Decomposition for Particle Methods on the Sphere. [Citation Graph (0, 0)][DBLP]
    IRREGULAR, 1996, pp:119-130 [Conf]
  16. Peter R. Cappello, Ömer Egecioglu
    Automatic Processor Lower Bound Formulas for Array Computations. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:59-64 [Conf]
  17. Abdullah N. Arslan, Ömer Egecioglu
    Algorithms for Local Alignment with Length Constraints. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:38-51 [Conf]
  18. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena
    Characterizations of Catalytic Membrane Computing Systems. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:480-489 [Conf]
  19. Ömer Egecioglu
    Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. [Citation Graph (0, 0)][DBLP]
    PKDD, 2001, pp:79-90 [Conf]
  20. Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner
    A new approach to sequence comparison: normalized sequence alignment. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2001, pp:2-11 [Conf]
  21. Abdullah N. Arslan, Ömer Egecioglu
    Efficient Computation of Long Similar Subsequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:77-90 [Conf]
  22. Abdullah N. Arslan, Ömer Egecioglu
    An Efficient Uniform-Cost Normalized Edit Distance Algorithm. [Citation Graph (0, 0)][DBLP]
    SPIRE/CRIWG, 1999, pp:8-15 [Conf]
  23. Abdullah N. Arslan, Ömer Egecioglu
    Algorithms for the Constrained Longest Common Subsequence Problems. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:24-32 [Conf]
  24. Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner
    A new approach to sequence comparison: normalized sequence alignment. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2001, v:17, n:4, pp:327-337 [Journal]
  25. Ömer Egecioglu, Timothy Redmond, Charles Ryavec
    From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:1, pp:- [Journal]
  26. Ömer Egecioglu, Teofilo F. Gonzalez
    A Computationally Intractable Problem on Simplicial Complexes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1996, v:6, n:, pp:85-98 [Journal]
  27. Ömer Egecioglu, Ambuj K. Singh
    Naming Symmetric Processes Using Shared Variables. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 1994, v:8, n:1, pp:19-38 [Journal]
  28. James Abello, Ömer Egecioglu, Krishna Kumar
    Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:14, n:3, pp:331-358 [Journal]
  29. Hakan Ferhatosmanoglu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    Optimal Data-Space Partitioning of Spatial Data for Parallel I/O. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2005, v:17, n:1, pp:75-101 [Journal]
  30. James Abello, Ömer Egecioglu
    Visibility graphs of staircase polygons with uniform step length. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:27-37 [Journal]
  31. Abdullah N. Arslan, Ömer Egecioglu
    Approximation Algorithms for Local Alignment with Length Constraints. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:5, pp:751-767 [Journal]
  32. Abdullah N. Arslan, Ömer Egecioglu
    Dictionary Look-Up Within Small Edit Distance. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:1, pp:57-71 [Journal]
  33. Peter R. Cappello, Ömer Egecioglu
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1998, v:9, n:4, pp:351-375 [Journal]
  34. Abdullah N. Arslan, Ömer Egecioglu
    Algorithms For The Constrained Longest Common Subsequence Problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1099-1109 [Journal]
  35. M. Cemil Azizoglu, Ömer Egecioglu
    The Isoperimetric Number of d-Dimensional k-Ary Arrays. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:289-300 [Journal]
  36. Ömer Egecioglu, Jeffrey B. Remmel, S. G. Williamson
    A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:619-648 [Journal]
  37. Kamil Saraç, Ömer Egecioglu, Amr El Abbadi
    DFT Techniques for Size Estimation of Database Join Operations. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:1, pp:81-102 [Journal]
  38. Abdullah N. Arslan, Ömer Egecioglu
    Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:4, pp:441-458 [Journal]
  39. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    Billiard Quorums on the Grid. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:64, n:1, pp:9-16 [Journal]
  40. Ömer Egecioglu, Bahman Kalantari
    Approximating the Diameter of a Set of Points in the Euclidean Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:4, pp:205-211 [Journal]
  41. Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç
    Fast computation of divided differences and parallel hermite interpolation. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1989, v:5, n:4, pp:417-437 [Journal]
  42. Ömer Egecioglu, Jeffrey B. Remmel
    The monomial symmetric functions and the Frobenius map. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:54, n:2, pp:272-295 [Journal]
  43. Ömer Egecioglu, Jeffrey B. Remmel
    Bijections for Cayley trees, spanning trees, and their q-analogues. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:15-30 [Journal]
  44. Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu
    Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:49, n:1, pp:57-85 [Journal]
  45. Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman
    Processor-time-optimal systolic arrays. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms Appl., 2000, v:15, n:3-4, pp:167-199 [Journal]
  46. Ömer Egecioglu, Çetin Kaya Koç
    A parallel algorithm for generating discrete orthogonal polynomials. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:6, pp:649-659 [Journal]
  47. M. Cemil Azizoglu, Ömer Egecioglu
    Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2000, v:49, n:3, pp:259-266 [Journal]
  48. Ömer Egecioglu, Çetin Kaya Koç
    Exponentiation Using Canonical Recoding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:129, n:2, pp:407-417 [Journal]
  49. Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu
    Catalytic P systems, semilinear sets, and vector addition systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:2-3, pp:379-399 [Journal]
  50. Athanassios S. Poulakidas, Ashok Srinivasan, Ömer Egecioglu, Oscar H. Ibarra, Tao Yang
    Image compression for fast wavelet-based subregion retrieval. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:240, n:2, pp:447-469 [Journal]
  51. Ömer Egecioglu, Hakan Ferhatosmanoglu, Ümit Y. Ogras
    Dimensionality Reduction and Similarity Computation by Inner-Product Approximations. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Knowl. Data Eng., 2004, v:16, n:6, pp:714-726 [Journal]
  52. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:5, pp:533-537 [Journal]
  53. Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:486-495 [Conf]

  54. On Stateless Multicounter Machines. [Citation Graph (, )][DBLP]


  55. Hierarchies and Characterizations of Stateless Multicounter Machines. [Citation Graph (, )][DBLP]


  56. Strongly Regular Grammars and Regular Approximation of Context-Free Languages. [Citation Graph (, )][DBLP]


  57. Asynchronous Spiking Neural P Systems: Decidability and Undecidability. [Citation Graph (, )][DBLP]


  58. Anonymizing weighted social network graphs. [Citation Graph (, )][DBLP]


  59. Rome: Performance and Anonymity using Route Meshes. [Citation Graph (, )][DBLP]


  60. Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. [Citation Graph (, )][DBLP]


  61. Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs [Citation Graph (, )][DBLP]


  62. Brick tabloids and the connection matrices between bases of symmetric functions. [Citation Graph (, )][DBLP]


Search in 0.050secs, Finished in 0.052secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002