Ömer Egecioglu

According to our database1, Ömer Egecioglu
  • authored at least 93 papers between 1985 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Privacy-Preserving Certification of Sustainability Metrics.
Proceedings of the Eighth ACM Conference on Data and Application Security and Privacy, 2018

2017
A note on iterated galileo sequences.
Discrete Math., Alg. and Appl., 2017

q-cube enumerator polynomial of Fibonacci cubes.
Discrete Applied Mathematics, 2017

Towards Practical Privacy-Preserving Life Cycle Assessment Computations.
Proceedings of the Seventh ACM on Conference on Data and Application Security and Privacy, 2017

2016
A Matrix Decomposition Method for Optimal Normal Basis Multiplication.
IEEE Trans. Computers, 2016

Counting disjoint hypercubes in Fibonacci cubes.
Discrete Applied Mathematics, 2016

2015
A Matrix Decomposition Method for Optimal Normal Basis Multiplication.
IACR Cryptology ePrint Archive, 2015

2014
Reducing the Complexity of Normal Basis Multiplication.
IACR Cryptology ePrint Archive, 2014

Reducing the Complexity of Normal Basis Multiplication.
Proceedings of the Arithmetic of Finite Fields - 5th International Workshop, 2014

2013
Fixed-Parameter Tractability of Error Correction in Graphical Linear Systems.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
Anónimos: An LP-Based Approach for Anonymizing Weighted Social Network Graphs.
IEEE Trans. Knowl. Data Eng., 2012

Stateless multicounter 5′ → 3′ Watson-Crick automata: the deterministic case.
Natural Computing, 2012

A Survey of Results on Stateless Multicounter Automata.
Fundam. Inform., 2012

Multitape NFA: Weak Synchronization of the Input Heads.
Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

2011
Hierarchies of Stateless Multicounter 5′ → 3′ Watson-Crick Automata Languages.
Fundam. Inform., 2011

Hierarchy Results on Stateless Multicounter 5′ → 3′ Watson-Crick Automata.
Proceedings of the Advances in Computational Intelligence, 2011

2010
Bessel Polynomials and the Partial Sums of the Exponential Series.
SIAM J. Discrete Math., 2010

A multilinear operator for almost product evaluation of Hankel determinants.
J. Comb. Theory, Ser. A, 2010

Anonimos: An LP based Approach for Anonymizing Weighted Social Network Graphs
CoRR, 2010

Anonymizing weighted social network graphs.
Proceedings of the 26th International Conference on Data Engineering, 2010

Stateless multicounter 5′ → 3′ Watson-Crick automata.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009
Asynchronous spiking neural P systems.
Theor. Comput. Sci., 2009

Uniform generation of anonymous and neutral preference profiles for social choice rules.
Monte Carlo Meth. and Appl., 2009

Analysis of Bit-Split Languages for Packet Scanning and Experiments with Wildcard Matching.
Int. J. Found. Comput. Sci., 2009

On Bottcher's mysterious identity.
Australasian J. Combinatorics, 2009

Rome: Performance and Anonymity using Route Meshes.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

Strongly Regular Grammars and Regular Approximation of Context-Free Languages.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Hierarchies and Characterizations of Stateless Multicounter Machines.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

On Stateless Multicounter Machines.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Almost Product Evaluation of Hankel Determinants.
Electr. J. Comb., 2008

Automata-Theoretic Analysis of Bit-Split Languages for Packet Scanning.
Proceedings of the Implementation and Applications of Automata, 2008

2007
Dynamic and Fractional Programming-Based Approximation Algorithms for Sequence Alignment with Constraints.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation.
Proceedings of the 23rd International Conference on Data Engineering, 2007

Asynchronous Spiking Neural P Systems: Decidability and Undecidability.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

A q-Analogue of the Parikh Matrix Mapping.
Proceedings of the Formal Models, 2007

2005
Algorithms For The Constrained Longest Common Subsequence Problems.
Int. J. Found. Comput. Sci., 2005

Optimal Data-Space Partitioning of Spatial Data for Parallel I/O.
Distributed and Parallel Databases, 2005

2004
Dimensionality Reduction and Similarity Computation by Inner-Product Approximations.
IEEE Trans. Knowl. Data Eng., 2004

Catalytic P systems, semilinear sets, and vector addition systems.
Theor. Comput. Sci., 2004

Dynamic Programming Based Approximation Algorithms for Sequence Alignment with Constraints.
INFORMS Journal on Computing, 2004

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.
Int. J. Found. Comput. Sci., 2004

Dictionary Look-Up Within Small Edit Distance.
Int. J. Found. Comput. Sci., 2004

Algorithms for the Constrained Longest Common Subsequence Problems.
Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

