@Proceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2014,
title = {{LIPIcs, Volume 28, APPROX/RANDOM'14, Complete Volume}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014},
URN = {urn:nbn:de:0030-drops-47603},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014},
annote = {Keywords: Network Architecture and Design, Computer-communication, Coding and Information Theory, Theory of Computation, Computation by Abstract Devices, Models of Computation – relations between models, Modes of Computation, Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity}
}
@InProceedings{jansen_et_al:LIPIcs.APPROX-RANDOM.2014.i,
author = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
title = {{Frontmatter, Table of Contents, Preface, Conference Organization}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {i--xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.i},
URN = {urn:nbn:de:0030-drops-46846},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.i},
annote = {Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{abraham_et_al:LIPIcs.APPROX-RANDOM.2014.1,
author = {Abraham, Ittai and Chechik, Shiri and Talwar, Kunal},
title = {{Fully Dynamic All-Pairs Shortest Paths: Breaking the O(n) Barrier}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {1--16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.1},
URN = {urn:nbn:de:0030-drops-46857},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.1},
annote = {Keywords: Shortest Paths, Dynamic Algorithms}
}
@InProceedings{ahmadian_et_al:LIPIcs.APPROX-RANDOM.2014.17,
author = {Ahmadian, Sara and Behsaz, Babak and Friggstad, Zachary and Jorati, Amin and Salavatipour, Mohammad R. and Swamy, Chaitanya},
title = {{Approximation Algorithms for Minimum-Load k-Facility Location}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {17--33},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.17},
URN = {urn:nbn:de:0030-drops-47154},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.17},
annote = {Keywords: approximation algorithms, min-max star cover, facility location, line metrics}
}
@InProceedings{alon_et_al:LIPIcs.APPROX-RANDOM.2014.34,
author = {Alon, Noga and Lee, Troy and Shraibman, Adi},
title = {{The Cover Number of a Matrix and its Algorithmic Applications}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {34--47},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.34},
URN = {urn:nbn:de:0030-drops-46865},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.34},
annote = {Keywords: Approximation algorithms, Approximate Nash equilibria, Cover number, VC dimension}
}
@InProceedings{barman_et_al:LIPIcs.APPROX-RANDOM.2014.48,
author = {Barman, Siddharth and Chawla, Shuchi and Umboh, Seeun},
title = {{Network Design with Coverage Costs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {48--63},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.48},
URN = {urn:nbn:de:0030-drops-46876},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.48},
annote = {Keywords: Network Design, Spanner, Primal Dual Method, Traffic Redundancy}
}
@InProceedings{bhawalkar_et_al:LIPIcs.APPROX-RANDOM.2014.64,
author = {Bhawalkar, Kshipra and Gollapudi, Sreenivas and Panigrahi, Debmalya},
title = {{Online Set Cover with Set Requests}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {64--79},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.64},
URN = {urn:nbn:de:0030-drops-46883},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.64},
annote = {Keywords: Online Algorithms, Set Cover}
}
@InProceedings{chlamtac_et_al:LIPIcs.APPROX-RANDOM.2014.80,
author = {Chlamt\'{a}c, Eden and Dinitz, Michael},
title = {{Lowest Degree k-Spanner: Approximation and Hardness}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {80--95},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.80},
URN = {urn:nbn:de:0030-drops-46894},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.80},
annote = {Keywords: Graph spanners, approximation algorithms, hardness of approximation}
}
@InProceedings{crouch_et_al:LIPIcs.APPROX-RANDOM.2014.96,
author = {Crouch, Michael and Stubbs, Daniel M.},
title = {{Improved Streaming Algorithms for Weighted Matching, via Unweighted Matching}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {96--104},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.96},
URN = {urn:nbn:de:0030-drops-46907},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.96},
annote = {Keywords: Streaming Algorithms, Graph Matching, Weighted Graph Matching, MapReduce, Independence Systems}
}
@InProceedings{deshpande_et_al:LIPIcs.APPROX-RANDOM.2014.105,
author = {Deshpande, Amit and Venkat, Rakesh},
title = {{Guruswami-Sinop Rounding without Higher Level Lasserre}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {105--114},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.105},
URN = {urn:nbn:de:0030-drops-46911},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.105},
annote = {Keywords: Sparsest Cut, Lasserre Hierarchy, Metric embeddings}
}
@InProceedings{dinitz_et_al:LIPIcs.APPROX-RANDOM.2014.115,
author = {Dinitz, Michael and Kortsarz, Guy and Nutov, Zeev},
title = {{Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {115--127},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
URN = {urn:nbn:de:0030-drops-46925},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.115},
annote = {Keywords: k-Steiner Forest; Uniform weights; Densest k-Subgraph; Approximation algorithms}
}
@InProceedings{dumitrescu_et_al:LIPIcs.APPROX-RANDOM.2014.128,
author = {Dumitrescu, Adrian and Jiang, Minghui and T\'{o}th, Csaba D.},
title = {{Computing Opaque Interior Barriers \`{a} la Shermer}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {128--143},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.128},
URN = {urn:nbn:de:0030-drops-46938},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.128},
annote = {Keywords: Opaque barrier, approximation algorithm, isoperimetric inequality}
}
@InProceedings{ene_et_al:LIPIcs.APPROX-RANDOM.2014.144,
author = {Ene, Alina and Vondr\'{a}k, Jan},
title = {{Hardness of Submodular Cost Allocation: Lattice Matching and a Simplex Coloring Conjecture}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {144--159},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.144},
URN = {urn:nbn:de:0030-drops-46943},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.144},
annote = {Keywords: Minimum Cost Submodular Allocation, Submodular Optimization, Hypergraph Labeling}
}
@InProceedings{feldman_et_al:LIPIcs.APPROX-RANDOM.2014.160,
author = {Feldman, Moran and Izsak, Rani},
title = {{Constrained Monotone Function Maximization and the Supermodular Degree}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {160--175},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.160},
URN = {urn:nbn:de:0030-drops-46950},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.160},
annote = {Keywords: supermodular degree, set function, submodular, matroid, extendible system}
}
@InProceedings{feldmann_et_al:LIPIcs.APPROX-RANDOM.2014.176,
author = {Feldmann, Andreas Emil and K\"{o}nemann, Jochen and Olver, Neil and Sanit\`{a}, Laura},
title = {{On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {176--191},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.176},
URN = {urn:nbn:de:0030-drops-46962},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.176},
annote = {Keywords: Steiner tree, bidirected cut relaxation, hypergraphic relaxation, polyhedral equivalence, approximation algorithms}
}
@InProceedings{feldman_et_al:LIPIcs.APPROX-RANDOM.2014.192,
author = {Feldman, Michal and Immorlica, Nicole and Lucier, Brendan and Weinberg, S. Matthew},
title = {{Reaching Consensus via Non-Bayesian Asynchronous Learning in Social Networks}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {192--208},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.192},
URN = {urn:nbn:de:0030-drops-46976},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.192},
annote = {Keywords: Information Cascades, Social Networks, non-Bayesian Asynchronous Learning, Expander Graphs, Stochastic Processes}
}
@InProceedings{fukunaga_et_al:LIPIcs.APPROX-RANDOM.2014.209,
author = {Fukunaga, Takuro and Nikzad, Afshin and Ravi, R.},
title = {{Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {209--225},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.209},
URN = {urn:nbn:de:0030-drops-46985},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.209},
annote = {Keywords: Inventry Routing Problem, Approximation algorithm, Prize-collecting Steiner Tree}
}
@InProceedings{gairing_et_al:LIPIcs.APPROX-RANDOM.2014.226,
author = {Gairing, Martin and Harks, Tobias and Klimm, Max},
title = {{Complexity and Approximation of the Continuous Network Design Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {226--241},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.226},
URN = {urn:nbn:de:0030-drops-46998},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.226},
annote = {Keywords: Bilevel optimization, Optimization under equilibrium constraints, Network design, Wardrop equilibrium, Computational complexity, Approximation algorit}
}
@InProceedings{hansknecht_et_al:LIPIcs.APPROX-RANDOM.2014.242,
author = {Hansknecht, Christoph and Klimm, Max and Skopalik, Alexander},
title = {{Approximate Pure Nash Equilibria in Weighted Congestion Games}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {242--257},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.242},
URN = {urn:nbn:de:0030-drops-47005},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.242},
annote = {Keywords: Congestion game, Pure Nash equilibrium, Approximate equilibrium, Existence, Potential function}
}
@InProceedings{harvey_et_al:LIPIcs.APPROX-RANDOM.2014.258,
author = {Harvey, Nicholas J. A. and Schwartz, Roy and Singh, Mohit},
title = {{Discrepancy Without Partial Colorings}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {258--273},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.258},
URN = {urn:nbn:de:0030-drops-47014},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.258},
annote = {Keywords: Combinatorial Discrepancy, Brownian Motion, Semi-Definite Programming, Randomized Algorithm}
}
@InProceedings{jozeph:LIPIcs.APPROX-RANDOM.2014.274,
author = {Jozeph, Shlomo},
title = {{Universal Factor Graphs for Every NP-Hard Boolean CSP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {274--283},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.274},
URN = {urn:nbn:de:0030-drops-47021},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.274},
annote = {Keywords: Hardness of Approximation, Hardness with Preprocessing}
}
@InProceedings{karp_et_al:LIPIcs.APPROX-RANDOM.2014.284,
author = {Karp, Jeremy A. and Ravi, R.},
title = {{A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {284--296},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.284},
URN = {urn:nbn:de:0030-drops-47034},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.284},
annote = {Keywords: Approximation algorithms, traveling salesman problem, Barnette’s conjecture, combinatorial optimization}
}
@InProceedings{kolliopoulos_et_al:LIPIcs.APPROX-RANDOM.2014.297,
author = {Kolliopoulos, Stavros G. and Moysoglou, Yannis},
title = {{Sherali-Adams Gaps, Flow-cover Inequalities and Generalized Configurations for Capacity-constrained Facility Location}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {297--312},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.297},
URN = {urn:nbn:de:0030-drops-47046},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.297},
annote = {Keywords: Approximation Algorithms, Linear Programming, Facility Location}
}
@InProceedings{kwok_et_al:LIPIcs.APPROX-RANDOM.2014.313,
author = {Kwok, Tsz Chiu and Lau, Lap Chi},
title = {{Lower Bounds on Expansions of Graph Powers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {313--324},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.313},
URN = {urn:nbn:de:0030-drops-47057},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.313},
annote = {Keywords: Conductance, Expansion, Graph power, Random walk}
}
@InProceedings{li:LIPIcs.APPROX-RANDOM.2014.325,
author = {Li, Shanfei},
title = {{An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {325--338},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.325},
URN = {urn:nbn:de:0030-drops-47062},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.325},
annote = {Keywords: Approximation algorithm; k-median problem; LP-rounding; Hard capacities}
}
@InProceedings{louis_et_al:LIPIcs.APPROX-RANDOM.2014.339,
author = {Louis, Anand and Makarychev, Yury},
title = {{Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {339--355},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.339},
URN = {urn:nbn:de:0030-drops-47079},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.339},
annote = {Keywords: Approximation Algorithms, Graph Expansion, Hypergraph Expansion, Vertex Expansion}
}
@InProceedings{mittal_et_al:LIPIcs.APPROX-RANDOM.2014.356,
author = {Mittal, Shashi and Schulz, Andreas S. and Stiller, Sebastian},
title = {{Robust Appointment Scheduling}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {356--370},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.356},
URN = {urn:nbn:de:0030-drops-47089},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.356},
annote = {Keywords: Robust Optimization, Health Care Scheduling, Approximation Algorithms}
}
@InProceedings{natarajan_et_al:LIPIcs.APPROX-RANDOM.2014.371,
author = {Natarajan, Abhiram and Wu, Yi},
title = {{Computational Complexity of Certifying Restricted Isometry Property}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {371--380},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.371},
URN = {urn:nbn:de:0030-drops-47092},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.371},
annote = {Keywords: Restricted Isometry Property, RIP, RIP Certification, Sparse Cheeger Inequality, SSE Hard}
}
@InProceedings{raghavendra_et_al:LIPIcs.APPROX-RANDOM.2014.381,
author = {Raghavendra, Prasad and Schramm, Tselil},
title = {{Gap Amplification for Small-Set Expansion via Random Walks}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {381--391},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.381},
URN = {urn:nbn:de:0030-drops-47108},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.381},
annote = {Keywords: Gap amplification, Small-Set Expansion, random walks, graph products, Unique Games}
}
@InProceedings{soper_et_al:LIPIcs.APPROX-RANDOM.2014.392,
author = {Soper, Alan J. and Strusevich, Vitaly A.},
title = {{Power of Preemption on Uniform Parallel Machines}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {392--402},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.392},
URN = {urn:nbn:de:0030-drops-47116},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.392},
annote = {Keywords: Machine Scheduling, Uniform Parallel Machines, Power of Preemption}
}
@InProceedings{swamy:LIPIcs.APPROX-RANDOM.2014.403,
author = {Swamy, Chaitanya},
title = {{Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {403--418},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.403},
URN = {urn:nbn:de:0030-drops-47125},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.403},
annote = {Keywords: Approximation algorithms, LP rounding, facility location, matroid and submodular polyhedra, knapsack constraints}
}
@InProceedings{tamaki_et_al:LIPIcs.APPROX-RANDOM.2014.419,
author = {Tamaki, Suguru and Yoshida, Yuichi},
title = {{Robust Approximation of Temporal CSP}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {419--432},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.419},
URN = {urn:nbn:de:0030-drops-47135},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.419},
annote = {Keywords: constraint satisfaction, maximum satisfiability, approximation algorithm, hardness of approximation, infinite domain}
}
@InProceedings{wenner:LIPIcs.APPROX-RANDOM.2014.433,
author = {Wenner, Cenny},
title = {{Parity is Positively Useless}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {433--448},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.433},
URN = {urn:nbn:de:0030-drops-47144},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.433},
annote = {Keywords: Approximation hardness, approximation resistance, parity, usefulness, negations, monotone, constraint satisfaction problems, smoothness, multilayer, L}
}
@InProceedings{bapst_et_al:LIPIcs.APPROX-RANDOM.2014.449,
author = {Bapst, Victor and Coja-Oghlan, Amin and Hetterich, Samuel and Ra{\ss}mann, Felicia and Vilenchik, Dan},
title = {{The Condensation Phase Transition in Random Graph Coloring}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {449--464},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.449},
URN = {urn:nbn:de:0030-drops-47168},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.449},
annote = {Keywords: random graphs, graph coloring, phase transitions, message-passing algorithm}
}
@InProceedings{blais_et_al:LIPIcs.APPROX-RANDOM.2014.465,
author = {Blais, Eric and Brody, Joshua and Ghazi, Badih},
title = {{The Information Complexity of Hamming Distance}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {465--489},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.465},
URN = {urn:nbn:de:0030-drops-47174},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.465},
annote = {Keywords: Hamming distance, communication complexity, information complexity}
}
@InProceedings{bottcher_et_al:LIPIcs.APPROX-RANDOM.2014.490,
author = {B\"{o}ttcher, Julia and Hladk\'{y}, Jan and Piguet, Diana and Taraz, Anusch},
title = {{An Approximate Version of the Tree Packing Conjecture via Random Embeddings}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {490--499},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.490},
URN = {urn:nbn:de:0030-drops-47184},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.490},
annote = {Keywords: tree packing conjecture, Ringel’s conjecture, random walks, quasirandom graphs}
}
@InProceedings{bradonjic_et_al:LIPIcs.APPROX-RANDOM.2014.500,
author = {Bradonjic, Milan and Perkins, Will},
title = {{On Sharp Thresholds in Random Geometric Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {500--514},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.500},
URN = {urn:nbn:de:0030-drops-47195},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.500},
annote = {Keywords: Sharp thresholds, random geometric graphs, k-SAT}
}
@InProceedings{braun_et_al:LIPIcs.APPROX-RANDOM.2014.515,
author = {Braun, G\'{a}bor and Fiorini, Samuel and Pokutta, Sebastian},
title = {{Average Case Polyhedral Complexity of the Maximum Stable Set Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {515--530},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.515},
URN = {urn:nbn:de:0030-drops-47201},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.515},
annote = {Keywords: polyhedral approximation, extended formulation, stable sets}
}
@InProceedings{braverman_et_al:LIPIcs.APPROX-RANDOM.2014.531,
author = {Braverman, Vladimir and Katzman, Jonathan and Seidell, Charles and Vorsanger, Gregory},
title = {{An Optimal Algorithm for Large Frequency Moments Using O(n^(1-2/k)) Bits}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {531--544},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.531},
URN = {urn:nbn:de:0030-drops-47217},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.531},
annote = {Keywords: Streaming Algorithms, Randomized Algorithms, Frequency Moments, Heavy Hitters}
}
@InProceedings{brody_et_al:LIPIcs.APPROX-RANDOM.2014.545,
author = {Brody, Joshua and Chakrabarti, Amit and Kondapally, Ranganath and Woodruff, David P. and Yaroslavtsev, Grigory},
title = {{Certifying Equality With Limited Interaction}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {545--581},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.545},
URN = {urn:nbn:de:0030-drops-47229},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.545},
annote = {Keywords: equality, communication complexity, information complexity}
}
@InProceedings{cai_et_al:LIPIcs.APPROX-RANDOM.2014.582,
author = {Cai, Jin-Yi and Galanis, Andreas and Goldberg, Leslie Ann and Guo, Heng and Jerrum, Mark and Stefankovic, Daniel and Vigoda, Eric},
title = {{#BIS-Hardness for 2-Spin Systems on Bipartite Bounded Degree Graphs in the Tree Non-uniqueness Region}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {582--595},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.582},
URN = {urn:nbn:de:0030-drops-47235},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.582},
annote = {Keywords: Spin systems, approximate counting, complexity, #BIS-hardness, phase transition}
}
@InProceedings{chattopadhyay_et_al:LIPIcs.APPROX-RANDOM.2014.596,
author = {Chattopadhyay, Arkadev and Saks, Michael E.},
title = {{The Power of Super-logarithmic Number of Players}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {596--603},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.596},
URN = {urn:nbn:de:0030-drops-47243},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.596},
annote = {Keywords: Communication complexity, Number-On-Forehead model, composed functions}
}
@InProceedings{chierichetti_et_al:LIPIcs.APPROX-RANDOM.2014.604,
author = {Chierichetti, Flavio and Dasgupta, Anirban and Kumar, Ravi and Lattanzi, Silvio},
title = {{On Reconstructing a Hidden Permutation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {604--617},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.604},
URN = {urn:nbn:de:0030-drops-47251},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.604},
annote = {Keywords: Mallows model; Rank aggregation; Reconstruction}
}
@InProceedings{cohen_et_al:LIPIcs.APPROX-RANDOM.2014.618,
author = {Cohen, Gil and Ganor, Anat and Raz, Ran},
title = {{Two Sides of the Coin Problem}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {618--629},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.618},
URN = {urn:nbn:de:0030-drops-47265},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.618},
annote = {Keywords: bounded depth circuits, read once branching programs, Santha-Vazirani sources, the coin problem}
}
@InProceedings{diaz_et_al:LIPIcs.APPROX-RANDOM.2014.630,
author = {D{\'\i}az, Josep and Goldberg, Leslie Ann and Richerby, David and Serna, Maria},
title = {{Absorption Time of the Moran Process}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {630--642},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.630},
URN = {urn:nbn:de:0030-drops-47279},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.630},
annote = {Keywords: Moran Process}
}
@InProceedings{dubey_et_al:LIPIcs.APPROX-RANDOM.2014.643,
author = {Dubey, Chandan and Holenstein, Thomas},
title = {{Sampling a Uniform Solution of a Quadratic Equation Modulo a Prime Power}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {643--653},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.643},
URN = {urn:nbn:de:0030-drops-47289},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.643},
annote = {Keywords: Quadratic Forms, Lattices, Modular, p-adic}
}
@InProceedings{francois_et_al:LIPIcs.APPROX-RANDOM.2014.654,
author = {Fran\c{c}ois, Nathana\"{e}l and Jain, Rahul and Magniez, Fr\'{e}d\'{e}ric},
title = {{Unidirectional Input/Output Streaming Complexity of Reversal and Sorting}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {654--668},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.654},
URN = {urn:nbn:de:0030-drops-47298},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.654},
annote = {Keywords: Streaming Algorithms, Multiple Streams, Reversal, Sorting}
}
@InProceedings{fu_et_al:LIPIcs.APPROX-RANDOM.2014.669,
author = {Fu, Hu and Kleinberg, Robert},
title = {{Improved Lower Bounds for Testing Triangle-freeness in Boolean Functions via Fast Matrix Multiplication}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {669--676},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.669},
URN = {urn:nbn:de:0030-drops-47304},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.669},
annote = {Keywords: Property testing, linear invariance, fast matrix multiplication, uniquely solvable puzzles}
}
@InProceedings{galanis_et_al:LIPIcs.APPROX-RANDOM.2014.677,
author = {Galanis, Andreas and Stefankovic, Daniel and Vigoda, Eric and Yang, Linji},
title = {{Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {677--691},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.677},
URN = {urn:nbn:de:0030-drops-47319},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.677},
annote = {Keywords: Ferromagnetic Potts model, approximate counting, spin systems, phase transition, random regular graphs}
}
@InProceedings{ganor_et_al:LIPIcs.APPROX-RANDOM.2014.692,
author = {Ganor, Anat and Raz, Ran},
title = {{Space Pseudorandom Generators by Communication Complexity Lower Bounds}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {692--703},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.692},
URN = {urn:nbn:de:0030-drops-47324},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.692},
annote = {Keywords: Communication complexity, Logspace, Pseudorandom generator}
}
@InProceedings{goldreich:LIPIcs.APPROX-RANDOM.2014.704,
author = {Goldreich, Oded},
title = {{On Multiple Input Problems in Property Testing}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {704--720},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.704},
URN = {urn:nbn:de:0030-drops-47336},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.704},
annote = {Keywords: Property Testing, Direct Sum Theorems, Direct Product Theorems, Adaptive vs Nonadaptive queries, One-Sided Error vs Two-Sided Error}
}
@InProceedings{goos_et_al:LIPIcs.APPROX-RANDOM.2014.721,
author = {G\"{o}\"{o}s, Mika and Watson, Thomas},
title = {{Communication Complexity of Set-Disjointness for All Probabilities}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {721--736},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.721},
URN = {urn:nbn:de:0030-drops-47342},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.721},
annote = {Keywords: Communication Complexity, Set-Disjointness, All Probabilities}
}
@InProceedings{guo_et_al:LIPIcs.APPROX-RANDOM.2014.737,
author = {Guo, Alan and Sudan, Madhu},
title = {{List Decoding Group Homomorphisms Between Supersolvable Groups}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {737--747},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.737},
URN = {urn:nbn:de:0030-drops-47359},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.737},
annote = {Keywords: Group theory, error-correcting codes, locally decodable codes}
}
@InProceedings{guruswami_et_al:LIPIcs.APPROX-RANDOM.2014.748,
author = {Guruswami, Venkatesan and Wang, Carol},
title = {{Evading Subspaces Over Large Fields and Explicit List-decodable Rank-metric Codes}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {748--761},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.748},
URN = {urn:nbn:de:0030-drops-47361},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.748},
annote = {Keywords: list-decoding, pseudorandomness, algebraic coding, explicit constructions}
}
@InProceedings{jayram_et_al:LIPIcs.APPROX-RANDOM.2014.762,
author = {Jayram, T. S. and Vondr\'{a}k, Jan},
title = {{Exchangeability and Realizability: De Finetti Theorems on Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {762--778},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.762},
URN = {urn:nbn:de:0030-drops-47375},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.762},
annote = {Keywords: exchangeability, de Finetti’s Theorem, spectral graph theory, regularity lemma}
}
@InProceedings{kanade_et_al:LIPIcs.APPROX-RANDOM.2014.779,
author = {Kanade, Varun and Mossel, Elchanan and Schramm, Tselil},
title = {{Global and Local Information in Clustering Labeled Block Models}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {779--792},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.779},
URN = {urn:nbn:de:0030-drops-47384},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.779},
annote = {Keywords: stochastic block models, information flow on trees}
}
@InProceedings{klivans_et_al:LIPIcs.APPROX-RANDOM.2014.793,
author = {Klivans, Adam and Kothari, Pravesh},
title = {{Embedding Hard Learning Problems Into Gaussian Space}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {793--809},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.793},
URN = {urn:nbn:de:0030-drops-47391},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.793},
annote = {Keywords: distribution-specific hardness of learning, gaussian space, halfspace-learning, agnostic learning}
}
@InProceedings{krivelevich_et_al:LIPIcs.APPROX-RANDOM.2014.810,
author = {Krivelevich, Michael and Reichman, Daniel and Samotij, Wojciech},
title = {{Smoothed Analysis on Connected Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {810--825},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.810},
URN = {urn:nbn:de:0030-drops-47407},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.810},
annote = {Keywords: Random walks and Markov chains, Random network models}
}
@InProceedings{levi_et_al:LIPIcs.APPROX-RANDOM.2014.826,
author = {Levi, Reut and Ron, Dana and Rubinfeld, Ronitt},
title = {{Local Algorithms for Sparse Spanning Graphs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {826--842},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.826},
URN = {urn:nbn:de:0030-drops-47410},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.826},
annote = {Keywords: local, spanning graph, sparse}
}
@InProceedings{liu_et_al:LIPIcs.APPROX-RANDOM.2014.843,
author = {Liu, Jingcheng and Lu, Pinyan and Zhang, Chihao},
title = {{The Complexity of Ferromagnetic Two-spin Systems with External Fields}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {843--856},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.843},
URN = {urn:nbn:de:0030-drops-47428},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.843},
annote = {Keywords: Spin System, #BIS-hard, FPRAS}
}
@InProceedings{mehrabian_et_al:LIPIcs.APPROX-RANDOM.2014.857,
author = {Mehrabian, Abbas and Wormald, Nick},
title = {{It’s a Small World for Random Surfers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {857--871},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.857},
URN = {urn:nbn:de:0030-drops-47437},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.857},
annote = {Keywords: random-surfer webgraph model, PageRank-based selection model, smallworld phenomenon, height of random trees, probabilistic analysis, large deviations}
}
@InProceedings{meka_et_al:LIPIcs.APPROX-RANDOM.2014.872,
author = {Meka, Raghu and Reingold, Omer and Zhou, Yuan},
title = {{Deterministic Coupon Collection and Better Strong Dispersers}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {872--884},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.872},
URN = {urn:nbn:de:0030-drops-47440},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.872},
annote = {Keywords: Coupon collection; dispersers, strong dispersers, hashing, pseudorandomness}
}
@InProceedings{steinke_et_al:LIPIcs.APPROX-RANDOM.2014.885,
author = {Steinke, Thomas and Vadhan, Salil and Wan, Andrew},
title = {{Pseudorandomness and Fourier Growth Bounds for Width-3 Branching Programs}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {885--899},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.885},
URN = {urn:nbn:de:0030-drops-47456},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.885},
annote = {Keywords: Pseudorandomness, Branching Programs, Discrete Fourier Analysis}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing