Back to Results
First PageMeta Content
Algorithm / Mathematical logic / Shortest path problem / Matching / Tree decomposition / Matroid / Combinatorics / Randomized algorithm / Mathematics / Theoretical computer science / Graph theory


24 IP1 ”If You Can Specify It, You Can Analyze It” —The Lasting Legacy of Philippe Flajolet The ”Flajolet School” of the analysis of algorithms and
Add to Reading List

Document Date: 2012-12-18 10:42:32

Open Document

File Size: 426,02 KB

Share Result on Facebook

City

Rio de Janeiro / CP0 Robust Gossip / Paris / Informatics Saarbruecken / Poznan / /

Company

Sun / Alcatel-Lucent / Mihai Patrascu AT&T Labs / BP / Iraj Saniee Bell Labs / Mikkel Thorup AT&T Labs / Oracle / Communications Bell Labs / Microsoft / Michael Kaminsky Intel Labs / Intel / Distributed Computing Group / Graham Cormode AT&T Labs / Google / /

Country

Germany / Poland / /

/

Event

Product Issues / /

Facility

Marek Klonowski Wroclaw University / Mathematics University of Florida avince@u / Dana Randall Georgia Institute / Stellenbosch University / Yusu Wang The Ohio State University / Miklos Bona University of Florida bona@u / Ke Yi The Hong Kong University of Science / Siavosh Benabbas University / Wilfried N. Gansterer University of Vienna Department / Poland Emory University / Edyta Szymanska Adam Mickiewicz University / Daniele Gardy University of Versailles Saint-Quentin / Herbert Edelsbrunner Institute of Science / Madhukar Korupolu Google Research Micha Sharir Tel Aviv University / Samir Khuller University of Maryland / Ulrich Laube Computer Science Department University of Kaiserslautern / Donatella Firmani Sapienza University of Rome / Jiongxin Jin The Hong Kong University of Science / Thomas Sauerwald Max Planck Institute / Konstantinos Georgiou University / Per Austrin KTH Royal Institute / IT University / Takeaki Uno National Institute / Andrzej Rucinski Adam Mickiewicz University / Siu-Wing Cheng The Hong Kong University of Science / He Sun Max Planck Institute / Jonathan Spreer The University / Sabine Storandt University / Umang Bhaskar California Institute / Rossano Venturini University / Gerhard Niederbrucker University / Kyle Fox University of Illinois / University of Stuttgart / Computer Science University / Institute of Electronics / Tomasz Jurkiewicz Max Planck Institute / /

IndustryTerm

give solutions / factorization algorithms / online budgeted allocation problem / scientific applications / near-optimal solutions / local search / online system / outer product / xed-parameter tractable algorithm / content distribution networks / planar separator algorithms / string matching algorithms / sparse outer products / subquadratic algorithm / non-trivial randomized primal-dual algorithm / antiferromagnetic spin systems / power law / fractional solution / xed-point solution / online algorithm problems / ponential time algorithms / fair leader election algorithms / deterministic approximation algorithms / approximation algorithm / classical greedy algorithm / Internet routers / belief propagation algorithms / space optimal solutions / construction algorithm / parallel processing / presented algorithms / online bipartite matching problem / near-optimal algorithms / binary search / multi-state spin systems / planar graph algorithms / online optimization / online algorithm / natural language processing / cache-oblivious algorithms / online algorithms / antiferromagnetic systems / Online Mixed Packing / ferromagnetic spin systems / spin systems / graph algorithms / higher quality solutions / sensor networks / Online Scheduling / software viruses / effective algorithms / classical string matching algorithms / pair mining / social networks / computing / Online Bipartite Matching We / deterministic and randomized algorithms / rst algorithm / propagation algorithm / parameterized exact algorithm / matrix product / gossip-based aggregation algorithms / column-row vector products / greedy algorithm / efficient dualization algorithms / frequent items mining algo / approximate algorithm / rst polylogarithmic-competitive algorithm / /

OperatingSystem

VMs / /

Organization