A Matrix q-Analogue of the Parikh Map.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

2003
Characterizations of Catalytic Membrane Computing Systems.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Approximation Algorithms for Local Alignment with Length Constraints.
Int. J. Found. Comput. Sci., 2002

The Isoperimetric Number and The Bisection Width of Generalized Cylinders.
Electronic Notes in Discrete Mathematics, 2002

Efficient Computation of Long Similar Subsequences.
Proceedings of the String Processing and Information Retrieval, 2002

Algorithms for Local Alignment with Length Constraints.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

Automatic Processor Lower Bound Formulas for Array Computations.
Proceedings of the International Symposium on Parallel Architectures, 2002

Dictionary Look-Up within Small Edit Distance.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001
From a Polynomial Riemann Hypothesis to Alternating Sign Matrices.
Electr. J. Comb., 2001

A new approach to sequence comparison: normalized sequence alignment.
Bioinformatics, 2001

A new approach to sequence comparison: normalized sequence alignment.
Proceedings of the Fifth Annual International Conference on Computational Biology, 2001

Parametric Approximation Algorithms for High-Dimensional Euclidean Similarity.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2001

An Improved Upper Bound on the Size of Planar Convex-Hulls.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Image compression for fast wavelet-based subregion retrieval.
Theor. Comput. Sci., 2000

Lower Bounds on Communication Loads with Optimal Placements in Torus Networks.
IEEE Trans. Computers, 2000

Processor-time-optimal systolic arrays.
Parallel Algorithms Appl., 2000

Dimensionality Reduction and Similarity Computation by Inner Product Approximations.
Proceedings of the 2000 ACM CIKM International Conference on Information and Knowledge Management, 2000

1999
DFT Techniques for Size Estimation of Database Join Operations.
Int. J. Found. Comput. Sci., 1999

The Isoperimetric Number of d-Dimensional k-Ary Arrays.
Int. J. Found. Comput. Sci., 1999

An Efficient Uniform-Cost Normalized Edit Distance Algorithm.
Proceedings of the Sixth International Symposium on String Processing and Information Retrieval and Fifth International Workshop on Groupware, 1999

1998
Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance.
J. Parallel Distrib. Comput., 1998

Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems.
Int. J. Found. Comput. Sci., 1998

Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems.
IPPS/SPDP, 1998

Lower Bounds on Communication Loads and Optimal Placements in Torus Networks.
IPPS/SPDP, 1998

Algorithms for Almost-uniform Generation with an Unbiased Binary Source.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

Iterated DFT Based Techniques for Join Size Estimation.
Proceedings of the 1998 ACM CIKM International Conference on Information and Knowledge Management, 1998

1997
Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion.
IEEE Trans. Parallel Distrib. Syst., 1997

Billiard Quorums on the Grid.
Inf. Process. Lett., 1997

A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval.
Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996
A Computationally Intractable Problem on Simplicial Complexes.
Comput. Geom., 1996

Parallel algorithms for fast computation of normalized edit distances.
Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Domain Decomposition for Particle Methods on the Sphere.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, March 31, 1996

Scalability Issues for High Performance Digital Libraries on the World Wide Web.
Proceedings of the Third Forum on Research and Technology Advances in Digital Library, 1996

1995
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
Discrete & Computational Geometry, 1995

Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Exponentiation Using Canonical Recoding.
Theor. Comput. Sci., 1994

Naming Symmetric Processes Using Shared Variables.
Distributed Computing, 1994

1993
Optimal Parallel Prefix on Mesh Architectures.
Parallel Algorithms Appl., 1993

Visibility graphs of staircase polygons with uniform step length.
Int. J. Comput. Geometry Appl., 1993

A Combinatorial View of Visibility Graphs of Simple Polygons.
Proceedings of the Computing and Information, 1993

1992
A parallel algorithm for generating discrete orthogonal polynomials.
Parallel Computing, 1992

Topology preservation for speech recognition.
Proceedings of the Second International Conference on Spoken Language Processing, 1992

1991
Brick tabloids and the connection matrices between bases of symmetric functions.
Discrete Applied Mathematics, 1991

1990
The monomial symmetric functions and the Frobenius map.
J. Comb. Theory, Ser. A, 1990

1989
Fast computation of divided differences and parallel hermite interpolation.
J. Complexity, 1989

Approximating the Diameter of a Set of Points in the Euclidean Space.
Inf. Process. Lett., 1989

Parallel Hermite interpolation: An algebraic approach.
Computing, 1989

1986
Bijections for Cayley trees, spanning trees, and their q-analogues.
J. Comb. Theory, Ser. A, 1986

1985
Algorithms for the Character Theory of the Symmetric Group.
Proceedings of the EUROCAL '85, 1985


  Loading...