Alexander Golynski

According to our database1, Alexander Golynski authored at least 21 papers between 2002 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Zanzibar: Google's Consistent, Global Authorization System.
Proceedings of the 2019 USENIX Annual Technical Conference, 2019

2014
Optimal Indexes for Sparse Bit Vectors.
Algorithmica, 2014

2012
Optimal strategies for the list update problem under the MRM alternative cost model.
Inf. Process. Lett., 2012

On the complexity of routing in wireless multihop network.
Proceedings of the 8th International Wireless Communications and Mobile Computing Conference, 2012

2010
Sorting with networks of data structures.
Discret. Appl. Math., 2010

2009
Cell probe lower bounds for succinct data structures.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

2008
On the Redundancy of Succinct Data Structures.
Proceedings of the Algorithm Theory, 2008

2007
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures.
PhD thesis, 2007

Optimal lower bounds for rank and select indexes.
Theor. Comput. Sci., 2007

Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci., 2007

On the Size of Succinct Indices.
Proceedings of the Algorithms, 2007

2006
Rank/select operations on large alphabets: a tool for text indexing.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

2005
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Constraints An Int. J., 2005

2004
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci., 2004

Improved Algorithms for the Global Cardinality Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2004

2003
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
Proceedings of the Algorithms, 2003

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2003

the asteroid surveying problem and other puzzles.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

Sufficiently Fat Polyhedra are Not 2-Castable.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Curves of width one and the river shore problem.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
Proceedings of the Algorithm Theory, 2002


  Loading...