ACM DL

ACM Transactions on

Algorithms (TALG)

Menu
Latest Articles

Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks

Packet scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves... (more)

Fast Constructions of Lightweight Spanners for General Graphs

It is long known that for every weighted undirected n-vertex m-edge graph G = (V, E, ω), and every integer k ⩾ 1, there exists a ((2k... (more)

The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs

Consider the following problem: given a graph with edge costs and a subset Q of vertices, find a minimum-cost subgraph in which there are two... (more)

Approximating Semi-matchings in Streaming and in Two-Party Communication

We study the streaming complexity and communication complexity of approximating unweighted semi-matchings. A semi-matching in a bipartite graph G... (more)

Optimal Orthogonal Graph Drawing with Convex Bend Costs

Traditionally, the quality of orthogonal planar drawings is quantified by the total number of bends or the maximum number of bends per edge. However,... (more)

Families with Infants

Assume that a group of n people is going to an excursion and our task is to seat them into buses with several constraints each saying that a pair of people does not want to see each other in the same bus. This is a well-known graph coloring problem (with n being the number of vertices) and it can be solved in O*(2n) time by the... (more)

A Constant Factor Approximation Algorithm for Fault-Tolerant k-Median

In this article, we consider the fault-tolerant k-median problem and give the first constant factor approximation algorithm for it. In the... (more)

On the Expected Complexity of Voronoi Diagrams on Terrains

We investigate the combinatorial complexity of geodesic Voronoi diagrams on polyhedral terrains using a probabilistic analysis. Aronov et al. [2008]... (more)

All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

We study a variant of the generalized assignment problem (gap), which we label all-or-nothing gap... (more)

Sparse Text Indexing in Small Space

In this work, we present efficient algorithms for constructing sparse suffix trees, sparse suffix arrays, and sparse position heaps for b arbitrary positions of a text T of length n while using only O(b) words of space during the construction. Attempts at breaking the naïve bound of Ω(nb) time for constructing sparse suffix trees in O(b)... (more)

Point Line Cover

The input to the NP-hard point line cover problem (PLC) consists of a set P of n points on the plane and a positive integer k; the question is whether there exists a set of at most k lines that pass through all points in P. By straightforward reduction rules, one can efficiently reduce any input to one with at most k2 points. We show that this easy... (more)

Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack

We present a new approximation algorithm for the stochastic submodular set cover (SSSC) problem... (more)

NEWS

New options for ACM authors to manage rights and permissions for their work

ACM introduces a new publishing license agreement, an updated copyright transfer agreement, and a new author-pays option which allows for perpetual open access through the ACM Digital Library. For more information, visit the ACM Author Rights webpage.

Memberships Print Online
Professional Member Rates $50 $40
Student Member Rates $45 $36
Nonmember Rates $225 $180
 

About TALGS

The ACM Transactions on Algorithms (TALGS) 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
Forthcoming Articles
Maximizing k-Submodular Functions and Beyond

We consider the maximization problem in the value oracle model of functions defined on k-tuples of sets that are submodular in every orthant and r-wise monotone, where k>=2 and 1<=r<=k. We give an analysis of a deterministic greedy algorithm that shows that any such function can be approximated to a factor of 1/(1+r). For r = k, we give an analysis of a randomised greedy algorithm that shows that any such function can be approximated to a factor of 1/(1+Sqrt(k/2)). In the case of k=r=2, the considered functions correspond precisely to bisubmodular functions, in which case we obtain an approximation guarantee of 1/2. We show that, as in the case of submodular functions, this result is the best possible in both the value query model, and under the assumption that NP!=RP. Extending a result of Ando et al., we show that for any k>=3 submodularity in every orthant and pairwise monotonicity (i.e. r=2) precisely characterize k-submodular functions. Consequently, we obtain an approximation guarantee of 1/3 (and thus independent of k) for the maximization problem of k-submodular functions.

Data Structures for Path Queries

Scale-free Compact Routing Schemes in Networks of Low Doubling Dimension

We consider compact routing schemes in networks of low doubling dimension. We consider two variants on routing scheme design: (i) labeled (name-dependent) routing, where the designer is allowed to rename the nodes so that the names (labels) can contain additional, e.g. topological, routing information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, i.e. the node names are independent of the routing scheme. Given any constant µ in (0,1), and an n-node edge-weighted network of doubling dimension ± in o(\loglog n), we present (1) A (1+µ)-stretch labeled compact routing scheme with (log n)-bit routing labels, O(log^2 n/loglog n)-bit packet headers, and O(4^± log^3 n)-bit routing information at each node; (2) A (9+µ)-stretch name-independent compact routing scheme with O(log^2 n/loglog n)-bit packet headers, and O(4^± log^3 n )-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n^{(µ/60)^2}) bits of storage at each node has stretch no less than 9-µ, for any µ in (0,8). Therefore our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and polylogarithmic packet headers. Note that both our schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter of the network. We also present a simpler non-scale-free (9+µ)-stretch name-independent routing scheme with improved space requirements for instances where is polynomial in n.

Adaptive and Approximate Orthogonal Range Counting

We present three new results on one of the most basic problems in geometric data structures, 2-D orthogonal range counting. All the results are in the $w$-bit word RAM model. - It is well known that there are linear-space data structures for 2-D orthogonal range counting with worst-case optimal query time O(log n / loglog n). We give an O(n loglog n)-space adaptive data structure that improves the query time to O(loglog n+log k / loglog n), where k is the output count. When k=O(1), our bounds match the state of the art for the 2-D orthogonal range emptiness problem [Chan, Larsen, and Patrascu, SoCG 2011]. - We give an O(n loglog n)-space data structure for approximate 2-D orthogonal range counting that can compute a (1+delta)-factor approximation to the count in O(loglog n) time for any fixed constant delta>0. Again, our bounds match the state of the art for the 2-D orthogonal range emptiness problem. - Lastly, we consider the 1-D range selection problem, where a query in an array involves finding the kth least element in a given subarray. This problem is closely related to 2-D 3-sided orthogonal range counting. Recently, Jorgensen and Larsen [SODA 2011] presented a linear-space adaptive data structure with query time O(loglog n + log k / loglog n). We give a new linear-space structure that improves the query time to O(1 + log k / loglog n), exactly matching the lower bound proved by Jorgensen and Larsen.

Compressed Cache-Oblivious String B-tree

Inapproximability of the Multi-level Uncapacitated Facility Location Problem

Tight lower bound for the channel assignment problem

We study the complexity of the Channel Assignment problem. An open problem asks whether Channel Assignment admits an $O(c^n)$-time algorithm, for a constant $c$ independent of the weights on the edges. We answer this question in the negative i.e. we show that there is no $2^{o(n\log n)}$-time algorithm solving Channel Assignment unless the Exponential Time Hypothesis fails. Note that the currently best known algorithm works in time $O^*(n!) = 2^{O(n\log n)}$ so our lower bound is tight.

Deletion Without Rebalancing in Binary Search Trees

We address the vexing issue of deletions in balanced trees. Rebalancing after a deletion is generally more complicated than rebalancing after an insertion. Textbooks neglect deletion rebalancing, and many B-tree-based database systems do not do it. We describe a relaxation of AVL trees in which rebalancing is done after insertions but not after deletions, yet access time remains logarithmic in the number of insertions. For many applications of balanced trees, our structure offers performance competitive with that of classical balanced trees. With the addition of periodic rebuilding, the performance of our structure is theoretically superior to that of many if not all classic balanced tree structures. Our structure needs lglg(m) + 1 bits of balance information per node, where m is the number of insertions and lg is the base-two logarithm, or lglg(n) + O(1) with periodic rebuilding, where n is the number of nodes. An insertion takes up to two rotations and O(1) amortized time, the same as in standard AVL trees. Using an analysis that relies on an exponential potential function, we show that rebalancing steps occur with a frequency that is exponentially small in the height of the affected node. Our techniques apply to other types of balanced trees, notably B-trees, as we show in a companion paper, and in particular red-black trees, which can be viewed as a special case of B-trees.

Space-Constrained Interval Selection

We study streaming algorithms for the interval selection problem: finding a maximum cardinality subset of disjoint intervals on the line. A deterministic $2$-approximation streaming algorithm for this problem is developed, together with an algorithm for the special case of proper intervals, achieving improved approximation ratio of $3/2$. We complement these upper bounds by proving that they are essentially best possible in the streaming setting: it is shown that an approximation ratio of $2 - \epsilon$ (or $3 / 2 - \epsilon$ for proper intervals) cannot be achieved unless the space is linear in the input size. In passing, we also answer an open question of Adler and Azar (J.\ Scheduling 2003) regarding the space complexity of constant-competitive randomized preemptive online algorithms for the same problem.

On Problems as Hard as CNF-SAT

Limits and Applications of Group Algebras for Parameterized Problems

Approximation Algorithms for Movement Repairmen

A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs

Given an $n$-vertex undirected graph $G = (V,E)$ and a parameter $k = 1,2,\ldots$, Thorup-Zwick's distance oracle has size $O(k n^{1+1/k})$, and upon a query $(u,v)$ it constructs a path $\Pi$ between $u$ and $v$ of length $\delta(u,v)$ such that $d_G(u,v) \le \delta(u,v) \le (2k-1) d_G(u,v)$. The query time of this oracle is $O(k)$ (in addition to the length of the returned path), and it was subsequently improved to $O(1)$ \cite{WN12,C14}. A major drawback of the oracle of Thorup and Zwick is that its space is $\Omega(n \cdot \log n)$. Mendel and Naor devised an oracle with space $O(n^{1+1/k})$ and stretch $O(k)$, but their oracle can only report distance estimates and not actual paths. In this paper we devise a path-reporting distance oracle with size $O(n^{1+1/k})$, stretch $O(k)$ and query time $O(n^\eps)$, for an arbitrarily small $\eps > 0$. Another variant of our oracle has size $O(n \log\log n)$, polylogarithmic stretch, and query time $O(\log\log n)$. For unweighted graphs we devise a distance oracle with multiplicative stretch $O(1)$, additive stretch $O(\beta(k))$, for a function $\beta()$, space $O(n^{1+1/k} \cdot \beta)$, and query time $O(n^\eps)$, for an arbitrarily small constant $\eps >0$. The tradeoff between multiplicative stretch and size in these oracles is far below girth conjecture threshold (which is stretch $2k-1$ and size $O(n^{1+1/k})$). An important novel tool that we develop on the way to these results is a {distance-preserving path-reporting oracle}. We believe that this oracle is of independent interest.

Gathering Despite Mischief

Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection

Dynamic Facility Location via Exponential Clocks

The dynamic facility location problem is a generalization of the classic facility location problem proposed by Eisenstat, Mathieu, and Schabanel to model the dynamics of evolving social/infrastructure networks. The generalization lies in that the distance metric between clients and facilities changes over time. This leads to a trade-off between optimizing the classic objective function and the "stability" of the solution: there is a switching cost charged every time a client changes the facility to which it is connected. While the standard linear program (LP) relaxation for the classic problem naturally extends to this problem, traditional LP-rounding techniques do not, as they are often sensitive to small changes in the metric resulting in frequent switches. We present a new LP-rounding algorithm for facility location problems, which yields the first constant approximation algorithm for the dynamic facility location problem. Our algorithm installs competing exponential clocks on the clients and facilities, and connect every client by the path that repeatedly follows the smallest clock in the neighborhood. The use of exponential clocks gives rise to several properties that distinguish our approach from previous LP-roundings for facility location problems. In particular, we use no clustering and we allow clients to connect through paths of arbitrary lengths. In fact, the clustering-free nature of our algorithm is crucial for applying our LP-rounding approach to the dynamic problem.

Bibliometrics

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

Affiliation Paper Counts
Medical University of South Carolina 1
National Taiwan Ocean University 1
Georgetown University 1
Shanghai Jiaotong University 1
University College Cork 1
University of Tokyo 1
Rensselaer Polytechnic Institute 1
Indian Institute of Technology, Madras 1
University of Vienna 1
Netanya Academic College 1
University of Melbourne 1
University of Oxford 1
DePaul University 1
Stevens Institute of Technology 1
Kwansei Gakuin University 1
Institute for Advanced Studies 1
Oracle Corporation 1
University of Quebec in Montreal 1
Sant'Anna School of Advanced Studies 1
University of Eastern Piedmont Amedeo Avogadro, Alessandria 1
University of Leoben 1
Siemens AG 1
Ludwig Maximilian University of Munich 1
University of Miami 1
NICTA 1
The University of Georgia 1
Wesleyan University Middletown 1
Cisco Systems 1
University of Milan 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 the Saarland 1
Sobolev Institute of Mathematics of Siberian Branch of the RAS 1
University of Puerto Rico 1
Google Switzerland GmbH 1
NEC Deutschland GmbH 1
Istituto di Scienza e Tecnologie dell'Informazione A. Faedo 1
King Abdullah University of Science and Technology 1
ORT Braude - College of Engineering 1
Intertrust Technologies Corporation 1
Microsoft Research Cambridge 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
University of Michigan 1
Universite Pierre et Marie Curie 1
University of Glasgow 1
University of Stellenbosch 1
Center for Communications Research 1
National Technical University of Athens 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
University of G. d'Annunzio Chieti and 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
Technical University in Braunschweig 1
Malmo University 1
University of Sao Paulo 1
Vrije Universiteit Amsterdam 1
Hong Kong Polytechnic University 1
Birkbeck University of London 1
Linkoping University 1
University of Texas at Dallas 1
Universite Paris 13 1
University of Colorado at Denver 1
Kyushu University 1
BRICS Basic Research in Computer Science 1
National Chiao Tung University Taiwan 1
Lubeck University 1
The Interdisciplinary Center Herzliya 1
University of Texas at Austin 1
INRIA Institut National de Rechereche en Informatique et en Automatique 1
Indian Institute of Technology, Bombay 1
Hong Kong Baptist University 1
University of California, Davis 1
Dalle Molle Institute for Artificial Intelligence 1
Federal University of Parana 1
Florida International University 1
University of Witwatersrand 1
Holon Institute of Technology 1
Academia Sinica Taiwan 1
University of New Brunswick 1
University of Tubingen 1
Aegean University 1
George Mason University 1
Universite Bordeaux 1 1
Boston University 1
Brandenburg University of Technology Cottbus 1
Hewlett-Packard 1
Royal Holloway University of London 1
Sun Yat-Sen University 1
State University of New York College at Oneonta 1
Johannes Kepler University Linz 1
University of Durham 1
Meiji University 1
Pennsylvania State University 2
London School of Economics and Political Science 2
University of Texas at San Antonio 2
Ohio State University 2
University of Rostock 2
Uppsala University 2
Mentor Graphics Corporation 2
University of Ioannina 2
North Carolina State University 2
Instituto Superior Tecnico 2
National Taiwan University 2
Tohoku University 2
University of Dayton 2
University of Kaiserslautern 2
University of Arizona 2
IBM Research 2
King's College London 2
Center for Mathematics and Computer Science - Amsterdam 2
University of Trier 2
Oregon State University 2
Seoul National University 2
City University of Hong Kong 2
University of Denver 2
University of Guelph 2
Dalhousie University 2
Universite de Picardie Jules Verne 2
National University of Singapore 2
University of L'Aquila 2
Graz University of Technology 2
West Virginia University 2
University of Notre Dame 2
Kasetsart University 2
Brooklyn College 2
University of Iowa 2
Universite Paris-Sud XI 2
Eotvos Lorand University 2
University of Utah 2
University of Freiburg 2
Microsoft 2
Virginia Tech 2
Universite Paul Verlaine - Metz 2
St. Louis University 2
Research Organization of Information and Systems National Institute of Informatics 2
University of Chicago 2
University of Aarhus 2
Universite d'Orleans 2
Technical University of Ilmenau 2
Temple University 2
Free University of Berlin 2
University of Cambridge 2
Tata Institute of Fundamental Research 2
University of Nevada, Las Vegas 2
University at Buffalo, State University of New York 2
Universite de Caen Basse Normandie 2
Pontifical Catholic University of Rio de Janeiro 2
Indian Institute of Technology, Delhi 2
Universidad de la Republica 2
Microsoft Research Asia 2
Universite de Bordeaux 2
Aalto University 2
Ecole Normale Superieure 3
University of Colorado at Boulder 3
Helsinki Institute for Information Technology 3
Royal Institute of Technology 3
University of Helsinki 3
Arizona State University 3
Johns Hopkins University 3
Nanyang Technological University 3
Northwestern University 3
University of Bonn 3
Johann Wolfgang Goethe University of Frankfurt 3
Harvard University 3
University of Texas-Pan American 3
Ecole Polytechnique 3
Texas A and M University 3
University of Connecticut 3
New Jersey Institute of Technology 3
Computer and Automation Research Institute Hungarian Academy of Sciences 3
University of Sydney 3
Laboratoire d'Informatique de l'Ecole Polytechnique 3
Shandong University 3
University of Ljubljana 3
Academy of Sciences of the Czech Republic (Avcr.Cz) 3
University of Dortmund 3
York University Canada 3
University of Iceland 3
Reykjavik University 3
Toyota Technological Institute at Chicago 3
Aix Marseille Universite 3
Karlsruhe Institute of Technology 3
Chinese University of Hong Kong 4
Illinois Institute of Technology 4
University of Victoria 4
IBM India Research Laboratory New Delhi 4
Yale University 4
City University of New York 4
University of Salerno 4
Universitat Politecnica de Catalunya 4
Roma Tre University 4
Indian Institute of Science 4
AT&T Inc. 4
University of Massachusetts Amherst 4
INRIA Lorraine 4
National Tsing Hua University 4
University of Southern Denmark 4
Georgia Institute of Technology 4
University of Twente 4
Universite Montpellier 2 Sciences et Techniques 4
New York University 4
University of Athens 4
University of Southern California 4
Karlsruhe Institute of Technology, Campus South 4
Budapest University of Technology and Economics 4
University of California, San Diego 4
University of New Mexico 4
Cornell University 5
Alcatel-Lucent Bell Labs 5
IBM Almaden Research Center 5
Purdue University 5
Dartmouth College 5
Technical University of Denmark 5
University of Kiel 5
University of Washington Seattle 5
University of Wroclaw 5
Indian Institute of Technology, Kanpur 5
University of Roma Tor Vergata 5
Hungarian Academy of Sciences 5
University of California, Riverside 5
McMaster University 5
Yahoo Research Labs 5
Universite Libre de Bruxelles 6
Humboldt University of Berlin 6
MIT Computer Science and Artificial Intelligence Laboratory 6
Utrecht University 6
The University of British Columbia 6
Kyoto University 6
University of Pittsburgh 6
Charles University in Prague 6
Vienna University of Technology 6
Simon Fraser University 6
IT University of Copenhagen 6
University of Quebec in Outaouais 6
University Michigan Ann Arbor 6
Columbia University 6
University of Leicester 6
University of Patras 7
University of Warsaw 7
Stony Brook University 7
Polytechnic University - Brooklyn 7
University of Illinois at Urbana-Champaign 7
University of California, Irvine 7
University of Pisa 7
Open University of Israel 7
Universite Paris 7- Denis Diderot 7
University of California, Santa Barbara 7
University of Copenhagen 7
The University of Warwick 7
University of Toronto 7
Lund University 8
Swiss Federal Institute of Technology, Lausanne 8
Technical University of Berlin 8
University of Illinois 8
University of Bergen 8
Carleton University 8
University of California, Los Angeles 8
McGill University 8
Sharif University of Technology 8
University of Liverpool 8
Rutgers University 8
RWTH Aachen University 9
Universidad de Chile 9
Duke University 9
Hebrew University of Jerusalem 9
University of Pennsylvania 9
University of Paderborn 9
Friedrich Schiller University Jena 9
Swiss Federal Institute of Technology, Zurich 9
University of California, Berkeley 9
IBM 9
Eindhoven University of Technology 10
Hong Kong University of Science and Technology 10
Brown University 10
University of Alberta 10
Rutgers University-Camden campus 13
Institute of Mathematical Sciences India 13
Princeton University 13
The University of Hong Kong 13
University of Roma La Sapienza 14
Microsoft Research 14
Weizmann Institute of Science Israel 15
IBM Thomas J. Watson Research Center 15
University of Maryland 16
Google Inc. 17
AT&T Laboratories Florham Park 18
University of Haifa 18
Stanford University 19
Ben-Gurion University of the Negev 21
Bar-Ilan University 22
Max Planck Institute for Informatics 24
Carnegie Mellon University 25
Technion - Israel Institute of Technology 27
Massachusetts Institute of Technology 27
University of Waterloo 27
Tel Aviv University 68

ACM Transactions on Algorithms (TALG)
Archive


2016
Volume 12 Issue 3, April 2016  Issue-in-Progress
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