Alexander Golynski

25 papers A* 2A 4B 2Journal 9Unranked 7
YearRankTypeTitle / Venue / Authors
2019 — conf
Zanzibar: Google's Consistent, Global Authorization System.
USENIX ATC
Ruoming Pang, Ramón Cáceres, Mike Burrows, Zhifeng Chen, Pratik Dave, Nathan Germer, Alexander Golynski, Kevin Graney, Nina Kang, Lea Kissner, Jeffrey L. Korn, Abhishek Parmar, Christopher D. Richards, Mengzhi Wang
2014 J jnl
Optimal Indexes for Sparse Bit Vectors.
Algorithmica
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2012 B conf
On the complexity of routing in wireless multihop network.
IWCMC
Sonia Waharte, Alexander Golynski, Raouf Boutaba
2012 J jnl
Optimal strategies for the list update problem under the MRM alternative cost model.
Inf. Process. Lett.
Alexander Golynski, Alejandro López-Ortiz
2011 J jnl
Optimal Indexes for Sparse Bit Vectors
CoRR
Alexander Golynski, Alessio Orlandi, Rajeev Raman, S. Srinivasa Rao
2010 J jnl
Sorting with networks of data structures.
Discret. Appl. Math.
Therese Biedl, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, J. Ian Munro
2009 A* conf
Cell probe lower bounds for succinct data structures.
SODA
Alexander Golynski
2008 — conf
On the Redundancy of Succinct Data Structures.
SWAT
Alexander Golynski, Rajeev Raman, S. Srinivasa Rao
2007 J jnl
Adaptive searching in succinctly encoded binary relations and tree-structured documents.
Theor. Comput. Sci.
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2007 A conf
On the Size of Succinct Indices.
ESA
Alexander Golynski, Roberto Grossi, Ankur Gupta, Rajeev Raman, S. Srinivasa Rao
2007 J jnl
Optimal lower bounds for rank and select indexes.
Theor. Comput. Sci.
Alexander Golynski
2007 — —
Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures.
Alexander Golynski
2006 B conf
Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents.
CPM
Jérémy Barbay, Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2006 — conf
Optimal Lower Bounds for Rank and Select Indexes.
ICALP (1)
Alexander Golynski
2006 A* conf
Rank/select operations on large alphabets: a tool for text indexing.
SODA
Alexander Golynski, J. Ian Munro, S. Srinivasa Rao
2005 J jnl
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
Constraints An Int. J.
Claude-Guy Quimper, Alexander Golynski, Alejandro López-Ortiz, Peter van Beek
2004 A conf
Improved Algorithms for the Global Cardinality Constraint.
CP
Claude-Guy Quimper, Alejandro López-Ortiz, Peter van Beek, Alexander Golynski
2004 J jnl
Longest increasing subsequences in sliding windows.
Theor. Comput. Sci.
Michael H. Albert, Alexander Golynski, Angèle M. Hamel, Alejandro López-Ortiz, S. Srinivasa Rao, Mohammad Ali Safari
2003 A conf
An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint.
CP
Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, Sayyed Bashir Sadjad
2003 — conf
Curves of width one and the river shore problem.
CCCG
Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
2003 A conf
Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting.
ESA
Therese Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper
2003 — conf
Sufficiently Fat Polyhedra are Not 2-Castable.
CCCG
Alexander Golynski, David Bremner
2003 — conf
the asteroid surveying problem and other puzzles.
SCG
Timothy M. Chan, Alexander Golynski, Alejandro López-Ortiz, Claude-Guy Quimper
2002 — conf
A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid.
SWAT
Alexander Golynski, Joseph Douglas Horton
2002 J jnl
Sufficiently Fat Polyhedra are not 2-castable
CoRR
David Bremner, Alexander Golynski