ACM DL

ACM Transactions on

Algorithms (TALG)

Menu
Latest Articles

On Uniform Capacitated k-Median Beyond the Natural LP Relaxation

In this article, we study the uniform capacitated k-median (CKM) problem. In the problem, we are given a set F of potential facility locations, a set... (more)

NEWS

In Memoriam: David S. Johnson

http://dl.acm.org/citation.cfm?id=2907073

About TALG

The ACM Transactions on Algorithms (TALG) publishes original research of the highest quality dealing with algorithms that are inherently discrete and finite, and having mathematical content in a natural way, either in the objective or in the analysis.

read more
An Improved Approximation for k-median, and Positive Correlation in Budgeted Optimization

Dependent rounding is a useful technique for optimization problems with hard budget constraints. This framework naturally leads to \emph{negative correlation} properties. However, what if an application naturally calls for dependent rounding on the one hand, and desires \emph{positive} correlation on the other? More generally, we develop algorithms that guarantee the known properties of dependent rounding, but also have nearly best-possible behavior -- near-independence, which generalizes positive correlation -- on ``small" subsets of the variables. The recent breakthrough of Li \& Svensson for the classical $k$-median problem has to handle positive correlation in certain dependent-rounding settings, and does so implicitly. We improve upon Li-Svensson's approximation ratio for $k$-median from $2.732 + \epsilon$ to $2.611 + \epsilon$ by developing an algorithm that improves upon various aspects of their work. Our dependent-rounding approach helps us improve the dependence of the runtime on the parameter $\epsilon$ from Li-Svensson's $N^{O(1/\epsilon^2)}$ to $N^{O((1/\epsilon) \log(1/\epsilon))}$.

A Fast and Simple Surface Reconstruction Algorithm

We present an algorithm for surface reconstruction from a point cloud. It runs in O(n log n) time, where n is the number of sample points, and this is optimal in the pointer machine model. The only existing O(n log n)-time algorithm is due to Funke and Ramos, and it uses some sophisticated data structures. The key task in their algorithm is to ex- tract a locally uniform subsample from the input points. Our extraction of locally uniform subsample is based on a variant of the standard octree and it is much simpler. We built a prototype that runs an implementation of our algorithm to extract a locally uniform sub- sample, invokes Cocone to reconstruct a surface from the subsample, and adds back the samples points absent from the subsample via edge flips. In our experiments with some non-uniform samples, the subsample extraction step is fast and effective, and the prototype gives a 51% to 68% speedup from using Cocone alone. The prototype also runs faster on locally uniform samples.

Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries

We consider the problem of, given an array $A[1,n]$ of elements with a total order, building a data structure that solves two queries: $(a)$ selection queries receive a range $[i,j]$ and an integer $k$ and return the position of the $k$th largest element in $A[i,j]$; $(b)$ top-$k$ queries receive $[i,j]$ and $k$ and return the positions of the $k$ largest elements in $A[i,j]$. These problems can be solved in optimal time, $O(1+\log k/\log\log n)$ and $O(k)$ respectively, using linear-space data structures. We present the first study of {\em encoding} data structures for this problem, which do not access $A$ at query time. These save storage space in applications where the values of $A$ themselves are not of interest. We first show that any encoding answering such queries requires $n\lg k - O(n+k \lg k)$ bits of space. Then we design encodings using $O(n\log k)$ bits, that is, asymptotically optimal up to constant factors, that answer selection and top-$k$ queries in optimal time.

Smoothed Analysis of Local Search for the Maximum-Cut Problem

Even though local search heuristics are the method of choice in practice for many well-studied optimization problems, most of them behave poorly in the worst case. This is in particular the case for the Maximum-Cut Problem, for which local search can take an exponential number of steps to terminate and the problem of computing a local optimum is PLS-complete. To narrow the gap between theory and practice, we study local search for the Maximum-Cut Problem in the framework of smoothed analysis in which inputs are subject to a small amount of random noise. We show that the smoothed number of iterations is quasi-polynomial, i.e., it is bounded from above by a polynomial in n^log(n) and ¦ where n denotes the number of nodes and ¦ denotes the perturbation parameter. This shows that worst-case instances are fragile and it is a first step in explaining why they are rarely observed in practice.

Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution

