Moscow / Montreal / Houtalen / Paris / Tokyo / Bratislava / Philadelphia / Rennes / Vienna / Wadern / Marseille / Geneva / Tempere / Rocquencourt / Barcelona / Nafplion / Borgholm / Noordwijkerhout / New Orleans / Rome / Aarhus / Beijing / Sendai / Lille / /
Company
Theoretical Computer Science (Proceedings) AG / Cambridge University Press / World Scientific / AddisonWesley Publishing Company / IEEE Computer Society Press / IBFI GmbH / SIAM Press / Computer Science Press / Aquila / North Holland Publishing Company / Congested Networks / SIAM Journal / International Thomson Publishing / Formal Power Series / AofA / /
Country
Netherlands / France / China / Finland / Denmark / Germany / Sweden / Belgium / Spain / Greece / /
Facility
University of Illinois / Liguori Pub / /
IndustryTerm
random binary search trees / tree communication protocols / reduction algorithm / recursive tree algorithms / Search costs / Search trees / non recursive sorting algorithms / data base applications / polynomial factorization algorithm / recursive search programs / Mathematical tools / random access systems / ary collision resolution algorithms / comparison algorithms / stack algorithm / Digital search trees / tree matching algorithms / fraction algorithms / near-optimal cardinality estimation algorithm / /
Organization
Cambridge University / Institut National de Recherche / North Atlantic Treaty Organization / International Congress / American Mathematical Society / Centre de Recerca Matem` / Universidad Politecnica de Las Palmas / Institut de Recherche / Service of Man / Cambridge Philosophical Society / IEEE Information Theory Society / Association for Computing Machinery / University of Illinois / Universitat Polit`ecnica de Catalunya / /
Person
Dominique Sotteau / Yves Guivarc / G. Nigel Martin / Pierre Nicod`eme / P. Flajolet / A. Odlyzko / Heide Monien / Paul Spirakis / Philippe Dumas / Wojtek Szpankowski / Thomas Lafforgue / Bernhard Gittenberger / A. G. Greenberg / B. Monien / Henry W. Gould / L. Thimonier / Bruce Richmond / Constructive / Nevin Kapur / Boris Pittel / Peter Mathys / Robert Sedgewick / P. Allouche / B. Salvy / W. Cunto / Zhicheng Gao / Helmut Pekari / Paul Zimmermann / A. Mokkadem / Alfredo Viola / Bernard Van Cutsem / Rainer Kemp / J. Gabarro / O. Watanabe / Ferran Hurtado / Formal Power / J. van Leeuwen / P. Jacquet / Bruno Salvy / Helmut Prodinger / P. Zimmermann / Combinatorial Algorithms / M. Drmota / William Steiger / T. Ottmann / Anthony J. Guttmann / Micha Hofri / Ed Coffman / Marc Noy / Omega / Peter Grabner / Jean Vuillemin / M. Hagiya / Donald E. Knuth / Conrado Mart´ınez / C. Puech / Mamoru Hoshi / Xavier Gourdon / John Wiley / Nasser Saheb / Wolfgang Thomas / Paul Zimmerman / Brigitte Vall´ee / Gaston Gonnet / Wojciech Szpankowski / D. Wood / Fabrice Guillemin / C. Y. James Lee / Jean Fran / T. Ito / Leopold Flatto / Pawel Blasiak / G. Lau / Stefan Gerhold / Eric van Fossen Conrad / Brigitte Chauvin / Eric Fusy / L. Ramshaw / Andrew M. Odlyzko / Olivier Gandouet / Louise Laforest / Guy Fayolle / N. Saheb / Roland Bacher / D. Gardy / Applied Algebra / Philippe Chassaing / Robert F. Tichy / Cyril Banderier / Jean-Marc Steyaert / Philippe Duchon / Guy Louchard / Nicolas Pouyanne / James A. Fill / En-Hui Yang / D. Sotteau / Mordecai Golin / Jeffrey Scott Vitter / Daniel Panario / Thierry Huillet / J. Fran / Journ / P. Spirakis / Gilbert Labelle / P. D. Moses / Patricio Poblete / Nicholas R. Beaton / Encyclopaedia / Vincent Puyhaubert / Luc Devroye / Nicola Galesi / Claude Puech / Informatique / Mathieu Roux / Philippe Flajolet / R. Karlsson / Dominique Gouyou-Beauchamps / Markus Nebel / R. E. Ladner / Alain Denise / Linas Vepstas / Albin Michel / Marie Curie / Maryse Pelletier / A. A. Mikhalev / Philippe Jacquet / Carine Pivoteau / Laurent Cheno / Automata / Gilles Schaeffer / John Kieffer / M. Autebert / Peter Kirschenhofer / Julien Cl / Paolo Sipala / B. Gittenberger / Nicolas Broutin / Y. K. Cheung / J. M. Robson / Marianne Durand / M. Mend / /
Journal of the ACM / Aquila / SIAM Journal on Computing / IEEE Transactions on Information Theory / Journal of Symbolic Computation / European Journal of Combinatorics / Journal of Physics A / Theoretical Computer Science / Theory of Computing / Lecture Notes in Computer Science / /
Region
North Holland / /
Technology
Probabilistic counting algorithms / non recursive sorting algorithms / tree communication protocols / Random Access / comparison algorithms / cardinality estimation algorithm / Gaussian algorithm / polynomial factorization algorithm / Flow Control / ary collision resolution algorithms / tree matching algorithms / ESA / reduction algorithm / artificial intelligence / stack algorithm / Continued fraction algorithms / caching / recursive tree algorithms / /
Publication List Philippe Flajolet Updated October 6, 2010 References [1] Philippe Flajolet and Jean-Marc Steyaert. Complexit´e des probl`emes de decision relatifs aux algorithmes de tri. In Automata, Languages and Prog