University of Washington / New York University / University of Illinois / Urbana-Champaign / Inria Joint Center / Computer Science University / Jeffrey B. Gaither Purdue University Department / Massachusetts Institute of Technology / Vondrak IBM Almaden Research Center / Cornell University / National Institute of Standards and Technology / Peking University / University of Queensland / Institute of Electronics / Tomasz Jurkiewicz Max Planck Institute / Villanova University / The Ohio State University / University of Vienna Department of Computer Science / Capacitated Machines Haim Kaplan Tel-Aviv University / Hong Kong University of Science and Technology / Noga Alon Tel-Aviv University / Purdue University / Nanjing University / United Nations / University of Pisa / Marek Klonowski Wroclaw University of Technology / University of Toronto / IT University of Copenhagen / University of Rome / Aarhus University / Brooklyn College / Princeton University / .edu Andrew Vince Department / Dartmouth College / Flajolet School / Duke University / Xavier Lorca Ecole / Tel Aviv University / Carnegie Mellon University / University of Helsinki / Dominik Kempa Department / California Institute of Technology / Shanghai Jiaotong University / Ulrich Laube Computer Science Department University of Kaiserslautern / Aoyama Gakuin University / Takeaki Uno National Institute / University of Versailles Saint-Quentin / The Ohio State University / Columbus / The George Washington University / University of Waterloo / Herbert Edelsbrunner Institute of Science and Technology / Tufts University / University of Maryland / College Park / Zhewei Wei Center for Massive Data Algorithmics / Graduate School / University of Stuttgart / Yossi Azar Tel-Aviv University / Georgia Institute of Technology / University of Vienna / Emory University / Atlanta / Adam Mickiewicz University / University of Florida / Stellenbosch University / /

Person

Olaf Maurer / Vitaly Osipov / Tomasz Jurkiewicz Max / Amanda Streib / Pankaj Agarwal / Kurt Mehlhorn / Nicole Megow / Zbigniew Golebiewski / Xavier Lorca / Timo Bingmann / Andrew Vince / Joo Paixo Pontifcia Universidade Cat / Laurent Massouli´e Inria / Robert Kleinberg / Ben Avraham / Philippe Flajolet / Dana Randall / Siu-Wing Cheng / Raphael Reitzig / Guy Kortsarz / Michael Kerber / Kamal Jain / Jonathan Spreer / Sebastian Wild / Liang Li / Yossi Azar / Stefan Funke / Marek Klonowski / Konstantin Kutzkov / David Andersen Carnegie / Alexandre Stauffer / Olivier Bodini / Sarah Miracle / Mark Daniel Ward / Shay Mozes / Matthew Bauer / Eli Fox-Epstein / Timothy Chan David / Michael Drmota / Simon J. Puglisi / Benjamin A. Burton / Robert Sedgewick / Markus Nebel / Mathieu Leconte Technicolor / Andreas Wiese / Alice Jacquot / Lisa Fleischer / Simone Faro Dipartimento di Matematica / Andrea Campagna / Van Walderveen / Sandra R. Kingan / Marek Karpinski / Dominik Kempa / Keisuke Murakami Aoyama / Charlotte Truchet / Ravi Kalpathy / Clemens Heuberger / Johannes Fischer / Marc Lelarge / Thomas Sauerwald Max / Paul Bogdan Carnegie / Nikhil R. Devanur / Bryan T. Wilkinson / Jan Vondrak / Axel Bacher / /

Position

secretary / probabilistic model for the constraint and its variables / Fair Leader / rdk@cs.cornell.edu CP2 Matroid Secretary / Governor / /

Product

SDI iP1 Speakers / Cgal / MaLiJAn / environments / implemented using Cgal / /

ProgrammingLanguage

Java / R / /

ProvinceOrState

Ohio / Illinois / Maryland / /

PublishedMedium

Theoretical Computer Science / /

TVStation

Kyle / /

Technology

RAM / ponential time algorithms / random access / string matching algorithms / above / cache-oblivious algorithms / rst algorithm / propagation algorithm / deterministic and randomized algorithms / Java / planar separator algorithms / non-trivial randomized primal-dual algorithm / effective algorithms / Alpha / xed-parameter tractable algorithm / deterministic approximation algorithms / existing gossip-based aggregation algorithms / same processor / machine learning / natural language processing / Load Balancing / online algorithms / parallel processing / belief propagation algorithms / classical string matching algorithms / Internet routers / approximate algorithm / planar graph algorithms / fair leader election algorithms / scheduling algorithms / Primal-dual algorithms / DA13 Abstracts Our algorithm / extended algorithm / virtual memory / inducing algorithm / just-in-time compiler / online algorithm / rst EM construction algorithm / graph algorithms / approximation algorithm / factorization algorithms / subquadratic algorithm / classical greedy algorithm / mstc@itu.dk CP0 Efficient Algorithms / greedy algorithm / efficient dualization algorithms / /

SocialTag