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

Improved algorithms for the global cardinality constraint CG Quimper, A López-Ortiz, P Van Beek, A Golynski Principles and Practice of Constraint Programming–CP 2004: 10th …, 2004 | 86 | 2004 |

On the size of succinct indices A Golynski, R Grossi, A Gupta, R Raman, SS Rao Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007 | 73 | 2007 |

A polynomial time algorithm to find the minimum cycle basis of a regular matroid A Golynski, JD Horton Algorithm Theory—SWAT 2002: 8th Scandinavian Workshop on Algorithm Theory …, 2002 | 67 | 2002 |

An efficient bounds consistency algorithm for the global cardinality constraint CG Quimper, P Van Beek, A López-Ortiz, A Golynski, SB Sadjad Principles and Practice of Constraint Programming–CP 2003: 9th International …, 2003 | 63 | 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 |

Zanzibar:{Google’s} Consistent, Global Authorization System R Pang, R Caceres, M Burrows, Z Chen, P Dave, N Germer, A Golynski, ... 2019 USENIX Annual Technical Conference (USENIX ATC 19), 33-46, 2019 | 45 | 2019 |

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

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 | 44 | 2004 |

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

Adaptive searching in succinctly encoded binary relations and tree-structured documents J Barbay, A Golynski, JI Munro, SS Rao Combinatorial Pattern Matching: 17th Annual Symposium, CPM 2006, Barcelona …, 2006 | 31 | 2006 |

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

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

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

Upper and lower bounds for text upper and lower bounds for text indexing data structures A Golynski University of Waterloo, Waterloo, Ont., 2007 | 15 | 2007 |

Curves of width one and the river shore problem. TM Chan, A Golynski, A López-Ortiz, CG Quimper CCCG, 73-75, 2003 | 7 | 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 |

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

Optimal dynamic video-on-demand using adaptive broadcasting T Biedl, ED Demaine, A Golynski, JD Horton, A López-Ortiz, G Poirier, ... Algorithms-ESA 2003: 11th Annual European Symposium, Budapest, Hungary …, 2003 | 5 | 2003 |

On the complexity of routing in wireless multihop network S Waharte, A Golynski, R Boutaba 2012 8th International Wireless Communications and Mobile Computing …, 2012 | 4 | 2012 |