Moser & Tardos have developed a powerful algorithmic approach (henceforth ``MT") to the Lovasz Local Lemma (LLL); the basic operation in that algorithm is a search for ``bad" events in a current configuration. We examine the variable distribution during intermediate stages of MT. We show that these configurations have a more or less ``random'' form, building further on the ``MT-distribution" concept of Haeupler et al. One important consequence of this that bad events can be found relatively quickly, improving upon MT across the complexity spectrum: it makes some polynomial-time algorithms sub-linear (e.g., for Latin transversals, which are of basic combinatorial interest), gives lower-degree polynomial run-times in some settings, transforms certain super-polynomial-time algorithms into polynomial-time ones, and leads to Las Vegas algorithms for some coloring problems for which only Monte Carlo algorithms were known. We show that in certain conditions when the LLL condition is violated, a variant of the MT algorithm can still produce a distribution which avoids most of the bad events. We show that this MT variant can run faster than the original MT algorithm, and develop the first-known criterion for the case of the asymmetric LLL. This can be used to find partial Latin transversals -- improving upon earlier bounds of Stein (1975) -- among other applications. We furthermore give enumerative applications, showing that many problems have many more solutions than known before by proving that the MT-distribution has ``large" Renyi entropy and hence that its support-size is large.

Time vs. Information Tradeoffs for Leader Election in Anonymous Trees

Leader election is a fundamental problem in distributed computing. It calls for all nodes of a network to agree on a single node, called the leader. When the nodes are anonymous, leader election is formulated as follows: every node must output a simple path, which is coded as a sequence of port numbers, such that all these paths end at a common node, the leader. In this paper, we study deterministic leader election in n-node anonymous trees of diameter diam d D. We establish tradeoffs between the allocated time Ä and the amount of information that must be given a priori to the nodes to enable leader election in time Ä in all trees for which leader election in this time is at all possible. While leader election in time diam can be performed without any information, for time diam-1 we give a tight bound of ¸(log D). For time diam-2 we give a tight bound of ¸(log D) for even values of diam, and a tight bound of ¸(log n) for odd values of diam. Moving to shorter time, in the interval [²·diam, diam-3] for constant ² >1/2, we prove an upper bound of O((nlog n)/D) and a lower bound of &(n/D), the latter being valid whenever diam is odd or when the time is at most diam-4. Finally, for time ±·diam for any constant ± < 1/2 (except for the case of very small diameters), we again give a tight bound, this time ¸(n).

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

This paper addresses the general limit of the standard tractability results for Constraint Satisfaction Problems (CSP) and counting-CSP, that they only apply to instances where all constraints belong to a single tractable language. We show that we can overcome this limitation as long as we keep some control of how constraints over the various considered tractable languages interact with each other. For this purpose we utilize the notion of a strong backdoor of a CSP instance, as introduced by Williams et al. (IJCAI 2003), which is a set of variables that when instantiated moves the instance to an island of tractability, i.e., to a tractable class of instances. Our main result is an algorithm that, given a CSP instance with n variables, finds in time f(k)nO(1) a strong backdoor into a scattered class (associated with a list of finite conservative constraint languages) of size k or correctly decides that there is no such backdoor. This also gives the running time for solving #CSP, provided that #CSP is polynomial-time tractable for the considered constraint languages. Our result makes significant progress towards the main goal of the backdoor-based approach to CSPs -- the identification of maximal base classes for which small backdoors can be detected efficiently.

Generating Random Permutations by Coin-Tossing

Several simple, classical, little-known algorithms in the statistical literature for generating random permutations by coin-tossing are examined, analyzed and implemented. These algorithms are either asymptotically optimal or close to being so in terms of the expected number of times the random bits are generated. In addition to asymptotic approximations to the expected complexity, we also clarify the corresponding variances, as well as the asymptotic distributions. A brief comparative discussion with numerical computations in a multicore system is also given.

Faster and Simpler Sketches of Valuation Functions

We present fast algorithms for sketching valuation functions. Let $N$ ($|N|=n$) be some ground set and $v:2^N\rightarrow \mathbb R$ be a function. We say that $\tilde v:2^N\rightarrow \mathbb R$ is an \emph{$\alpha$-sketch} of $v$ if for every set $S$ we have that $\frac {v(S)} {\alpha} \leq \tilde v(S) \leq v(S)$ and $\tilde v$ can be described in $poly(n)$ bits. If $v$ is submodular then a $\tilde O(\sqrt n)$-sketch can be constructed using polynomially many value queries [Goemans et al., SODA'09] (this is essentially the best possible, as Balcan and Harvey [STOC'11] show that no submodular function admit an $n^{\frac 1 3 - \epsilon}$-sketch). Based on their work, Balcan et al. [COLT'12] and Badanidiyuru et al [SODA'12] construct a $\tilde O(\sqrt n)$-sketch for subadditive functions with polynomially many demand queries. All previous sketches use complicated geometric arguments: the first step proves the existence of a good sketch by finding an ellipsoid that ``approximates'' $v$ well (by applying John's theorem to ensure the existence of an ellipsoid that is ``close'' to $v$). The second step shows how to efficiently find this ellipsoid, by repeatedly solving a certain convex program to obtain better approximations of John's ellipsoid. This paper gives a significantly simpler, non-geometric proof for the existence of good sketches, and obtains much faster algorithms that match the previous bounds. Specifically, we construct a $\tilde O(\sqrt n)$-sketch of a submodular function with $\tilde O(n^\frac{3}{2})$ value queries, and an $\tilde O(\sqrt n)$-sketch of a subadditive function with $O(n)$ demand and value queries.

Property Testing on Product Distributions:Optimal Testers for Bounded Derivative Properties

We study algorithms that, given query-access to an input function, approximately determine whether the function satisfies a desired property. More specifically, our algorithms accept if the function has the property and reject with high probability if the function is far from having the property. The distance to having the property is measured with respect to a known or an unknown distribution over the domain of function. In this work, we focus on functions over domains of the form {1,2,..,n}^d (that is, d-dimensional hypergrids). We look at a general class of properties of such functions, called bounded derivative properties (BDP), which includes monotonicity and the Lipschitz property. We give an optimal tester for BDPs for the case when the distance to the property is measured with respect to a product distribution, that is, a distribution where each coordinate is chosen independently. Our main tool here is a novel dimension reduction which reduces testing properties of functions over {1,2,..,n}^d to testing functions over {1,2,..,n}. This dimension reduction is optimal up to a constant factor. For BDPs of functions over {1,2,...,n}, we design an optimal tester for the case when the distribution is known. Our tester is based on Knuth's construction of binary search trees over {1,2,..,n} with minimum expected depth. As a special case, we obtain an optimal monotonicity tester for {1,2,..,n}, thus improving the tester given by Ailon and Chazelle (Information and Computation, 2006). Our work resolves two open problems given in their work.

Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform

For every fixed constant $\alpha > 0$, we design an algorithm for computing the $k$-sparse Walsh-Hadamard transform of an $N$-dimensional vector $x \in \R^N$ in time $k^{1+\alpha} (\log N)^{O(1)}$. Specifically, the algorithm is given query access to $x$ and computes a $k$-sparse $\tx \in \R^N$ satisfying $\|\tx - \hat{x}\|_1 = O( \|\hat{x} - H_k(\hat{x})\|_1$ ), where $\hat{x}$ is the transform of $x$ and $H_k(\hat{x})$ is its best $k$-sparse approximation. Our algorithm is fully deterministic and only uses non-adaptive queries to $x$. An important technical tool that we use is a construction of nearly optimal and linear lossless condensers which is a careful instantiation of the GUV condenser (Guruswami et al, JACM 2009). Moreover, we design a deterministic and non-adaptive $\ell_1/\ell_1$ compressed sensing scheme based on general lossless condensers that is equipped with a fast reconstruction algorithm running in time $k^{1+\alpha} (\log N)^{O(1)}$ (for the GUV-based condenser) and is of independent interest. Our scheme significantly simplifies and improves an earlier expander-based construction due to Berinde et al (Allerton 2008). Our methods use linear lossless condensers in a black box fashion; therefore, any future improvement on explicit constructions of such condensers would immediately translate to improved parameters in our framework (potentially leading to $k (\log N)^{O(1)}$ reconstruction time with a reduced exponent in the poly-logarithmic factor, and eliminating the extra parameter $\alpha$). By allowing the algorithm to use randomness, while still using non-adaptive queries, the running time of the algorithm can be improved to $\tilde{O}(k \log^3 N)$.

Uniform Kernelization Complexity of Hitting Forbidden Minors

The F-Minor-Free Deletion problem asks, for a fixed set F and an input consisting of a graph G and integer k, whether k vertices can be removed from G such that the resulting graph does not contain any member of F as a minor. Fomin et al. (FOCS 2012) showed that the special case when F contains at least one planar graph has a kernel of size f(F)·kg(F) for some functions f and g. They left open whether this Planar F-Minor-Free Deletion problem has kernels whose size is uniformly polynomial, of the form f(F)·kc for some universal constant c. We prove that some Planar F-Minor-Free Deletion problems do not have uniformly polynomial kernels (unless NP † coNP/poly), not even when parameterized by the vertex cover number. On the positive side, we consider the problem of determining whether k vertices can be removed to obtain a graph of treedepth at most ·. We prove that this problem admits uniformly polynomial kernels with O(k6) vertices for every fixed ·.

Editorial: 13:2

Bibliometrics

Publication Years 2005-2017
Publication Count 546
Citation Count 3227
Available for Download 546
Downloads (6 weeks) 1977
Downloads (12 Months) 18314
Downloads (cumulative) 211279
Average downloads per article 387
Average citations per article 6
First Name Last Name Award
Lars Arge ACM Distinguished Member (2009)
Moses S Charikar ACM Paris Kanellakis Theory and Practice Award (2012)
Danny Z Chen ACM Distinguished Member (2014)
ACM Senior Member (2011)
Anne Condon ACM Doctoral Dissertation Award
Series Winner (1988) ACM Doctoral Dissertation Award
Series Winner (1988)
Graham R. Cormode ACM Distinguished Member (2013)
Constantinos Daskalakis ACM Doctoral Dissertation Award (2008)
Xiaotie Deng ACM Senior Member (2006)
Martin Dietzfelbinger ACM Distinguished Member (2011)
Pedro F Felzenszwalb ACM Grace Murray Hopper Award (2013)
Emden R Gansner ACM Distinguished Member (2016)
Michael T Goodrich ACM Distinguished Member (2006)
Leonidas J Guibas ACM AAAI Allen Newell Award (2007)
Venkatesan Guruswami ACM Doctoral Dissertation Award (2002)
Piotr Indyk ACM Paris Kanellakis Theory and Practice Award (2012)
Charles E Leiserson ACM-IEEE CS Ken Kennedy Award (2014)
ACM Paris Kanellakis Theory and Practice Award (2013)
ACM Doctoral Dissertation Award (1982)
Carsten Lund ACM Doctoral Dissertation Award
Series Winner (1991) ACM Doctoral Dissertation Award
Series Winner (1991)
Kurt Mehlhorn ACM Paris Kanellakis Theory and Practice Award (2010)
Mukesh Mohania ACM Distinguished Member (2011)
Noam Nissan ACM Doctoral Dissertation Award
Series Winner (1990) ACM Doctoral Dissertation Award
Series Winner (1990)
Omer Reingold ACM Grace Murray Hopper Award (2005)
Sandeep K Shukla ACM Distinguished Member (2012)
ACM Senior Member (2007)
David Steurer ACM Doctoral Dissertation Award
Honorable Mention (2011) ACM Doctoral Dissertation Award
Honorable Mention (2011)
Madhu Sudan ACM Doctoral Dissertation Award (1993)
Subhash Suri ACM Distinguished Member (2007)
Robert E Tarjan ACM Paris Kanellakis Theory and Practice Award (1999)
ACM A. M. Turing Award (1986)
Salil P Vadhan ACM Doctoral Dissertation Award (2000)
Jeffrey S Vetter ACM Distinguished Member (2012)
ACM Gordon Bell Prize
Performance (2010)
Jennifer L Welch ACM Distinguished Member (2012)

First Name Last Name Paper Counts
Mohammadtaghi Hajiaghayi 12
Dániel Marx 11
Guy Kortsarz 10
Robert Tarjan 9
Erik Demaine 8
Uri Zwick 8
Magnús Halldórsson 7
Pankaj Agarwal 7
Mikkel Thorup 7
Samir Khuller 7
Anupam Gupta 7
Gonzalo Navarro 6
Ke Yi 6
David Peleg 6
Zeev Nutov 6
Haim Kaplan 6
Moshe Lewenstein 6
Viswanath Nagarajan 6
Noga Alon 6
Maxim Sviridenko 6
Adi Rosén 5
Rohit Khandekar 5
David Eppstein 5
Chandra Chekuri 5
Andrzej Pelc 5
Kirk Pruhs 5
Hadas Shachnai 5
Micha Sharir 5
Raphael Yuster 5
Joseph Naor 5
Inge Gørtz 5
Timothy Chan 5
Venkatesh Raman 5
Graham Cormode 5
Saket Saurabh 5
Shay Solomon 5
Yossi Azar 5
Philip Klein 5
S Muthukrishnan 5
Michael Elkin 5
Liam Roditty 5
Sariel Har-Peled 5
Nikhil Bansal 5
Loukas Georgiadis 4
Thore Husfeldt 4
Telikepalli Kavitha 4
Glencora Borradaile 4
Fedor Fomin 4
Dana Ron 4
Boris Aronov 4
Meng He 4
Ashish Goel 4
Daniel Lokshtanov 4
Oren Weimann 4
Baruch Schieber 4
Guy Even 4
Sudipto Guha 4
Mohammad Salavatipour 4
Susanne Albers 4
Paolo Ferragina 4
Ignaz Rutter 4
Seth Pettie 4
Asaf Levin 4
Kurt Mehlhorn 4
Andrew McGregor 3
Dror Rawitz 3
Artur Czumaj 3
Yuval Emek 3
Berthold Vöcking 3
Alberto Marchetti-Spaccamela 3
Surender Baswana 3
Daniel Berend 3
Harald Räcke 3
Stephen Alstrup 3
Edward Reingold 3
Giuseppe Italiano 3
Rob Van Stee 3
Leah Epstein 3
Amotz Bar-Noy 3
Sanjeev Khanna 3
Julia Chuzhoy 3
Dimitrios Thilikos 3
Marek Cygan 3
Harold Gabow 3
Christian Sohler 3
Pat Morin 3
Gabriel Scalosub 3
Srinivasa Satti 3
Shai Gutner 3
George Karakostas 3
Kenichi Kawarabayashi 3
Baruch Awerbuch 3
Amos Korman 3
Wojciech Szpankowski 3
Amol Deshpande 3
Jeff Edmonds 3
Fabrizio Grandoni 3
Laurent Alonso 3
Sergio Cabello 3
Kazuo Iwama 3
Marek Chrobak 3
Amit Chakrabarti 3
Rajiv Gandhi 3
Danny Segev 3
Stefan Kratsch 3
Zoya Svitkina 3
Chaitanya Swamy 3
David Johnson 3
Yonatan Aumann 3
Refael Hassin 3
Philip Bille 3
Dimitrios Michail 3
Ramamoorthi Ravi 3
Martín Farach-Colton 3
Amin Saberi 3
Yuval Rabani 3
Joseph Cheriyan 3
Morteza Zadimoghaddam 3
Lisa Hellerstein 3
Lapchi Lau 2
Pierre Fraigniaud 2
Hamid Mahini 2
Subhash Suri 2
James Aspnes 2
Éva Tardos 2
Ioannis Caragiannis 2
Ola Svensson 2
Takwah Lam 2
Tami Tamir 2
Anne Driemel 2
Djamal Belazzougui 2
László Végh 2
Adrian Vetta 2
Dilys Thomas 2
Robert Krauthgamer 2
Eduardo Laber 2
Vincenzo Bonifaci 2
Alexander Russell 2
Kenneth Clarkson 2
Ramakrishna Thurimella 2
Goran Konjevod 2
Jittat Fakcharoenphol 2
John Hershberger 2
Adam Meyerson 2
Shay Mozes 2
Yishay Mansour 2
Joan Feigenbaum 2
Shuichi Miyazaki 2
Theis Rauhe 2
Jérémy Barbay 2
Antoine Vigneron 2
Teofilo Gonzalez 2
Roy Schwartz 2
Dariusz Kowalski 2
Ravishankar Krishnaswamy 2
Sungjin Im 2
Holger Dell 2
Cristopher Moore 2
Katarzyna Paluch 2
Michael Bender 2
Svante Janson 2
Andreas Björklund 2
Jochen Könemann 2
Christoph Ambühl 2
Hiroki Yanagisawa 2
Rossano Venturini 2
James Munro 2
Tobias Jacobs 2
Siddhartha Sen 2
Alfredo Viola 2
Atri Rudra 2
Zachary Friggstad 2
Conrado Martínez 2
Don Coppersmith 2
Joseph Leung 2
Joe Sawada 2
Peter Korteweg 2
Camil Demetrescu 2
Clifford Stein 2
Joan Boyar 2
HoLeung Chan 2
Kamesh Munagala 2
Venkatesan Guruswami 2
Thomas Erlebach 2
MohammadHossein Bateni 2
Stefan Langerman 2
Irene Finocchi 2
Alex Kesselman 2
Amihood Amir 2
Hans Bodlaender 2
Vijay Kumar 2
Bernhard Haeupler 2
Carmit Hazay 2
Bundit Laekhanukit 2
Thomas Sauerwald 2
Lisa Fleischer 2
Rina Panigrahy 2
An Zhu 2
Veli Mäkinen 2
Lisa Zhang 2
Milan Ružić 2
Konstantin Makarychev 2
Andréa Richa 2
Leen Stougie 2
Magnus Wahlström 2
Rajeev Raman 2
Claire Mathieu 2
Dimitris Fotakis 2
Hamid Nazerzadeh 2
Matthew Andrews 2
Yury Makarychev 2
Michael Drmota 2
Bodo Manthey 2
Michele Flammini 2
R Sritharan 2
Helmut Prodinger 2
Alexandr Andoni 2
Konstantinos Panagiotou 2
Jie Gao 2
Ulrich Meyer 2
MohammadTaghi Hajiaghayi 2
Christophe Paul 2
John Iacono 2
Petr Kolman 2
Holeung Chan 2
Iftah Gamzu 2
Kunihiko Sadakane 2
Dina Sokol 2
Somnath Sikdar 2
Jesper Nederlof 2
Ioannis Koutis 2
Roberto Grossi 2
Benjamin Raichel 2
Nicole Megow 2
Martin Aumüller 2
Angelika Steger 2
Shanghua Teng 2
Jon Feldman 2
Anastasios Sidiropoulos 2
Mingyang Kao 2
Mikko Koivisto 2
Ignasi Sau 2
Christos Kaklamanis 2
Klaus Jansen 2
Martin Skutella 2
T Chan 2
Tomás Feder 2
Julián Mestre 2
Cyril Gavoille 2
Martin Dietzfelbinger 2
Avinatan Hassidim 2
Mohammad Mahdian 2
Jiří Sgall 2
Luca Becchetti 2
Dieter Kratsch 2
Bruce Maggs 2
Geevarghese Philip 2
Thomas Bläsius 2
Yoann Dieudonné 2
Dekel Tsur 2
Suresh Venkatasubramanian 2
Lars Arge 2
Ittai Abraham 2
Allan Borodin 2
Vijaya Ramachandran 1
ChiaChi Yeh 1
Elliot Anshelevich 1
Michiel Smid 1
Cunquan Zhang 1
Dahlia Malkhi 1
Andreas Wiese 1
Matthias Englert 1
Paul LaFollette 1
Rajneesh Hegde 1
Burkhard Monien 1
Ran Mendelson 1
Jeff Erickson 1
Virginia Williams 1
William Evans 1
Reut Levi 1
Reuven Cohen 1
David Woodruff 1
Friedrich Eisenbrand 1
Miguel Mosteiro 1
Hiro Ito 1
Mariusz Rokicki 1
Marcin Pilipczuk 1
Amin Sayedi-Roshkhar 1
Qin Zhang 1
Sylvain Guillemot 1
Panos Giannopoulos 1
Nicholas Pippenger 1
Xin Han 1
Rajeev Motwani 1
Liadan O'Callaghan 1
Randeep Bhatia 1
Amit Bhosle 1
Nitish Korula 1
Vikraman Arvind 1
Christoph Dürr 1
Mark Ward 1
Konstantin Andreev 1
Charles Garrod 1
Tao Jiang 1
Jason McCullough 1
Amr Elmasry 1
Venkatesan Chakaravarthy 1
Vinayaka Pandit 1
Pranjal Awasthi 1
Yongwook Choi 1
Shuchi Chawla 1
Amitabh Sinha 1
András Benczúr 1
Barry O'Sullivan 1
Igor Razgon 1
Clemens Heuberger 1
SiuWing Cheng 1
Jurek Czyzowicz 1
Marcel Silva 1
Rishi Saket 1
Petteri Kaski 1
Yuan Zhou 1
Lukáš Poláček 1
Claire Mathieu 1
Ning Chen 1
Funda Ergün 1
Mohammad Khani 1
Dorothea Wagner 1
Moran Feldman 1
Liam Mencel 1
Saber Fadaee 1
Fabrizio Frati 1
N Narayanaswamy 1
Benjamin Doerr 1
Arturo Gonzalez-Gutierrez 1
Shahar Fattal 1
Owen Kaser 1
Claire Kenyon 1
Emden Gansner 1
Jim Pugh 1
Hsueh Lu 1
Yusuke Kobayashi 1
Ruben Van Der Zwaan 1
Jin Zhang 1
Giuseppe Paleologo 1
Charles Tresser 1
Salil Vadhan 1
Marco Molinaro 1
Kaimin Chung 1
Luca Foschini 1
Piotr Krysta 1
Matthias Függer 1
Jennifer Welch 1
Matt DeVos 1
Yusu Wang 1
Leonidas Guibas 1
John Carlsson 1
Louis Ibarra 1
David Ilcinkas 1
Panagiotis Cheilaris 1
Jakub Łącki 1
Dömötör Pálvölgyi 1
Alex Scott 1
Phong Nguyêñ 1
Bogdan Chlebus 1
Venkatesh Natarajan 1
Moses Charikar 1
Yijie Han 1
Michael Krivelevich 1
Hiroshi Fujiwara 1
Matthew Maxel 1
Eldar Fischer 1
Ying Xu 1
Gruia Călinescu 1
Fabrizio Luccio 1
Xiaotie Deng 1
Juanjo Rué 1
Martin Pál 1
Uriel Feige 1
SéBastien Collette 1
Kristian Lichtenberg 1
David Hay 1
Kinsum Mak 1
Marcelo De Carvalho 1
Xin Chen 1
Claus Jensen 1
Steven Skiena 1
Sangil Oum 1
Leszek Gąsieniec 1
Renato Werneck 1
Manuel Kauers 1
Michael Fuchs 1
Giovanni Manzini 1
Maciej Kurowski 1
Ryan Hayward 1
Stephen Kobourov 1
Amir Sapir 1
Kobbi Nissim 1
Christina Fragouli 1
Christian Sommer 1
Atlas IV 1
Ekkehard Köhler 1
Mark Petrick 1
George Yuhasz 1
Himanshu Gupta 1
Cristiane Sato 1
Jelani Nelson 1
Vitaly Feldman 1
Poshen Loh 1
Joseph Mitchell 1
Valentin Polishchuk 1
Jukka Suomela 1
Marc Van Kreveld 1
Ran Raz 1
Alexander Langer 1
Mikkel Thorup 1
Keren Censor 1
Michael Kapralov 1
Aravind Srinivasan 1
Ivan Mihajlin 1
Alexander Kulikov 1
Shi Li 1
Hjalte VildhØj 1
Csaba Tóth 1
Siuwing Cheng 1
Donglin Xia 1
Rajesh Chitnis 1
MohammadAmin Fazli 1
Sina Sadeghabad 1
MohammadAli Safari 1
Jan Kratochvíl 1
M Ramanujan 1
Dannyziyi Chen 1
Richard Cole 1
Frank Ruskey 1
Gagan Aggarwal 1
Hisao Tamaki 1
Hung Yu 1
Shay Kutten 1
Shimon Shahar 1
Per Austrin 1
Konstantinos Georgiou 1
Edith Cohen 1
Carsten Lund 1
Heiko Röglin 1
Vladlen Koltun 1
Tomasz Nowicki 1
Avner Magen 1
Karsten Tiemann 1
Gilad Tsur 1
Sandeep Sen 1
Justus Schwartz 1
Bojan Mohar 1
Ulrich Faigle 1
Reid Andersen 1
Valerie King 1
Nishanth Chandran 1
Jens Vygen 1
Shakhar Smorodinsky 1
Mihai Bǎdoiu 1
Thomas Rothvoß 1
Mohammad Safari 1
Constantinos Daskalakis 1
Yusuke Kobayashi 1
Rohan Fernandes 1
David Fernández-Baca 1
Sebastian Böcker 1
Greg Little 1
Satish Rao 1
Chris Harrelson 1
Oded Lachish 1
Orly Yahalom 1
François Nicolas 1
Bob Sedgewick 1
Francis Chin 1
Nikos Karanikolas 1
Piyush Kurur 1
Alessandro Panconesi 1
Jaikumar Radhakrishnan 1
Julien Clément 1
Pierre Nicodème 1
Mordecai Golin 1
Guy Louchard 1
Balaji Raghavachari 1
Alexey Stepanov 1
Sivan Toledo 1
Ge Nong 1
Tomasz Radzik 1
M Paal 1
Markus Püschel 1
Lene Favrholdt 1
Irit Katriel 1
Hu Zhang 1
Erich Kaltofen 1
Piotr Indyk 1
Stefan Hougardy 1
Micah Adler 1
Prasad Raghavendra 1
Yi Wu 1
Guillaume Moroz 1
Alex Levin 1
Sándor Fekete 1
Frank Staals 1
Jeremy Fineman 1
Martin Hoefer 1
Benjamin Aminof 1
Orna Kupferman 1
Stéphan Thomassé 1
Danny Hermelin 1
Stanislav Živný 1
David Kim 1
Alexander Golovnev 1
Johannes Fischer 1
Ryan Williams 1
Jérémie Chalopin 1
Yann Disser 1
Vít Jelínek 1
Aaron Williams 1
Krishnaram Kenthapadi 1
Daniel Lemire 1
Ron Levy 1
Bastian Pochon 1
Gerhard Woeginger 1
Jeff Phillips 1
Erel Segal-Halevi 1
Shmuel Safra 1
Martin Gairing 1
Kasturi Varadarajan 1
Niv Buchbinder 1
Steve Oudot 1
Deepak Ajwani 1
Rafail Ostrovsky 1
Takeshi Tokuyama 1
Tim Nieberg 1
Nir Ailon 1
Siddhartha Sen 1
Rogers Mathew 1
Jianer Chen 1
Songjian Lu 1
Fenghui Zhang 1
Anke Truß 1
Sandy Irani 1
Roberto De Prisco 1
Wojciech Jawor 1
Tali Kaufman 1
Zohar Yakhini 1
Eric Chen 1
Reinhard Kutzelnigg 1
Yuli Ye 1
Petteri Kaski 1
Sharon Marko 1
Xiaotie Deng 1
Anne Condon 1
Christian Knauer 1
Arlindo Oliveira 1
Shlomo Moran 1
Wingkin Sung 1
Howard Karloff 1
David Pritchard 1
Guochuan Zhang 1
Eli Upfal 1
Ulrich Schwarz 1
Friedhelm Heide 1
Yan Zhang 1
Andrea Ribichini 1
Amalia Duch 1
Danny Raz 1
Lapkei Lee 1
Mathieu Liedloff 1
Ioan Todinca 1
Vanbang Le 1
Alessandro Panconesi 1
Hsienkuei Hwang 1
Gad Landau 1
Łukasz Kowalik 1
Wei Chen 1
Estrella Eisenberg 1
Peter Sanders 1
Ravi Kolluri 1
Aaron Jaggard 1
Alexander Wolff 1
Georg Baier 1
Ondřej Pangrác 1
Bernhard Von Stengel 1
Marcelo Mydlarz 1
F Shepherd 1
Assaf Naor 1
TamáS Fleiner 1
Benjamin Moseley 1
Yngve Villanger 1
Aravindan Vijayaraghavan 1
Ronald Graham 1
Seth Gilbert 1
Peter Rossmanith 1
Petra Berenbrink 1
Omid Madani 1
Srinivasan Parthasarathy 1
Saurabh Ray 1
Jian Li 1
Devorah Kletenik 1
Omrit Filtser 1
Abbas Mehrabian 1
Shayan Ehsani 1
Morteza Saghafian 1
Peter Widmayer 1
Patrizio Angelini 1
Retsef Levi 1
Patchrawat Uthaisombut 1
Matthew Drescher 1
Daniel Panario 1
Christos Levcopoulos 1
Yongbin Ou 1
Noam Nisan 1
Siavosh Benabbas 1
Nikos Parotsidis 1
Olaf Maurer 1
Daniel Rockmore 1
Robert Irving 1
Markus Nebel 1
Josef Widder 1
Stefanie Gerke 1
Christian Wulff-Nilsen 1
Britta Peis 1
Mohammad Hajiaghayi 1
Bruce Kapron 1
David Kempe 1
Jared Saia 1
Benjamin Armbruster 1
Yinyu Ye 1
Paul Medvedev 1
Omkant Pandey 1
Walter Kern 1
Paweł Gawrychowski 1
Vladimir Braverman 1
Matteo Frigo 1
Singhoi Sze 1
Kedar Dhamdhere 1
Sandeep Shukla 1
Anil Maheshwari 1
Luís Russo 1
Frederic Dorn 1
Sagi Snir 1
Jessica Chang 1
Renars Gailis 1
Ari Freund 1
Valentina Ciriani 1
Norbert Zeh 1
Valentina Damerow 1
Andrea Vitaletti 1
F Bruss 1
Raja Jothi 1
Benjamin Rossman 1
Prudence Wong 1
László Babai 1
Pedro Felzenszwalb 1
Daniel Golovin 1
Yochai Twitto 1
Sambuddha Roy 1
Lusheng Wang 1
Eric De Verdiere 1
Alexander Schrijver 1
Xiaohui Zhang 1
Amitabh Chaudhary 1
David Mount 1
Yuval Ishai 1
Łukasz Jeż 1
Jay Sethuraman 1
Satish Rao 1
Arie Koster 1
Ely Porat 1
Daniel Blandford 1
Gilles Schaeffer 1
Hoyee Cheung 1
Li Ning 1
Nicole Immorlica 1
Vahab Mirrokni 1
Alexander Hall 1
Heiko Schilling 1
Michael Spriggs 1
Daming Zhu 1
Richard Ladner 1
Peter Grabner 1
Arnaud Labourel 1
Nicholas Harvey 1
Huy Nguyeݱn 1
Alon Efrat 1
Michael Dinitz 1
Felix Reidl 1
Justin Thaler 1
Alon Shalita 1
Annamária Kovács 1
Cenk Sahinalp 1
Shuheng Zhou 1
Madhav Marathe 1
Benjamin Sach 1
Rohit Khandekar 1
Christian Konrad 1
Rahul Garg 1
Shantanu Das 1
Giuseppe Di Battista 1
Maurizio Patrignani 1
Yufei Tao 1
Shuxin Nie 1
Adam Buchsbaum 1
Herman Haverkort 1
Iam Roditty 1
Biingfeng Wang 1
Boaz Patt-Shamir 1
Andrew Goldberg 1
Yumei Huo 1
James Korsh 1
Dany Breslauer 1
Stefan Schmid 1
David Cashman 1
Omer Reingold 1
Rajiv Raman 1
Ankur Gupta 1
Johannes Blömer 1
Vishal Sanwalani 1
Spyros Kontogiannis 1
Paul Spirakis 1
Johann Hurink 1
Edo Liberty 1
Amit Sahai 1
Akiko Suzuki 1
Manan Sanghi 1
Roei Tov 1
Balaji Venkatachalam 1
Damien Stehlé 1
Charles Leiserson 1
Harald Prokop 1
Vincenzo Auletta 1
Oren Melamud 1
Andrei Krokhin 1
Günter Rote 1
Paul Bonsma 1
Asaf Shapira 1
J Munro 1
Yoshiharu Kohayakawa 1
Aaron Archer 1
Antonios Antoniadis 1
Angelo Fanelli 1
Florian Diedrich 1
Serge Gaspers 1
Noam Solomon 1
Michael Goldwasser 1
Emo Welzl 1
Bin Fu 1
Amitabha Bagchi 1
Jeremy Spinrad 1
Christian Duncan 1
Martin Strauss 1
Tal Malkin 1
Fei Li 1
Javad Ebrahimi 1
Yajun Wang 1
Avivit Levy 1
David Steurer 1
Dominique Poulalhon 1
Kaiman Leung 1
Michael Langberg 1
Panagiotis Kanellopoulos 1
Guy Blelloch 1
Therese Biedl 1
Bernd Gärtner 1
Moni Naor 1
Udi Wieder 1
Eyal Even-Dar 1
Matthew Katz 1
Ryan Williams 1
Eyal Gordon 1
Cecilia Procopiuc 1
Andrew Shallue 1
Rachid Guerraoui 1
Maxim Babenko 1
Wuzhou Zhang 1
Luigi Laura 1
Merav Parter 1
Rephael Wenger 1
Katarína Cechlárová 1
Jianxing Feng 1
Daniel Binkele-Raible 1
Henning Fernau 1
Miklós Ajtai 1
Ariel Levavi 1
Maarten Löffler 1
Neva Cherniavsky 1
Bruce Bobier 1
Elias Koutsoupias 1
Ayelet Butman 1
Justin Ward 1
Martin Grohe 1
Karl Wimmer 1
Tsvi Kopelowitz 1
Adrian Dumitrescu 1
Nick Duffield 1
Tal Wagner 1
Jens Gramm 1
Rolf Niedermeier 1
Michael Pinedo 1
Rajsekar Manokaran 1
Martin Wahlén 1
Zvi Galil* 1
Evangelos Kranakis 1
Danny Krizanc 1
Sriram Pemmaraju 1
Richard Geary 1
Jeffrey Vitter 1
René Meier 1
Sebastian Wild 1
Ralph Neininger 1
Yixin Cao 1
Artur Jež 1
Marcel Ackermann 1
Azarakhsh Malekian 1
David Shmoys 1
Markus Bläser 1
Jens Maßberg 1
T Jayram 1
Gregory Sorkin 1
David Wood 1
Leana Golubchik 1
Sridhar Ramachandran 1
Yang Liu 1
Ojas Parekh 1
Yoav Giora 1
Rajesh Gupta 1
Jacques Yuster 1
Giuseppe Persiano 1
Tomáš Tichý 1
Robert Kleinberg 1
Tom Leighton 1
Gauri Shah 1
Ilan Newman 1
Keke Chen 1
Yoav Katz 1
Vincent Berry 1
Bruno Salvy 1
Yong Zhang 1
Gopal Pandurangan 1
Ning Chen 1
Vida Dujmović 1
Christian Scheideler 1
Till Tantau 1
Frédérique Bassino 1
Serge Plotkin 1
Jacob Holm 1
Wolfgang Bein 1
Joseph Chan 1
Andreas Brandstädt 1
Zheng Liu 1
Mark Pedigo 1
William Aiello 1
Noa Lewenstein 1
Avraham Ben-Aroya 1
Sen Zhang 1
Jyrki Katajainen 1
Sundar Vishwanathan 1
Sunil Arya 1
Theocharis Malamatos 1
C Subramanian 1
Guy Kortsarz 1
Joachim Giesen 1
Éric Fusy 1
Danupon Nanongkai 1
Hristo Djidjev 1
Carola Wenk 1
Dan Rubenstein 1
JöRg Thuswaldner 1
Stavros Kolliopoulos 1
Pekka Parviainen 1
Shiri Chechik 1
Eunjung Kim 1
Piotr Berman 1
Wei Hu 1
Yoshio Okamoto 1
Ramamohan Paturi 1
Ron Adany 1
Elad Haramaty 1
Sanjiv Kapoor 1
Rinat Avraham 1
Matúš Mihalák 1
Michael Dom 1
Haitao Wang 1
Guyslain Naves 1
Tobias Friedrich 1
Gianni Franceschini 1
Margaret Berg 1
Yefim Dinitz 1
Alexander Shvartsman 1
Qianping Gu 1
Tzuchin Lin 1
Joachim Gudmundsson 1
Giri Narasimhan 1
David Harris 1
Elisabeth Lubbecke 1
Pascal Klaue 1
Yossi Richter 1
Dana Moshkovitz 1
Jiong Guo 1
Nina Taslaman 1
Christian Scheideler 1
Chaiwah Wu 1
Bernadette Charron-Bost 1
Piotr Sankowski 1
Yue Wang 1
David Kirkpatrick 1
Tobias Friedrich 1
Ryan Moriarty 1
Robert Schweller 1
Bruce Reed 1
Dorit Hochbaum 1
Quang Bui 1
Robert Carr 1
Shayan Oveisgharan 1
Paolo Penna 1
Madhu Sudan 1
Ron Pinter 1
Arie Matsliah 1
Prosenjit Bose 1
Toshihiro Fujito 1
Guojun Li 1
Ningning Wu 1
Zdeněk Dvořák 1
Robin Thomas 1
Michèle Soria 1
Brigitte Vallee 1
Alexander Izsak 1
Hingfung Ting 1
Renato Carmo 1
Ariel Procaccia 1
Luca Moscardelli 1
Arash Asadpour 1
Lars Prädel 1
Philippe Baptiste 1
Rolf Fagerberg 1
Lawrence Larmore 1
Gorjan Alagic 1
Rami Cohen 1
Dany Azriel 1
Lan Liu 1
Eric Torng 1
Artem Pyatkin 1
Mukesh Mohania 1
Waihong Chan 1
Nira Shafrir 1
Stefano Leonardi 1
Wingkai Hon 1
Yevgen Voronenko 1
Huahuai Chern 1
Michael Goodrich 1
Rebecca Wright 1
Martin Jaggi 1
Sören Laue 1
Natalie Shapira 1
Amnon Ta-Shma 1
Michael Schapira 1
Gaia Nicosia 1
Leonard Schulman 1
Anna Lubiw 1
Wolfgang Slany 1
Doratha Vinkemeier 1
Soumojit Sarkar 1
Sumeet Khurana 1
Jing Wang 1
Ofer Neiman 1
Mihai P&acaron;trascu 1
Linus Hamilton 1
Richard Peng 1
Robby Lampert 1
George Christodoulou 1
Arkadiusz Socała 1
Sofya Raskhodnikova 1
Bryan Wilkinson 1
Gelin Zhou 1
Barna Saha 1
Wiebke Höhn 1
Noa Avigdor-Elgrabli 1
Virginia Vassilevska 1

Affiliation Paper Counts
California State University Northridge 1
Sun Yat-Sen University 1
State University of New York College at Oneonta 1
Johannes Kepler Universitat Linz 1
University of Durham 1
Meiji University 1
Medical University of South Carolina 1
National Taiwan Ocean University 1
Georgetown University 1
Shanghai Jiaotong University 1
National University of Ireland, Cork 1
University of Tokyo 1
Rensselaer Polytechnic Institute 1
Indian Institute of Technology, Madras 1
Universitat Wien 1
Netanya Academic College 1
Lawrence Livermore National Laboratory 1
University of Melbourne 1
DePaul University 1
Stevens Institute of Technology 1
Kwansei Gakuin University 1
Institute for Advanced Studies 1
Oracle Corporation 1
Universite du Quebec a Montreal 1
Scuola Superiore Sant'Anna di Studi Universitari e di Perfezionamento 1
Universita degli Studi del Piemonte Orientale Amedeo Avogadro, Alessandria 1
Montanuniversitat Leoben 1
Siemens AG 1
Ludwig-Maximilians-Universitat Munchen 1
University of Miami 1
NICTA 1
The University of Georgia 1
Wesleyan University Middletown 1
Cisco Systems 1
Universita degli Studi di Milano 1
Pavol Jozef safarik University in Kosice 1
California Institute of Technology 1
Utah State University 1
Michigan State University 1
Korea Advanced Institute of Science & Technology 1
University of Wisconsin Madison 1
University of Electro-Communications 1
Sobolev Institute of Mathematics of Siberian Branch of the RAS 1
Google Switzerland GmbH 1
NEC Deutschland GmbH 1
Istituto di Scienza e Tecnologie dell'Informazione A. Faedo 1
ORT Braude - College of Engineering 1
Microsoft Research Cambridge 1
Microsoft Research India 1
VMware, Inc 1
Laboratoire d'Analyse et Modelisation de Systemes pour l'Aide a la Decision 1
SRI International 1
Harvey Mudd College 1
Emory University 1
Universite Pierre et Marie Curie 1
University of Glasgow 1
Universiteit Stellenbosch 1
Center for Communications Research 1
Ethniko Metsovio Polytechnico 1
Toyohashi University of Technology 1
Vanderbilt University 1
Zhejiang University 1
IBM Tokyo Research Laboratory 1
Iowa State University 1
Dalian University of Technology 1
Universita degli Studi G. d'Annunzio Chieti e Pescara 1
J. Craig Venter Institute 1
Ecole Normale Superieure de Lyon 1
Los Alamos National Laboratory 1
University of Western Macedonia 1
National Institutes of Health, Bethesda 1
University of Missouri-Kansas City 1
Sandia National Laboratories, New Mexico 1
Laboratoire d'Informatique, de Robotique et de Microelectronique de Montpellier LIRMM 1
Technische Universitat Braunschweig 1
Malmo Hogskola 1
Universidade de Sao Paulo 1
Vrije Universiteit Amsterdam 1
Hong Kong Polytechnic University 1
Birkbeck University of London 1
UC MERCED 1
Linkopings universitet 1
Universite Paris 13 1
University of Colorado at Denver 1
Apple Computer 1
Kyushu University 1
Illinois Wesleyan University 1
BRICS Basic Research in Computer Science 1
National Chiao Tung University Taiwan 1
Universitat zu Lubeck 1
Duquesne University 1
University of Texas at Austin 1
INRIA Institut National de Rechereche en Informatique et en Automatique 1
Indian Institute of Technology, Bombay 1
University of Tsukuba 1
Hong Kong Baptist University 1
UC Davis 1
Istituto Dalle Molle Di Studi Sull'intelligenza Artificiale 1
Universidade Federal do Parana 1
Florida International University 1
University of Witwatersrand 1
Holon Institute of Technology 1
Academia Sinica Taiwan 1
University of New Brunswick 1
Universitat Tubingen 1
Panepistimion Aegaeou 1
George Mason University 1
Maastricht University 1
Boston University 1
University of Wisconsin Milwaukee 1
Saint Petersburg Department of Steklov Institute of Mathematics, Russian Academy of Sciences 1
Brandenburgische Technische Universitat Cottbus 1
Gosudarstvennyj Universitet - Vyssaja Skola Ekonomiki 1
Hewlett-Packard Inc. 1
University of Bristol 1
Pennsylvania State University 2
London School of Economics and Political Science 2
University of Texas at San Antonio 2
Ohio State University 2
Universitat Rostock 2
Uppsala Universitet 2
Mentor Graphics Corporation 2
North Carolina State University 2
Instituto Superior Tecnico 2
National Taiwan University 2
Tohoku University 2
University of Dayton 2
University of Texas at Dallas 2
Technische Universitat Kaiserslautern 2
University of Arizona 2
King's College London 2
Centrum voor Wiskunde en Informatica 2
Universitat Trier 2
IDC 2
Seoul National University 2
City University of Hong Kong 2
University of Denver 2
University of Guelph 2
Universite de Picardie Jules Verne 2
National University of Singapore 2
Universita degli Studi dell'Aquila 2
Technische Universitat Graz 2
Royal Holloway University of London 2
West Virginia University 2
University of Notre Dame 2
Kasetsart University 2
University of Iowa 2
Universite Paris-Sud XI 2
Eotvos Lorand Tudomanyegyetem 2
Tsinghua University 2
Universitat Freiburg im Breisgau 2
Microsoft 2
University of Oxford 2
Universite Paul Verlaine - Metz 2
St. Louis University 2
Aarhus Universitet 2
Universite d'Orleans 2
Temple University 2
Freie Universitat Berlin 2
University of Cambridge 2
Tata Institute of Fundamental Research 2
University of Nevada, Las Vegas 2
Universite de Caen Basse Normandie 2
Pontificia Universidade Catolica do Rio de Janeiro 2
Indian Institute of Technology, Delhi 2
Universitat des Saarlandes 2
University of Puerto Rico 2
Universidad de la Republica 2
Microsoft Research Asia 2
Aalto University 2
Ecole Normale Superieure 3
University of Colorado at Boulder 3
Helsinki Institute for Information Technology 3
Sveriges Storsta Tekniska Universitet 3
Helsingin Yliopisto 3
Johns Hopkins University 3
Nanyang Technological University 3
Northwestern University 3
Johann Wolfgang Goethe Universitat Frankfurt am Main 3
Harvard University 3
University of Texas-Pan American 3
IBM Research 3
Oregon State University 3
Ecole Polytechnique 3
Dalhousie University 3
University of Connecticut 3
New Jersey Institute of Technology 3
Brooklyn College 3
University of Utah 3
University of Sydney 3
Research Organization of Information and Systems National Institute of Informatics 3
Laboratoire d'Informatique de l'Ecole Polytechnique 3
University of Chicago 3
Shandong University 3
University of Ljubljana 3
Akademie Ved Ceske Republiky 3
University at Buffalo, State University of New York 3
York Universite Canada 3
University of Iceland 3
Toyota Technological Institute at Chicago 3
King Abdullah University of Science and Technology 3
Intertrust Technologies Corporation 3
Universite de Bordeaux 3
Aix Marseille Universite 3
University of Michigan 4
Chinese University of Hong Kong 4
University of Victoria 4
IBM India Research Laboratory New Delhi 4
Arizona State University 4
Panepistimion Ioanninon 4
Yale University 4
City University of New York 4
Universita di Salerno 4
Universitat Bonn 4
Universitat Politecnica de Catalunya 4
Universita degli Studi Roma Tre 4
Indian Institute of Science 4
INRIA Lorraine 4
National Tsing Hua University 4
Syddansk Universitet 4
Georgia Institute of Technology 4
Texas A and M University 4
University of Twente 4
Universite Montpellier 2 Sciences et Techniques 4
Computer and Automation Research Institute Hungarian Academy of Sciences 4
Virginia Polytechnic Institute and State University 4
University of Athens 4
University of Southern California 4
Karlsruhe Institute of Technology, Campus South 4
Budapesti Muszaki es Gazdasagtudomanyi Egyetem 4
Universitat Dortmund 4
University of New Mexico 4
Illinois Institute of Technology 5
Cornell University 5
Alcatel-Lucent Bell Labs 5
IBM Almaden Research Center 5
Purdue University 5
Christian-Albrechts-Universitat zu Kiel 5
AT&T Inc. 5
University of Massachusetts Amherst 5
University of Washington Seattle 5
Uniwersytet Wroclawski 5
Indian Institute of Technology, Kanpur 5
Magyar Tudomanyos Akademia 5
University of California, Riverside 5
Technische Universitat Ilmenau 5
McMaster University 5
Reykjavik University 5
Universite Libre de Bruxelles 6
Humboldt-Universitat zu Berlin 6
MIT Computer Science and Artificial Intelligence Laboratory 6
Utrecht University 6
The University of British Columbia 6
Dartmouth College 6
Kyoto University 6
University of Pittsburgh 6
Univerzita Karlova v Praze 6
Technische Universitat Wien 6
Universite Simon Fraser 6
IT-Universitetet i Kobenhavn 6
Universite du Quebec en Outaouais 6
Columbia University in the City of New York 6
University of California, San Diego 6
University of Leicester 6
Yahoo Research Labs 6
Karlsruher Institut fur Technologie 6
Polytechnic University - Brooklyn 7
UC Irvine 7
New York University 7
Open University of Israel 7
University Michigan Ann Arbor 7
Stony Brook University 7
Universita degli Studi di Roma Tor Vergata 7
University of California, Santa Barbara 7
Kobenhavns Universitet 7
Panepistimion Patron 7
McGill University 8
University of Illinois 8
Danmarks Tekniske Universitet 8
Carleton University 8
University of Liverpool 8
University of California, Los Angeles 8
Sharif University of Technology 8
Lunds Universitet 8
Rutgers, The State University of New Jersey 8
University of Illinois at Urbana-Champaign 9
University of Pennsylvania 9
Hebrew University of Jerusalem 9
Universidad de Chile 9
Uniwersytet Warszawski 9
University of Toronto 9
Universitat Paderborn 9
International Business Machines 9
The University of Warwick 9
UC Berkeley 9
Eidgenossische Technische Hochschule Zurich 9
Ecole Polytechnique Federale de Lausanne 9
Universita di Pisa 9
Friedrich Schiller Universitat Jena 9
Universitetet i Bergen 9
Universite Paris 7- Denis Diderot 10
Rheinisch-Westfalische Technische Hochschule Aachen 10
University of Alberta 10
Duke University 11
Brown University 11
Technische Universiteit Eindhoven 11
Hong Kong University of Science and Technology 12
Princeton University 13
Technische Universitat Berlin 13
The University of Hong Kong 14
Rutgers University-Camden campus 14
Institute of Mathematical Sciences India 14
Universita degli Studi di Roma La Sapienza 15
Microsoft Research 16
University of Haifa 18
Google Inc. 18
AT&T Laboratories Florham Park 18
IBM Thomas J. Watson Research Center 18
Weizmann Institute of Science Israel 19
Stanford University 21
University of Maryland 22
Ben-Gurion University of the Negev 24
Max Planck Institut fur Informatik 25
Bar-Ilan University 26
Carnegie Mellon University 27
Massachusetts Institute of Technology 28
Technion - Israel Institute of Technology 32
University of Waterloo 33
Tel Aviv University 70

ACM Transactions on Algorithms (TALG)
Archive


2017
Volume 13 Issue 2, January 2017  Issue-in-Progress

2016
Volume 13 Issue 1, December 2016
Volume 12 Issue 4, September 2016
Volume 12 Issue 3, June 2016
Volume 12 Issue 2, February 2016
Volume 12 Issue 1, February 2016 Special Issue on SODA'12 and Regular Papers

2015
Volume 11 Issue 4, June 2015
Volume 11 Issue 3, January 2015

2014
Volume 11 Issue 2, November 2014
Volume 11 Issue 1, October 2014
Volume 10 Issue 4, August 2014
Volume 10 Issue 3, June 2014
Volume 10 Issue 2, February 2014
Volume 10 Issue 1, January 2014

2013
Volume 9 Issue 4, September 2013
Volume 9 Issue 3, June 2013 Special Issue on SODA'11
Volume 9 Issue 2, March 2013

2012
Volume 9 Issue 1, December 2012
Volume 8 Issue 4, September 2012
Volume 8 Issue 3, July 2012
Volume 8 Issue 2, April 2012
Volume 8 Issue 1, January 2012

2011
Volume 7 Issue 4, September 2011
Volume 7 Issue 3, July 2011
Volume 7 Issue 2, March 2011

2010
Volume 7 Issue 1, November 2010
Volume 6 Issue 4, August 2010
Volume 6 Issue 3, June 2010
Volume 6 Issue 2, March 2010

2009
Volume 6 Issue 1, December 2009
Volume 5 Issue 4, October 2009
Volume 5 Issue 3, July 2009
Volume 5 Issue 2, March 2009

2008
Volume 5 Issue 1, November 2008
Volume 4 Issue 4, August 2008
Volume 4 Issue 3, June 2008
Volume 4 Issue 2, May 2008
Volume 4 Issue 1, March 2008

2007
Volume 3 Issue 4, November 2007
Volume 3 Issue 3, August 2007
Volume 3 Issue 2, May 2007
Volume 3 Issue 1, February 2007

2006
Volume 2 Issue 4, October 2006
Volume 2 Issue 3, July 2006
Volume 2 Issue 2, April 2006
Volume 2 Issue 1, January 2006

2005
Volume 1 Issue 2, October 2005
Volume 1 Issue 1, July 2005
 
All ACM Journals | See Full Journal Index

Search TALG
enter search term and/or author name