The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "ANALCO"( http://dblp.L3S.de/Venues/ANALCO )

URL (DBLP): http://dblp.uni-trier.de/db/conf/analco

Publication years (Num. hits)
2006-2007 (26) 2008-2009 (22) 2010-2011 (30) 2012 (15) 2013-2014 (26) 2015-2016 (27) 2017 (19) 2018 (16) 2019 (15)
Publication types (Num. hits)
inproceedings(182) proceedings(14)
Venues (Conferences, Journals, ...)
ANALCO(196)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 196 publication records. Showing 196 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Colin Desmarais, Cecilia Holmgren Degree distributions of generalized hooking networks. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Benjamin Hackl, Clemens Heuberger, Stephan G. Wagner Reducing Simply Generated Trees by Iterative Leaf Cutting. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Marni Mishna, J. Ian Munro (eds.) Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2019, San Diego, CA, USA, January 6, 2019. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Elie de Panafieu, Mohamed Lamine Lamali, Michael Wallner 0001 Combinatorics of nondeterministic walks of the Dyck and Motzkin type. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Clemens Heuberger, Daniel Krenn Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Oliver Cooley, Wenjie Fang, Nicola Del Giudice 0001, Mihyun Kang Subcritical random hypergraphs, high-order components, and hypertrees. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Simon Langowski, Mark Daniel Ward Moments of Select Sets. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Antoine Genitrini, Mehdi Naima Ranked Schröder Trees. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Markus E. Nebel, Elisabeth Neumann, Sebastian Wild Median-of-k Jumplists and Dangling-Min BSTs. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Conrado Martínez, Markus Nebel, Sebastian Wild Sesquickselect: One and a half pivots for cache-efficient selection. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Zbigniew Golebiewski, Mateusz Klimczak Protection Number of Recursive Trees. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Johannes Lengler, Anders Martinsson, Angelika Steger When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1James Allen Fill, Wei-Chun Hung QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Michael Mitzenmacher Arithmetic Progression Hypergraphs: Examining the Second Moment Method. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Roberto I. Oliveira 0001, Yuval Peres Random walks on graphs: new bounds on hitting, meeting, coalescing and returning. Search on Bibsonomy ANALCO The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Maryam Bahrani, Jérémie O. Lumbroso Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Konstantinos Panagiotou, Leon Ramzews Asymptotic Enumeration of Graph Classes with Many Components. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Rosa M. Jiménez, Conrado Martínez On Deletions in Open Addressing Hashing. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ralph Neininger, Jasmin Straub Probabilistic Analysis of the Dual-Pivot Quicksort "Count". Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Kunal Dutta, C. R. Subramanian 0001 On Induced Paths, Holes and Trees in Random Graphs. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Sebastian Wild Quicksort Is Optimal For Many Equal Keys. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Meng He 0001, Richard Peng, Yinzhan Xu Parameterizing the Hardness of Binary Search Tree Access Sequences by Inversion Counts. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Frédérique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello The complexity of the Multiple Pattern Matching Problem for random strings. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Colin Cooper, Alan M. Frieze, Samantha Petti The cover time of a biased random walk on Gn, p. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Maciej Bendkowski, Olivier Bodini, Sergey Dovgal Polynomial tuning of multiparametric combinatorial samplers. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Lisa Hartung, Nina Holden, Yuval Peres Trace reconstruction with varying deletion probabilities. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Chris Whidden, Frederick A. Matsen IV Efficiently Inferring Pairwise Subtree Prune-and-Regraft Adjacencies between Phylogenetic Trees. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Markus E. Nebel, Stephan G. Wagner (eds.) Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Megan Bernstein, Matthew Fahrbach, Dana Randall Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joachim Gudmundsson, Irina Kostitsyna, Maarten Löffler, Tobias Müller 0001, Vera Sacristán, Rodrigo I. Silveira Theoretical analysis of beaconless geocast protocols in 1D. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Jérémie O. Lumbroso, Jessica Shi 0001 Exponential Bounds on Graph Enumerations from Vertex Incremental Characterizations. Search on Bibsonomy ANALCO The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Joachim M. Buhmann, Julien Dumazert, Alexey Gronskiy, Wojciech Szpankowski Phase Transitions in Parameter Rich Optimization Problems. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernhard Gittenberger, Emma Yu Jin, Michael Wallner 0001 A note on the scaling limits of random Pólya trees. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger External Profile of Symmetric Digital Search Trees (Extended Abstract). Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Subhroshekhar Ghosh, Thomas M. Liggett, Robin Pemantle Multivariate CLT follows from strong Rayleigh property. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amanda Pascoe Streib, Noah Streib Cycle Basis Markov Chains for the Ising Model. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Wenlong Mou, Liwei Wang 0001 A Refined Analysis of LSH for Well-dispersed Data Points. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Conrado Martínez, Mark Daniel Ward (eds.) Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski The Ordered and Colored Products in Analytic Combinatorics: Application to the Quantitative Study of Synchronizations in Concurrent Processes. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Benjamin Hackl, Sara Kropf, Helmut Prodinger Iterative Cutting and Pruning of Planar Trees. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marc Noy, Vonjy Rasendrahasina, Vlady Ravelomanana, Juanjo Rué Isolated cycles of critical random graphs. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Amalia Duch, Gustavo Lau Partial Match Queries in Relaxed K-dt trees. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Jacek Cichon, Abram Magner, Wojciech Szpankowski, Krzysztof Turowski On Symmetries of Non-Plane Trees in a Non-Uniform Model. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Joubert Oosthuizen, Stephan Wagner 0003 On the distribution of random walk hitting times in random trees. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Thibault Godin An analogue to Dixon's theorem for automaton groups. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Cédric Chauve, Éric Fusy, Jérémie O. Lumbroso An Exact Enumeration of Distance-Hereditary Graphs. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pablo Rotondo, Brigitte Vallée The recurrence function of a random Sturmian word. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Krenn An Extended Note on the Comparison-optimal Dual-Pivot Quickselect. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Miklós Bóna, Boris G. Pittel On the cycle structure of the product of random maximal cycles. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Andrea Kuntschik, Ralph Neininger Rates of convergence for balanced irreducible two-color Pólya urns. Search on Bibsonomy ANALCO The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Matús Mihalák, Przemyslaw Uznanski, Pencho Yordanov Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita Total Variation Discrepancy of Deterministic Random Walks for Ergodic Markov Chains. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Mitzenmacher A New Approach to Analyzing Robin Hood Hashing. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Jun Zhao, Panpan Zhang On Connectivity in a General Random Intersection Graph. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Emma Yu Jin Scaling limit of random k-trees. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Noela S. Müller, Ralph Neininger The CLT Analogue for Cyclic Urns. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Chris Whidden, Frederick A. Matsen IV Ricci-Ollivier Curvature of the Rooted Phylogenetic Subtree-Prune-Regraft Graph. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Prateek Bhakta, Dana Randall Sampling Weighted Perfect Matchings on the Square-Octagon Lattice. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Panpan Zhang On Terminal Nodes and the Degree Profile of Preferential Dynamic Attachment Circuits. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Michael Mitzenmacher More Analysis of Double Hashing for Balanced Allocations. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Kevin Durant, Stephan Wagner 0003 Betweenness Centrality in Random Trees. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Elie de Panafieu, Lander Ramos Graphs with degree constraints. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1James Allen Fill, Mark Daniel Ward (eds.) Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016 Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Yusuke Kobayashi 0001, Kenjiro Takazawa Randomized Strategies for Cardinality Robustness in the Knapsack Problem. Search on Bibsonomy ANALCO The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Philippe Jacquet, Abram Magner Variance of Size in Regular Graph Tries. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marcin Kardas, Miroslaw Kutylowski, Jakub Lemiesz On Distributed Cardinality Estimation: Random Arcs Recycled. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Frédérique Bassino, Andrea Sportiello Linear-time generation of inhomogeneous random directed walks. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Marcos A. Kiwi, Dieter Mitsche A Bound for the Diameter of Random Hyperbolic Graphs. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Ioannis Giotis 0001, Lefteris M. Kirousis, Kostas I. Psaromiligkos, Dimitrios M. Thilikos On the Algorithmic Lovász Local Lemma and Acyclic Edge Coloring. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Cyril Banderier, Michael Wallner 0001 Lattice paths of slope 2/5. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Jun Zhao 0007, Osman Yagan, Virgil D. Gligor On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Conrado Martínez, Markus E. Nebel, Sebastian Wild Analysis of Branch Misses in Quicksort. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Robert Sedgewick, Mark Daniel Ward (eds.) Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015 Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Milan Bradonjic, Iraj Saniee Bootstrap Percolation on Periodic Trees. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Dimbinaina Ralaivaosaona, Stephan G. Wagner Repeated fringe subtrees in random rooted trees. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Jérémie O. Lumbroso, Nicolas Rolin Analytic Samplers and the Combinatorial Rejection Method. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Antoine Genitrini Cuts in Increasing Trees. Search on Bibsonomy ANALCO The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Pat Morin, Sander Verdonschot On the Average Number of Edges in Theta Graphs. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Shirshendu Ganguly, Yuval Peres Permuted Random Walk Exits Typically in Linear Time. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Kanal Hun, Brigitte Vallée Typical Depth of a Digital Search Tree built on a general source. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Mireille Régnier, Billy Fang, Daria Iakovishina Clump Combinatorics, Automata, and Word Asymptotics. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael J. Bannister, William E. Devanny, David Eppstein Small Superpatterns for Dominance Drawing. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Ravi Kalpathy, Hosam M. Mahmoud, Walter Rosenkrantz Survivors in Leader Election Algorithms. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Olivier Bodini, Bernhard Gittenberger On the asymptotic number of BCK(2)-terms. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benjamin Dadoun, Ralph Neininger A statistical view on exchanges in Quickselect. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Mark Daniel Ward (eds.) 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2014, Portland, Oregon, USA, January 6, 2014 Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Benjamin Doerr, Marvin Künnemann Tight Analysis of Randomized Rumor Spreading in Complete Graphs. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Olivier Bernardi, Gwendal Collet, Éric Fusy A bijection for plane graphs and its applications. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Noam Solomon, Shay Solomon On The Average-Case Complexity of the Bottleneck Tower of Hanoi Problem. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Abram Magner, Charles Knessl, Wojciech Szpankowski Expected External Profile of PATRICIA Tries. Search on Bibsonomy ANALCO The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Jeffrey Gaither, Mark Daniel Ward The Variance of the Number of 2-Protected Nodes in a Trie. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jacek Cichon, Zbigniew Golebiewski, Marcin Kardas, Marek Klonowski On Delta-Method of Moments and Probabilistic Sums. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Miklós Bóna, Andrew Vince The number of ways to assemble a graph. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Axel Bacher, Olivier Bodini, Alice Jacquot Exact-size Sampling for Motzkin Trees in Linear Time via Boltzmann Samplers and Holonomic Specification. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Jérémie Du Boisberranger, Danièle Gardy, Xavier Lorca, Charlotte Truchet When is it worthwhile to propagate a constraint? A probabilistic analysis of AllDifferent. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Markus E. Nebel, Wojciech Szpankowski (eds.) Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013 Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Milan Bradonjic, Iraj Saniee Bootstrap Percolation on Random Geometric Graphs. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Hosam M. Mahmoud Perpetuities in fair leader election algorithms. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Sandra R. Kingan Unlabeled equivalence for matroids representable over finite fields. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Michael Drmota, Marc Noy Extremal Parameters in Sub-Critical Graph Classes. Search on Bibsonomy ANALCO The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 196 (100 per page; Change: )
Pages: [1][2][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license