Table of Contents

• Fast dimension reduction using Rademacher series on dual BCH codesNir Ailon, Edo Liberty. 1-9 [doi]
• Estimators and tail bounds for dimension reduction in ::::l::::α (0 < α ≤ 2) using stable random projectionsPing Li. 10-19 [doi]
• A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methodsMark A. Iwen. 20-29 [doi]
• Explicit constructions for compressed sensing of sparse signalsPiotr Indyk. 30-33 [doi]
• Improved distance sensitivity oracles via random samplingAaron Bernstein, David R. Karger. 34-43 [doi]
• Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimizationS. Thomas McCormick, Satoru Fujishige. 44-53 [doi]
• Holographic algorithms with unsymmetric signaturesJin-yi Cai, Pinyan Lu. 54-63 [doi]
• The UGC hardness threshold of the ℓ::::::p:::::: Grothendieck problemGuy Kindler, Assaf Naor, Gideon Schechtman. 64-73 [doi]
• Succinct approximate convex pareto curvesIlias Diakonikolas, Mihalis Yannakakis. 74-83 [doi]
• Efficient reductions among lattice problemsDaniele Micciancio. 84-93 [doi]
• Delaunay graphs of point sets in the plane with respect to axis-parallel rectanglesXiaomin Chen, János Pach, Mario Szegedy, Gábor Tardos. 94-101 [doi]
• Greedy drawings of triangulationsRaghavan Dhandapani. 102-111 [doi]
• Maintaining deforming surface meshesSiu-Wing Cheng, Tamal K. Dey. 112-121 [doi]
• Exact and efficient 2D-arrangements of arbitrary algebraic curvesArno Eigenwillig, Michael Kerber. 122-131 [doi]
• On properties of random dissections and triangulationsNicla Bernasconi, Konstantinos Panagiotou, Angelika Steger. 132-141 [doi]
• Graph algorithms for biological systems analysisBonnie Berger, Rohit Singh, Jinbo Xu. 142-151 [doi]
• Adaptive local ratioJulián Mestre. 152-160 [doi]
• Two-phase greedy algorithms for some classes of combinatorial linear programsUlrich Faigle, Britta Peis. 161-166 [doi]
• Analysis of greedy approximations with nonsubmodular potential functionsDing-Zhu Du, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao. 167-175 [doi]
• Yet another algorithm for dense max cut: go greedyClaire Mathieu, Warren Schudy. 176-182 [doi]
• Computing large matchings fastIgnaz Rutter, Alexander Wolff. 183-192 [doi]
• A fractional model of the border gateway protocol (BGP)Penny E. Haxell, Gordon T. Wilfong. 193-199 [doi]
• Minimizing average latency in oblivious routingPrahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Räcke, Jaikumar Radhakrishnan. 200-207 [doi]
• Distributed broadcast in unknown radio networksGianluca De Marco. 208-217 [doi]
• The power of memory in randomized broadcastingRobert Elsässer, Thomas Sauerwald. 218-227 [doi]
• Competitive queue management for latency sensitive packetsAmos Fiat, Yishay Mansour, Uri Nadav. 228-237 [doi]
• Rapid mixing of Gibbs sampling on graphs that are sparse on averageElchanan Mossel, Allan Sly. 238-247 [doi]
• Product growth and mixing in finite groupsLászló Babai, Nikolay Nikolov, László Pyber. 248-257 [doi]
• Concatenated codes can achieve list-decoding capacityVenkatesan Guruswami, Atri Rudra. 258-267 [doi]
• Noisy sorting without resamplingMark Braverman, Elchanan Mossel. 268-276 [doi]
• Algorithms for the coalitional manipulation problemMichael Zuckerman, Ariel D. Procaccia, Jeffrey S. Rosenschein. 277-286 [doi]
• On allocations that maximize fairnessUriel Feige. 287-293 [doi]
• On the value of coordination in network designSusanne Albers. 294-303 [doi]
• Auctions for structured procurementMatthew Cary, Abraham D. Flaxman, Jason D. Hartline, Anna R. Karlin. 304-313 [doi]
• Fast load balancing via bounded best responseBaruch Awerbuch, Yossi Azar, Rohit Khandekar. 314-322 [doi]
• (Almost) optimal coordination mechanisms for unrelated machine schedulingYossi Azar, Kamal Jain, Vahab S. Mirrokni. 323-332 [doi]
• Ultra-low-dimensional embeddings for doubling metricsT.-H. Hubert Chan, Anupam Gupta, Kunal Talwar. 333-342 [doi]
• Earth mover distance over high-dimensional spacesAlexandr Andoni, Piotr Indyk, Robert Krauthgamer. 343-352 [doi]
• Almost Euclidean subspaces of l:::N:::::1:: via expander codesVenkatesan Guruswami, James R. Lee, Alexander A. Razborov. 353-362 [doi]
• Embedding metric spaces in their intrinsic dimensionIttai Abraham, Yair Bartal, Ofer Neiman. 363-372 [doi]
• Optimal universal graphs with deterministic embeddingNoga Alon, Michael R. Capalbo. 373-378 [doi]
• Fast and reliable reconstruction of phylogenetic trees with very short edgesIlan Gronau, Shlomo Moran, Sagi Snir. 379-388 [doi]
• Trace reconstruction with constant deletion probability and related resultsThomas Holenstein, Michael Mitzenmacher, Rina Panigrahy, Udi Wieder. 389-398 [doi]
• Improved string reconstruction over insertion-deletion channelsKrishnamurthy Viswanathan, Ram Swaminathan. 399-408 [doi]
• Dimension augmentation and combinatorial criteria for efficient error-resistant DNA self-assemblyHo-Lin Chen, Ashish Goel, Chris Luhrs. 409-418 [doi]
• Approximating general metric distances between a pattern and a textEly Porat, Klim Efremenko. 419-427 [doi]
• A near-linear time algorithm for computing replacement paths in planar directed graphsYuval Emek, David Peleg, Liam Roditty. 428-435 [doi]
• Bounded-leg distance and reachability oraclesRan Duan, Seth Pettie. 436-445 [doi]
• A nearly linear time algorithm for the half integral disjoint paths packingKen-ichi Kawarabayashi, Bruce A. Reed. 446-454 [doi]
• Fast edge splitting and Edmonds arborescence construction for unweighted graphsAnand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi. 455-464 [doi]
• Nondecreasing paths in a weighted graph or: how to optimally read a train scheduleVirginia Vassilevska. 465-472 [doi]
• Broadcast scheduling: algorithms and complexityJessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller. 473-482 [doi]
• Graph balancing: a special case of scheduling unrelated parallel machinesTomás Ebenlendr, Marek Krcal, Jiri Sgall. 483-490 [doi]
• Non-clairvoyant scheduling with precedence constraintsJulien Robert, Nicolas Schabanel. 491-500 [doi]
• Provably good multicore cache performance for divide-and-conquer algorithmsGuy E. Blelloch, Rezaul Alam Chowdhury, Phillip B. Gibbons, Vijaya Ramachandran, Shimin Chen, Michael Kozuch. 501-510 [doi]
• Balls and bins with structure: balanced allocations on hypergraphsBrighten Godfrey. 511-517 [doi]
• Arc-disjoint in-trees in directed graphsNaoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa. 518-526 [doi]
• Finding one tight cycleSergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar. 527-531 [doi]
• Set connectivity problems in undirected graphs and the directed Steiner network problemChandra Chekuri, Guy Even, Anupam Gupta, Danny Segev. 532-541 [doi]
• Matroid intersection, pointer chasing, and Young s seminormal representation of ::::S::n::::::Nicholas J. A. Harvey. 542-549 [doi]
• Iterated rounding algorithms for the smallest ::::k::::-edge connected spanning subgraphHarold N. Gabow, Suzanne Gallagher. 550-559 [doi]
• Shuffling cards, adding numbers, and symmetric functionsPersi Diaconis. 560 [doi]
• On the bichromatic ::::k::::-set problemTimothy M. Chan. 561-570 [doi]
• Geodesic Delaunay triangulation and witness complex in the planeJie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang. 571-580 [doi]
• Minimum weight convex Steiner partitionsAdrian Dumitrescu, Csaba D. Tóth. 581-590 [doi]
• Improved algorithms for fully dynamic geometric spanners and geometric routingLee-Ad Gottlieb, Liam Roditty. 591-600 [doi]
• On the connectivity of dynamic random geometric graphsJosep Díaz, Dieter Mitsche, Xavier Pérez-Giménez. 601-610 [doi]
• Improved algorithmic versions of the Lovász Local LemmaAravind Srinivasan. 611-620 [doi]
• L(2, 1)-labelling of graphsFrédéric Havet, Bruce A. Reed, Jean-Sébastien Sereni. 621-630 [doi]
• Catalan structures and dynamic programming in ::::H::::-minor-free graphsFrederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. 631-640 [doi]
• Computing excluded minorsIsolde Adler, Martin Grohe, Stephan Kreutzer. 641-650 [doi]
• An algorithm for improving graph partitionsReid Andersen, Kevin J. Lang. 651-660 [doi]
• Improved algorithms for orienteering and related problemsChandra Chekuri, Nitish Korula, Martin Pál. 661-670 [doi]
• Approximation algorithms for labeling hierarchical taxonomiesYuval Rabani, Leonard J. Schulman, Chaitanya Swamy. 671-680 [doi]
• Fast approximation of the permanent for very dense problemsMark Huber, Jenny Law. 681-689 [doi]
• Approximating TSP on metrics with bounded global growthT.-H. Hubert Chan, Anupam Gupta. 690-699 [doi]
• Fully polynomial time approximation schemes for stochastic dynamic programsNir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi. 700-709 [doi]
• On distributing symmetric streaming computationsJon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, Zoya Svitkina. 710-719 [doi]
• Tight lower bounds for selection in randomly ordered streamsAmit Chakrabarti, T. S. Jayram, Mihai Patrascu. 720-729 [doi]
• On distance to monotonicity and longest increasing subsequence of a data streamFunda Ergün, Hossein Jowhari. 730-736 [doi]
• Declaring independence via the sketching of sketchesPiotr Indyk, Andrew McGregor. 737-745 [doi]
• Why simple hash functions work: exploiting the entropy in a data streamMichael Mitzenmacher, Salil P. Vadhan. 746-755 [doi]
• Maximum overhangMike Paterson, Yuval Peres, Mikkel Thorup, Peter Winkler, Uri Zwick. 756-765 [doi]
• Deterministic random walks on regular treesJoshua N. Cooper, Benjamin Doerr, Tobias Friedrich, Joel Spencer. 766-772 [doi]
• Quasirandom rumor spreadingBenjamin Doerr, Tobias Friedrich, Thomas Sauerwald. 773-781 [doi]
• Universality of random graphsDomingos Dellamonica Jr., Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski. 782-788 [doi]
• The effect of induced subgraphs on quasi-randomnessAsaf Shapira, Raphael Yuster. 789-798 [doi]
• Clustering for metric and non-metric distance measuresMarcel R. Ackermann, Johannes Blömer, Christian Sohler. 799-808 [doi]
• Metric clustering via consistent labelingRobert Krauthgamer, Tim Roughgarden. 809-818 [doi]
• On clustering to minimize the sum of radiiMatt Gibson, Gaurav Kanade, Erik Krohn, Imran A. Pirwani, Kasturi R. Varadarajan. 819-825 [doi]
• A constant factor approximation algorithm for ::::k::::-median clustering with outliersKe Chen. 826-835 [doi]
• Geometric clustering: fixed-parameter tractability and lower bounds with respect to the dimensionSergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote. 836-843 [doi]
• The complexity of game dynamics: BGP oscillations, sink equilibria, and beyondAlex Fabrikant, Christos H. Papadimitriou. 844-853 [doi]
• Designing networks with good equilibriaHo-Lin Chen, Tim Roughgarden, Gregory Valiant. 854-863 [doi]
• Ascending auctions for integral (poly)matroids with concave nondecreasing separable valuesSushil Bikhchandani, Sven de Vries, James Schummer, Rakesh V. Vohra. 864-873 [doi]
• Fast algorithms for finding proper strategies in game treesPeter Bro Miltersen, Troels Bjerre Sørensen. 874-883 [doi]
• Incentive compatible regression learningOfer Dekel, Felix A. Fischer, Ariel D. Procaccia. 884-893 [doi]
• Space-efficient dynamic orthogonal point location, segment intersection, and range reportingGuy E. Blelloch. 894-903 [doi]
• In-place 2-d nearest neighbor searchTimothy M. Chan, Eric Y. Chen. 904-911 [doi]
• Distribution-sensitive point location in convex subdivisionsSébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin. 912-921 [doi]
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithmKenneth L. Clarkson. 922-931 [doi]
• Sampling algorithms and coresets for ℓ::::::p:::::: regressionAnirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney. 932-941 [doi]
• Stochastic analyses for online combinatorial optimization problemsNaveen Garg, Anupam Gupta, Stefano Leonardi, Piotr Sankowski. 942-951 [doi]
• Online make-to-order joint replenishment model: primal dual competitive algorithmsNiv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko. 952-961 [doi]
• Parallel monotonicity reconstructionMichael E. Saks, C. Seshadhri. 962-971 [doi]
• Better bounds for online load balancing on unrelated machinesIoannis Caragiannis. 972-981 [doi]
• Online budgeted matching in random input models with applications to AdwordsGagan Goel, Aranyak Mehta. 982-991 [doi]
• Computational advertisingAndrei Z. Broder. 992 [doi]
• Linked decompositions of networks and the power of choice in Polya urnsHenry Lin, Christos Amanatidis, Martha Sideri, Richard M. Karp, Christos H. Papadimitriou. 993-1002 [doi]
• A local algorithm for finding dense subgraphsReid Andersen. 1003-1009 [doi]
• PageRank and the random surfer modelPrasad Chebolu, Páll Melsted. 1010-1018 [doi]
• Charity auctions on social networksArpita Ghosh, Mohammad Mahdian. 1019-1028 [doi]
• On the approximability of influence in social networksNing Chen. 1029-1037 [doi]
• Fast asynchronous byzantine agreement and leader election with full informationBruce M. Kapron, David Kempe, Valerie King, Jared Saia, Vishal Sanwalani. 1038-1047 [doi]
• Unconditionally reliable message transmission in directed networksBhavani Shankar, Prasant Gopal, Kannan Srinathan, C. Pandu Rangan. 1048-1055 [doi]
• A tight lower bound for parity in noisy communication networksChinmoy Dutta, Yashodhan Kanoria, D. Manjunath, Jaikumar Radhakrishnan. 1056-1065 [doi]
• Ranged hash functions and the price of churnJames Aspnes, Muli Safra, Yitong Yin. 1066-1075 [doi]
• Algorithms for distributed functional monitoringGraham Cormode, S. Muthukrishnan, Ke Yi. 1076-1085 [doi]
• Real-time indexing over fixed finite alphabetsAmihood Amir, Igor Nor. 1086-1095 [doi]
• Finding an optimal tree searching strategy in linear timeShay Mozes, Krzysztof Onak, Oren Weimann. 1096-1105 [doi]
• Dynamic optimality for skip lists and B-treesProsenjit Bose, Karim Douïeb, Stefan Langerman. 1106-1114 [doi]
• Splay trees, Davenport-Schinzel sequences, and the deque conjectureSeth Pettie. 1115-1124 [doi]
• Fully dynamic algorithm for graph spanners with poly-logarithmic update timeSurender Baswana, Soumojit Sarkar. 1125-1134 [doi]
• SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systemsMario Mense, Christian Scheideler. 1135-1144 [doi]
• Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilitiesAshish Goel, Hamid Nazerzadeh. 1145-1153 [doi]
• Lower-bounded facility locationZoya Svitkina. 1154-1163 [doi]
• A plant location guide for the unsureBarbara M. Anthony, Vineet Goyal, Anupam Gupta, Viswanath Nagarajan. 1164-1173 [doi]
• Approximating connected facility location problems via random facility sampling and core detouringFriedrich Eisenbrand, Fabrizio Grandoni, Thomas Rothvoß, Guido Schäfer. 1174-1183 [doi]
• The hiring problem and Lake Wobegon strategiesAndrei Z. Broder, Adam Kirsch, Ravi Kumar, Michael Mitzenmacher, Eli Upfal, Sergei Vassilvitskii. 1184-1193 [doi]
• Weak ε-nets and interval chainsNoga Alon, Haim Kaplan, Gabriel Nivasch, Micha Sharir, Shakhar Smorodinsky. 1194-1203 [doi]
• Robust cost coloringsTakuro Fukunaga, Magnús M. Halldórsson, Hiroshi Nagamochi. 1204-1212 [doi]
• Comparing the strength of query types in property testing: the case of testing ::::k::::-colorabilityIdo Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron. 1213-1222 [doi]
• Sampling stable marriages: why spouse-swapping won t workNayantara Bhatnagar, Sam Greenberg, Dana Randall. 1223-1232 [doi]
• On stars and Steiner starsAdrian Dumitrescu, Csaba D. Tóth. 1233-1240 [doi]
• Cutting cycles of rods in space: hardness and approximationBoris Aronov, Mark de Berg, Chris Gray, Elena Mumford. 1241-1248 [doi]
• Empty-ellipse graphsOlivier Devillers, Jeff Erickson, Xavier Goaoc. 1249-1257 [doi]
• Recognizing partial cubes in quadratic timeDavid Eppstein. 1258-1266 [doi]
• Approximating geometric coverage problemsThomas Erlebach, Erik Jan van Leeuwen. 1267-1276 [doi]