default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:conf/analco:"
download as .bib file
@inproceedings{DBLP:conf/analco/BodiniGN19,
author = {Olivier Bodini and
Antoine Genitrini and
Mehdi Naima},
editor = {Marni Mishna and
J. Ian Munro},
title = {Ranked Schr{\"{o}}der Trees},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {13--26},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.2},
doi = {10.1137/1.9781611975505.2},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/BodiniGN19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CooleyFGK19,
author = {Oliver Cooley and
Wenjie Fang and
Nicola Del Giudice and
Mihyun Kang},
editor = {Marni Mishna and
J. Ian Munro},
title = {Subcritical random hypergraphs, high-order components, and hypertrees},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {111--118},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.12},
doi = {10.1137/1.9781611975505.12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CooleyFGK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DesmaraisH19,
author = {Colin Desmarais and
Cecilia Holmgren},
editor = {Marni Mishna and
J. Ian Munro},
title = {Degree distributions of generalized hooking networks},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {103--110},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.11},
doi = {10.1137/1.9781611975505.11},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DesmaraisH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FillH19,
author = {James Allen Fill and
Wei{-}Chun Hung},
editor = {Marni Mishna and
J. Ian Munro},
title = {QuickSort: Improved right-tail asymptotics for the limiting distribution,
and large deviations (Extended Abstract)},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {87--93},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.9},
doi = {10.1137/1.9781611975505.9},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/FillH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GolebiewskiK19,
author = {Zbigniew Golebiewski and
Mateusz Klimczak},
editor = {Marni Mishna and
J. Ian Munro},
title = {Protection Number of Recursive Trees},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {45--53},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.5},
doi = {10.1137/1.9781611975505.5},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/GolebiewskiK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HacklHW19,
author = {Benjamin Hackl and
Clemens Heuberger and
Stephan G. Wagner},
editor = {Marni Mishna and
J. Ian Munro},
title = {Reducing Simply Generated Trees by Iterative Leaf Cutting},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {36--44},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.4},
doi = {10.1137/1.9781611975505.4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/HacklHW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HeubergerK19,
author = {Clemens Heuberger and
Daniel Krenn},
editor = {Marni Mishna and
J. Ian Munro},
title = {Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory
Functions of Regular Sequences},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {27--35},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.3},
doi = {10.1137/1.9781611975505.3},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/HeubergerK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LangowskiW19,
author = {Simon Langowski and
Mark Daniel Ward},
editor = {Marni Mishna and
J. Ian Munro},
title = {Moments of Select Sets},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {67--73},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.7},
doi = {10.1137/1.9781611975505.7},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/LangowskiW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LenglerMS19,
author = {Johannes Lengler and
Anders Martinsson and
Angelika Steger},
editor = {Marni Mishna and
J. Ian Munro},
title = {When Does Hillclimbing Fail on Monotone Functions: An entropy compression
argument},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {94--102},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.10},
doi = {10.1137/1.9781611975505.10},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/LenglerMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MartinezNW19,
author = {Conrado Mart{\'{\i}}nez and
Markus Nebel and
Sebastian Wild},
editor = {Marni Mishna and
J. Ian Munro},
title = {Sesquickselect: One and a half pivots for cache-efficient selection},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {54--66},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.6},
doi = {10.1137/1.9781611975505.6},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MartinezNW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher19,
author = {Michael Mitzenmacher},
editor = {Marni Mishna and
J. Ian Munro},
title = {Arithmetic Progression Hypergraphs: Examining the Second Moment Method},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {127--134},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.14},
doi = {10.1137/1.9781611975505.14},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/NebelNW19,
author = {Markus E. Nebel and
Elisabeth Neumann and
Sebastian Wild},
editor = {Marni Mishna and
J. Ian Munro},
title = {Median-of-k Jumplists and Dangling-Min BSTs},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {74--86},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.8},
doi = {10.1137/1.9781611975505.8},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/NebelNW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/OliveiraP19,
author = {Roberto I. Oliveira and
Yuval Peres},
editor = {Marni Mishna and
J. Ian Munro},
title = {Random walks on graphs: new bounds on hitting, meeting, coalescing
and returning},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {119--126},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.13},
doi = {10.1137/1.9781611975505.13},
timestamp = {Sat, 29 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/OliveiraP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/PanafieuLW19,
author = {Elie de Panafieu and
Mohamed Lamine Lamali and
Michael Wallner},
editor = {Marni Mishna and
J. Ian Munro},
title = {Combinatorics of nondeterministic walks of the Dyck and Motzkin type},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {1--12},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.1},
doi = {10.1137/1.9781611975505.1},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/PanafieuLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2019,
editor = {Marni Mishna and
J. Ian Munro},
title = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505},
doi = {10.1137/1.9781611975505},
timestamp = {Fri, 15 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BahraniL18,
author = {Maryam Bahrani and
J{\'{e}}r{\'{e}}mie O. Lumbroso},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Split-Decomposition Trees with Prime Nodes: Enumeration and Random
Generation of Cactus Graphs},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {143--157},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.13},
doi = {10.1137/1.9781611975062.13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BahraniL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BassinoRS18,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Tsinjo Rakotoarimalala and
Andrea Sportiello},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {The complexity of the Multiple Pattern Matching Problem for random
strings},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {40--53},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.5},
doi = {10.1137/1.9781611975062.5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BassinoRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BendkowskiBD18,
author = {Maciej Bendkowski and
Olivier Bodini and
Sergey Dovgal},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Polynomial tuning of multiparametric combinatorial samplers},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {92--106},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.9},
doi = {10.1137/1.9781611975062.9},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BendkowskiBD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BernsteinFR18,
author = {Megan Bernstein and
Matthew Fahrbach and
Dana Randall},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet
Generating Functions},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {107--117},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.10},
doi = {10.1137/1.9781611975062.10},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/BernsteinFR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CooperFP18,
author = {Colin Cooper and
Alan M. Frieze and
Samantha Petti},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {The cover time of a biased random walk on \emph{G\({}_{\mbox{n, p}}\)}},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {158--167},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.14},
doi = {10.1137/1.9781611975062.14},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/CooperFP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DuttaS18,
author = {Kunal Dutta and
C. R. Subramanian},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {On Induced Paths, Holes and Trees in Random Graphs},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {168--177},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.15},
doi = {10.1137/1.9781611975062.15},
timestamp = {Tue, 14 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/DuttaS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GudmundssonKLMS18,
author = {Joachim Gudmundsson and
Irina Kostitsyna and
Maarten L{\"{o}}ffler and
Tobias M{\"{u}}ller and
Vera Sacrist{\'{a}}n and
Rodrigo I. Silveira},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Theoretical analysis of beaconless geocast protocols in 1D},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {62--76},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.7},
doi = {10.1137/1.9781611975062.7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GudmundssonKLMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HartungHP18,
author = {Lisa Hartung and
Nina Holden and
Yuval Peres},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Trace reconstruction with varying deletion probabilities},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {54--61},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.6},
doi = {10.1137/1.9781611975062.6},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/HartungHP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HePX18,
author = {Meng He and
Richard Peng and
Yinzhan Xu},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Parameterizing the Hardness of Binary Search Tree Access Sequences
by Inversion Counts},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {32--39},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.4},
doi = {10.1137/1.9781611975062.4},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/HePX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JimenezM18,
author = {Rosa M. Jim{\'{e}}nez and
Conrado Mart{\'{\i}}nez},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {On Deletions in Open Addressing Hashing},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {23--31},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.3},
doi = {10.1137/1.9781611975062.3},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/JimenezM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LumbrosoS18,
author = {J{\'{e}}r{\'{e}}mie O. Lumbroso and
Jessica Shi},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {118--132},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.11},
doi = {10.1137/1.9781611975062.11},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/LumbrosoS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/NeiningerS18,
author = {Ralph Neininger and
Jasmin Straub},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Probabilistic Analysis of the Dual-Pivot Quicksort "Count"},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {1--7},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.1},
doi = {10.1137/1.9781611975062.1},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/NeiningerS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/PanagiotouR18,
author = {Konstantinos Panagiotou and
Leon Ramzews},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Asymptotic Enumeration of Graph Classes with Many Components},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {133--142},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.12},
doi = {10.1137/1.9781611975062.12},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/PanagiotouR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/WhiddenM18,
author = {Chris Whidden and
Frederick A. Matsen IV},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies
between Phylogenetic Trees},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {77--91},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.8},
doi = {10.1137/1.9781611975062.8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/WhiddenM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Wild18,
author = {Sebastian Wild},
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Quicksort Is Optimal For Many Equal Keys},
booktitle = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
pages = {8--22},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062.2},
doi = {10.1137/1.9781611975062.2},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Wild18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2018,
editor = {Markus E. Nebel and
Stephan G. Wagner},
title = {Proceedings of the Fifteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2018, New Orleans, LA, USA, January 8-9, 2018},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975062},
doi = {10.1137/1.9781611975062},
isbn = {978-1-61197-506-2},
timestamp = {Thu, 04 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniDGP17,
author = {Olivier Bodini and
Matthieu Dien and
Antoine Genitrini and
Fr{\'{e}}d{\'{e}}ric Peschanski},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {The Ordered and Colored Products in Analytic Combinatorics: Application
to the Quantitative Study of Synchronizations in Concurrent Processes},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {16--30},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.2},
doi = {10.1137/1.9781611974775.2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniDGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BonaP17,
author = {Mikl{\'{o}}s B{\'{o}}na and
Boris G. Pittel},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {On the cycle structure of the product of random maximal cycles},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {1--15},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.1},
doi = {10.1137/1.9781611974775.1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BonaP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BuhmannDGS17,
author = {Joachim M. Buhmann and
Julien Dumazert and
Alexey Gronskiy and
Wojciech Szpankowski},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Phase Transitions in Parameter Rich Optimization Problems},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {148--155},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.15},
doi = {10.1137/1.9781611974775.15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BuhmannDGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ChauveFL17,
author = {C{\'{e}}dric Chauve and
{\'{E}}ric Fusy and
J{\'{e}}r{\'{e}}mie O. Lumbroso},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {An Exact Enumeration of Distance-Hereditary Graphs},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {31--45},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.3},
doi = {10.1137/1.9781611974775.3},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/ChauveFL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CichonMST17,
author = {Jacek Cichon and
Abram Magner and
Wojciech Szpankowski and
Krzysztof Turowski},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {On Symmetries of Non-Plane Trees in a Non-Uniform Model},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {156--163},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.16},
doi = {10.1137/1.9781611974775.16},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CichonMST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Drmota0HN17,
author = {Michael Drmota and
Michael Fuchs and
Hsien{-}Kuei Hwang and
Ralph Neininger},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {External Profile of Symmetric Digital Search Trees (Extended Abstract)},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {124--130},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.12},
doi = {10.1137/1.9781611974775.12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Drmota0HN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DuchL17,
author = {Amalia Duch and
Gustavo Lau},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Partial Match Queries in Relaxed \emph{K}-d\emph{t} trees},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {131--138},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.13},
doi = {10.1137/1.9781611974775.13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DuchL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GhoshLP17,
author = {Subhroshekhar Ghosh and
Thomas M. Liggett and
Robin Pemantle},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Multivariate {CLT} follows from strong Rayleigh property},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {139--147},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.14},
doi = {10.1137/1.9781611974775.14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GhoshLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GittenbergerJW17,
author = {Bernhard Gittenberger and
Emma Yu Jin and
Michael Wallner},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {A note on the scaling limits of random P{\'{o}}lya trees},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {85--93},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.8},
doi = {10.1137/1.9781611974775.8},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/GittenbergerJW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Godin17,
author = {Thibault Godin},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {An analogue to Dixon's theorem for automaton groups},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {164--173},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.17},
doi = {10.1137/1.9781611974775.17},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Godin17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HacklKP17,
author = {Benjamin Hackl and
Sara Kropf and
Helmut Prodinger},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Iterative Cutting and Pruning of Planar Trees},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {66--72},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.6},
doi = {10.1137/1.9781611974775.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/HacklKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Krenn17,
author = {Daniel Krenn},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {An Extended Note on the Comparison-optimal Dual-Pivot Quickselect},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {115--123},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.11},
doi = {10.1137/1.9781611974775.11},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/Krenn17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KuntschikN17,
author = {Andrea Kuntschik and
Ralph Neininger},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Rates of convergence for balanced irreducible two-color P{\'{o}}lya
urns},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {94--99},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.9},
doi = {10.1137/1.9781611974775.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KuntschikN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MouW17,
author = {Wenlong Mou and
Liwei Wang},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {A Refined Analysis of {LSH} for Well-dispersed Data Points},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {174--182},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.18},
doi = {10.1137/1.9781611974775.18},
timestamp = {Tue, 19 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MouW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/NoyRRR17,
author = {Marc Noy and
Vonjy Rasendrahasina and
Vlady Ravelomanana and
Juanjo Ru{\'{e}}},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Isolated cycles of critical random graphs},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {46--55},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.4},
doi = {10.1137/1.9781611974775.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/NoyRRR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/OosthuizenW17,
author = {Joubert Oosthuizen and
Stephan Wagner},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {On the distribution of random walk hitting times in random trees},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {73--84},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.7},
doi = {10.1137/1.9781611974775.7},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/OosthuizenW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/RotondoV17,
author = {Pablo Rotondo and
Brigitte Vall{\'{e}}e},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {The recurrence function of a random Sturmian word},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {100--114},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.10},
doi = {10.1137/1.9781611974775.10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/RotondoV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/StreibS17,
author = {Amanda Pascoe Streib and
Noah Streib},
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Cycle Basis Markov Chains for the Ising Model},
booktitle = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
pages = {56--65},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775.5},
doi = {10.1137/1.9781611974775.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/StreibS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2017,
editor = {Conrado Mart{\'{\i}}nez and
Mark Daniel Ward},
title = {Proceedings of the Fourteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2017, Barcelona, Spain, Hotel Porta Fira,
January 16-17, 2017},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974775},
doi = {10.1137/1.9781611974775},
isbn = {978-1-61197-477-5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/0001T16,
author = {Yusuke Kobayashi and
Kenjiro Takazawa},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Randomized Strategies for Cardinality Robustness in the Knapsack Problem},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {25--33},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.3},
doi = {10.1137/1.9781611974324.3},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/0001T16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BhaktaR16,
author = {Prateek Bhakta and
Dana Randall},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Sampling Weighted Perfect Matchings on the Square-Octagon Lattice},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {46--55},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.5},
doi = {10.1137/1.9781611974324.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BhaktaR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DrmotaJ16,
author = {Michael Drmota and
Emma Yu Jin},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Scaling limit of random \emph{k}-trees},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {56--65},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.7},
doi = {10.1137/1.9781611974324.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DrmotaJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DurantW16,
author = {Kevin Durant and
Stephan Wagner},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Betweenness Centrality in Random Trees},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {66--79},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.8},
doi = {10.1137/1.9781611974324.8},
timestamp = {Thu, 01 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/DurantW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MihalakUY16,
author = {Mat{\'{u}}s Mihal{\'{a}}k and
Przemyslaw Uznanski and
Pencho Yordanov},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration
of Arborescences},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {93--105},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.10},
doi = {10.1137/1.9781611974324.10},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/MihalakUY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher16,
author = {Michael Mitzenmacher},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {More Analysis of Double Hashing for Balanced Allocations},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {1--9},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.1},
doi = {10.1137/1.9781611974324.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher16a,
author = {Michael Mitzenmacher},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {A New Approach to Analyzing Robin Hood Hashing},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {10--24},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.2},
doi = {10.1137/1.9781611974324.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MullerN16,
author = {Noela S. M{\"{u}}ller and
Ralph Neininger},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {The {CLT} Analogue for Cyclic Urns},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {121--127},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.11},
doi = {10.1137/1.9781611974324.11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MullerN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/PanafieuR16,
author = {Elie de Panafieu and
Lander Ramos},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Graphs with degree constraints},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {34--45},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.4},
doi = {10.1137/1.9781611974324.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/PanafieuR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ShiragaYKY16,
author = {Takeharu Shiraga and
Yukiko Yamauchi and
Shuji Kijima and
Masafumi Yamashita},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Total Variation Discrepancy of Deterministic Random Walks for Ergodic
Markov Chains},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {138--148},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.13},
doi = {10.1137/1.9781611974324.13},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/ShiragaYKY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/WhiddenM16,
author = {Chris Whidden and
Frederick A. Matsen IV},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Ricci-Ollivier Curvature of the Rooted Phylogenetic Subtree-Prune-Regraft
Graph},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {106--120},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.6},
doi = {10.1137/1.9781611974324.6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/WhiddenM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Zhang16,
author = {Panpan Zhang},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment
Circuits},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {80--92},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.9},
doi = {10.1137/1.9781611974324.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Zhang16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ZhaoZ16,
author = {Jun Zhao and
Panpan Zhang},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {On Connectivity in a General Random Intersection Graph},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
pages = {128--137},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324.12},
doi = {10.1137/1.9781611974324.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/ZhaoZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2016,
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324},
doi = {10.1137/1.9781611974324},
isbn = {978-1-61197-432-4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/0001KPT15,
author = {Ioannis Giotis and
Lefteris M. Kirousis and
Kostas I. Psaromiligkos and
Dimitrios M. Thilikos},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {On the Algorithmic Lov{\'{a}}sz Local Lemma and Acyclic Edge
Coloring},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {16--25},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.2},
doi = {10.1137/1.9781611973761.2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/0001KPT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/0007YG15,
author = {Jun Zhao and
Osman Yagan and
Virgil D. Gligor},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {On \emph{k}-Connectivity and Minimum Vertex Degree in Random \emph{s}-Intersection
Graphs},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {1--15},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.1},
doi = {10.1137/1.9781611973761.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/0007YG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BanderierW15,
author = {Cyril Banderier and
Michael Wallner},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Lattice paths of slope 2/5},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {105--113},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.10},
doi = {10.1137/1.9781611973761.10},
timestamp = {Thu, 30 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/BanderierW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BassinoS15,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Andrea Sportiello},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Linear-time generation of inhomogeneous random directed walks},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {51--65},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.5},
doi = {10.1137/1.9781611973761.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BassinoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniG15,
author = {Olivier Bodini and
Antoine Genitrini},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Cuts in Increasing Trees},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {66--77},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.6},
doi = {10.1137/1.9781611973761.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniLR15,
author = {Olivier Bodini and
J{\'{e}}r{\'{e}}mie O. Lumbroso and
Nicolas Rolin},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Analytic Samplers and the Combinatorial Rejection Method},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {40--50},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.4},
doi = {10.1137/1.9781611973761.4},
timestamp = {Mon, 02 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BradonjicS15,
author = {Milan Bradonjic and
Iraj Saniee},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Bootstrap Percolation on Periodic Trees},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {89--96},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.8},
doi = {10.1137/1.9781611973761.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BradonjicS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JacquetM15,
author = {Philippe Jacquet and
Abram Magner},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Variance of Size in Regular Graph Tries},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {97--104},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.9},
doi = {10.1137/1.9781611973761.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JacquetM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KardasKL15,
author = {Marcin Kardas and
Miroslaw Kutylowski and
Jakub Lemiesz},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {On Distributed Cardinality Estimation: Random Arcs Recycled},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {129--137},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.12},
doi = {10.1137/1.9781611973761.12},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KardasKL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KiwiM15,
author = {Marcos A. Kiwi and
Dieter Mitsche},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {A Bound for the Diameter of Random Hyperbolic Graphs},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {26--39},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.3},
doi = {10.1137/1.9781611973761.3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KiwiM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MartinezNW15,
author = {Conrado Mart{\'{\i}}nez and
Markus E. Nebel and
Sebastian Wild},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Analysis of Branch Misses in Quicksort},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {114--128},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.11},
doi = {10.1137/1.9781611973761.11},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MartinezNW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/RalaivaosaonaW15,
author = {Dimbinaina Ralaivaosaona and
Stephan G. Wagner},
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Repeated fringe subtrees in random rooted trees},
booktitle = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
pages = {78--88},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761.7},
doi = {10.1137/1.9781611973761.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/RalaivaosaonaW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2015,
editor = {Robert Sedgewick and
Mark Daniel Ward},
title = {Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2015, San Diego, CA, USA, January 4, 2015},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973761},
doi = {10.1137/1.9781611973761},
isbn = {978-1-61197-376-1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BannisterDE14,
author = {Michael J. Bannister and
William E. Devanny and
David Eppstein},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Small Superpatterns for Dominance Drawing},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {92--103},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.9},
doi = {10.1137/1.9781611973204.9},
timestamp = {Tue, 23 May 2017 01:10:30 +0200},
biburl = {https://dblp.org/rec/conf/analco/BannisterDE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BernardiCF14,
author = {Olivier Bernardi and
Gwendal Collet and
{\'{E}}ric Fusy},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {A bijection for plane graphs and its applications},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {52--61},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.5},
doi = {10.1137/1.9781611973204.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BernardiCF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniG14,
author = {Olivier Bodini and
Bernhard Gittenberger},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {On the asymptotic number of \emph{BCK}(2)-terms},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {25--39},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.3},
doi = {10.1137/1.9781611973204.3},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DadounN14,
author = {Benjamin Dadoun and
Ralph Neininger},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {A statistical view on exchanges in Quickselect},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {40--51},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.4},
doi = {10.1137/1.9781611973204.4},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DadounN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DoerrK14,
author = {Benjamin Doerr and
Marvin K{\"{u}}nnemann},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Tight Analysis of Randomized Rumor Spreading in Complete Graphs},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {82--91},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.8},
doi = {10.1137/1.9781611973204.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DoerrK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GangulyP14,
author = {Shirshendu Ganguly and
Yuval Peres},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Permuted Random Walk Exits Typically in Linear Time},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {74--81},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.7},
doi = {10.1137/1.9781611973204.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GangulyP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HunV14,
author = {Kanal Hun and
Brigitte Vall{\'{e}}e},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Typical Depth of a Digital Search Tree built on a general source},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {1--15},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.1},
doi = {10.1137/1.9781611973204.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/HunV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KalpathyMR14,
author = {Ravi Kalpathy and
Hosam M. Mahmoud and
Walter Rosenkrantz},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Survivors in Leader Election Algorithms},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {113--120},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.11},
doi = {10.1137/1.9781611973204.11},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KalpathyMR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MagnerKS14,
author = {Abram Magner and
Charles Knessl and
Wojciech Szpankowski},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Expected External Profile of {PATRICIA} Tries},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {16--24},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.2},
doi = {10.1137/1.9781611973204.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MagnerKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MorinV14,
author = {Pat Morin and
Sander Verdonschot},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {On the Average Number of Edges in Theta Graphs},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {121--132},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.12},
doi = {10.1137/1.9781611973204.12},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MorinV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/RegnierFI14,
author = {Mireille R{\'{e}}gnier and
Billy Fang and
Daria Iakovishina},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {Clump Combinatorics, Automata, and Word Asymptotics},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {62--73},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.6},
doi = {10.1137/1.9781611973204.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/RegnierFI14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/SolomonS14,
author = {Noam Solomon and
Shay Solomon},
editor = {Michael Drmota and
Mark Daniel Ward},
title = {On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem},
booktitle = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
pages = {104--112},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204.10},
doi = {10.1137/1.9781611973204.10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/SolomonS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2014,
editor = {Michael Drmota and
Mark Daniel Ward},
title = {2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics
and Combinatorics, {ANALCO} 2014, Portland, Oregon, USA, January 6,
2014},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973204},
doi = {10.1137/1.9781611973204},
isbn = {978-1-61197-320-4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BacherBJ13,
author = {Axel Bacher and
Olivier Bodini and
Alice Jacquot},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann
Samplers and Holonomic Specification},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {52--61},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.7},
doi = {10.1137/1.9781611973037.7},
timestamp = {Tue, 23 May 2017 01:10:30 +0200},
biburl = {https://dblp.org/rec/conf/analco/BacherBJ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BoisberrangerGLT13,
author = {J{\'{e}}r{\'{e}}mie Du Boisberranger and
Dani{\`{e}}le Gardy and
Xavier Lorca and
Charlotte Truchet},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {When is it worthwhile to propagate a constraint? {A} probabilistic
analysis of AllDifferent},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {80--90},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.10},
doi = {10.1137/1.9781611973037.10},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BoisberrangerGLT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BonaV13,
author = {Mikl{\'{o}}s B{\'{o}}na and
Andrew Vince},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {The number of ways to assemble a graph},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {8--17},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.2},
doi = {10.1137/1.9781611973037.2},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BonaV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BradonjicS13,
author = {Milan Bradonjic and
Iraj Saniee},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Bootstrap Percolation on Random Geometric Graphs},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {18--24},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.3},
doi = {10.1137/1.9781611973037.3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BradonjicS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CichonGKK13,
author = {Jacek Cichon and
Zbigniew Golebiewski and
Marcin Kardas and
Marek Klonowski},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {On Delta-Method of Moments and Probabilistic Sums},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {91--98},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.11},
doi = {10.1137/1.9781611973037.11},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CichonGKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DrmotaN13,
author = {Michael Drmota and
Marc Noy},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Extremal Parameters in Sub-Critical Graph Classes},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {1--7},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.1},
doi = {10.1137/1.9781611973037.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DrmotaN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Forster13,
author = {Klaus{-}Tycho F{\"{o}}rster},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Approximating Fault-Tolerant Domination in General Graphs},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {25--32},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.4},
doi = {10.1137/1.9781611973037.4},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Forster13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GaitherW13,
author = {Jeffrey Gaither and
Mark Daniel Ward},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {The Variance of the Number of 2-Protected Nodes in a Trie},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {43--51},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.6},
doi = {10.1137/1.9781611973037.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GaitherW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HeubergerKW13,
author = {Clemens Heuberger and
Daniel Krenn and
Stephan G. Wagner},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Analysis of parameters of trees corresponding to Huffman codes and
sums of unit fractions},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {33--42},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.5},
doi = {10.1137/1.9781611973037.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/HeubergerKW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Kingan13,
author = {Sandra R. Kingan},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Unlabeled equivalence for matroids representable over finite fields},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {99--106},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.12},
doi = {10.1137/1.9781611973037.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Kingan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mahmoud13,
author = {Hosam M. Mahmoud},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Perpetuities in fair leader election algorithms},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {62--71},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.8},
doi = {10.1137/1.9781611973037.8},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/Mahmoud13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/SzymanskaK013,
author = {Edyta Szymanska and
Marek Karpinski and
Andrzej Rucinski},
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Approximate Counting of Matchings in Sparse Uniform Hypergraphs},
booktitle = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
pages = {72--79},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037.9},
doi = {10.1137/1.9781611973037.9},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/SzymanskaK013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2013,
editor = {Markus E. Nebel and
Wojciech Szpankowski},
title = {Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2013, New Orleans, Louisiana, USA, January 6, 2013},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973037},
doi = {10.1137/1.9781611973037},
isbn = {978-1-61197-254-2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BanderierBPB12,
author = {Cyril Banderier and
Olivier Bodini and
Yann Ponty and
Hanane Tafat Bouzid},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Biodiversity of Pattern Distributions in Combinatorial Ecosystems},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {107--115},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.13},
doi = {10.1137/1.9781611973020.13},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/BanderierBPB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BannisterE12,
author = {Michael J. Bannister and
David Eppstein},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Randomized Speedup of the Bellman-Ford Algorithm},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {41--47},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.6},
doi = {10.1137/1.9781611973020.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BannisterE12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BaryshnikovZ12,
author = {Yuliy M. Baryshnikov and
Vadim Zharnitsky},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Search on the Brink of Chaos},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {65--74},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.9},
doi = {10.1137/1.9781611973020.9},
timestamp = {Thu, 02 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/BaryshnikovZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Blelloch12,
author = {Guy E. Blelloch},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Problem Based Benchmarks},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
publisher = {{SIAM}},
year = {2012},
timestamp = {Tue, 14 May 2013 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Blelloch12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Coja-OghlanF12,
author = {Amin Coja{-}Oghlan and
Alan M. Frieze},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Analyzing Walksat on Random Formulas},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {48--55},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.7},
doi = {10.1137/1.9781611973020.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Coja-OghlanF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DrmotaP12,
author = {Michael Drmota and
Konstantinos Panagiotou},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {A Central Limit Theorem for the Number of Degree-k Vertices in Random
Maps},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {9--15},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.2},
doi = {10.1137/1.9781611973020.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DrmotaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HelmiP12,
author = {Ahmed Helmi and
Alois Panholzer},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Analysis of "Hiring Above the Median": {A} "Lake Wobegon" Strategy
for The Hiring Problem},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {75--83},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.10},
doi = {10.1137/1.9781611973020.10},
timestamp = {Sat, 03 Feb 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/HelmiP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/HemmeckeKMTW12,
author = {Raymond Hemmecke and
Sven Kosub and
Ernst W. Mayr and
Hanjo T{\"{a}}ubig and
Jeremias Weihmann},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Inequalities for the Number of Walks in Graphs},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {26--39},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.4},
doi = {10.1137/1.9781611973020.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/HemmeckeKMTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JinN12,
author = {Emma Yu Jin and
Markus E. Nebel},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {The Expected Order of Saturated {RNA} Secondary Structures},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {84--91},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.11},
doi = {10.1137/1.9781611973020.11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JinN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KijimaKM12,
author = {Shuji Kijima and
Kentaro Koga and
Kazuhisa Makino},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Deterministic Random Walks on Finite Graphs},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {16--25},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.3},
doi = {10.1137/1.9781611973020.3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KijimaKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LumbrosoB12,
author = {J{\'{e}}r{\'{e}}mie O. Lumbroso and
Olivier Bodini},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Dirichlet Random Samplers for Multiplicative Combinatorial Structures},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {92--106},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.12},
doi = {10.1137/1.9781611973020.12},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/LumbrosoB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Munro12,
author = {J. Ian Munro},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {The Complexity of Partial Orders},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {40},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.5},
doi = {10.1137/1.9781611973020.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Munro12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Wagner12,
author = {Stephan G. Wagner},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Asymptotic Enumeration of Extensional Acyclic Digraphs},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {1--8},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.1},
doi = {10.1137/1.9781611973020.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Wagner12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Watanabe12,
author = {Osamu Watanabe},
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Message Passing Algorithms for {MLS-3LIN} Problem},
booktitle = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
pages = {56--64},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020.8},
doi = {10.1137/1.9781611973020.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Watanabe12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2012,
editor = {Conrado Mart{\'{\i}}nez and
Hsien{-}Kuei Hwang},
title = {Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics,
{ANALCO} 2012, Kyoto, Japan, January 16, 2012},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973020},
doi = {10.1137/1.9781611973020},
isbn = {978-1-61197-213-9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/000111,
author = {Michael Fuchs},
editor = {Philippe Flajolet and
Daniel Panario},
title = {The Subtree Size Profile of Plane-oriented Recursive Trees},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {85--92},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.10},
doi = {10.1137/1.9781611973013.10},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/000111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/AminiDL11,
author = {Hamed Amini and
Moez Draief and
Marc Lelarge},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Flooding and Diameter in Weighted Random Graphs},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {1--15},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.1},
doi = {10.1137/1.9781611973013.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/AminiDL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BeerFJS11,
author = {Elizabeth Beer and
James Allen Fill and
Svante Janson and
Edward R. Scheinerman},
editor = {Philippe Flajolet and
Daniel Panario},
title = {On Vertex, Edge, and Vertex-edge Random Graphs},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {16--22},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.2},
doi = {10.1137/1.9781611973013.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BeerFJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniGG11,
author = {Olivier Bodini and
Dani{\`{e}}le Gardy and
Bernhard Gittenberger},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Lambda-terms of Bounded Unary Height},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {23--32},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.3},
doi = {10.1137/1.9781611973013.3},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniGG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ByersHMZ11,
author = {John W. Byers and
Brent Heeringa and
Michael Mitzenmacher and
Georgios Zervas},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Heapable Sequences and Subsequences},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {33--44},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.4},
doi = {10.1137/1.9781611973013.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/ByersHMZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ChauvinGM11,
author = {Brigitte Chauvin and
Dani{\`{e}}le Gardy and
C{\'{e}}cile Mailler},
editor = {Philippe Flajolet and
Daniel Panario},
title = {The Growing Trees Distribution on Boolean Functions},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {45--56},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.5},
doi = {10.1137/1.9781611973013.5},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/ChauvinGM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Dasse-HartautH11,
author = {Sandrine Dasse{-}Hartaut and
Pawel Hitczenko},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Some Properties of Random Staircase Tableaux},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {58--66},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.7},
doi = {10.1137/1.9781611973013.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Dasse-HartautH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DekelGP11,
author = {Yael Dekel and
Ori Gurel{-}Gurevich and
Yuval Peres},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Finding Hidden Cliques in Linear Time with High Probability},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {67--75},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.8},
doi = {10.1137/1.9781611973013.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DekelGP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Eisenstat11,
author = {David Eisenstat},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Random Road Networks: The Quadtree Model},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {76--84},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.9},
doi = {10.1137/1.9781611973013.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Eisenstat11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Goodrich11,
author = {Michael T. Goodrich},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin
Random Comparisons},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {93--106},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.11},
doi = {10.1137/1.9781611973013.11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Goodrich11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KamousiS11,
author = {Pegah Kamousi and
Subhash Suri},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Stochastic Minimum Spanning Trees and Related Problems},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {107--116},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.12},
doi = {10.1137/1.9781611973013.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KamousiS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KholfiM11,
author = {Sanaa Kholfi and
Hosam M. Mahmoud},
editor = {Philippe Flajolet and
Daniel Panario},
title = {The Class of Tenable Zero-balanced Polya Urn Schemes: Characterization
and Gaussian Phases},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {117--126},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.13},
doi = {10.1137/1.9781611973013.13},
timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/KholfiM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LouchardMP11,
author = {Guy Louchard and
Conrado Martinez and
Helmut Prodinger},
editor = {Philippe Flajolet and
Daniel Panario},
title = {The Swedish Leader Election Protocol: Analysis and Variations},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {127--134},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.14},
doi = {10.1137/1.9781611973013.14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/LouchardMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MiracleRS11,
author = {Sarah Miracle and
Dana Randall and
Amanda Pascoe Streib},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Cluster Algorithms for Discrete Models of Colloids with Bars},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {135--149},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.15},
doi = {10.1137/1.9781611973013.15},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MiracleRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Sedgewick11,
author = {Robert Sedgewick},
editor = {Philippe Flajolet and
Daniel Panario},
title = {Algorithms for the Masses},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {57},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.6},
doi = {10.1137/1.9781611973013.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Sedgewick11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2011,
editor = {Philippe Flajolet and
Daniel Panario},
title = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013},
doi = {10.1137/1.9781611973013},
isbn = {978-1-61197-301-3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BalajiM10,
author = {Srinivasan Balaji and
Hosam M. Mahmoud},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Phases in the Mixing of Gases via the Ehrenfest Urn Model},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {9--17},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.2},
doi = {10.1137/1.9781611973006.2},
timestamp = {Thu, 01 Jun 2017 18:58:35 +0200},
biburl = {https://dblp.org/rec/conf/analco/BalajiM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BassinoMNVW10,
author = {Fr{\'{e}}d{\'{e}}rique Bassino and
Armando Martino and
Cyril Nicaud and
Enric Ventura and
Pascal Weil},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {On Two Distributions of Subgroups of Free Groups},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {82--89},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.11},
doi = {10.1137/1.9781611973006.11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BassinoMNVW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BauerKW10,
author = {Reinhard Bauer and
Marcus Krug and
Dorothea Wagner},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Enumerating and Generating Labeled k-degenerate Graphs},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {90--98},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.12},
doi = {10.1137/1.9781611973006.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BauerKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BodiniFR10,
author = {Olivier Bodini and
Thomas Fernique and
Damien Regnault},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Stochastic Flips on Two-letter Words},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {48--55},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.7},
doi = {10.1137/1.9781611973006.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BodiniFR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Choi10,
author = {Yongwook Choi},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Fast Algorithm for Optimal Compression of Graphs},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {34--46},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.5},
doi = {10.1137/1.9781611973006.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Choi10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DarrasseHBS10,
author = {Alexis Darrasse and
Hsien{-}Kuei Hwang and
Olivier Bodini and
Mich{\`{e}}le Soria},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {The Connectivity-Profile of Random Increasing k-trees},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {99--106},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.13},
doi = {10.1137/1.9781611973006.13},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DarrasseHBS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DuchonL10,
author = {Philippe Duchon and
Hubert Larchev{\^{e}}que},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {On the Search Path Length of Random Binary Skip Graphs},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {1--8},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.1},
doi = {10.1137/1.9781611973006.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DuchonL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Elmasry10,
author = {Amr Elmasry},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {The Subset Partial Order: Computing and Combinatorics},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {27--33},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.4},
doi = {10.1137/1.9781611973006.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Elmasry10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Fleischer10,
author = {Lisa Fleischer},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Data Center Scheduling, Generalized Flows, and Submodularity},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {56--65},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.8},
doi = {10.1137/1.9781611973006.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Fleischer10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FleischerS10,
author = {Lisa Fleischer and
Zoya Svitkina},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Preference-constrained Oriented Matching},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {66--73},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.9},
doi = {10.1137/1.9781611973006.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/FleischerS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/IchibaI10,
author = {Takayuki Ichiba and
Kazuo Iwama},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Averaging Techniques for Competitive Auctions},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {74--81},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.10},
doi = {10.1137/1.9781611973006.10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/IchibaI10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/PanarioRY10,
author = {Daniel Panario and
L. Bruce Richmond and
Benjamin Young},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Bivariate Asymptotics for Striped Plane Partitions},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {18--26},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.3},
doi = {10.1137/1.9781611973006.3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/PanarioRY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Salvy10,
author = {Bruno Salvy},
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Newton Iteration: From Numerics to Combinatorics, and Back},
booktitle = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
pages = {47},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006.6},
doi = {10.1137/1.9781611973006.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Salvy10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2010,
editor = {Mordecai J. Golin and
Robert Sedgewick},
title = {Proceedings of the Seventh Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2010, Austin, Texas, USA, January 16, 2010},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973006},
doi = {10.1137/1.9781611973006},
isbn = {978-0-89871-933-8},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/AtajanOY09,
author = {Talip Atajan and
Naohisa Otsuka and
Xuerong Yong},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {The Spanning Trees Formulas in a Class of Double Fixed-Step Loop Networks},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {17--22},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.3},
doi = {10.1137/1.9781611972993.3},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/AtajanOY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BonatoC09,
author = {Anthony Bonato and
Ehsan Chiniforooshan},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Pursuit and Evasion from a Distance: Algorithms and Bounds},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {1--10},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.1},
doi = {10.1137/1.9781611972993.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BonatoC09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BradonjicMP09,
author = {Milan Bradonjic and
Tobias M{\"{u}}ller and
Allon G. Percus},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Coloring Geographical Threshold Graphs},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {11--16},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.2},
doi = {10.1137/1.9781611972993.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BradonjicMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CheungFGL09,
author = {Yun Kuen Cheung and
Philippe Flajolet and
Mordecai J. Golin and
C. Y. James Lee},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Multidimensional Divide-and-Conquer and Weighted Digital Sums},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {58--74},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.9},
doi = {10.1137/1.9781611972993.9},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CheungFGL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FournierGG09,
author = {Herv{\'{e}} Fournier and
Dani{\`{e}}le Gardy and
Antoine Genitrini},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Balanced And/Or Trees and Linear Threshold Functions},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {51--57},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.8},
doi = {10.1137/1.9781611972993.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/FournierGG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Gonnet09,
author = {Gaston H. Gonnet},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Mathematics and Computer Science Serving/Impacting Bioinformatics},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {34},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.5},
doi = {10.1137/1.9781611972993.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Gonnet09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JacquetV09,
author = {Philippe Jacquet and
Laurent Viennot},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Average Size of Unstretched Remote-Spanners},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {23--33},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.4},
doi = {10.1137/1.9781611972993.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JacquetV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/LaubeN09,
author = {Ulrich Laube and
Markus E. Nebel},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Maximum Likelihood Analysis of Heapsort},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {41--50},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.7},
doi = {10.1137/1.9781611972993.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/LaubeN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Lladser09,
author = {Manuel E. Lladser},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Prediction of Unseen Proportions in Urn Models with Restricted Sampling},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {85--91},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.12},
doi = {10.1137/1.9781611972993.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Lladser09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MahalanabisS09,
author = {Satyaki Mahalanabis and
Daniel Stefankovic},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Approximating L1-distances Between Mixture Distributions Using Random
Projections},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {75--84},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.11},
doi = {10.1137/1.9781611972993.11},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MahalanabisS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mahmoud09,
author = {Hosam M. Mahmoud},
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Average-case Analysis of Moves in Quick Select},
booktitle = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
pages = {35--40},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993.6},
doi = {10.1137/1.9781611972993.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mahmoud09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2009,
editor = {Conrado Mart{\'{\i}}nez and
Robert Sedgewick},
title = {Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2009, New York, New York, USA, January 03, 2009},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611972993},
doi = {10.1137/1.9781611972993},
isbn = {978-0-89871-932-1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2009.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FillN08,
author = {James Allen Fill and
Tak{\'{e}}hiko Nakama},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Analysis of the Expected Number of Bit Comparisons Required by Quickselect},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {249--256},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.9},
doi = {10.1137/1.9781611972986.9},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/FillN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Gebauer08,
author = {Heidi Gebauer},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {On the Number of Hamilton Cycles in Bounded Degree Graphs},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {241--248},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.8},
doi = {10.1137/1.9781611972986.8},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Gebauer08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GuptaGV08,
author = {Ankur Gupta and
Roberto Grossi and
Jeffrey Scott Vitter},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Nearly Tight Bounds on the Encoding Length of the Burrows-Wheeler
Transform},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {191--202},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.3},
doi = {10.1137/1.9781611972986.3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/GuptaGV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Lladser08,
author = {Manuel E. Lladser},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Markovian Embeddings of General Random Strings},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {183--190},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.2},
doi = {10.1137/1.9781611972986.2},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Lladser08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Lueker08,
author = {George S. Lueker},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {On the Convergence of Upper Bound Techniques for the Average Length
of Longest Common Subsequences},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {169--182},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.1},
doi = {10.1137/1.9781611972986.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Lueker08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MartinezPP08,
author = {Conrado Mart{\'{\i}}nez and
Alois Panholzer and
Helmut Prodinger},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Generating Random Derangements},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {234--240},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.7},
doi = {10.1137/1.9781611972986.7},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/MartinezPP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Matsuura08,
author = {Akihiro Matsuura},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Exact Analysis of the Recurrence Relations Generalized from the Tower
of Hanoi},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {228--233},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.6},
doi = {10.1137/1.9781611972986.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Matsuura08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/NguyenM08,
author = {Van Nguyen and
Chip Martel},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Augmented Graph Models for Small-World Analysis with Geographic Factors},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {213--227},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.5},
doi = {10.1137/1.9781611972986.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/NguyenM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/TalbotT08,
author = {David Talbot and
John M. Talbot},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Bloom Maps},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {203--212},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.4},
doi = {10.1137/1.9781611972986.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/TalbotT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2008,
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986},
doi = {10.1137/1.9781611972986},
isbn = {978-1-61197-298-6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/AkhaviMR07,
author = {Ali Akhavi and
Jean{-}Fran{\c{c}}ois Marckert and
Alain Rouault},
editor = {Daniel Panario and
Robert Sedgewick},
title = {On the Reduction of a Random Basis},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {265--270},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.13},
doi = {10.1137/1.9781611972979.13},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/AkhaviMR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Arthur07,
author = {David Arthur},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Fast Sorting and Pattern-avoiding Permutations},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {169--174},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.1},
doi = {10.1137/1.9781611972979.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Arthur07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BoseDKLMWW07,
author = {Prosenjit Bose and
Vida Dujmovic and
Danny Krizanc and
Stefan Langerman and
Pat Morin and
David R. Wood and
Stefanie Wuhrer},
editor = {Daniel Panario and
Robert Sedgewick},
title = {A Characterization of the Degree Sequences of 2-trees},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {232--241},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.10},
doi = {10.1137/1.9781611972979.10},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/BoseDKLMWW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CesarattoDLMV07,
author = {Eda Cesaratto and
Benoit Daireaux and
Lo{\"{\i}}ck Lhote and
V{\'{e}}ronique Maume{-}Deschamps and
Brigitte Vall{\'{e}}e},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Analysis of Fast Versions of the Euclid Algorithm},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {271--285},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.14},
doi = {10.1137/1.9781611972979.14},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CesarattoDLMV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/ChaudhuriK07,
author = {Siddhartha Chaudhuri and
Vladlen Koltun},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Smoothed Analysis of Probabilistic Roadmaps},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {250--264},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.12},
doi = {10.1137/1.9781611972979.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/ChaudhuriK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DuchM07,
author = {Amalia Duch and
Conrado Mart{\'{\i}}nez},
editor = {Daniel Panario and
Robert Sedgewick},
title = {On the Average Cost of Insertions on Random Relaxed K-d Trees},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {194--200},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.4},
doi = {10.1137/1.9781611972979.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DuchM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FlajoletFP07,
author = {Philippe Flajolet and
{\'{E}}ric Fusy and
Carine Pivoteau},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Boltzmann Sampling of Unlabeled Structures},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {201--211},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.5},
doi = {10.1137/1.9781611972979.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/FlajoletFP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FusyG07,
author = {{\'{E}}ric Fusy and
Fr{\'{e}}d{\'{e}}ric Giroire},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Estimating the Number of Active Flows in a Data Stream over a Sliding
Window},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {223--231},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.9},
doi = {10.1137/1.9781611972979.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/FusyG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GolinYZ07,
author = {Mordecai J. Golin and
Xuerong Yong and
Yuanping Zhang},
editor = {Daniel Panario and
Robert Sedgewick},
title = {The Asymptotic Number of Spanning Trees in Circulant Graphs},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {242--249},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.11},
doi = {10.1137/1.9781611972979.11},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GolinYZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JelenkovicK07,
author = {Predrag R. Jelenkovic and
Xiaozhu Kang},
editor = {Daniel Panario and
Robert Sedgewick},
title = {{LRU} Caching with Moderately Heavy Request Distributions},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {212--222},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.6},
doi = {10.1137/1.9781611972979.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JelenkovicK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KubaP07,
author = {Markus Kuba and
Alois Panholzer},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Analysis of Insertion Costs in Priority Trees},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {175--182},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.2},
doi = {10.1137/1.9781611972979.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KubaP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Ward07,
author = {Mark Daniel Ward},
editor = {Daniel Panario and
Robert Sedgewick},
title = {The Average Profile of Suffix Trees},
booktitle = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
pages = {183--193},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979.3},
doi = {10.1137/1.9781611972979.3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Ward07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2007,
editor = {Daniel Panario and
Robert Sedgewick},
title = {Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2007, New Orleans, Louisiana, USA, January 06, 2007},
publisher = {{SIAM}},
year = {2007},
url = {https://doi.org/10.1137/1.9781611972979},
doi = {10.1137/1.9781611972979},
isbn = {978-1-61197-297-9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2007.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BlumCR06,
author = {Avrim Blum and
T.{-}H. Hubert Chan and
Mugizi Robert Rwebangira},
editor = {Daniel Panario and
Robert Sedgewick},
title = {A Random-Surfer Web-Graph Model},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {238--246},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.8},
doi = {10.1137/1.9781611972962.8},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/BlumCR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/CooperDST06,
author = {Joshua N. Cooper and
Benjamin Doerr and
Joel Spencer and
G{\'{a}}bor Tardos},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Deterministic Random Walks},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {185--197},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.1},
doi = {10.1137/1.9781611972962.1},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/CooperDST06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/DaligaultM06,
author = {Jean Daligault and
Conrado Mart{\'{\i}}nez},
editor = {Daniel Panario and
Robert Sedgewick},
title = {On the Variance of Quickselect},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {205--210},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.3},
doi = {10.1137/1.9781611972962.3},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/DaligaultM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GohH06,
author = {William M. Y. Goh and
Pawel Hitczenko},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Random Partitions with Parts in the Range of a Polynomial},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {273--279},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.12},
doi = {10.1137/1.9781611972962.12},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GohH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/GolinLW06,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung and
Yajun Wang},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Permanents of Circulants: {A} Transfer Matrix Approach},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {263--272},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.11},
doi = {10.1137/1.9781611972962.11},
timestamp = {Thu, 01 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/GolinLW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JansonS06,
author = {Svante Janson and
Wojciech Szpankowski},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Partial Fillup and Search Time in {LC} Tries},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {223--229},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.6},
doi = {10.1137/1.9781611972962.6},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JansonS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/JelenkovicR06,
author = {Predrag R. Jelenkovic and
Ana Radovanovic},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Asymptotic Optimality of the Static Frequency Caching in the Presence
of Correlated Requests},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {247--252},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.9},
doi = {10.1137/1.9781611972962.9},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/JelenkovicR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KnesslS06,
author = {Charles Knessl and
Wojciech Szpankowski},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Binary Trees, Left and Right Paths, {WKB} Expansions, and Painleve
Transcendents},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {198--204},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.2},
doi = {10.1137/1.9781611972962.2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KnesslS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/KrivelevichV06,
author = {Michael Krivelevich and
Dan Vilenchik},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Semirandom Models as Benchmarks for Coloring Algorithms},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {211--221},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.4},
doi = {10.1137/1.9781611972962.4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/KrivelevichV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/Mitzenmacher06,
author = {Michael Mitzenmacher},
editor = {Daniel Panario and
Robert Sedgewick},
title = {New Results and Open Problems for Deletion Channels},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {222},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.5},
doi = {10.1137/1.9781611972962.5},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/Mitzenmacher06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/MotwaniV06,
author = {Rajeev Motwani and
Sergei Vassilvitskii},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Distinct Values Estimators for Power Law Distributions},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {230--237},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.7},
doi = {10.1137/1.9781611972962.7},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/MotwaniV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/PemantleW06,
author = {Robin Pemantle and
Mark Daniel Ward},
editor = {Daniel Panario and
Robert Sedgewick},
title = {Exploring the Average Values of Boolean Functions via Asymptotics
and Experimentation},
booktitle = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
pages = {253--262},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962.10},
doi = {10.1137/1.9781611972962.10},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/PemantleW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2006,
editor = {Daniel Panario and
Robert Sedgewick},
title = {Proceedings of the Third Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2006, Miami, Florida, USA, January 21, 2006},
publisher = {{SIAM}},
year = {2006},
url = {https://doi.org/10.1137/1.9781611972962},
doi = {10.1137/1.9781611972962},
isbn = {978-1-61197-296-2},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/AcarBV05,
author = {Umut A. Acar and
Guy E. Blelloch and
Jorge L. Vittes},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {An Experimental Analysis of Change Propagation in Dynamic Trees},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {41--54},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/04uacar.pdf},
timestamp = {Tue, 30 Jan 2007 13:47:28 +0100},
biburl = {https://dblp.org/rec/conf/alenex/AcarBV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BerendS05,
author = {Daniel Berend and
Amir Sapir},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Complexity of the Path Multi-Peg Tower of Hanoi},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {212--217},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/03deberend.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BerendS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BliudzeK05,
author = {Simon Bliudze and
Daniel Krob},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Performance Evaluation of Demodulation with Diversity{\O}A Combinatorial
Approach {III:} Threshold Analysis},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {195--205},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/01sbliudze.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BliudzeK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BoydGPS05,
author = {Stephen P. Boyd and
Arpita Ghosh and
Balaji Prabhakar and
Devavrat Shah},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Mixing Times for Random Walks on Geometric Random Graphs},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {240--249},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/07SBoyd2.pdf},
timestamp = {Tue, 11 Sep 2007 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BoydGPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BrightwellW05,
author = {Graham R. Brightwell and
Peter Winkler},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Counting Eulerian Circuits is {\#}P-Complete},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {259--262},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/09grbrightwell.pdf},
timestamp = {Mon, 23 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/BrightwellW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BrodalFM05,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Gabriel Moruz},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {On the Adaptiveness of Quicksort},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {130--140},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/12gbrodal.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BrodalFM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BronnimannKPS05,
author = {Herv{\'{e}} Br{\"{o}}nnimann and
Lutz Kettner and
Michel Pocchiola and
Jack Snoeyink},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Counting and Enumerating Pointed Pseudo-triangulations with the Greedy
Flip Algorithm},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {98--110},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/09hbronnimann4.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BronnimannKPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CodenottiMPRV05,
author = {Bruno Codenotti and
Benton McCune and
Sriram V. Pemmaraju and
Rajiv Raman and
Kasturi R. Varadarajan},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {An Experimental Study of Different Approaches to Solve the Market
Equilibrium Problem},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {167--179},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/15bcodenotti.pdf},
timestamp = {Mon, 17 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/CodenottiMPRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DementievKMS05,
author = {Roman Dementiev and
Juha K{\"{a}}rkk{\"{a}}inen and
Jens Mehnert and
Peter Sanders},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Better External Memory Suffix Array Construction},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {86--97},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/08rdementiev.pdf},
timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/DementievKMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FanEKKV05,
author = {Quanfu Fan and
Alon Efrat and
Vladlen Koltun and
Shankar Krishnan and
Suresh Venkatasubramanian},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Hardware-Assisted Natural Neighbor Interpolation},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {111--120},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/10QFAN.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/FanEKKV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FaruquieMU05,
author = {Tanveer A. Faruquie and
Hemanta Kumar Maji and
Raghavendra Udupa},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {A New Decoding Algorithm for Statistical Machine Translation: Design
and Implementation},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {180--194},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/16tfaruquie.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/FaruquieMU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Frias05,
author = {Leonor Frias},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Extending {STL} Maps Using LBSTs},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {155--166},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/14lfrias.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Frias05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/FurerK05,
author = {Martin F{\"{u}}rer and
Shiva Prasad Kasiviswanathan},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Approximately Counting Perfect Matchings in General Graphs},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {263--272},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/10mfurer.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/FurerK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GoldbergW05,
author = {Andrew V. Goldberg and
Renato Fonseca F. Werneck},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Computing Point-to-Point Shortest Paths from External Memory},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {26--40},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/03agoldberg.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GoldbergW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GolinLWY05,
author = {Mordecai J. Golin and
Yiu{-}Cho Leung and
Yajun Wang and
Xuerong Yong},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Counting Structures in Grid Graphs, Cylinders and Tori Using Transfer
Matrices: Survey and New Results},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {250--258},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/08MGolin.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GolinLWY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HallS05,
author = {Alexander Hall and
Heiko Schilling},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Flows over Time: Towards a More Realistic and Computationally Tractable
Model},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {55--67},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/05ahall.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HallS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HansenS05,
author = {Jennie C. Hansen and
Eric Schmutz},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Comparison of Two {CDS} Algorithms on Random Unit Ball Graphs},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {206--211},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/02jhansen.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HansenS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HeilemanL05,
author = {Gregory L. Heileman and
Wenbin Luo},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {How Caching Affects Hashing},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {141--154},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/13gheileman.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HeilemanL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/KnesslS05,
author = {Charles Knessl and
Wojciech Szpankowski},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Enumeration of Binary Trees, Lempel-Ziv'78 Parsings, and Universal
Types},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {222--229},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/05cknessl.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/KnesslS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/LjubicWPKMF05,
author = {Ivana Ljubic and
Ren{\'{e}} Weiskircher and
Ulrich Pferschy and
Gunnar W. Klau and
Petra Mutzel and
Matteo Fischetti},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Solving the Prize-Collecting Steiner Tree Problem to Optimality},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {68--76},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/06iljubic.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/LjubicWPKMF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Moret05,
author = {Bernard M. E. Moret},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Computational Challenges from the Tree of Life},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {3--16},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/01keynote\_bmoret.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Moret05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/RandallW05,
author = {Dana Randall and
Peter Winkler},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Mixing Points on an Interval},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {218--221},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/04drandall.pdf},
timestamp = {Mon, 23 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/RandallW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Reznik05,
author = {Yuriy A. Reznik},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {On the Average Density and Selectivity of Nodes in Multi-Digit Tries},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {230--239},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/analco05/papers/06yreznik.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Reznik05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/SchurmannS05,
author = {Klaus{-}Bernd Sch{\"{u}}rmann and
Jens Stoye},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {An Incomplex Algorithm for Fast Suffix Array Construction},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {78--85},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/07kschuermann.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/SchurmannS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/SwensonMEM05,
author = {Krister M. Swenson and
Mark Marron and
Joel V. Earnest{-}DeYoung and
Bernard M. E. Moret},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Approximating the True Evolutionary Distance between Two Genomes},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {121--129},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/11submission.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/SwensonMEM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/WagnerW05,
author = {Dorothea Wagner and
Thomas Willhalm},
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Drawing Graphs to Speed Up Shortest-Path Computations},
booktitle = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
pages = {17--25},
publisher = {{SIAM}},
year = {2005},
url = {http://www.siam.org/meetings/alenex05/papers/02d.wagner.pdf},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/WagnerW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2005,
editor = {Camil Demetrescu and
Robert Sedgewick and
Roberto Tamassia},
title = {Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments
and the Second Workshop on Analytic Algorithmics and Combinatorics,
{ALENEX} /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005},
publisher = {{SIAM}},
year = {2005},
isbn = {0-89871-596-2},
timestamp = {Tue, 30 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Abu-KhzamCFLSS04,
author = {Faisal N. Abu{-}Khzam and
Rebecca L. Collins and
Michael R. Fellows and
Michael A. Langston and
W. Henry Suters and
Christopher T. Symons},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Kernelization Algorithms for the Vertex Cover Problem: Theory and
Experiments},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {62--69},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 23 Feb 2006 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Abu-KhzamCFLSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BaladiV04,
author = {Viviane Baladi and
Brigitte Vall{\'{e}}e},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Distribuional Analyses of Euclidean Algorithms},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {170--184},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BaladiV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BarequetM04,
author = {Gill Barequet and
Micha Moffie},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {The Complexity of Jensen's Algorithm for Counting Polyominoes},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {161--169},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BarequetM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Ben-MisheCK04,
author = {Boaz Ben{-}Moshe and
Paz Carmi and
Matthew J. Katz},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Approximating the Visible Region of a Point on a Terrain},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {120--128},
publisher = {{SIAM}},
year = {2004},
timestamp = {Tue, 04 Jan 2005 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Ben-MisheCK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BenderBJP04,
author = {Michael A. Bender and
Bryan Bradley and
Geetha Jagannathan and
Krishnan Pillaipakkamnatt},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {The Robustness of the Sum-of-Squares Algorithm for Bin Packing},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {18--30},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BenderBJP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BlandfordBK04,
author = {Daniel K. Blandford and
Guy E. Blelloch and
Ian A. Kash},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {An Experimental Analysis of a Compact Graph Representation},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {49--61},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BlandfordBK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BodlaenderK04,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Safe Seperators for Treewidth},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {70--78},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BodlaenderK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BrodalFV04,
author = {Gerth St{\o}lting Brodal and
Rolf Fagerberg and
Kristoffer Vinther},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Engineering a Cache-Oblivious Sorting Algorith},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {4--17},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 03 Mar 2005 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BrodalFV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/CardinalE04,
author = {Jean Cardinal and
David Eppstein},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Lazy Algorithms for Dynamic Closest Pair with Arbitary Distance Measures},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {112--119},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/CardinalE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/DementievKMS04,
author = {Roman Dementiev and
Lutz Kettner and
Jens Mehnert and
Peter Sanders},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Engineering a Sorted List Data Structure for 32 Bit Key},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {142--151},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 06 Jan 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/DementievKMS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Flajolet04,
author = {Philippe Flajolet},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Theory and Practice of Probabilistic Counting Algorithms (Abstract
of Invited Talk)},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {152},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Flajolet04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Furer04,
author = {Martin F{\"{u}}rer},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Quadratic Convergence for Scaling of Matrices},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {216--223},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Furer04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/GuibasKR04,
author = {Leonidas J. Guibas and
Menelaos I. Karavelas and
Daniel Russel},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {A Computational Framework for Handling Motion},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {129--141},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/GuibasKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Gutman04,
author = {Ronald J. Gutman},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Reach-Based Routing: {A} New Approach to Shortest Path Algorithms
Optimized for Road Networks},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {100--111},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Gutman04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Halperin04,
author = {Dan Halperin},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Engineering Geometric Algorithms: Persistent Problems and Some Solutions
(Abstract of invited talk)},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {3},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Halperin04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HitczenkoK04,
author = {Pawel Hitczenko and
Arnold Knopfmacher},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Gap-Free Samples of Geometric Random Variables},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {194--198},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/HitczenkoK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/HonLSTWY04,
author = {Wing{-}Kai Hon and
Tak Wah Lam and
Wing{-}Kin Sung and
Wai{-}Leuk Tse and
Chi{-}Kwong Wong and
Siu{-}Ming Yiu},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Practical aspects of Compressed Suffix Arrays and FM-Index in Searching
{DNA} Sequences},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {31--38},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 21 Apr 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/HonLSTWY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Leaver-FayLS04,
author = {Andrew Leaver{-}Fay and
Yuanxin Liu and
Jack Snoeyink},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Faster Placement of Hydrogens in Protein Structures by Dynamic Programming},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {39--48},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Leaver-FayLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Lhote04,
author = {Lo{\"{\i}}ck Lhote},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Computation of a Class of COntinued Fraction Constants},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {199--210},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Lhote04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Martinez04,
author = {Conrado Mart{\'{\i}}nez},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Patial Quicksort},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {224--228},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Martinez04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/PanarioRY04,
author = {Daniel Panario and
L. Bruce Richmond and
Martha Yip},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {A Simple Primality Test and th rth Smallest Prime Factor},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {185--193},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 04 Jan 2007 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/PanarioRY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/PessoaLS04,
author = {Artur Alves Pessoa and
Eduardo Sany Laber and
Cr{\'{\i}}ston P. de Souza},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Efficient Implementation of Hotlink Assignment Algorithm for Web Sites},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {79--87},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 11 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/PessoaLS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Prodinger04,
author = {Helmut Prodinger},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Compositions and Patricia Tries: No Fluctuations in the Variance!},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {211--215},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/Prodinger04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/PyrgaSWZ04,
author = {Evangelia Pyrga and
Frank Schulz and
Dorothea Wagner and
Christos D. Zaroliagis},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Experimental Comparison of Shortest Path Approaches for Timetable
Information},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {88--99},
publisher = {{SIAM}},
year = {2004},
timestamp = {Thu, 04 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/PyrgaSWZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/WardS04,
author = {Mark Daniel Ward and
Wojciech Szpankowski},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Analysis of Randomized Selection Algorithm Motivated by the LZ'77
Scheme},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {153--160},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/WardS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/alenex/2004,
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
publisher = {{SIAM}},
year = {2004},
isbn = {0-89871-564-4},
timestamp = {Fri, 10 Dec 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/alenex/2004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2025-01-19 21:15 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
