External Links

    Journal: ACM Transactions on Algorithms

    Volume 6, Issue 4

    0 -- 0Timothy M. Chan. On the bichromatic ::::k::::-set problem
    0 -- 0Kenneth L. Clarkson. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
    0 -- 0Bruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. Fast asynchronous Byzantine agreement and leader election with full information
    0 -- 0Marcel R. Ackermann, Johannes Blömer, Christian Sohler. Clustering for metric and nonmetric distance measures
    0 -- 0Ulrich Faigle, Britta Peis. Two-phase greedy algorithms for some classes of combinatorial linear programs
    0 -- 0Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang. Geodesic delaunay triangulations in bounded planar domains
    0 -- 0Yuval Emek, David Peleg, Liam Roditty. A near-linear-time algorithm for computing replacement paths in planar directed graphs
    0 -- 0Pankaj K. Agarwal, Sariel Har-Peled, Micha Sharir, Yusu Wang. Hausdorff distance under translation for points and balls
    0 -- 0Mohammad Taghi Hajiaghayi, Shang-Hua Teng. Foreword to special issue on SODA 2008
    0 -- 0Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. Finding one tight cycle
    0 -- 0Susanne Albers. Editorial note
    0 -- 0Reid Andersen. A local algorithm for finding dense subgraphs
    0 -- 0Virginia Vassilevska Williams. Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
    0 -- 0John Gunnar Carlsson, Benjamin Armbruster, Yinyu Ye. Finding equitable convex partitions of points in a polygon efficiently
    0 -- 0Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. On distributing symmetric streaming computations
    0 -- 0Zoya Svitkina. Lower-bounded facility location

    Volume 6, Issue 3

    0 -- 0Gagan Aggarwal, Rina Panigrahy, Tomás Feder, Dilys Thomas, Krishnaram Kenthapadi, Samir Khuller, An Zhu. Achieving anonymity via clustering
    0 -- 0Shahar Fattal, Dana Ron. Approximating the distance to monotonicity in high dimensions
    0 -- 0Eyal Gordon, Adi Rosén. Competitive weighted throughput analysis of greedy protocols on DAGs
    0 -- 0Conrado Martínez, Daniel Panario, Alfredo Viola. Adaptive sampling strategies for quickselects
    0 -- 0Amit Chakrabarti, Graham Cormode, Andrew McGregor. A near-optimal algorithm for estimating the entropy of a stream
    0 -- 0Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez. Approximating corridors and tours via restriction and relaxation techniques
    0 -- 0Joseph Naor, Roy Schwartz. The directed circular arrangement problem
    0 -- 0Yossi Azar, Shay Kutten, Boaz Patt-Shamir. Distributed error confinement
    0 -- 0Don Coppersmith, Lisa Fleischer, Atri Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments
    0 -- 0Noga Alon, Shai Gutner. Balanced families of perfect hash functions and their applications
    0 -- 0Virginia Vassilevska, Ryan Williams, Raphael Yuster. Finding heaviest ::::H::::-subgraphs in real weighted graphs, with applications
    0 -- 0Frank Ruskey, Aaron Williams. An explicit universal cycle for the (::::n::::-1)-permutations of an ::::n::::-set
    0 -- 0Matthew Drescher, Adrian Vetta. An approximation algorithm for the maximum leaf spanning arborescence problem

    Volume 6, Issue 2

    0 -- 0Nikhil Bansal, Ning Chen, Neva Cherniavsky, Atri Rudra, Baruch Schieber, Maxim Sviridenko. Dynamic pricing for impatient bidders
    0 -- 0Philip N. Klein, Shay Mozes, Oren Weimann. Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithm
    0 -- 0Funda Ergün, S. Muthukrishnan, Süleyman Cenk Sahinalp. Periodicity testing with sublinear samples and space
    0 -- 0Bruce A. Bobier, Joe Sawada. A fast algorithm to generate open meandric systems and meanders
    0 -- 0Claire Mathieu. Foreword to special issue SODA 2009
    0 -- 0Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi. Dial a Ride from ::::k::::-forest
    0 -- 0George Christodoulou, Elias Koutsoupias, Annamária Kovács. Mechanism design for fractional scheduling on unrelated machines
    0 -- 0Benjamin Aminof, Orna Kupferman, Robby Lampert. Reasoning about online algorithms with weighted automata
    0 -- 0Ayelet Butman, Danny Hermelin, Moshe Lewenstein, Dror Rawitz. Optimization problems in multiple-interval graphs
    0 -- 0Timothy M. Chan. Comparison-based time-space lower bounds for selection
    0 -- 0Alon Shalita, Uri Zwick. Efficient algorithms for the 2-gathering problem
    0 -- 0Dániel Marx. Approximating fractional hypertree width
    0 -- 0Ashish Goel, Michael Kapralov, Sanjeev Khanna. Perfect matchings via uniform sampling in regular bipartite graphs
    0 -- 0Amos Korman. Labeling schemes for vertex connectivity
    0 -- 0Zoya Svitkina, Éva Tardos. Facility location with hierarchical facility costs
    0 -- 0Konstantinos Panagiotou, Angelika Steger. Maximal biconnected subgraphs of random planar graphs
    0 -- 0Yossi Azar, Iftah Gamzu, Shai Gutner. Truthful unsplittable flow for large capacity networks
    0 -- 0James Aspnes, Keren Censor. Approximate shared-memory counting despite a strong adversary
    0 -- 0Omid Madani, Mikkel Thorup, Uri Zwick. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
    0 -- 0Susanne Albers. Editorial Note
    0 -- 0Sergio Cabello. Finding shortest contractible and shortest separating cycles in embedded graphs

    Volume 6, Issue 1

    0 -- 0László Babai, Pedro F. Felzenszwalb. Computing rank-convolutions with a mask
    0 -- 0Amalia Duch, Conrado Martínez. Updating relaxed ::::K::::-d trees
    0 -- 0Philip Bille, Rolf Fagerberg, Inge Li Gørtz. Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
    0 -- 0Camil Demetrescu, Irene Finocchi, Andrea Ribichini. Trading off space for passes in graph streaming problems
    0 -- 0Konstantin Andreev, Charles Garrod, Daniel Golovin, Bruce M. Maggs, Adam Meyerson. Simultaneous source location
    0 -- 0Erik D. Demaine, Shay Mozes, Benjamin Rossman, Oren Weimann. An optimal decomposition algorithm for tree edit distance
    0 -- 0Zeev Nutov. Approximating connectivity augmentation problems
    0 -- 0Luca Becchetti, Alberto Marchetti-Spaccamela, Andrea Vitaletti, Peter Korteweg, Martin Skutella, Leen Stougie. Latency-constrained aggregation in sensor networks
    0 -- 0Wolfgang W. Bein, Mordecai J. Golin, Lawrence L. Larmore, Yan Zhang. The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
    0 -- 0Refael Hassin, Asaf Levin, Maxim Sviridenko. Approximating the minimum quadratic assignment problems
    0 -- 0Iftah Gamzu, Danny Segev. Improved online algorithms for the sorting buffer problem on line metrics
    0 -- 0Kurt Mehlhorn, Dimitrios Michail. Minimum cycle bases: Faster and simpler
    0 -- 0Rami Cohen, Dror Rawitz, Danny Raz. Time-dependent multi-scheduling of multicast
    0 -- 0Ho-Leung Chan, Joseph Wun-Tat Chan, Tak Wah Lam, Lap-Kei Lee, Kin-Sum Mak, Prudence W. H. Wong. Optimizing throughput and energy in online deadline scheduling
    0 -- 0Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano. Resilient dictionaries
    0 -- 0Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca. Exponential time algorithms for the minimum dominating set problem on some graph classes
    0 -- 0Gorjan Alagic, Cristopher Moore, Alexander Russell. Quantum algorithms for Simon s problem over nonabelian groups
    0 -- 0Seth Pettie. Low distortion spanners
    0 -- 0F. Thomas Bruss, Guy Louchard, Mark Daniel Ward. Inverse auctions: Injecting unique minima into random sets
    0 -- 0David Hay, Gabriel Scalosub. Jitter regulation for multiple streams
    0 -- 0Noga Alon, Yossi Azar, Shai Gutner. Admission control to minimize rejections and online set cover with repetitions
    runs on