default search action
Ömer Egecioglu
Person information
- affiliation: University of California, Santa Barbara, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j56]Ömer Egecioglu
, Elif Saygi, Zülfükar Saygi:
Euler numbers and diametral paths in Fibonacci cubes, Lucas cubes and alternate Lucas cubes. Discret. Math. Algorithms Appl. 16(3): 2350027:1-2350027:10 (2024) - 2023
- [b1]Ömer Egecioglu, Sandi Klavzar, Michel Mollard:
Fibonacci Cubes with Applications and Variations. WorldScientific 2023, ISBN 9789811269035, pp. 1-304 - [c43]Ömer Egecioglu, Benedek Nagy:
On Languages Generated by Signed Grammars. NCMA 2023: 28-37 - 2021
- [j55]Ömer Egecioglu
Fibonacci-run graphs I: Basic properties. Discret. Appl. Math. 295: 70-84 (2021) - [j54]Ömer Egecioglu
Fibonacci-run graphs II: Degree sequences. Discret. Appl. Math. 300: 56-71 (2021) - [j53]Ömer Egecioglu
Alternate Lucas Cubes. Int. J. Found. Comput. Sci. 32(7): 871-899 (2021) - [j52]Ömer Egecioglu
The number of short cycles in Fibonacci cubes. Theor. Comput. Sci. 871: 134-146 (2021) - 2020
- [j51]Ömer Egecioglu, Elif Saygi
k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes. Int. J. Found. Comput. Sci. 31(5): 639-661 (2020)
2010 – 2019
- 2019
- [j50]Elif Saygi
Boundary enumerator polynomial of hypercubes in Fibonacci cubes. Discret. Appl. Math. 266: 191-199 (2019) - 2018
- [c42]Cetin Sahin, Brandon Kuczenski, Ömer Egecioglu, Amr El Abbadi:
Privacy-Preserving Certification of Sustainability Metrics. CODASPY 2018: 53-63 - [p1]Abdullah N. Arslan, Ömer Egecioglu:
Dynamic and Fractional Programming Based Approximation Algorithms for Sequence Alignment with Constraints. Handbook of Approximation Algorithms and Metaheuristics (2) 2018 - 2017
- [j49]Elif Saygi
q-cube enumerator polynomial of Fibonacci cubes. Discret. Appl. Math. 226: 127-137 (2017) - [j48]Ömer Egecioglu:
A note on iterated galileo sequences. Discret. Math. Algorithms Appl. 9(2): 1750015:1-1750015:4 (2017) - [c41]Cetin Sahin, Brandon Kuczenski, Ömer Egecioglu, Amr El Abbadi:
Towards Practical Privacy-Preserving Life Cycle Assessment Computations. CODASPY 2017: 167-169 - 2016
- [j47]Elif Saygi
Counting disjoint hypercubes in Fibonacci cubes. Discret. Appl. Math. 215: 231-237 (2016) - [j46]Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IEEE Trans. Computers 65(11): 3239-3250 (2016) - 2015
- [i3]Can Kizilkale, Ömer Egecioglu, Çetin Kaya Koç:
A Matrix Decomposition Method for Optimal Normal Basis Multiplication. IACR Cryptol. ePrint Arch. 2015: 742 (2015) - 2014
- [c40]Ömer Egecioglu, Çetin Kaya Koç
Reducing the Complexity of Normal Basis Multiplication. WAIFI 2014: 61-80 - [i2]Ömer Egecioglu, Çetin Kaya Koç:
Reducing the Complexity of Normal Basis Multiplication. IACR Cryptol. ePrint Arch. 2014: 687 (2014) - 2013
- [c39]Peter Damaschke, Ömer Egecioglu, Leonid Molokov:
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems. WALCOM 2013: 245-256 - 2012
- [j45]Oscar H. Ibarra, Ömer Egecioglu:
A Survey of Results on Stateless Multicounter Automata. Fundam. Informaticae 116(1-4): 129-140 (2012) - [j44]László Hegedüs, Benedek Nagy, Ömer Egecioglu:
Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case. Nat. Comput. 11(3): 361-368 (2012) - [j43]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) - [c38]Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân:
Multitape NFA: Weak Synchronization of the Input Heads. SOFSEM 2012: 238-250 - 2011
- [j42]Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages. Fundam. Informaticae 110(1-4): 111-123 (2011) - [c37]Benedek Nagy, László Hegedüs, Ömer Egecioglu:
Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata. IWANN (1) 2011: 465-472 - 2010
- [j41]Ömer Egecioglu, B. Siddik Yarman
Stable Factorization of Strictly Hurwitz Polynomials. Int. J. Comput. Commun. Control 5(5): 701-709 (2010) - [j40]Ömer Egecioglu, Timothy Redmond, Charles Ryavec:
A multilinear operator for almost product evaluation of Hankel determinants. J. Comb. Theory A 117(1): 77-103 (2010) - [j39]Ömer Egecioglu:
Bessel Polynomials and the Partial Sums of the Exponential Series. SIAM J. Discret. Math. 24(4): 1753-1762 (2010) - [c36]Ömer Egecioglu, László Hegedüs, Benedek Nagy:
Stateless multicounter 5′ → 3′ Watson-Crick automata. BIC-TA 2010: 1599-1606 - [c35]Sudipto Das, Ömer Egecioglu, Amr El Abbadi:
Anonymizing weighted social network graphs. ICDE 2010: 904-907 - [i1]Sudipto Das, Ömer Egecioglu, Amr El Abbadi:
Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs. CoRR abs/1004.0048 (2010)
2000 – 2009
- 2009
- [j38]Ömer Egecioglu:
On Bottcher's mysterious identity. Australas. J Comb. 43: 307- (2009) - [j37]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) - [j36]Ömer Egecioglu:
Uniform generation of anonymous and neutral preference profiles for social choice rules. Monte Carlo Methods Appl. 15(3): 241-255 (2009) - [j35]Matteo Cavaliere
Asynchronous spiking neural P systems. Theor. Comput. Sci. 410(24-25): 2352-2364 (2009) - [c34]Ömer Egecioglu, Oscar H. Ibarra:
On Stateless Multicounter Machines. CiE 2009: 178-187 - [c33]Oscar H. Ibarra, Ömer Egecioglu:
Hierarchies and Characterizations of Stateless Multicounter Machines. COCOON 2009: 408-417 - [c32]Ömer Egecioglu:
Strongly Regular Grammars and Regular Approximation of Context-Free Languages. Developments in Language Theory 2009: 207-220 - [c31]Krishna P. N. Puttaswamy, Alessandra Sala, Ömer Egecioglu, Ben Y. Zhao:
Rome: Performance and Anonymity using Route Meshes. INFOCOM 2009: 2861-2865 - 2008
- [j34]Ömer Egecioglu, Timothy Redmond, Charles Ryavec:
Almost Product Evaluation of Hankel Determinants. Electron. J. Comb. 15(1) (2008) - [c30]Ryan Dixon, Ömer Egecioglu, Timothy Sherwood
Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning. CIAA 2008: 141-150 - 2007
- [c29]Ömer Egecioglu, Oscar H. Ibarra:
A q-Analogue of the Parikh Matrix Mapping. Formal Models, Languages and Applications 2007: 97-111 - [c28]Matteo Cavaliere
Asynchronous Spiking Neural P Systems: Decidability and Undecidability. DNA 2007: 246-255 - [c27]Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation. ICDE 2007: 486-495 - [r1]Ömer Egecioglu, Abdullah N. Arslan:
Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2005
- [j33]Hakan Ferhatosmanoglu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Optimal Data-Space Partitioning of Spatial Data for Parallel I/O. Distributed Parallel Databases 17(1): 75-101 (2005) - [j32]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms For The Constrained Longest Common Subsequence Problems. Int. J. Found. Comput. Sci. 16(6): 1099-1109 (2005) - 2004
- [j31]Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up Within Small Edit Distance. Int. J. Found. Comput. Sci. 15(1): 57-71 (2004) - [j30]Ö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) - [j29]Abdullah N. Arslan, Ömer Egecioglu:
Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints. INFORMS J. Comput. 16(4): 441-458 (2004) - [j28]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) - [j27]Ö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) - [c26]Ömer Egecioglu, Oscar H. Ibarra:
A Matrix q-Analogue of the Parikh Map. IFIP TCS 2004: 125-138 - [c25]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for the Constrained Longest Common Subsequence Problems. Stringology 2004: 24-32 - 2003
- [c24]Oscar H. Ibarra, Zhe Dang, Ömer Egecioglu, Gaurav Saxena:
Characterizations of Catalytic Membrane Computing Systems. MFCS 2003: 480-489 - 2002
- [j26]M. Cemil Azizoglu, Ömer Egecioglu:
The Isoperimetric Number and The Bisection Width of Generalized Cylinders. Electron. Notes Discret. Math. 11: 53-62 (2002) - [j25]Abdullah N. Arslan, Ömer Egecioglu:
Approximation Algorithms for Local Alignment with Length Constraints. Int. J. Found. Comput. Sci. 13(5): 751-767 (2002) - [c23]Abdullah N. Arslan, Ömer Egecioglu:
Dictionary Look-Up within Small Edit Distance. COCOON 2002: 127-136 - [c22]Peter R. Cappello, Ömer Egecioglu:
Automatic Processor Lower Bound Formulas for Array Computations. ISPAN 2002: 59-64 - [c21]Abdullah N. Arslan, Ömer Egecioglu:
Algorithms for Local Alignment with Length Constraints. LATIN 2002: 38-51 - [c20]Abdullah N. Arslan, Ömer Egecioglu:
Efficient Computation of Long Similar Subsequences. SPIRE 2002: 77-90 - 2001
- [j24]Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment. Bioinform. 17(4): 327-337 (2001) - [j23]Ömer Egecioglu, Timothy Redmond, Charles Ryavec:
From a Polynomial Riemann Hypothesis to Alternating Sign Matrices. Electron. J. Comb. 8(1) (2001) - [c19]Abdullah N. Arslan, Ömer Egecioglu:
An Improved Upper Bound on the Size of Planar Convex-Hulls. COCOON 2001: 111-120 - [c18]Ömer Egecioglu:
Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity. PKDD 2001: 79-90 - [c17]Abdullah N. Arslan, Ömer Egecioglu, Pavel A. Pevzner:
A new approach to sequence comparison: normalized sequence alignment. RECOMB 2001: 2-11 - 2000
- [j22]Peter R. Cappello, Ömer Egecioglu, Chris J. Scheiman:
Processor-time-optimal systolic arrays. Parallel Algorithms Appl. 15(3-4): 167-199 (2000) - [j21]M. Cemil Azizoglu, Ömer Egecioglu:
Lower Bounds on Communication Loads with Optimal Placements in Torus Networks. IEEE Trans. Computers 49(3): 259-266 (2000) - [j20]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) - [c16]Ömer Egecioglu, Hakan Ferhatosmanoglu:
Dimensionality Reduction and Similarity Computation by Inner Product Approximations. CIKM 2000: 219-226
1990 – 1999
- 1999
- [j19]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) - [j18]M. Cemil Azizoglu, Ömer Egecioglu:
The Isoperimetric Number of d-Dimensional k-Ary Arrays. Int. J. Found. Comput. Sci. 10(3): 289-300 (1999) - [c15]Abdullah N. Arslan, Ömer Egecioglu:
An Efficient Uniform-Cost Normalized Edit Distance Algorithm. SPIRE/CRIWG 1999: 8-15 - 1998
- [j17]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) - [j16]Daniel Andresen, Tao Yang, Oscar H. Ibarra, Ömer Egecioglu:
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance. J. Parallel Distributed Comput. 49(1): 57-85 (1998) - [c14]Kamil Saraç, Ömer Egecioglu, Amr El Abbadi:
Iterated DFT Based Techniques for Join Size Estimation. CIKM 1998: 348-355 - [c13]Ömer Egecioglu, Marcus Peinado:
Algorithms for Almost-uniform Generation with an Unbiased Binary Source. COCOON 1998: 117-126 - [c12]Peter R. Cappello, Ömer Egecioglu:
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems. IPPS/SPDP 1998: 105-109 - [c11]M. Cemil Azizoglu, Ömer Egecioglu:
Lower Bounds on Communication Loads and Optimal Placements in Torus Networks. IPPS/SPDP 1998: 460-464 - 1997
- [j15]Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Billiard Quorums on the Grid. Inf. Process. Lett. 64(1): 9-16 (1997) - [j14]Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. IEEE Trans. Parallel Distributed Syst. 8(5): 533-537 (1997) - [c10]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 - 1996
- [j13]Ömer Egecioglu, Teofilo F. Gonzalez:
A Computationally Intractable Problem on Simplicial Complexes. Comput. Geom. 6: 85-98 (1996) - [c9]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 - [c8]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 - [c7]Ömer Egecioglu, Ashok Srinivasan:
Domain Decomposition for Particle Methods on the Sphere. IRREGULAR 1996: 119-130 - [c6]Ömer Egecioglu, Maximilian Ibel:
Parallel algorithms for fast computation of normalized edit distances. SPDP 1996: 496-503 - 1995
- [j12]James Abello, Ömer Egecioglu, Krishna Kumar:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains. Discret. Comput. Geom. 14(3): 331-358 (1995) - [c5]Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi:
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. COCOON 1995: 161-170 - 1994
- [j11]Ömer Egecioglu, Ambuj K. Singh:
Naming Symmetric Processes Using Shared Variables. Distributed Comput. 8(1): 19-38 (1994) - [j10]Ömer Egecioglu, Çetin Kaya Koç
Exponentiation Using Canonical Recoding. Theor. Comput. Sci. 129(2): 407-417 (1994) - 1993
- [j9]James Abello, Ömer Egecioglu:
Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geom. Appl. 3(1): 27-37 (1993) - [j8]Ömer Egecioglu, Ashok Srinivasan
Optimal Parallel Prefix on Mesh Architectures. Parallel Algorithms Appl. 1(3): 191-209 (1993) - [c4]James Abello, Krishna Kumar, Ömer Egecioglu:
A Combinatorial View of Visibility Graphs of Simple Polygons. ICCI 1993: 87-92 - 1992
- [j7]Ömer Egecioglu, Çetin Kaya Koç
A parallel algorithm for generating discrete orthogonal polynomials. Parallel Comput. 18(6): 649-659 (1992) - [c3]Gregory R. De Haan, Ömer Egecioglu:
Topology preservation for speech recognition. ICSLP 1992: 463-466 - 1991
- [j6]Ömer Egecioglu, Jeffrey B. Remmel:
Brick tabloids and the connection matrices between bases of symmetric functions. Discret. Appl. Math. 34(1-3): 107-120 (1991) - 1990
- [j5]Ömer Egecioglu, Jeffrey B. Remmel:
The monomial symmetric functions and the Frobenius map. J. Comb. Theory A 54(2): 272-295 (1990)
1980 – 1989
- 1989
- [j4]Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç
Parallel Hermite interpolation: An algebraic approach. Computing 42(4): 291-307 (1989) - [j3]Ömer Egecioglu, Bahman Kalantari:
Approximating the Diameter of a Set of Points in the Euclidean Space. Inf. Process. Lett. 32(4): 205-211 (1989) - [j2]Ömer Egecioglu, Efstratios Gallopoulos, Çetin Kaya Koç:
Fast computation of divided differences and parallel hermite interpolation. J. Complex. 5(4): 417-437 (1989) - 1988
- [c2]Ömer Egecioglu, Çetin Kaya Koç, Alan J. Laub:
Prefix algorithms for tridiagonal systems on hypercube multiprocessors. C³P 1988: 1539-1545 - 1986
- [j1]Ömer Egecioglu, Jeffrey B. Remmel:
Bijections for Cayley trees, spanning trees, and their q-analogues. J. Comb. Theory A 42(1): 15-30 (1986) - 1985
- [c1]Ömer Egecioglu:
Algorithms for the Character Theory of the Symmetric Group. European Conference on Computer Algebra (2) 1985: 206-224
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: