Rank/select operations on large alphabets: a tool for text indexing A Golynski, JI Munro, SS Rao SODA 6, 368-373, 2006 | 223 | 2006 |

Improved algorithms for the global cardinality constraint CG Quimper, A López-Ortiz, P Van Beek, A Golynski International Conference on Principles and Practice of Constraint …, 2004 | 83 | 2004 |

On the size of succinct indices A Golynski, R Grossi, A Gupta, R Raman, SS Rao European Symposium on Algorithms, 371-382, 2007 | 71 | 2007 |

A polynomial time algorithm to find the minimum cycle basis of a regular matroid A Golynski, JD Horton Scandinavian Workshop on Algorithm Theory, 200-209, 2002 | 63 | 2002 |

An efficient bounds consistency algorithm for the global cardinality constraint CG Quimper, P Van Beek, A López-Ortiz, A Golynski, SB Sadjad International Conference on Principles and Practice of Constraint …, 2003 | 60 | 2003 |

Adaptive searching in succinctly encoded binary relations and tree-structured documents J Barbay, A Golynski, JI Munro, SS Rao Theoretical Computer Science 387 (3), 284-297, 2007 | 56 | 2007 |

Longest increasing subsequences in sliding windows MH Albert, A Golynski, AM Hamel, A López-Ortiz, SS Rao, MA Safari Theoretical Computer Science 321 (2-3), 405-414, 2004 | 43 | 2004 |

On the redundancy of succinct data structures A Golynski, R Raman, SS Rao Scandinavian Workshop on Algorithm Theory, 148-159, 2008 | 38 | 2008 |

Cell probe lower bounds for succinct data structures A Golynski Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 35 | 2009 |

Adaptive searching in succinctly encoded binary relations and tree-structured documents J Barbay, A Golynski, JI Munro, SS Rao Annual Symposium on Combinatorial Pattern Matching, 24-35, 2006 | 33 | 2006 |

Optimal lower bounds for rank and select indexes A Golynski International Colloquium on Automata, Languages, and Programming, 370-381, 2006 | 28 | 2006 |

An efficient bounds consistency algorithm for the global cardinality constraint CG Quimper, A Golynski, A López-Ortiz, P Van Beek Constraints 10 (2), 115-135, 2005 | 28 | 2005 |

Upper and lower bounds for text indexing data structures A Golynski PhD Th., U. Waterloo, 2007 | 15 | 2007 |

Optimal indexes for sparse bit vectors A Golynski, A Orlandi, R Raman, SS Rao Algorithmica 69 (4), 906-924, 2014 | 14 | 2014 |

Zanzibar: Google’s consistent, global authorization system R Pang, R Cáceres, M Burrows, Z Chen, P Dave, N Germer, A Golynski, ... 2019 {USENIX} Annual Technical Conference ({USENIX}{ATC} 19), 33-46, 2019 | 6 | 2019 |

Curves of width one and the river shore problem. TM Chan, A Golynski, A López-Ortiz, CG Quimper CCCG, 73-75, 2003 | 6 | 2003 |

Optimal strategies for the list update problem under the MRM alternative cost model A Golynski, A López-Ortiz Information Processing Letters 112 (6), 218-222, 2012 | 5 | 2012 |

Optimal dynamic video-on-demand using adaptive broadcasting T Biedl, ED Demaine, A Golynski, JD Horton, A López-Ortiz, G Poirier, ... European Symposium on Algorithms, 90-101, 2003 | 5 | 2003 |

A note on the power of quantum fingerprinting A Golynski, P Sen arXiv preprint quant-ph/0510091, 2005 | 3 | 2005 |

Exploiting Statistics of Web Traces to Improve Caching Algorithms A Golynski, A López-Ortiz, R Sweidan Technical Report CS-2003-34, School of Computer Science, University of Waterloo, 2003 | 3 | 2003 |