Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "stream:journals/jacm:"
more than 1000 matches, exporting first 1000 hits only!
download as .bib file
@article{DBLP:journals/jacm/0005024,
author = {Xiao Hu and
Yufei Tao},
title = {Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {6:1--6:44},
year = {2024},
url = {https://doi.org/10.1145/3633512},
doi = {10.1145/3633512},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/0005024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AltschulerC24,
author = {Jason M. Altschuler and
Sinho Chewi},
title = {Faster High-accuracy Log-concave Sampling via Algorithmic Warm Starts},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {24},
year = {2024},
url = {https://doi.org/10.1145/3653446},
doi = {10.1145/3653446},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AltschulerC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalcanDSV24,
author = {Maria{-}Florina Balcan and
Travis Dick and
Tuomas Sandholm and
Ellen Vitercik},
title = {Learning to Branch: Generalization Guarantees and Limits of Data-Independent
Discretization},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {13:1--13:73},
year = {2024},
url = {https://doi.org/10.1145/3637840},
doi = {10.1145/3637840},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BalcanDSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhargavaGGKU24,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Zeyu Guo and
Mrinal Kumar and
Chris Umans},
title = {Fast Multivariate Multipoint Evaluation over All Finite Fields},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {22},
year = {2024},
url = {https://doi.org/10.1145/3652025},
doi = {10.1145/3652025},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BhargavaGGKU24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonnetGMSTT24,
author = {{\'{E}}douard Bonnet and
Ugo Giocanti and
Patrice Ossona de Mendez and
Pierre Simon and
St{\'{e}}phan Thomass{\'{e}} and
Szymon Torunczyk},
title = {Twin-Width {IV:} Ordered Graphs and Matrices},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {21},
year = {2024},
url = {https://doi.org/10.1145/3651151},
doi = {10.1145/3651151},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BonnetGMSTT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChaudhuryGM24,
author = {Bhaskar Ray Chaudhury and
Jugal Garg and
Kurt Mehlhorn},
title = {{EFX} Exists for Three Agents},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {4:1--4:27},
year = {2024},
url = {https://doi.org/10.1145/3616009},
doi = {10.1145/3616009},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChaudhuryGM24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChouGSV24,
author = {Chi{-}Ning Chou and
Alexander Golovnev and
Madhu Sudan and
Santhoshini Velusamy},
title = {Sketching Approximability of All Finite CSPs},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {15:1--15:74},
year = {2024},
url = {https://doi.org/10.1145/3649435},
doi = {10.1145/3649435},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChouGSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CohenAddadDKPT24,
author = {Vincent Cohen{-}Addad and
Debarati Das and
Evangelos Kipouridis and
Nikos Parotsidis and
Mikkel Thorup},
title = {Fitting Distances by Tree Metrics Minimizing the Total Error within
a Constant Factor},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {10:1--10:41},
year = {2024},
url = {https://doi.org/10.1145/3639453},
doi = {10.1145/3639453},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CohenAddadDKPT24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DinitzFGN24,
author = {Michael Dinitz and
Jeremy T. Fineman and
Seth Gilbert and
Calvin Newport},
title = {Smoothed Analysis of Information Spreading in Dynamic Networks},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {17},
year = {2024},
url = {https://doi.org/10.1145/3661831},
doi = {10.1145/3661831},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DinitzFGN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DinurKK24,
author = {Itai Dinur and
Nathan Keller and
Ohad Klein},
title = {Fine-grained Cryptanalysis: Tight Conditional Bounds for Dense \emph{k}-SUM
and \emph{k}-XOR},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {23},
year = {2024},
url = {https://doi.org/10.1145/3653014},
doi = {10.1145/3653014},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DinurKK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Dutting0NPR24,
author = {Paul D{\"{u}}tting and
Zhe Feng and
Harikrishna Narasimhan and
David C. Parkes and
Sai Srivatsa Ravindranath},
title = {Optimal Auctions through Deep Learning: Advances in Differentiable
Economics},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {5:1--5:53},
year = {2024},
url = {https://doi.org/10.1145/3630749},
doi = {10.1145/3630749},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Dutting0NPR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EsparzaRS24,
author = {Javier Esparza and
Rub{\'{e}}n Rubio and
Salomon Sickert},
title = {Efficient Normalization of Linear Temporal Logic},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {16:1--16:42},
year = {2024},
url = {https://doi.org/10.1145/3651152},
doi = {10.1145/3651152},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EsparzaRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GeorgesGSTTDB24,
author = {A{\"{\i}}na Linn Georges and
Arma{\"{e}}l Gu{\'{e}}neau and
Thomas Van Strydonck and
Amin Timany and
Alix Trieu and
Dominique Devriese and
Lars Birkedal},
title = {Cerise: Program Verification on a Capability Machine in the Presence
of Untrusted Code},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {3:1--3:59},
year = {2024},
url = {https://doi.org/10.1145/3623510},
doi = {10.1145/3623510},
timestamp = {Mon, 01 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GeorgesGSTTDB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HaghtalabRS24,
author = {Nika Haghtalab and
Tim Roughgarden and
Abhishek Shetty},
title = {Smoothed Analysis with Adaptive Adversaries},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {19},
year = {2024},
url = {https://doi.org/10.1145/3656638},
doi = {10.1145/3656638},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HaghtalabRS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HuangPZ24,
author = {Shang{-}En Huang and
Seth Pettie and
Leqi Zhu},
title = {Byzantine Agreement with Optimal Resilience via Statistical Fraud
Detection},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {12:1--12:37},
year = {2024},
url = {https://doi.org/10.1145/3639454},
doi = {10.1145/3639454},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HuangPZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KhamisNPSW24,
author = {Mahmoud Abo Khamis and
Hung Q. Ngo and
Reinhard Pichler and
Dan Suciu and
Yisu Remy Wang},
title = {Convergence of datalog over (Pre-) Semirings},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {8:1--8:55},
year = {2024},
url = {https://doi.org/10.1145/3643027},
doi = {10.1145/3643027},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KhamisNPSW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kong24,
author = {Yuqing Kong},
title = {Dominantly Truthful Peer Prediction Mechanisms with a Finite Number
of Tasks},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {9:1--9:49},
year = {2024},
url = {https://doi.org/10.1145/3638239},
doi = {10.1145/3638239},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Kong24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LichterS24,
author = {Moritz Lichter and
Pascal Schweitzer},
title = {Choiceless Polynomial Time with Witnessed Symmetric Choice},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {7:1--7:70},
year = {2024},
url = {https://doi.org/10.1145/3648104},
doi = {10.1145/3648104},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LichterS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NeigerSSV24,
author = {Vincent Neiger and
Bruno Salvy and
{\'{E}}ric Schost and
Gilles Villard},
title = {Faster Modular Composition},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {11:1--11:79},
year = {2024},
url = {https://doi.org/10.1145/3638349},
doi = {10.1145/3638349},
timestamp = {Fri, 17 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/NeigerSSV24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ovens24,
author = {Sean Ovens},
title = {The Space Complexity of Consensus from Swap},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {1:1--1:26},
year = {2024},
url = {https://doi.org/10.1145/3631390},
doi = {10.1145/3631390},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ovens24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RonZewiR24,
author = {Noga Ron{-}Zewi and
Ron Rothblum},
title = {Local Proofs Approaching the Witness Length},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {18},
year = {2024},
url = {https://doi.org/10.1145/3661483},
doi = {10.1145/3661483},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RonZewiR24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SteinS24,
author = {Dario Stein and
Sam Staton},
title = {Probabilistic Programming with Exact Conditions},
journal = {J. {ACM}},
volume = {71},
number = {1},
pages = {2:1--2:53},
year = {2024},
url = {https://doi.org/10.1145/3632170},
doi = {10.1145/3632170},
timestamp = {Sat, 16 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SteinS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ValeSC24,
author = {Arthur Oliveira Vale and
Zhong Shao and
Yixuan Chen},
title = {A Compositional Theory of Linearizability},
journal = {J. {ACM}},
volume = {71},
number = {2},
pages = {14:1--14:107},
year = {2024},
url = {https://doi.org/10.1145/3643668},
doi = {10.1145/3643668},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ValeSC24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/YamakawaZ24,
author = {Takashi Yamakawa and
Mark Zhandry},
title = {Verifiable Quantum Advantage without Structure},
journal = {J. {ACM}},
volume = {71},
number = {3},
pages = {20},
year = {2024},
url = {https://doi.org/10.1145/3658665},
doi = {10.1145/3658665},
timestamp = {Thu, 04 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/YamakawaZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AfshaniC23,
author = {Peyman Afshani and
Pingan Cheng},
title = {Lower Bounds for Semialgebraic Range Searching and Stabbing Problems},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {16:1--16:26},
year = {2023},
url = {https://doi.org/10.1145/3578574},
doi = {10.1145/3578574},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AfshaniC23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AsharovKLNPS23,
author = {Gilad Asharov and
Ilan Komargodski and
Wei{-}Kai Lin and
Kartik Nayak and
Enoch Peserico and
Elaine Shi},
title = {OptORAMa: Optimal Oblivious {RAM}},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {4:1--4:70},
year = {2023},
url = {https://doi.org/10.1145/3566049},
doi = {10.1145/3566049},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AsharovKLNPS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaltagBF23,
author = {Alexandru Baltag and
Nick Bezhanishvili and
David Fern{\'{a}}ndez{-}Duque},
title = {The Topological Mu-Calculus: Completeness and Decidability},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {33:1--33:38},
year = {2023},
url = {https://doi.org/10.1145/3623268},
doi = {10.1145/3623268},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaltagBF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BauwensZ23,
author = {Bruno Bauwens and
Marius Zimand},
title = {Universal almost Optimal Compression and Slepian-wolf Coding in Probabilistic
Polynomial Time},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {9:1--9:33},
year = {2023},
url = {https://doi.org/10.1145/3575807},
doi = {10.1145/3575807},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BauwensZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BehnezhadHH23,
author = {Soheil Behnezhad and
MohammadTaghi Hajiaghayi and
David G. Harris},
title = {Exponentially Faster Massively Parallel Maximal Matching},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {34:1--34:18},
year = {2023},
url = {https://doi.org/10.1145/3617360},
doi = {10.1145/3617360},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BehnezhadHH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenDavidB23,
author = {Shalev Ben{-}David and
Eric Blais},
title = {A New Minimax Theorem for Randomized Algorithms},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {38:1--38:58},
year = {2023},
url = {https://doi.org/10.1145/3626514},
doi = {10.1145/3626514},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenDavidB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenSassonCIKS23,
author = {Eli Ben{-}Sasson and
Dan Carmon and
Yuval Ishai and
Swastik Kopparty and
Shubhangi Saraf},
title = {Proximity Gaps for Reed-Solomon Codes},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {31:1--31:57},
year = {2023},
url = {https://doi.org/10.1145/3614423},
doi = {10.1145/3614423},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenSassonCIKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenderCFKT23,
author = {Michael A. Bender and
Alex Conway and
Martin Farach{-}Colton and
William Kuszmaul and
Guido Tagliavini},
title = {Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {40:1--40:51},
year = {2023},
url = {https://doi.org/10.1145/3625817},
doi = {10.1145/3625817},
timestamp = {Sat, 10 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenderCFKT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BerkholzN23,
author = {Christoph Berkholz and
Jakob Nordstr{\"{o}}m},
title = {Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman
Refinement Steps},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {32:1--32:32},
year = {2023},
url = {https://doi.org/10.1145/3195257},
doi = {10.1145/3195257},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BerkholzN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhargavaGKM23,
author = {Vishwas Bhargava and
Sumanta Ghosh and
Mrinal Kumar and
Chandra Kanta Mohapatra},
title = {Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic
and Applications},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {42:1--42:46},
year = {2023},
url = {https://doi.org/10.1145/3625226},
doi = {10.1145/3625226},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BhargavaGKM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodirskyR23,
author = {Manuel Bodirsky and
Jakub Rydval},
title = {On the Descriptive Complexity of Temporal Constraint Satisfaction
Problems},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {2:1--2:58},
year = {2023},
url = {https://doi.org/10.1145/3566051},
doi = {10.1145/3566051},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BodirskyR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodwinP23,
author = {Greg Bodwin and
Merav Parter},
title = {Restorable Shortest Path Tiebreaking for Edge-Faulty Graphs},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {28:1--28:24},
year = {2023},
url = {https://doi.org/10.1145/3603542},
doi = {10.1145/3603542},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BodwinP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BruniGGR23,
author = {Roberto Bruni and
Roberto Giacobazzi and
Roberta Gori and
Francesco Ranzato},
title = {A Correctness and Incorrectness Program Logic},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {15:1--15:45},
year = {2023},
url = {https://doi.org/10.1145/3582267},
doi = {10.1145/3582267},
timestamp = {Thu, 11 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BruniGGR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BubeckS23,
author = {S{\'{e}}bastien Bubeck and
Mark Sellke},
title = {A Universal Law of Robustness via Isoperimetry},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {10:1--10:18},
year = {2023},
url = {https://doi.org/10.1145/3578580},
doi = {10.1145/3578580},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BubeckS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CharalampopoulosGLMPWW23,
author = {Panagiotis Charalampopoulos and
Pawel Gawrychowski and
Yaowei Long and
Shay Mozes and
Seth Pettie and
Oren Weimann and
Christian Wulff{-}Nilsen},
title = {Almost Optimal Exact Distance Oracles for Planar Graphs},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {12:1--12:50},
year = {2023},
url = {https://doi.org/10.1145/3580474},
doi = {10.1145/3580474},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CharalampopoulosGLMPWW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenDRS23,
author = {Ho{-}Lin Chen and
David Doty and
Wyatt Reeves and
David Soloveichik},
title = {Rate-independent Computation in Continuous Chemical Reaction Networks},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {22:1--22:61},
year = {2023},
url = {https://doi.org/10.1145/3590776},
doi = {10.1145/3590776},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenDRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenRTY23,
author = {Lijie Chen and
Ron D. Rothblum and
Roei Tell and
Eylon Yogev},
title = {On Exponential-time Hypotheses, Derandomization, and Circuit Lower
Bounds},
journal = {J. {ACM}},
volume = {70},
number = {4},
pages = {25:1--25:62},
year = {2023},
url = {https://doi.org/10.1145/3593581},
doi = {10.1145/3593581},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenRTY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChiaCL23,
author = {Nai{-}Hui Chia and
Kai{-}Min Chung and
Ching{-}Yi Lai},
title = {On the Need for Large Quantum Depth},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {6:1--6:38},
year = {2023},
url = {https://doi.org/10.1145/3570637},
doi = {10.1145/3570637},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChiaCL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChonevOW23,
author = {Ventsislav Chonev and
Jo{\"{e}}l Ouaknine and
James Worrell},
title = {On the Zeros of Exponential Polynomials},
journal = {J. {ACM}},
volume = {70},
number = {4},
pages = {26:1--26:26},
year = {2023},
url = {https://doi.org/10.1145/3603543},
doi = {10.1145/3603543},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChonevOW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CormodeKLTV23,
author = {Graham Cormode and
Zohar S. Karnin and
Edo Liberty and
Justin Thaler and
Pavel Vesel{\'{y}}},
title = {Relative Error Streaming Quantiles},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {30:1--30:48},
year = {2023},
url = {https://doi.org/10.1145/3617891},
doi = {10.1145/3617891},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CormodeKLTV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CotumaccioDPP23,
author = {Nicola Cotumaccio and
Giovanna D'Agostino and
Alberto Policriti and
Nicola Prezza},
title = {Co-lexicographically Ordering Automata and Regular Languages - Part
{I}},
journal = {J. {ACM}},
volume = {70},
number = {4},
pages = {27:1--27:73},
year = {2023},
url = {https://doi.org/10.1145/3607471},
doi = {10.1145/3607471},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CotumaccioDPP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Doyen23,
author = {Laurent Doyen},
title = {Stochastic Games with Synchronization Objectives},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {23:1--23:35},
year = {2023},
url = {https://doi.org/10.1145/3588866},
doi = {10.1145/3588866},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Doyen23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FearnleyGHS23,
author = {John Fearnley and
Paul Goldberg and
Alexandros Hollender and
Rahul Savani},
title = {The Complexity of Gradient Descent: {CLS} = {PPAD} {\(\cap\)} {PLS}},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {7:1--7:74},
year = {2023},
url = {https://doi.org/10.1145/3568163},
doi = {10.1145/3568163},
timestamp = {Fri, 06 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FearnleyGHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FeldmanNSZ23,
author = {Moran Feldman and
Ashkan Norouzi{-}Fard and
Ola Svensson and
Rico Zenklusen},
title = {The One-Way Communication Complexity of Submodular Maximization with
Applications to Streaming and Robustness},
journal = {J. {ACM}},
volume = {70},
number = {4},
pages = {24:1--24:52},
year = {2023},
url = {https://doi.org/10.1145/3588564},
doi = {10.1145/3588564},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FeldmanNSZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GaitondeT23,
author = {Jason Gaitonde and
{\'{E}}va Tardos},
title = {The Price of Anarchy of Strategic Queuing Systems},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {20:1--20:63},
year = {2023},
url = {https://doi.org/10.1145/3587250},
doi = {10.1145/3587250},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GaitondeT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GeffnerH23,
author = {Ivan Geffner and
Joseph Y. Halpern},
title = {Lower Bounds on Implementing Mediators in Asynchronous Systems with
Rational and Malicious Agents},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {13:1--13:21},
year = {2023},
url = {https://doi.org/10.1145/3578579},
doi = {10.1145/3578579},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GeffnerH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoaocW23,
author = {Xavier Goaoc and
Emo Welzl},
title = {Convex Hulls of Random Order Types},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {8:1--8:47},
year = {2023},
url = {https://doi.org/10.1145/3570636},
doi = {10.1145/3570636},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoaocW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoubaultLarrecqJT23,
author = {Jean Goubault{-}Larrecq and
Xiaodong Jia and
Cl{\'{e}}ment Th{\'{e}}ron},
title = {A Domain-theoretic Approach to Statistical Programming Languages},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {35:1--35:63},
year = {2023},
url = {https://doi.org/10.1145/3611660},
doi = {10.1145/3611660},
timestamp = {Sun, 10 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoubaultLarrecqJT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HrushovskiOPW23,
author = {Ehud Hrushovski and
Jo{\"{e}}l Ouaknine and
Amaury Pouly and
James Worrell},
title = {On Strongest Algebraic Program Invariants},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {29:1--29:22},
year = {2023},
url = {https://doi.org/10.1145/3614319},
doi = {10.1145/3614319},
timestamp = {Mon, 13 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HrushovskiOPW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JagadeesanWWJS23,
author = {Meena Jagadeesan and
Alexander Wei and
Yixin Wang and
Michael I. Jordan and
Jacob Steinhardt},
title = {Learning Equilibria in Matching Markets with Bandit Feedback},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {19:1--19:46},
year = {2023},
url = {https://doi.org/10.1145/3583681},
doi = {10.1145/3583681},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JagadeesanWWJS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jiang23,
author = {Haotian Jiang},
title = {Minimizing Convex Functions with Rational Minimizers},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {5:1--5:27},
year = {2023},
url = {https://doi.org/10.1145/3566050},
doi = {10.1145/3566050},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Jiang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JinL23,
author = {Yaonan Jin and
Pinyan Lu},
title = {First Price Auction is 1-1/\emph{e}\({}^{\mbox{2}}\) Efficient},
journal = {J. {ACM}},
volume = {70},
number = {5},
pages = {36:1--36:86},
year = {2023},
url = {https://doi.org/10.1145/3617902},
doi = {10.1145/3617902},
timestamp = {Tue, 28 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JinL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kock23,
author = {Joachim Kock},
title = {Whole-grain Petri Nets and Processes},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {1:1--1:58},
year = {2023},
url = {https://doi.org/10.1145/3559103},
doi = {10.1145/3559103},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kock23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lichter23,
author = {Moritz Lichter},
title = {Separating Rank Logic from Polynomial Time},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {14:1--14:53},
year = {2023},
url = {https://doi.org/10.1145/3572918},
doi = {10.1145/3572918},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Lichter23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LiuM23,
author = {Allen Liu and
Ankur Moitra},
title = {Robustly Learning General Mixtures of Gaussians},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {21:1--21:53},
year = {2023},
url = {https://doi.org/10.1145/3583680},
doi = {10.1145/3583680},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LiuM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LosS23,
author = {Dimitrios Los and
Thomas Sauerwald},
title = {Balanced Allocations with the Choice of Noise},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {37:1--37:84},
year = {2023},
url = {https://doi.org/10.1145/3625386},
doi = {10.1145/3625386},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LosS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OrlinV23,
author = {James B. Orlin and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {Directed Shortest Paths via Approximate Cost Balancing},
journal = {J. {ACM}},
volume = {70},
number = {1},
pages = {3:1--3:33},
year = {2023},
url = {https://doi.org/10.1145/3565019},
doi = {10.1145/3565019},
timestamp = {Sat, 25 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OrlinV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RinbergK23,
author = {Arik Rinberg and
Idit Keidar},
title = {Intermediate Value Linearizability: {A} Quantitative Correctness Criterion},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {17:1--17:21},
year = {2023},
url = {https://doi.org/10.1145/3584699},
doi = {10.1145/3584699},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RinbergK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RomeroWZ23,
author = {Miguel Romero and
Marcin Wrochna and
Stanislav Zivn{\'{y}}},
title = {Pliability and Approximating Max-CSPs},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {41:1--41:43},
year = {2023},
url = {https://doi.org/10.1145/3626515},
doi = {10.1145/3626515},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RomeroWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RutschmannW23,
author = {Daniel Rutschmann and
Manuel Wettstein},
title = {Chains, Koch Chains, and Point Sets with Many Triangulations},
journal = {J. {ACM}},
volume = {70},
number = {3},
pages = {18:1--18:26},
year = {2023},
url = {https://doi.org/10.1145/3585535},
doi = {10.1145/3585535},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RutschmannW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TangWZ23,
author = {Zhihao Gavin Tang and
Xiaowei Wu and
Yuhao Zhang},
title = {Toward a Better Understanding of Randomized Greedy Matching},
journal = {J. {ACM}},
volume = {70},
number = {6},
pages = {39:1--39:32},
year = {2023},
url = {https://doi.org/10.1145/3614318},
doi = {10.1145/3614318},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/TangWZ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Wang23,
author = {Haitao Wang},
title = {A New Algorithm for Euclidean Shortest Paths in the Plane},
journal = {J. {ACM}},
volume = {70},
number = {2},
pages = {11:1--11:62},
year = {2023},
url = {https://doi.org/10.1145/3580475},
doi = {10.1145/3580475},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Wang23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbrahamsenAM22,
author = {Mikkel Abrahamsen and
Anna Adamaszek and
Tillmann Miltzow},
title = {The Art Gallery Problem is {\(\exists\)}{\(\mathbb{R}\)}-complete},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {4:1--4:70},
year = {2022},
url = {https://doi.org/10.1145/3486220},
doi = {10.1145/3486220},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AbrahamsenAM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonBLMM22,
author = {Noga Alon and
Mark Bun and
Roi Livni and
Maryanthe Malliaris and
Shay Moran},
title = {Private and Online Learnability Are Equivalent},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {28:1--28:34},
year = {2022},
url = {https://doi.org/10.1145/3526074},
doi = {10.1145/3526074},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AlonBLMM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalkanskiRS22,
author = {Eric Balkanski and
Aviad Rubinstein and
Yaron Singer},
title = {The Limitations of Optimization from Samples},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {21:1--21:33},
year = {2022},
url = {https://doi.org/10.1145/3511018},
doi = {10.1145/3511018},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BalkanskiRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarenboimEG22,
author = {Leonid Barenboim and
Michael Elkin and
Uri Goldenberg},
title = {Locally-iterative Distributed ({\(\Delta\)} + 1)-coloring and Applications},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {5:1--5:26},
year = {2022},
url = {https://doi.org/10.1145/3486625},
doi = {10.1145/3486625},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarenboimEG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-EliezerJWY22,
author = {Omri Ben{-}Eliezer and
Rajesh Jayaram and
David P. Woodruff and
Eylon Yogev},
title = {A Framework for Adversarially Robust Streaming Algorithms},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {17:1--17:33},
year = {2022},
url = {https://doi.org/10.1145/3498334},
doi = {10.1145/3498334},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Ben-EliezerJWY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeraGLSS22,
author = {Suman K. Bera and
Lior Gishboliner and
Yevgeny Levanzov and
C. Seshadhri and
Asaf Shapira},
title = {Counting Subgraphs in Degenerate Graphs},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {23:1--23:21},
year = {2022},
url = {https://doi.org/10.1145/3520240},
doi = {10.1145/3520240},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeraGLSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlancLQT22,
author = {Guy Blanc and
Jane Lange and
Mingda Qiao and
Li{-}Yang Tan},
title = {Properly Learning Decision Trees in almost Polynomial Time},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {39:1--39:19},
year = {2022},
url = {https://doi.org/10.1145/3561047},
doi = {10.1145/3561047},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlancLQT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlasiokGNRS22,
author = {Jaroslaw Blasiok and
Venkatesan Guruswami and
Preetum Nakkiran and
Atri Rudra and
Madhu Sudan},
title = {General Strong Polarization},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {11:1--11:67},
year = {2022},
url = {https://doi.org/10.1145/3491390},
doi = {10.1145/3491390},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlasiokGNRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonakdarpourFRR22,
author = {Borzoo Bonakdarpour and
Pierre Fraigniaud and
Sergio Rajsbaum and
David A. Rosenblueth and
Corentin Travers},
title = {Decentralized Asynchronous Crash-resilient Runtime Verification},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {34:1--34:31},
year = {2022},
url = {https://doi.org/10.1145/3550483},
doi = {10.1145/3550483},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BonakdarpourFRR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonchiGKSZ22,
author = {Filippo Bonchi and
Fabio Gadducci and
Aleks Kissinger and
Pawel Sobocinski and
Fabio Zanasi},
title = {String Diagram Rewrite Theory {I:} Rewriting with Frobenius Structure},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {14:1--14:58},
year = {2022},
url = {https://doi.org/10.1145/3502719},
doi = {10.1145/3502719},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BonchiGKSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonnetKTW22,
author = {{\'{E}}douard Bonnet and
Eun Jung Kim and
St{\'{e}}phan Thomass{\'{e}} and
R{\'{e}}mi Watrigant},
title = {Twin-width {I:} Tractable {FO} Model Checking},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {3:1--3:46},
year = {2022},
url = {https://doi.org/10.1145/3486655},
doi = {10.1145/3486655},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BonnetKTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BravermanEGY22,
author = {Mark Braverman and
Klim Efremenko and
Ran Gelles and
Michael A. Yitayew},
title = {Optimal Short-Circuit Resilient Formulas},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {26:1--26:37},
year = {2022},
url = {https://doi.org/10.1145/3538390},
doi = {10.1145/3538390},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BravermanEGY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChanCMS22,
author = {T.{-}H. Hubert Chan and
Kai{-}Min Chung and
Bruce M. Maggs and
Elaine Shi},
title = {Foundations of Differentially Oblivious Algorithms},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {27:1--27:49},
year = {2022},
url = {https://doi.org/10.1145/3555984},
doi = {10.1145/3555984},
timestamp = {Thu, 29 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChanCMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenHOPRS22,
author = {Lijie Chen and
Shuichi Hirahara and
Igor Carboni Oliveira and
J{\'{a}}n Pich and
Ninad Rajgopal and
Rahul Santhanam},
title = {Beyond Natural Proofs: Hardness Magnification and Locality},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {25:1--25:49},
year = {2022},
url = {https://doi.org/10.1145/3538391},
doi = {10.1145/3538391},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenHOPRS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChengJLW22,
author = {Kuan Cheng and
Zhengzhong Jin and
Xin Li and
Ke Wu},
title = {Deterministic Document Exchange Protocols and Almost Optimal Binary
Codes for Edit Errors},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {44:1--44:39},
year = {2022},
url = {https://doi.org/10.1145/3561046},
doi = {10.1145/3561046},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChengJLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChiaGLLTW22,
author = {Nai{-}Hui Chia and
Andr{\'{a}}s Pal Gily{\'{e}}n and
Tongyang Li and
Han{-}Hsuan Lin and
Ewin Tang and
Chunhao Wang},
title = {Sampling-based Sublinear Low-rank Matrix Arithmetic Framework for
Dequantizing Quantum Machine Learning},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {33:1--33:72},
year = {2022},
url = {https://doi.org/10.1145/3549524},
doi = {10.1145/3549524},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChiaGLLTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChiesaFGS22,
author = {Alessandro Chiesa and
Michael A. Forbes and
Tom Gur and
Nicholas Spooner},
title = {Spatial Isolation Implies Zero Knowledge Even in a Quantum World},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {15:1--15:44},
year = {2022},
url = {https://doi.org/10.1145/3511100},
doi = {10.1145/3511100},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChiesaFGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DoronMOZ22,
author = {Dean Doron and
Dana Moshkovitz and
Justin Oh and
David Zuckerman},
title = {Nearly Optimal Pseudorandomness from Hardness},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {43:1--43:55},
year = {2022},
url = {https://doi.org/10.1145/3555307},
doi = {10.1145/3555307},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DoronMOZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DoryP22,
author = {Michal Dory and
Merav Parter},
title = {Exponentially Faster Shortest Paths in the Congested Clique},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {29:1--29:42},
year = {2022},
url = {https://doi.org/10.1145/3527213},
doi = {10.1145/3527213},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DoryP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuttaSS22,
author = {Pranjal Dutta and
Nitin Saxena and
Amit Sinhababu},
title = {Discovering the Roots: Uniform Closure Results for Algebraic Classes
Under Factoring},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {18:1--18:39},
year = {2022},
url = {https://doi.org/10.1145/3510359},
doi = {10.1145/3510359},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DuttaSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Edalat22,
author = {Abbas Edalat},
title = {Smooth Approximation of Lipschitz Maps and Their Subgradients},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {8:1--8:32},
year = {2022},
url = {https://doi.org/10.1145/3481805},
doi = {10.1145/3481805},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Edalat22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EphraimFKP22,
author = {Naomi Ephraim and
Cody Freitag and
Ilan Komargodski and
Rafael Pass},
title = {SPARKs: Succinct Parallelizable Arguments of Knowledge},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {31:1--31:88},
year = {2022},
url = {https://doi.org/10.1145/3549523},
doi = {10.1145/3549523},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EphraimFKP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FahrbachHTZ22,
author = {Matthew Fahrbach and
Zhiyi Huang and
Runzhou Tao and
Morteza Zadimoghaddam},
title = {Edge-Weighted Online Bipartite Matching},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {45:1--45:35},
year = {2022},
url = {https://doi.org/10.1145/3556971},
doi = {10.1145/3556971},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FahrbachHTZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FarinaCMG22,
author = {Gabriele Farina and
Andrea Celli and
Alberto Marchesi and
Nicola Gatti},
title = {Simple Uncoupled No-regret Learning Dynamics for Extensive-form Correlated
Equilibrium},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {41:1--41:41},
year = {2022},
url = {https://doi.org/10.1145/3563772},
doi = {10.1145/3563772},
timestamp = {Wed, 20 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FarinaCMG22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlemingPPR22,
author = {Noah Fleming and
Denis Pankratov and
Toniann Pitassi and
Robert Robere},
title = {Random {\textbackslash}( {\textbackslash}Theta ({\textbackslash}log
n) {\textbackslash}) -CNFs are Hard for Cutting Planes},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {19:1--19:32},
year = {2022},
url = {https://doi.org/10.1145/3486680},
doi = {10.1145/3486680},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FlemingPPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FulekT22,
author = {Radoslav Fulek and
Csaba D. T{\'{o}}th},
title = {Atomic Embeddability, Clustered Planarity, and Thickenability},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {13:1--13:34},
year = {2022},
url = {https://doi.org/10.1145/3502264},
doi = {10.1145/3502264},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FulekT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GargS22,
author = {Sanjam Garg and
Akshayaram Srinivasan},
title = {Two-round Multiparty Secure Computation from Minimal Assumptions},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {36:1--36:30},
year = {2022},
url = {https://doi.org/10.1145/3566048},
doi = {10.1145/3566048},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GargS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GroheKKL22,
author = {Martin Grohe and
Benjamin Lucien Kaminski and
Joost{-}Pieter Katoen and
Peter Lindner},
title = {Generative Datalog with Continuous Distributions},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {46:1--46:52},
year = {2022},
url = {https://doi.org/10.1145/3559102},
doi = {10.1145/3559102},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GroheKKL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GroheL22,
author = {Martin Grohe and
Peter Lindner},
title = {Independence in Infinite Probabilistic Databases},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {37:1--37:42},
year = {2022},
url = {https://doi.org/10.1145/3549525},
doi = {10.1145/3549525},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GroheL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuptaHLL22,
author = {Anupam Gupta and
David G. Harris and
Euiwoong Lee and
Jason Li},
title = {Optimal Bounds for the \emph{k}-cut Problem},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {2:1--2:18},
year = {2022},
url = {https://doi.org/10.1145/3478018},
doi = {10.1145/3478018},
timestamp = {Wed, 02 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuptaHLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiX22,
author = {Venkatesan Guruswami and
Chaoping Xing},
title = {Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric
Codes},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {10:1--10:48},
year = {2022},
url = {https://doi.org/10.1145/3506668},
doi = {10.1145/3506668},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiX22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarveyH22,
author = {David Harvey and
Joris van der Hoeven},
title = {Polynomial Multiplication over Finite Fields in Time {\textbackslash}(
{O} (n {\textbackslash}log n) {\textbackslash})},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {12:1--12:40},
year = {2022},
url = {https://doi.org/10.1145/3505584},
doi = {10.1145/3505584},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HarveyH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HassidimKMMS22,
author = {Avinatan Hassidim and
Haim Kaplan and
Yishay Mansour and
Yossi Matias and
Uri Stemmer},
title = {Adversarially Robust Streaming Algorithms via Differential Privacy},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {42:1--42:14},
year = {2022},
url = {https://doi.org/10.1145/3556972},
doi = {10.1145/3556972},
timestamp = {Sun, 25 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HassidimKMMS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ImmorlicaSSS22,
author = {Nicole Immorlica and
Karthik Abinav Sankararaman and
Robert E. Schapire and
Aleksandrs Slivkins},
title = {Adversarial Bandits with Knapsacks},
journal = {J. {ACM}},
volume = {69},
number = {6},
pages = {40:1--40:47},
year = {2022},
url = {https://doi.org/10.1145/3557045},
doi = {10.1145/3557045},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ImmorlicaSSS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KalaiRR22,
author = {Yael Tauman Kalai and
Ran Raz and
Ron D. Rothblum},
title = {How to Delegate Computations: The Power of No-Signaling Proofs},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {1:1--1:82},
year = {2022},
url = {https://doi.org/10.1145/3456867},
doi = {10.1145/3456867},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KalaiRR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaminskiKGMH22,
author = {Mark Kaminski and
Egor V. Kostylev and
Bernardo Cuenca Grau and
Boris Motik and
Ian Horrocks},
title = {The Complexity and Expressive Power of Limit Datalog},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {6:1--6:83},
year = {2022},
url = {https://doi.org/10.1145/3495009},
doi = {10.1145/3495009},
timestamp = {Tue, 12 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KaminskiKGMH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LabradaTT22,
author = {Elizabeth Labrada and
Mat{\'{\i}}as Toro and
{\'{E}}ric Tanter},
title = {Gradual System {F}},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {38:1--38:78},
year = {2022},
url = {https://doi.org/10.1145/3555986},
doi = {10.1145/3555986},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LabradaTT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ODonnellST22,
author = {Ryan O'Donnell and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {Fooling Polytopes},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {9:1--9:37},
year = {2022},
url = {https://doi.org/10.1145/3460532},
doi = {10.1145/3460532},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ODonnellST22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RazT22,
author = {Ran Raz and
Avishay Tal},
title = {Oracle Separation of {BQP} and {PH}},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {30:1--30:21},
year = {2022},
url = {https://doi.org/10.1145/3530258},
doi = {10.1145/3530258},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RazT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rubin22,
author = {Natan Rubin},
title = {An Improved Bound for Weak Epsilon-nets in the Plane},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {32:1--32:35},
year = {2022},
url = {https://doi.org/10.1145/3555985},
doi = {10.1145/3555985},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rubin22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SchweikardtSV22,
author = {Nicole Schweikardt and
Luc Segoufin and
Alexandre Vigny},
title = {Enumeration for {FO} Queries over Nowhere Dense Graphs},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {22:1--22:37},
year = {2022},
url = {https://doi.org/10.1145/3517035},
doi = {10.1145/3517035},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SchweikardtSV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SolovievH22,
author = {Matvey Soloviev and
Joseph Y. Halpern},
title = {Information Acquisition Under Resource Limitations in a Noisy Environment},
journal = {J. {ACM}},
volume = {69},
number = {3},
pages = {20:1--20:37},
year = {2022},
url = {https://doi.org/10.1145/3510024},
doi = {10.1145/3510024},
timestamp = {Mon, 25 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SolovievH22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos22,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {69},
number = {1},
pages = {7:1},
year = {2022},
url = {https://doi.org/10.1145/3505279},
doi = {10.1145/3505279},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos22a,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {69},
number = {2},
pages = {16:1},
year = {2022},
url = {https://doi.org/10.1145/3519019},
doi = {10.1145/3519019},
timestamp = {Wed, 13 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos22a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Taubenfeld22,
author = {Gadi Taubenfeld},
title = {Anonymous Shared Memory},
journal = {J. {ACM}},
volume = {69},
number = {4},
pages = {24:1--24:30},
year = {2022},
url = {https://doi.org/10.1145/3529752},
doi = {10.1145/3529752},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Taubenfeld22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZhukM22,
author = {Dmitriy Zhuk and
Barnaby Martin},
title = {{QCSP} Monsters and the Demise of the Chen Conjecture},
journal = {J. {ACM}},
volume = {69},
number = {5},
pages = {35:1--35:44},
year = {2022},
url = {https://doi.org/10.1145/3563820},
doi = {10.1145/3563820},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ZhukM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArenasCJR21,
author = {Marcelo Arenas and
Luis Alberto Croquevielle and
Rajesh Jayaram and
Cristian Riveros},
title = {{\#}NFA Admits an {FPRAS:} Efficient Enumeration, Counting, and Uniform
Generation for Logspace Classes},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {48:1--48:40},
year = {2021},
url = {https://doi.org/10.1145/3477045},
doi = {10.1145/3477045},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ArenasCJR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArgueGTG21,
author = {C. J. Argue and
Anupam Gupta and
Ziye Tang and
Guru Guruganesh},
title = {Chasing Convex Bodies with Linear Competitive Ratio},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {32:1--32:10},
year = {2021},
url = {https://doi.org/10.1145/3450349},
doi = {10.1145/3450349},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ArgueGTG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasBRLNR21,
author = {Albert Atserias and
Ilario Bonacina and
Susanna F. de Rezende and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Alexander A. Razborov},
title = {Clique Is Hard on Average for Regular Resolution},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {23:1--23:26},
year = {2021},
url = {https://doi.org/10.1145/3449352},
doi = {10.1145/3449352},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasBRLNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasDO21,
author = {Albert Atserias and
Anuj Dawar and
Joanna Ochremiak},
title = {On the Power of Symmetric Linear Programs},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {26:1--26:35},
year = {2021},
url = {https://doi.org/10.1145/3456297},
doi = {10.1145/3456297},
timestamp = {Thu, 19 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasDO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalliuBHORS21,
author = {Alkida Balliu and
Sebastian Brandt and
Juho Hirvonen and
Dennis Olivetti and
Mika{\"{e}}l Rabie and
Jukka Suomela},
title = {Lower Bounds for Maximal Matchings and Maximal Independent Sets},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {39:1--39:30},
year = {2021},
url = {https://doi.org/10.1145/3461458},
doi = {10.1145/3461458},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BalliuBHORS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BartoBKO21,
author = {Libor Barto and
Jakub Bul{\'{\i}}n and
Andrei A. Krokhin and
Jakub Oprsal},
title = {Algebraic Approach to Promise Constraint Satisfaction},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {28:1--28:66},
year = {2021},
url = {https://doi.org/10.1145/3457606},
doi = {10.1145/3457606},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BartoBKO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BatesALMJ21,
author = {Stephen Bates and
Anastasios Angelopoulos and
Lihua Lei and
Jitendra Malik and
Michael I. Jordan},
title = {Distribution-free, Risk-controlling Prediction Sets},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {43:1--43:34},
year = {2021},
url = {https://doi.org/10.1145/3478535},
doi = {10.1145/3478535},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BatesALMJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhattacharyyaBE21,
author = {Arnab Bhattacharyya and
{\'{E}}douard Bonnet and
L{\'{a}}szl{\'{o}} Egri and
Suprovat Ghoshal and
Karthik C. S. and
Bingkai Lin and
Pasin Manurangsi and
D{\'{a}}niel Marx},
title = {Parameterized Intractability of Even Set and Shortest Vector Problem},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {16:1--16:40},
year = {2021},
url = {https://doi.org/10.1145/3444942},
doi = {10.1145/3444942},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BhattacharyyaBE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlondinEFGHLMT21,
author = {Michael Blondin and
Matthias Englert and
Alain Finkel and
Stefan G{\"{o}}ller and
Christoph Haase and
Ranko Lazic and
Pierre McKenzie and
Patrick Totzke},
title = {The Reachability Problem for Two-Dimensional Vector Addition Systems
with States},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {34:1--34:43},
year = {2021},
url = {https://doi.org/10.1145/3464794},
doi = {10.1145/3464794},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlondinEFGHLMT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonamyBBCGKRST21,
author = {Marthe Bonamy and
{\'{E}}douard Bonnet and
Nicolas Bousquet and
Pierre Charbit and
Panos Giannopoulos and
Eun Jung Kim and
Pawel Rzazewski and
Florian Sikora and
St{\'{e}}phan Thomass{\'{e}}},
title = {{EPTAS} and Subexponential Algorithm for Maximum Clique on Disk and
Unit Ball Graphs},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {9:1--9:38},
year = {2021},
url = {https://doi.org/10.1145/3433160},
doi = {10.1145/3433160},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BonamyBBCGKRST21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BoroujeniEGHS21,
author = {Mahdi Boroujeni and
Soheil Ehsani and
Mohammad Ghodsi and
MohammadTaghi Hajiaghayi and
Saeed Seddighin},
title = {Approximating Edit Distance in Truly Subquadratic Time: Quantum and
MapReduce},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {19:1--19:41},
year = {2021},
url = {https://doi.org/10.1145/3456807},
doi = {10.1145/3456807},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BoroujeniEGHS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrakerskiCMVV21,
author = {Zvika Brakerski and
Paul F. Christiano and
Urmila Mahadev and
Umesh V. Vazirani and
Thomas Vidick},
title = {A Cryptographic Test of Quantumness and Certifiable Randomness from
a Single Quantum Device},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {31:1--31:47},
year = {2021},
url = {https://doi.org/10.1145/3441309},
doi = {10.1145/3441309},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BrakerskiCMVV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BubeckEL21,
author = {S{\'{e}}bastien Bubeck and
Ronen Eldan and
Yin Tat Lee},
title = {Kernel-based Methods for Bandit Convex Optimization},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {25:1--25:35},
year = {2021},
url = {https://doi.org/10.1145/3453721},
doi = {10.1145/3453721},
timestamp = {Thu, 19 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BubeckEL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChangPSZ21,
author = {Yi{-}Jun Chang and
Seth Pettie and
Thatchaphol Saranurak and
Hengjie Zhang},
title = {Near-optimal Distributed Triangle Enumeration via Expander Decompositions},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {21:1--21:36},
year = {2021},
url = {https://doi.org/10.1145/3446330},
doi = {10.1145/3446330},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChangPSZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadFS21,
author = {Vincent Cohen{-}Addad and
Andreas Emil Feldmann and
David Saulpic},
title = {Near-linear Time Approximation Schemes for Clustering in Doubling
Metrics},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {44:1--44:34},
year = {2021},
url = {https://doi.org/10.1145/3477541},
doi = {10.1145/3477541},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadFS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadVMM21,
author = {Vincent Cohen{-}Addad and
{\'{E}}ric Colin de Verdi{\`{e}}re and
D{\'{a}}niel Marx and
Arnaud de Mesmay},
title = {Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {30:1--30:26},
year = {2021},
url = {https://doi.org/10.1145/3450704},
doi = {10.1145/3450704},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadVMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CohenLS21,
author = {Michael B. Cohen and
Yin Tat Lee and
Zhao Song},
title = {Solving Linear Programs in the Current Matrix Multiplication Time},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {3:1--3:39},
year = {2021},
url = {https://doi.org/10.1145/3424305},
doi = {10.1145/3424305},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CohenLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CramerDW21,
author = {Ronald Cramer and
L{\'{e}}o Ducas and
Benjamin Wesolowski},
title = {Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial
Time},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {8:1--8:26},
year = {2021},
url = {https://doi.org/10.1145/3431725},
doi = {10.1145/3431725},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CramerDW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CzerwinskiLLLM21,
author = {Wojciech Czerwinski and
Slawomir Lasota and
Ranko Lazic and
J{\'{e}}r{\^{o}}me Leroux and
Filip Mazowiecki},
title = {The Reachability Problem for Petri Nets Is Not Elementary},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {7:1--7:28},
year = {2021},
url = {https://doi.org/10.1145/3422822},
doi = {10.1145/3422822},
timestamp = {Thu, 22 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CzerwinskiLLLM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CzumajD21,
author = {Artur Czumaj and
Peter Davies},
title = {Exploiting Spontaneous Transmissions for Broadcasting and Leader Election
in Radio Networks},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {13:1--13:22},
year = {2021},
url = {https://doi.org/10.1145/3446383},
doi = {10.1145/3446383},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CzumajD21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DottlingG21,
author = {Nico D{\"{o}}ttling and
Sanjam Garg},
title = {Identity-based Encryption from the Diffie-Hellman Assumption},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {14:1--14:46},
year = {2021},
url = {https://doi.org/10.1145/3422370},
doi = {10.1145/3422370},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DottlingG21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DughmiHKN21,
author = {Shaddin Dughmi and
Jason D. Hartline and
Robert D. Kleinberg and
Rad Niazadeh},
title = {Bernoulli Factories and Black-box Reductions in Mechanism Design},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {10:1--10:30},
year = {2021},
url = {https://doi.org/10.1145/3440988},
doi = {10.1145/3440988},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DughmiHKN21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DujmovicEGJMM21,
author = {Vida Dujmovic and
Louis Esperet and
Cyril Gavoille and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin},
title = {Adjacency Labelling for Planar Graphs (and Beyond)},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {42:1--42:33},
year = {2021},
url = {https://doi.org/10.1145/3477542},
doi = {10.1145/3477542},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicEGJMM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FengGYZ21,
author = {Weiming Feng and
Heng Guo and
Yitong Yin and
Chihao Zhang},
title = {Fast Sampling and Counting \emph{k}-SAT Solutions in the Local Lemma
Regime},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {40:1--40:42},
year = {2021},
url = {https://doi.org/10.1145/3469832},
doi = {10.1145/3469832},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FengGYZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FuggerNS21,
author = {Matthias F{\"{u}}gger and
Thomas Nowak and
Manfred Schwarz},
title = {Tight Bounds for Asymptotic and Approximate Consensus},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {46:1--46:35},
year = {2021},
url = {https://doi.org/10.1145/3485242},
doi = {10.1145/3485242},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FuggerNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GanardiJL21,
author = {Moses Ganardi and
Artur Jez and
Markus Lohrey},
title = {Balancing Straight-line Programs},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {27:1--27:40},
year = {2021},
url = {https://doi.org/10.1145/3457389},
doi = {10.1145/3457389},
timestamp = {Wed, 01 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GanardiJL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GasieniecS21,
author = {Leszek Gasieniec and
Grzegorz Stachowiak},
title = {Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal
Leader Election},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {2:1--2:21},
year = {2021},
url = {https://doi.org/10.1145/3424659},
doi = {10.1145/3424659},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GasieniecS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GonczarowskiW21,
author = {Yannai A. Gonczarowski and
S. Matthew Weinberg},
title = {The Sample Complexity of Up-to-{\(\epsilon\)} Multi-dimensional Revenue
Maximization},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {15:1--15:28},
year = {2021},
url = {https://doi.org/10.1145/3439722},
doi = {10.1145/3439722},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GonczarowskiW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobHKL21,
author = {Georg Gottlob and
Andr{\'{e}} Hernich and
Clemens Kupke and
Thomas Lukasiewicz},
title = {Stable Model Semantics for Guarded Existential Rules and Description
Logics: Decidability and Complexity},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {35:1--35:87},
year = {2021},
url = {https://doi.org/10.1145/3447508},
doi = {10.1145/3447508},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GottlobHKL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobLPR21,
author = {Georg Gottlob and
Matthias Lanzinger and
Reinhard Pichler and
Igor Razgon},
title = {Complexity Analysis of Generalized and Fractional Hypertree Decompositions},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {38:1--38:50},
year = {2021},
url = {https://doi.org/10.1145/3457374},
doi = {10.1145/3457374},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GottlobLPR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HaeuplerS21,
author = {Bernhard Haeupler and
Amirbehshad Shahrasbi},
title = {Synchronization Strings: Codes for Insertions and Deletions Approaching
the Singleton Bound},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {36:1--36:39},
year = {2021},
url = {https://doi.org/10.1145/3468265},
doi = {10.1145/3468265},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HaeuplerS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarrisonB21,
author = {Peter G. Harrison and
Julianna Bor},
title = {Response Time Distribution in a Tandem Pair of Queues with Batch Processing},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {22:1--22:41},
year = {2021},
url = {https://doi.org/10.1145/3448973},
doi = {10.1145/3448973},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HarrisonB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hastad21,
author = {Johan H{\aa}stad},
title = {On Small-depth Frege Proofs for Tseitin for Grids},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {1:1--1:31},
year = {2021},
url = {https://doi.org/10.1145/3425606},
doi = {10.1145/3425606},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Hastad21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JinNGKJ21,
author = {Chi Jin and
Praneeth Netrapalli and
Rong Ge and
Sham M. Kakade and
Michael I. Jordan},
title = {On Nonconvex Optimization for Machine Learning: Gradients, Stochasticity,
and Saddle Points},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {11:1--11:29},
year = {2021},
url = {https://doi.org/10.1145/3418526},
doi = {10.1145/3418526},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JinNGKJ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LovettWZ21,
author = {Shachar Lovett and
Kewen Wu and
Jiapeng Zhang},
title = {Decision List Compression by Mild Random Restrictions},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {45:1--45:17},
year = {2021},
url = {https://doi.org/10.1145/3485007},
doi = {10.1145/3485007},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LovettWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LykourisV21,
author = {Thodoris Lykouris and
Sergei Vassilvitskii},
title = {Competitive Caching with Machine Learned Advice},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {24:1--24:25},
year = {2021},
url = {https://doi.org/10.1145/3447579},
doi = {10.1145/3447579},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LykourisV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MikaS21,
author = {Maksymilian Mika and
Marek Szykula},
title = {The Frobenius and Factor Universality Problems of the Kleene Star
of a Finite Set of Words},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {18:1--18:22},
year = {2021},
url = {https://doi.org/10.1145/3447237},
doi = {10.1145/3447237},
timestamp = {Mon, 20 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MikaS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MurawskiT21,
author = {Andrzej S. Murawski and
Nikos Tzevelekos},
title = {Game Semantics for Interface Middleweight Java},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {4:1--4:51},
year = {2021},
url = {https://doi.org/10.1145/3428676},
doi = {10.1145/3428676},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MurawskiT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SterlingH21,
author = {Jonathan Sterling and
Robert Harper},
title = {Logical Relations as Types: Proof-Relevant Parametricity for Program
Modules},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {41:1--41:47},
year = {2021},
url = {https://doi.org/10.1145/3474834},
doi = {10.1145/3474834},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SterlingH21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TabareauTS21,
author = {Nicolas Tabareau and
{\'{E}}ric Tanter and
Matthieu Sozeau},
title = {The Marriage of Univalence and Parametricity},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {5:1--5:44},
year = {2021},
url = {https://doi.org/10.1145/3429979},
doi = {10.1145/3429979},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/TabareauTS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {68},
number = {1},
pages = {6:1},
year = {2021},
url = {https://doi.org/10.1145/3442687},
doi = {10.1145/3442687},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21a,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {12e:1},
year = {2021},
url = {https://doi.org/10.1145/3456290},
doi = {10.1145/3456290},
timestamp = {Mon, 26 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21b,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {20:1},
year = {2021},
url = {https://doi.org/10.1145/3448013},
doi = {10.1145/3448013},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21c,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {29:1},
year = {2021},
url = {https://doi.org/10.1145/3464772},
doi = {10.1145/3464772},
timestamp = {Thu, 19 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21d,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {37:1},
year = {2021},
url = {https://doi.org/10.1145/3485044},
doi = {10.1145/3485044},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos21e,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {68},
number = {6},
pages = {47:1},
year = {2021},
url = {https://doi.org/10.1145/3490689},
doi = {10.1145/3490689},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos21e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TzameretC21,
author = {Iddo Tzameret and
Stephen A. Cook},
title = {Uniform, Integral, and Feasible Proofs for the Determinant Identities},
journal = {J. {ACM}},
volume = {68},
number = {2},
pages = {12:1--12:80},
year = {2021},
url = {https://doi.org/10.1145/3431922},
doi = {10.1145/3431922},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/TzameretC21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZengTX21,
author = {Yun Zeng and
Jian Tan and
Cathy H. Xia},
title = {Fork and Join Queueing Networks with Heavy Tails: Scaling Dimension
and Throughput Limit},
journal = {J. {ACM}},
volume = {68},
number = {3},
pages = {17:1--17:30},
year = {2021},
url = {https://doi.org/10.1145/3448213},
doi = {10.1145/3448213},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ZengTX21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Zhandry21,
author = {Mark Zhandry},
title = {How to Construct Quantum Random Functions},
journal = {J. {ACM}},
volume = {68},
number = {5},
pages = {33:1--33:43},
year = {2021},
url = {https://doi.org/10.1145/3450745},
doi = {10.1145/3450745},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Zhandry21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AnariV20,
author = {Nima Anari and
Vijay V. Vazirani},
title = {Planar Graph Perfect Matching Is in {NC}},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {21:1--21:34},
year = {2020},
url = {https://doi.org/10.1145/3397504},
doi = {10.1145/3397504},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AnariV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AshtianiBHLMP20,
author = {Hassan Ashtiani and
Shai Ben{-}David and
Nicholas J. A. Harvey and
Christopher Liaw and
Abbas Mehrabian and
Yaniv Plan},
title = {Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian
Mixtures via Compression Schemes},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {32:1--32:42},
year = {2020},
url = {https://doi.org/10.1145/3417994},
doi = {10.1145/3417994},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AshtianiBHLMP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasM20,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
title = {Automating Resolution is NP-Hard},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {31:1--31:17},
year = {2020},
url = {https://doi.org/10.1145/3409472},
doi = {10.1145/3409472},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BabaioffILW20,
author = {Moshe Babaioff and
Nicole Immorlica and
Brendan Lucier and
S. Matthew Weinberg},
title = {A Simple and Approximately Optimal Mechanism for an Additive Buyer},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {24:1--24:40},
year = {2020},
url = {https://doi.org/10.1145/3398745},
doi = {10.1145/3398745},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BabaioffILW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BangaloreCP20,
author = {Laasya Bangalore and
Ashish Choudhury and
Arpita Patra},
title = {The Power of Shunning: Efficient Asynchronous Byzantine Agreement
Revisited},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {14:1--14:59},
year = {2020},
url = {https://doi.org/10.1145/3388788},
doi = {10.1145/3388788},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BangaloreCP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarceloFGP20,
author = {Pablo Barcel{\'{o}} and
Diego Figueira and
Georg Gottlob and
Andreas Pieris},
title = {Semantic Optimization of Conjunctive Queries},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {34:1--34:60},
year = {2020},
url = {https://doi.org/10.1145/3424908},
doi = {10.1145/3424908},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarceloFGP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeyersdorffBCP20,
author = {Olaf Beyersdorff and
Ilario Bonacina and
Leroy Chew and
J{\'{a}}n Pich},
title = {Frege Systems for Quantified Boolean Logic},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {9:1--9:36},
year = {2020},
url = {https://doi.org/10.1145/3381881},
doi = {10.1145/3381881},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeyersdorffBCP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhargavaSV20,
author = {Vishwas Bhargava and
Shubhangi Saraf and
Ilya Volkovich},
title = {Deterministic Factorization of Sparse Polynomials with Bounded Individual
Degree},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {8:1--8:28},
year = {2020},
url = {https://doi.org/10.1145/3365667},
doi = {10.1145/3365667},
timestamp = {Fri, 22 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BhargavaSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlellochGSS20,
author = {Guy E. Blelloch and
Yan Gu and
Julian Shun and
Yihan Sun},
title = {Parallelism in Randomized Incremental Algorithms},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {27:1--27:27},
year = {2020},
url = {https://doi.org/10.1145/3402819},
doi = {10.1145/3402819},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlellochGSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Canetti20,
author = {Ran Canetti},
title = {Universally Composable Security},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {28:1--28:94},
year = {2020},
url = {https://doi.org/10.1145/3402457},
doi = {10.1145/3402457},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Canetti20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChakrabortyDGKS20,
author = {Diptarka Chakraborty and
Debarati Das and
Elazar Goldenberg and
Michal Kouck{\'{y}} and
Michael E. Saks},
title = {Approximating Edit Distance Within Constant Factor in Truly Sub-quadratic
Time},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {36:1--36:22},
year = {2020},
url = {https://doi.org/10.1145/3422823},
doi = {10.1145/3422823},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChakrabortyDGKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChattopadhyayMS20,
author = {Arkadev Chattopadhyay and
Nikhil S. Mande and
Suhail Sherif},
title = {The Log-Approximate-Rank Conjecture Is False},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {23:1--23:28},
year = {2020},
url = {https://doi.org/10.1145/3396695},
doi = {10.1145/3396695},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChattopadhyayMS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuaF20,
author = {Jeroen Chua and
Pedro F. Felzenszwalb},
title = {Scene Grammars, Factor Graphs, and Belief Propagation},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {19:1--19:41},
year = {2020},
url = {https://doi.org/10.1145/3396886},
doi = {10.1145/3396886},
timestamp = {Sat, 18 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuaF20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChudnovskySSS20,
author = {Maria Chudnovsky and
Alex Scott and
Paul D. Seymour and
Sophie Spirkl},
title = {Detecting an Odd Hole},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {5:1--5:12},
year = {2020},
url = {https://doi.org/10.1145/3375720},
doi = {10.1145/3375720},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChudnovskySSS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CiacciaMT20,
author = {Paolo Ciaccia and
Davide Martinenghi and
Riccardo Torlone},
title = {Foundations of Context-aware Preference Propagation},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {4:1--4:43},
year = {2020},
url = {https://doi.org/10.1145/3375713},
doi = {10.1145/3375713},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CiacciaMT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuditeHLSSV20,
author = {Miroslav Dud{\'{\i}}k and
Nika Haghtalab and
Haipeng Luo and
Robert E. Schapire and
Vasilis Syrgkanis and
Jennifer Wortman Vaughan},
title = {Oracle-efficient Online Learning and Auction Design},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {26:1--26:57},
year = {2020},
url = {https://doi.org/10.1145/3402203},
doi = {10.1145/3402203},
timestamp = {Wed, 01 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DuditeHLSSV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DujmovicJMMUW20,
author = {Vida Dujmovic and
Gwena{\"{e}}l Joret and
Piotr Micek and
Pat Morin and
Torsten Ueckerdt and
David R. Wood},
title = {Planar Graphs Have Bounded Queue-Number},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {22:1--22:38},
year = {2020},
url = {https://doi.org/10.1145/3385731},
doi = {10.1145/3385731},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DujmovicJMMUW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Elkin20,
author = {Michael Elkin},
title = {A Simple Deterministic Distributed {MST} Algorithm with Near-Optimal
Time and Message Complexities},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {13:1--13:15},
year = {2020},
url = {https://doi.org/10.1145/3380546},
doi = {10.1145/3380546},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Elkin20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Elkin20a,
author = {Michael Elkin},
title = {Distributed Exact Shortest Paths in Sublinear Time},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {15:1--15:36},
year = {2020},
url = {https://doi.org/10.1145/3387161},
doi = {10.1145/3387161},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Elkin20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EmekKLS20,
author = {Yuval Emek and
Shay Kutten and
Ron Lavi and
Yangguang Shi},
title = {Approximating Generalized Network Design under (Dis)economies of Scale
with Applications to Energy Efficiency},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {7:1--7:33},
year = {2020},
url = {https://doi.org/10.1145/3377387},
doi = {10.1145/3377387},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EmekKLS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EsparzaKS20,
author = {Javier Esparza and
Jan Kret{\'{\i}}nsk{\'{y}} and
Salomon Sickert},
title = {A Unified Translation of Linear Temporal Logic to {\(\omega\)}-Automata},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {33:1--33:61},
year = {2020},
url = {https://doi.org/10.1145/3417995},
doi = {10.1145/3417995},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EsparzaKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GagieNP20,
author = {Travis Gagie and
Gonzalo Navarro and
Nicola Prezza},
title = {Fully Functional Suffix Trees and Optimal Text Searching in BWT-Runs
Bounded Space},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {2:1--2:54},
year = {2020},
url = {https://doi.org/10.1145/3375890},
doi = {10.1145/3375890},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GagieNP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gaina20,
author = {Daniel Gaina},
title = {Forcing and Calculi for Hybrid Logics},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {25:1--25:55},
year = {2020},
url = {https://doi.org/10.1145/3400294},
doi = {10.1145/3400294},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gaina20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoemansR20,
author = {Michel X. Goemans and
Thomas Rothvoss},
title = {Polynomiality for Bin Packing with a Constant Number of Item Types},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {38:1--38:21},
year = {2020},
url = {https://doi.org/10.1145/3421750},
doi = {10.1145/3421750},
timestamp = {Mon, 30 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoemansR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GorenM20,
author = {Guy Goren and
Yoram Moses},
title = {Silence},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {3:1--3:26},
year = {2020},
url = {https://doi.org/10.1145/3377883},
doi = {10.1145/3377883},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GorenM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HuangKTWZZ20,
author = {Zhiyi Huang and
Ning Kang and
Zhihao Gavin Tang and
Xiaowei Wu and
Yuhao Zhang and
Xue Zhu},
title = {Fully Online Matching},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {17:1--17:25},
year = {2020},
url = {https://doi.org/10.1145/3390890},
doi = {10.1145/3390890},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HuangKTWZZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarstadtS20,
author = {Elaye Karstadt and
Oded Schwartz},
title = {Matrix Multiplication, a Little Faster},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {1:1--1:31},
year = {2020},
url = {https://doi.org/10.1145/3364504},
doi = {10.1145/3364504},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KarstadtS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KowalskiM20,
author = {Dariusz R. Kowalski and
Miguel A. Mosteiro},
title = {Polynomial Counting in Anonymous Dynamic Networks with Applications
to Anonymous Dynamic Algebraic Computations},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {11:1--11:17},
year = {2020},
url = {https://doi.org/10.1145/3385075},
doi = {10.1145/3385075},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KowalskiM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KratschW20,
author = {Stefan Kratsch and
Magnus Wahlstr{\"{o}}m},
title = {Representative Sets and Irrelevant Vertices: New Tools for Kernelization},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {16:1--16:50},
year = {2020},
url = {https://doi.org/10.1145/3390887},
doi = {10.1145/3390887},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KratschW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MesmayRST20,
author = {Arnaud de Mesmay and
Yo'av Rieck and
Eric Sedgwick and
Martin Tancer},
title = {Embeddability in R\({}^{\mbox{3}}\) is NP-hard},
journal = {J. {ACM}},
volume = {67},
number = {4},
pages = {20:1--20:29},
year = {2020},
url = {https://doi.org/10.1145/3396593},
doi = {10.1145/3396593},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MesmayRST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OlverV20,
author = {Neil Olver and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {A Simpler and Faster Strongly Polynomial Algorithm for Generalized
Flow Maximization},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {10:1--10:26},
year = {2020},
url = {https://doi.org/10.1145/3383454},
doi = {10.1145/3383454},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OlverV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PlatzerT20,
author = {Andr{\'{e}} Platzer and
Yong Kiam Tan},
title = {Differential Equation Invariance Axiomatization},
journal = {J. {ACM}},
volume = {67},
number = {1},
pages = {6:1--6:66},
year = {2020},
url = {https://doi.org/10.1145/3380825},
doi = {10.1145/3380825},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/PlatzerT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RaghvendraA20,
author = {Sharath Raghvendra and
Pankaj K. Agarwal},
title = {A Near-linear Time {\(\epsilon\)}-Approximation Algorithm for Geometric
Bipartite Matching},
journal = {J. {ACM}},
volume = {67},
number = {3},
pages = {18:1--18:19},
year = {2020},
url = {https://doi.org/10.1145/3393694},
doi = {10.1145/3393694},
timestamp = {Wed, 01 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RaghvendraA20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SvenssonTV20,
author = {Ola Svensson and
Jakub Tarnawski and
L{\'{a}}szl{\'{o}} A. V{\'{e}}gh},
title = {A Constant-factor Approximation Algorithm for the Asymmetric Traveling
Salesman Problem},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {37:1--37:53},
year = {2020},
url = {https://doi.org/10.1145/3424306},
doi = {10.1145/3424306},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SvenssonTV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos20,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {12:1},
year = {2020},
url = {https://doi.org/10.1145/3391411},
doi = {10.1145/3391411},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos20a,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {29:1},
year = {2020},
url = {https://doi.org/10.1145/3418066},
doi = {10.1145/3418066},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos20b,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {67},
number = {6},
pages = {35:1},
year = {2020},
url = {https://doi.org/10.1145/3429262},
doi = {10.1145/3429262},
timestamp = {Tue, 01 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos20b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Zhuk20,
author = {Dmitriy Zhuk},
title = {A Proof of the {CSP} Dichotomy Conjecture},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {30:1--30:78},
year = {2020},
url = {https://doi.org/10.1145/3402029},
doi = {10.1145/3402029},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Zhuk20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AckermanFR19,
author = {Nathanael L. Ackerman and
Cameron E. Freer and
Daniel M. Roy},
title = {On the Computability of Conditional Probability},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {23:1--23:40},
year = {2019},
url = {https://doi.org/10.1145/3321699},
doi = {10.1145/3321699},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AckermanFR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AdamaszekHW19,
author = {Anna Adamaszek and
Sariel Har{-}Peled and
Andreas Wiese},
title = {Approximation Schemes for Independent Set and Sparse Subsets of Polygons},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {29:1--29:40},
year = {2019},
url = {https://doi.org/10.1145/3326122},
doi = {10.1145/3326122},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AdamaszekHW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AvniHC19,
author = {Guy Avni and
Thomas A. Henzinger and
Ventsislav Chonev},
title = {Infinite-duration Bidding Games},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {31:1--31:29},
year = {2019},
url = {https://doi.org/10.1145/3340295},
doi = {10.1145/3340295},
timestamp = {Thu, 10 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AvniHC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeameL19,
author = {Paul Beame and
Vincent Liew},
title = {Toward Verifying Nonlinear Integer Arithmetic},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {22:1--22:30},
year = {2019},
url = {https://doi.org/10.1145/3319396},
doi = {10.1145/3319396},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeameL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenderFGY19,
author = {Michael A. Bender and
Jeremy T. Fineman and
Seth Gilbert and
Maxwell Young},
title = {Scaling Exponential Backoff: Constant Throughput, Polylogarithmic
Channel-Access Attempts, and Robustness},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {6:1--6:33},
year = {2019},
url = {https://doi.org/10.1145/3276769},
doi = {10.1145/3276769},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenderFGY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BernsteinHR19,
author = {Aaron Bernstein and
Jacob Holm and
Eva Rotenberg},
title = {Online Bipartite Matching with Amortized \emph{O}(log \({}^{\mbox{2}}\)
\emph{n}) Replacements},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {37:1--37:23},
year = {2019},
url = {https://doi.org/10.1145/3344999},
doi = {10.1145/3344999},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BernsteinHR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BishopFMNRSSW19,
author = {Steve Bishop and
Matthew Fairbairn and
Hannes Mehnert and
Michael Norrish and
Tom Ridge and
Peter Sewell and
Michael Smith and
Keith Wansbrough},
title = {Engineering with Logic: Rigorous Test-Oracle Specification and Validation
for {TCP/IP} and the Sockets {API}},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {1:1--1:77},
year = {2019},
url = {https://doi.org/10.1145/3243650},
doi = {10.1145/3243650},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BishopFMNRSSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BurgisserCL19,
author = {Peter B{\"{u}}rgisser and
Felipe Cucker and
Pierre Lairez},
title = {Computing the Homology of Basic Semialgebraic Sets in Weak Exponential
Time},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {5:1--5:30},
year = {2019},
url = {https://doi.org/10.1145/3275242},
doi = {10.1145/3275242},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BurgisserCL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BushkovDFG19,
author = {Victor Bushkov and
Dmytro Dziuma and
Panagiota Fatourou and
Rachid Guerraoui},
title = {The {PCL} Theorem: Transactions cannot be Parallel, Consistent, and
Live},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {2:1--2:66},
year = {2019},
url = {https://doi.org/10.1145/3266141},
doi = {10.1145/3266141},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BushkovDFG19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cheraghchi19,
author = {Mahdi Cheraghchi},
title = {Capacity Upper Bounds for Deletion-type Channels},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {9:1--9:79},
year = {2019},
url = {https://doi.org/10.1145/3281275},
doi = {10.1145/3281275},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cheraghchi19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen-AddadKMM19,
author = {Vincent Cohen{-}Addad and
Varun Kanade and
Frederik Mallmann{-}Trenn and
Claire Mathieu},
title = {Hierarchical Clustering: Objective Functions and Algorithms},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {26:1--26:42},
year = {2019},
url = {https://doi.org/10.1145/3321386},
doi = {10.1145/3321386},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cohen-AddadKMM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DespreL19,
author = {Vincent Despr{\'{e}} and
Francis Lazarus},
title = {Computing the Geometric Intersection Number of Curves},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {45:1--45:49},
year = {2019},
url = {https://doi.org/10.1145/3363367},
doi = {10.1145/3363367},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DespreL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DevanurJSW19,
author = {Nikhil R. Devanur and
Kamal Jain and
Balasubramanian Sivan and
Christopher A. Wilkens},
title = {Near Optimal Online Algorithms and Fast Approximation Algorithms for
Resource Allocation Problems},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {7:1--7:41},
year = {2019},
url = {https://doi.org/10.1145/3284177},
doi = {10.1145/3284177},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DevanurJSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DisserHK19,
author = {Yann Disser and
Jan Hackfeld and
Max Klimm},
title = {Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple
Agents},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {40:1--40:41},
year = {2019},
url = {https://doi.org/10.1145/3356883},
doi = {10.1145/3356883},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DisserHK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerrereMNP19,
author = {Thomas Ferr{\`{e}}re and
Oded Maler and
Dejan Nickovic and
Amir Pnueli},
title = {From Real-time Logic to Timed Automata},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {19:1--19:31},
year = {2019},
url = {https://doi.org/10.1145/3286976},
doi = {10.1145/3286976},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FerrereMNP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FominGLS19,
author = {Fedor V. Fomin and
Serge Gaspers and
Daniel Lokshtanov and
Saket Saurabh},
title = {Exact Algorithms via Monotone Local Search},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {8:1--8:23},
year = {2019},
url = {https://doi.org/10.1145/3284176},
doi = {10.1145/3284176},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FominGLS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FraigniaudKR19,
author = {Pierre Fraigniaud and
Amos Korman and
Yoav Rodeh},
title = {Parallel Bayesian Search with No Coordination},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {17:1--17:28},
year = {2019},
url = {https://doi.org/10.1145/3304111},
doi = {10.1145/3304111},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FraigniaudKR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoaocPPTW19,
author = {Xavier Goaoc and
Pavel Pat{\'{a}}k and
Zuzana Pat{\'{a}}kov{\'{a}} and
Martin Tancer and
Uli Wagner},
title = {Shellability is NP-complete},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {21:1--21:18},
year = {2019},
url = {https://doi.org/10.1145/3314024},
doi = {10.1145/3314024},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoaocPPTW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuoJL19,
author = {Heng Guo and
Mark Jerrum and
Jingcheng Liu},
title = {Uniform Sampling Through the Lov{\'{a}}sz Local Lemma},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {18:1--18:31},
year = {2019},
url = {https://doi.org/10.1145/3310131},
doi = {10.1145/3310131},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuoJL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarrisS19,
author = {David G. Harris and
Aravind Srinivasan},
title = {The Moser-Tardos Framework with Partial Resampling},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {36:1--36:45},
year = {2019},
url = {https://doi.org/10.1145/3342222},
doi = {10.1145/3342222},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HarrisS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IkenmeyerKLLMS19,
author = {Christian Ikenmeyer and
Balagopal Komarath and
Christoph Lenzen and
Vladimir Lysikov and
Andrey Mokhov and
Karteek Sreenivasaiah},
title = {On the Complexity of Hazard-free Circuits},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {25:1--25:20},
year = {2019},
url = {https://doi.org/10.1145/3320123},
doi = {10.1145/3320123},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/IkenmeyerKLLMS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ImpagliazzoMZ19,
author = {Russell Impagliazzo and
Raghu Meka and
David Zuckerman},
title = {Pseudorandomness from Shrinkage},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {11:1--11:16},
year = {2019},
url = {https://doi.org/10.1145/3230630},
doi = {10.1145/3230630},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ImpagliazzoMZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IwataOT19,
author = {Satoru Iwata and
Taihei Oki and
Mizuyo Takamatsu},
title = {Index Reduction for Differential-algebraic Equations with Mixed Matrices},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {35:1--35:34},
year = {2019},
url = {https://doi.org/10.1145/3341499},
doi = {10.1145/3341499},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/IwataOT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jez19,
author = {Artur Jez},
title = {Deciding Context Unification},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {39:1--39:45},
year = {2019},
url = {https://doi.org/10.1145/3356904},
doi = {10.1145/3356904},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Jez19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaneLM19,
author = {Daniel M. Kane and
Shachar Lovett and
Shay Moran},
title = {Near-optimal Linear Decision Trees for k-SUM and Related Problems},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {16:1--16:18},
year = {2019},
url = {https://doi.org/10.1145/3285953},
doi = {10.1145/3285953},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaneLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KawarabayashiT19,
author = {Ken{-}ichi Kawarabayashi and
Mikkel Thorup},
title = {Deterministic Edge Connectivity in Near-Linear Time},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {4:1--4:50},
year = {2019},
url = {https://doi.org/10.1145/3274663},
doi = {10.1145/3274663},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KawarabayashiT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KieferPS19,
author = {Sandra Kiefer and
Ilia Ponomarenko and
Pascal Schweitzer},
title = {The Weisfeiler-Leman Dimension of Planar Graphs Is at Most 3},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {44:1--44:31},
year = {2019},
url = {https://doi.org/10.1145/3333003},
doi = {10.1145/3333003},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KieferPS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KleinbergSU19,
author = {Robert Kleinberg and
Aleksandrs Slivkins and
Eli Upfal},
title = {Bandits and Experts in Metric Spaces},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {30:1--30:77},
year = {2019},
url = {https://doi.org/10.1145/3299873},
doi = {10.1145/3299873},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KleinbergSU19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KomargodskiNY19,
author = {Ilan Komargodski and
Moni Naor and
Eylon Yogev},
title = {White-Box vs. Black-Box Complexity of Search Problems: Ramsey and
Graph Property Testing},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {34:1--34:28},
year = {2019},
url = {https://doi.org/10.1145/3341106},
doi = {10.1145/3341106},
timestamp = {Thu, 10 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KomargodskiNY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LenzenR19,
author = {Christoph Lenzen and
Joel Rybicki},
title = {Self-Stabilising Byzantine Clock Synchronisation Is Almost as Easy
as Consensus},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {32:1--32:56},
year = {2019},
url = {https://doi.org/10.1145/3339471},
doi = {10.1145/3339471},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LenzenR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MalajovichS19,
author = {Gregorio Malajovich and
Mike Shub},
title = {A Theory of NP-completeness and Ill-conditioning for Approximate Real
Computations},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {27:1--27:38},
year = {2019},
url = {https://doi.org/10.1145/3321479},
doi = {10.1145/3321479},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MalajovichS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mendelson19,
author = {Shahar Mendelson},
title = {An Unrestricted Learning Procedure},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {42:1--42:42},
year = {2019},
url = {https://doi.org/10.1145/3361699},
doi = {10.1145/3361699},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mendelson19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Moitra19,
author = {Ankur Moitra},
title = {Approximate Counting, the Lov{\'{a}}sz Local Lemma, and Inference
in Graphical Models},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {10:1--10:25},
year = {2019},
url = {https://doi.org/10.1145/3268930},
doi = {10.1145/3268930},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Moitra19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MonniauxT19,
author = {David Monniaux and
Valentin Touzeau},
title = {On the Complexity of Cache Analysis for Different Replacement Policies},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {41:1--41:22},
year = {2019},
url = {https://doi.org/10.1145/3366018},
doi = {10.1145/3366018},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MonniauxT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OuakninePPW19,
author = {Jo{\"{e}}l Ouaknine and
Amaury Pouly and
Jo{\~{a}}o Sousa Pinto and
James Worrell},
title = {On the Decidability of Membership in Matrix-exponential Semigroups},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {15:1--15:24},
year = {2019},
url = {https://doi.org/10.1145/3286487},
doi = {10.1145/3286487},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/OuakninePPW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PlaceZ19,
author = {Thomas Place and
Marc Zeitoun},
title = {Going Higher in First-Order Quantifier Alternation Hierarchies on
Words},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {12:1--12:65},
year = {2019},
url = {https://doi.org/10.1145/3303991},
doi = {10.1145/3303991},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/PlaceZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RahliBCC19,
author = {Vincent Rahli and
Mark Bickford and
Liron Cohen and
Robert L. Constable},
title = {Bar Induction is Compatible with Constructive Type Theory},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {13:1--13:35},
year = {2019},
url = {https://doi.org/10.1145/3305261},
doi = {10.1145/3305261},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RahliBCC19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Raz19,
author = {Ran Raz},
title = {Fast Learning Requires Good Memory: {A} Time-Space Lower Bound for
Parity Learning},
journal = {J. {ACM}},
volume = {66},
number = {1},
pages = {3:1--3:18},
year = {2019},
url = {https://doi.org/10.1145/3186563},
doi = {10.1145/3186563},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Raz19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RomashchenkoZ19,
author = {Andrei E. Romashchenko and
Marius Zimand},
title = {An Operational Characterization of Mutual Information in Algorithmic
Information Theory},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {38:1--38:42},
year = {2019},
url = {https://doi.org/10.1145/3356867},
doi = {10.1145/3356867},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RomashchenkoZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SLM19,
author = {Karthik C. S. and
Bundit Laekhanukit and
Pasin Manurangsi},
title = {On the Parameterized Complexity of Approximating Dominating Set},
journal = {J. {ACM}},
volume = {66},
number = {5},
pages = {33:1--33:38},
year = {2019},
url = {https://doi.org/10.1145/3325116},
doi = {10.1145/3325116},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SeboZ19,
author = {Andr{\'{a}}s Seb{\"{o}} and
Anke van Zuylen},
title = {The Salesman's Improved Paths through Forests},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {28:1--28:16},
year = {2019},
url = {https://doi.org/10.1145/3326123},
doi = {10.1145/3326123},
timestamp = {Thu, 10 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SeboZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos19,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {66},
number = {3},
pages = {20:1},
year = {2019},
url = {https://doi.org/10.1145/3328536},
doi = {10.1145/3328536},
timestamp = {Wed, 26 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos19a,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {66},
number = {6},
pages = {43:1},
year = {2019},
url = {https://doi.org/10.1145/3371337},
doi = {10.1145/3371337},
timestamp = {Tue, 07 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TraubV19,
author = {Vera Traub and
Jens Vygen},
title = {Approaching 3/2 for the \emph{s}-\emph{t}-path {TSP}},
journal = {J. {ACM}},
volume = {66},
number = {2},
pages = {14:1--14:17},
year = {2019},
url = {https://doi.org/10.1145/3309715},
doi = {10.1145/3309715},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/TraubV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WirthSYCS19,
author = {Fabian R. Wirth and
Sonja St{\"{u}}dli and
Jia Yuan Yu and
Martin Corless and
Robert Shorten},
title = {Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD,
and Optimisation},
journal = {J. {ACM}},
volume = {66},
number = {4},
pages = {24:1--24:37},
year = {2019},
url = {https://doi.org/10.1145/3312741},
doi = {10.1145/3312741},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WirthSYCS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbadiBF18,
author = {Mart{\'{\i}}n Abadi and
Bruno Blanchet and
C{\'{e}}dric Fournet},
title = {The Applied Pi Calculus: Mobile Values, New Names, and Secure Communication},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {1:1--1:41},
year = {2018},
url = {https://doi.org/10.1145/3127586},
doi = {10.1145/3127586},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AbadiBF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesACE18,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel and
Faith Ellen},
title = {Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {38:1--38:2},
year = {2018},
url = {https://doi.org/10.1145/3231592},
doi = {10.1145/3231592},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AspnesACE18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaGHR18,
author = {Hagit Attiya and
Alexey Gotsman and
Sandeep Hans and
Noam Rinetzky},
title = {Characterizing Transactional Memory Consistency Conditions Using Observational
Refinement},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {2:1--2:44},
year = {2018},
url = {https://doi.org/10.1145/3131360},
doi = {10.1145/3131360},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaGHR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BabaioffIKK18,
author = {Moshe Babaioff and
Nicole Immorlica and
David Kempe and
Robert Kleinberg},
title = {Matroid Secretary Problems},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {35:1--35:26},
year = {2018},
url = {https://doi.org/10.1145/3212512},
doi = {10.1145/3212512},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BabaioffIKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BadanidiyuruKS18,
author = {Ashwinkumar Badanidiyuru and
Robert Kleinberg and
Aleksandrs Slivkins},
title = {Bandits with Knapsacks},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {13:1--13:55},
year = {2018},
url = {https://doi.org/10.1145/3164539},
doi = {10.1145/3164539},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BadanidiyuruKS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BermanHT18,
author = {Itay Berman and
Iftach Haitner and
Aris Tentes},
title = {Coin Flipping of \emph{Any} Constant Bias Implies One-Way Functions},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {14:1--14:95},
year = {2018},
url = {https://doi.org/10.1145/2979676},
doi = {10.1145/2979676},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BermanHT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BienvenuKKPZ18,
author = {Meghyn Bienvenu and
Stanislav Kikot and
Roman Kontchakov and
Vladimir V. Podolskii and
Michael Zakharyaschev},
title = {Ontology-Mediated Queries: Combined Complexity and Succinctness of
Rewritings via Circuit Complexity},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {28:1--28:51},
year = {2018},
url = {https://doi.org/10.1145/3191832},
doi = {10.1145/3191832},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BienvenuKKPZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BitanskyV18,
author = {Nir Bitansky and
Vinod Vaikuntanathan},
title = {Indistinguishability Obfuscation from Functional Encryption},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {39:1--39:37},
year = {2018},
url = {https://doi.org/10.1145/3234511},
doi = {10.1145/3234511},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BitanskyV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodirskyMM18,
author = {Manuel Bodirsky and
Barnaby Martin and
Antoine Mottet},
title = {Discrete Temporal Constraint Satisfaction Problems},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {9:1--9:41},
year = {2018},
url = {https://doi.org/10.1145/3154832},
doi = {10.1145/3154832},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BodirskyMM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrandlBEG18,
author = {Florian Brandl and
Felix Brandt and
Manuel Eberl and
Christian Geist},
title = {Proving the Incompatibility of Efficiency and Strategyproofness via
{SMT} Solving},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {6:1--6:28},
year = {2018},
url = {https://doi.org/10.1145/3125642},
doi = {10.1145/3125642},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrandlBEG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BravermanEGH18,
author = {Mark Braverman and
Klim Efremenko and
Ran Gelles and
Bernhard Haeupler},
title = {Constant-Rate Coding for Multiparty Interactive Communication Is Impossible},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {4:1--4:41},
year = {2018},
url = {https://doi.org/10.1145/3050218},
doi = {10.1145/3050218},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BravermanEGH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BringmannIZ18,
author = {Karl Bringmann and
Christian Ikenmeyer and
Jeroen Zuiddam},
title = {On Algebraic Branching Programs of Small Width},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {32:1--32:29},
year = {2018},
url = {https://doi.org/10.1145/3209663},
doi = {10.1145/3209663},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BringmannIZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CastanedaRR18,
author = {Armando Casta{\~{n}}eda and
Sergio Rajsbaum and
Michel Raynal},
title = {Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {45:1--45:42},
year = {2018},
url = {https://doi.org/10.1145/3266457},
doi = {10.1145/3266457},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CastanedaRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CeroneG18,
author = {Andrea Cerone and
Alexey Gotsman},
title = {Analysing Snapshot Isolation},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {11:1--11:41},
year = {2018},
url = {https://doi.org/10.1145/3152396},
doi = {10.1145/3152396},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CeroneG18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChanLTZ18,
author = {T.{-}H. Hubert Chan and
Anand Louis and
Zhihao Gavin Tang and
Chenzi Zhang},
title = {Spectral Properties of Hypergraph Laplacian and Approximation Algorithms},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {15:1--15:48},
year = {2018},
url = {https://doi.org/10.1145/3178123},
doi = {10.1145/3178123},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChanLTZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenSTWX18,
author = {Xi Chen and
Rocco A. Servedio and
Li{-}Yang Tan and
Erik Waingarten and
Jinyu Xie},
title = {Settling the Query Complexity of Non-adaptive Junta Testing},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {40:1--40:18},
year = {2018},
url = {https://doi.org/10.1145/3213772},
doi = {10.1145/3213772},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenSTWX18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChierichettiGLP18,
author = {Flavio Chierichetti and
George Giakkoupis and
Silvio Lattanzi and
Alessandro Panconesi},
title = {Rumor Spreading and Conductance},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {17:1--17:21},
year = {2018},
url = {https://doi.org/10.1145/3173043},
doi = {10.1145/3173043},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChierichettiGLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganKN18,
author = {Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Fast Hamiltonicity Checking Via Bases of Perfect Matchings},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {12:1--12:46},
year = {2018},
url = {https://doi.org/10.1145/3148227},
doi = {10.1145/3148227},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CyganKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CzerwinskiMNP18,
author = {Wojciech Czerwinski and
Wim Martens and
Matthias Niewerth and
Pawel Parys},
title = {Minimization of Tree Patterns},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {26:1--26:46},
year = {2018},
url = {https://doi.org/10.1145/3180281},
doi = {10.1145/3180281},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CzerwinskiMNP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DattaKMSZ18,
author = {Samir Datta and
Raghav Kulkarni and
Anish Mukherjee and
Thomas Schwentick and
Thomas Zeume},
title = {Reachability Is in DynFO},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {33:1--33:24},
year = {2018},
url = {https://doi.org/10.1145/3212685},
doi = {10.1145/3212685},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DattaKMSZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DelgrandePW18,
author = {James P. Delgrande and
Pavlos Peppas and
Stefan Woltran},
title = {General Belief Revision},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {29:1--29:34},
year = {2018},
url = {https://doi.org/10.1145/3203409},
doi = {10.1145/3203409},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DelgrandePW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DziembowskiPW18,
author = {Stefan Dziembowski and
Krzysztof Pietrzak and
Daniel Wichs},
title = {Non-Malleable Codes},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {20:1--20:32},
year = {2018},
url = {https://doi.org/10.1145/3178432},
doi = {10.1145/3178432},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DziembowskiPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EhrhardPT18,
author = {Thomas Ehrhard and
Michele Pagani and
Christine Tasson},
title = {Full Abstraction for Probabilistic {PCF}},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {23:1--23:44},
year = {2018},
url = {https://doi.org/10.1145/3164540},
doi = {10.1145/3164540},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EhrhardPT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FominLS18,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Saket Saurabh},
title = {Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {10:1--10:44},
year = {2018},
url = {https://doi.org/10.1145/3154833},
doi = {10.1145/3154833},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FominLS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FriedrichsL18,
author = {Stephan Friedrichs and
Christoph Lenzen},
title = {Parallel Metric Tree Embedding Based on an Algebraic View on Moore-Bellman-Ford},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {43:1--43:55},
year = {2018},
url = {https://doi.org/10.1145/3231591},
doi = {10.1145/3231591},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FriedrichsL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GrochowP18,
author = {Joshua A. Grochow and
Toniann Pitassi},
title = {Circuit Complexity, Proof Complexity, and Polynomial Identity Testing:
The Ideal Proof System},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {37:1--37:59},
year = {2018},
url = {https://doi.org/10.1145/3230742},
doi = {10.1145/3230742},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GrochowP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GronlundP18,
author = {Allan Gr{\o}nlund and
Seth Pettie},
title = {Threesomes, Degenerates, and Love Triangles},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {22:1--22:25},
year = {2018},
url = {https://doi.org/10.1145/3185378},
doi = {10.1145/3185378},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GronlundP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarrisSS18,
author = {David G. Harris and
Johannes Schneider and
Hsin{-}Hao Su},
title = {Distributed ({\(\Delta\)} +1)-Coloring in Sublogarithmic Rounds},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {19:1--19:21},
year = {2018},
url = {https://doi.org/10.1145/3178120},
doi = {10.1145/3178120},
timestamp = {Wed, 15 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HarrisSS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HenzingerKN18,
author = {Monika Henzinger and
Sebastian Krinninger and
Danupon Nanongkai},
title = {Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear
Total Update Time},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {36:1--36:40},
year = {2018},
url = {https://doi.org/10.1145/3218657},
doi = {10.1145/3218657},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HenzingerKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ImKM18,
author = {Sungjin Im and
Janardhan Kulkarni and
Kamesh Munagala},
title = {Competitive Algorithms from Competitive Equilibria: Non-Clairvoyant
Scheduling under Polyhedral Constraints},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {3:1--3:33},
year = {2018},
url = {https://doi.org/10.1145/3136754},
doi = {10.1145/3136754},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ImKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaminskiKMO18,
author = {Benjamin Lucien Kaminski and
Joost{-}Pieter Katoen and
Christoph Matheja and
Federico Olmedo},
title = {Weakest Precondition Reasoning for Expected Runtimes of Randomized
Algorithms},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {30:1--30:68},
year = {2018},
url = {https://doi.org/10.1145/3208102},
doi = {10.1145/3208102},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaminskiKMO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KurokawaPW18,
author = {David Kurokawa and
Ariel D. Procaccia and
Junxing Wang},
title = {Fair Enough: Guaranteeing Approximate Maximin Shares},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {8:1--8:27},
year = {2018},
url = {https://doi.org/10.1145/3140756},
doi = {10.1145/3140756},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KurokawaPW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lin18,
author = {Bingkai Lin},
title = {The Parameterized Complexity of the \emph{k}-Biclique Problem},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {34:1--34:23},
year = {2018},
url = {https://doi.org/10.1145/3212622},
doi = {10.1145/3212622},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Lin18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MakarychevS18,
author = {Konstantin Makarychev and
Maxim Sviridenko},
title = {Solving Optimization Problems with Diseconomies of Scale via Decoupling},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {42:1--42:27},
year = {2018},
url = {https://doi.org/10.1145/3266140},
doi = {10.1145/3266140},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MakarychevS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MatousekSTW18,
author = {Jir{\'{\i}} Matousek and
Eric Sedgwick and
Martin Tancer and
Uli Wagner},
title = {Embeddability in the 3-Sphere Is Decidable},
journal = {J. {ACM}},
volume = {65},
number = {1},
pages = {5:1--5:49},
year = {2018},
url = {https://doi.org/10.1145/3078632},
doi = {10.1145/3078632},
timestamp = {Thu, 13 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MatousekSTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Molloy18,
author = {Michael Molloy},
title = {The Freezing Threshold for \emph{k}-Colourings of a Random Graph},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {7:1--7:62},
year = {2018},
url = {https://doi.org/10.1145/3034781},
doi = {10.1145/3034781},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Molloy18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NgoPRR18,
author = {Hung Q. Ngo and
Ely Porat and
Christopher R{\'{e}} and
Atri Rudra},
title = {Worst-case Optimal Join Algorithms},
journal = {J. {ACM}},
volume = {65},
number = {3},
pages = {16:1--16:40},
year = {2018},
url = {https://doi.org/10.1145/3180143},
doi = {10.1145/3180143},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NgoPRR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RoughgardenVW18,
author = {Tim Roughgarden and
Sergei Vassilvitskii and
Joshua R. Wang},
title = {Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {41:1--41:24},
year = {2018},
url = {https://doi.org/10.1145/3232536},
doi = {10.1145/3232536},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RoughgardenVW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SchreiberKM18,
author = {Ethan L. Schreiber and
Richard E. Korf and
Michael D. Moffitt},
title = {Optimal Multi-Way Number Partitioning},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {24:1--24:61},
year = {2018},
url = {https://doi.org/10.1145/3184400},
doi = {10.1145/3184400},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SchreiberKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SeidlMK18,
author = {Helmut Seidl and
Sebastian Maneth and
Gregor Kemper},
title = {Equivalence of Deterministic Top-Down Tree-to-String Transducers Is
Decidable},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {21:1--21:30},
year = {2018},
url = {https://doi.org/10.1145/3182653},
doi = {10.1145/3182653},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SeidlMK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StefanovDSCFRYD18,
author = {Emil Stefanov and
Marten van Dijk and
Elaine Shi and
T.{-}H. Hubert Chan and
Christopher W. Fletcher and
Ling Ren and
Xiangyao Yu and
Srinivas Devadas},
title = {Path {ORAM:} An Extremely Simple Oblivious {RAM} Protocol},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {18:1--18:26},
year = {2018},
url = {https://doi.org/10.1145/3177872},
doi = {10.1145/3177872},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/StefanovDSCFRYD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos18,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {65},
number = {1},
year = {2018},
url = {https://doi.org/10.1145/3159447},
doi = {10.1145/3159447},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos18a,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {65},
number = {2},
pages = {11e:1},
year = {2018},
url = {https://doi.org/10.1145/3186890},
doi = {10.1145/3186890},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos18b,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {65},
number = {3},
year = {2018},
url = {https://doi.org/10.1145/3186892},
doi = {10.1145/3186892},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos18b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos18c,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {65},
number = {4},
pages = {25:1--25:61},
year = {2018},
url = {https://doi.org/10.1145/3231052},
doi = {10.1145/3231052},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos18c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos18d,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {65},
number = {6},
pages = {44:1},
year = {2018},
url = {https://doi.org/10.1145/3241947},
doi = {10.1145/3241947},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Tardos18d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WilliamsW18,
author = {Virginia Vassilevska Williams and
R. Ryan Williams},
title = {Subcubic Equivalences Between Path, Matrix, and Triangle Problems},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {27:1--27:38},
year = {2018},
url = {https://doi.org/10.1145/3186893},
doi = {10.1145/3186893},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WilliamsW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/YuZJ18,
author = {Haifeng Yu and
Yuda Zhao and
Irvan Jahja},
title = {The Cost of Unknown Diameter in Dynamic Networks},
journal = {J. {ACM}},
volume = {65},
number = {5},
pages = {31:1--31:34},
year = {2018},
url = {https://doi.org/10.1145/3209665},
doi = {10.1145/3209665},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/YuZJ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbboudB17,
author = {Amir Abboud and
Greg Bodwin},
title = {The 4/3 Additive Spanner Exponent Is Tight},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {28:1--28:20},
year = {2017},
url = {https://doi.org/10.1145/3088511},
doi = {10.1145/3088511},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbboudB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbdullaAJS17,
author = {Parosh Aziz Abdulla and
Stavros Aronis and
Bengt Jonsson and
Konstantinos Sagonas},
title = {Source Sets: {A} Foundation for Optimal Dynamic Partial Order Reduction},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {25:1--25:49},
year = {2017},
url = {https://doi.org/10.1145/3073408},
doi = {10.1145/3073408},
timestamp = {Tue, 31 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AbdullaAJS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AfshaniBC17,
author = {Peyman Afshani and
J{\'{e}}r{\'{e}}my Barbay and
Timothy M. Chan},
title = {Instance-Optimal Geometric Algorithms},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {3:1--3:38},
year = {2017},
url = {https://doi.org/10.1145/3046673},
doi = {10.1145/3046673},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AfshaniBC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgrawalG17,
author = {Shipra Agrawal and
Navin Goyal},
title = {Near-Optimal Regret Bounds for Thompson Sampling},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {30:1--30:24},
year = {2017},
url = {https://doi.org/10.1145/3088510},
doi = {10.1145/3088510},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AgrawalG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlstrupDK17,
author = {Stephen Alstrup and
S{\o}ren Dahlgaard and
Mathias B{\ae}k Tejs Knudsen},
title = {Optimal Induced Universal Graphs and Adjacency Labeling for Trees},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {27:1--27:22},
year = {2017},
url = {https://doi.org/10.1145/3088513},
doi = {10.1145/3088513},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlstrupDK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlurD17,
author = {Rajeev Alur and
Loris D'Antoni},
title = {Streaming Tree Transducers},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {31:1--31:55},
year = {2017},
url = {https://doi.org/10.1145/3092842},
doi = {10.1145/3092842},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlurD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisBBLSS17,
author = {Andris Ambainis and
Kaspars Balodis and
Aleksandrs Belovs and
Troy Lee and
Miklos Santha and
Juris Smotrovs},
title = {Separations in Query Complexity Based on Pointer Functions},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {32:1--32:24},
year = {2017},
url = {https://doi.org/10.1145/3106234},
doi = {10.1145/3106234},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AmbainisBBLSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmelootGKNS17,
author = {Tom J. Ameloot and
Gaetano Geck and
Bas Ketsman and
Frank Neven and
Thomas Schwentick},
title = {Parallel-Correctness and Transferability for Conjunctive Queries},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {36:1--36:38},
year = {2017},
url = {https://doi.org/10.1145/3106412},
doi = {10.1145/3106412},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AmelootGKNS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ApplebaumAB17,
author = {Benny Applebaum and
Jonathan Avron and
Chris Brzuska},
title = {Arithmetic Cryptography},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {10:1--10:74},
year = {2017},
url = {https://doi.org/10.1145/3046675},
doi = {10.1145/3046675},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ApplebaumAB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AwasthiBL17,
author = {Pranjal Awasthi and
Maria{-}Florina Balcan and
Philip M. Long},
title = {The Power of Localization for Efficiently Learning Linear Separators
with Noise},
journal = {J. {ACM}},
volume = {63},
number = {6},
pages = {50:1--50:27},
year = {2017},
url = {https://doi.org/10.1145/3006384},
doi = {10.1145/3006384},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AwasthiBL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bar-YehudaCS17,
author = {Reuven Bar{-}Yehuda and
Keren Censor{-}Hillel and
Gregory Schwartzman},
title = {A Distributed {(2} + {\(\epsilon\)})-Approximation for Vertex Cover
in O(log {\(\Delta\)} / {\(\epsilon\)} log log {\(\Delta\)}) Rounds},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {23:1--23:11},
year = {2017},
url = {https://doi.org/10.1145/3060294},
doi = {10.1145/3060294},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bar-YehudaCS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeameKS17,
author = {Paul Beame and
Paraschos Koutris and
Dan Suciu},
title = {Communication Steps for Parallel Query Processing},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {40:1--40:58},
year = {2017},
url = {https://doi.org/10.1145/3125644},
doi = {10.1145/3125644},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeameKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BertrandGG17,
author = {Nathalie Bertrand and
Blaise Genest and
Hugo Gimbert},
title = {Qualitative Determinacy and Decidability of Stochastic Games with
Signals},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {33:1--33:48},
year = {2017},
url = {https://doi.org/10.1145/3107926},
doi = {10.1145/3107926},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BertrandGG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BournezGP17,
author = {Olivier Bournez and
Daniel Silva Gra{\c{c}}a and
Amaury Pouly},
title = {Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential
Equations of Polynomial Length},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {38:1--38:76},
year = {2017},
url = {https://doi.org/10.1145/3127496},
doi = {10.1145/3127496},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BournezGP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CaiC17,
author = {Jin{-}Yi Cai and
Xi Chen},
title = {Complexity of Counting {CSP} with Complex Weights},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {19:1--19:39},
year = {2017},
url = {https://doi.org/10.1145/2822891},
doi = {10.1145/2822891},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CaiC17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChatterjeeV17,
author = {Krishnendu Chatterjee and
Yaron Velner},
title = {The Complexity of Mean-Payoff Pushdown Games},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {34:1--34:49},
year = {2017},
url = {https://doi.org/10.1145/3121408},
doi = {10.1145/3121408},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChatterjeeV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chen17,
author = {Hubie Chen},
title = {The Tractability Frontier of Graph-Like First-Order Query Sets},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {26:1--26:29},
year = {2017},
url = {https://doi.org/10.1145/3073409},
doi = {10.1145/3073409},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chen17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenPY17,
author = {Xi Chen and
Dimitris Paparas and
Mihalis Yannakakis},
title = {The Complexity of Non-Monotone Markets},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {20:1--20:56},
year = {2017},
url = {https://doi.org/10.1145/3064810},
doi = {10.1145/3064810},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenPY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Coja-Oghlan17,
author = {Amin Coja{-}Oghlan},
title = {Belief Propagation Guided Decimation Fails on Random Formulas},
journal = {J. {ACM}},
volume = {63},
number = {6},
pages = {49:1--49:55},
year = {2017},
url = {https://doi.org/10.1145/3005398},
doi = {10.1145/3005398},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Coja-Oghlan17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CookKP17,
author = {Byron Cook and
Heidy Khlaaf and
Nir Piterman},
title = {Verifying Increasingly Expressive Temporal Logics for Infinite-State
Systems},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {15:1--15:39},
year = {2017},
url = {https://doi.org/10.1145/3060257},
doi = {10.1145/3060257},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CookKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganFGKMPS17,
author = {Marek Cygan and
Fedor V. Fomin and
Alexander Golovnev and
Alexander S. Kulikov and
Ivan Mihajlin and
Jakub Pachocki and
Arkadiusz Socala},
title = {Tight Lower Bounds on Graph Embedding Problems},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {18:1--18:22},
year = {2017},
url = {https://doi.org/10.1145/3051094},
doi = {10.1145/3051094},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CyganFGKMPS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DannaHKKMRS17,
author = {Emilie Danna and
Avinatan Hassidim and
Haim Kaplan and
Alok Kumar and
Yishay Mansour and
Danny Raz and
Michal Segalov},
title = {Upward Max-Min Fairness},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {2:1--2:24},
year = {2017},
url = {https://doi.org/10.1145/3011282},
doi = {10.1145/3011282},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DannaHKKMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Davies17,
author = {Rowan Davies},
title = {A Temporal Logic Approach to Binding-Time Analysis},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {1:1--1:45},
year = {2017},
url = {https://doi.org/10.1145/3011069},
doi = {10.1145/3011069},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Davies17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DinS17,
author = {Mohab Safey El Din and
{\'{E}}ric Schost},
title = {A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth
and Bounded Real Algebraic Sets},
journal = {J. {ACM}},
volume = {63},
number = {6},
pages = {48:1--48:37},
year = {2017},
url = {https://doi.org/10.1145/2996450},
doi = {10.1145/2996450},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DinS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerJM17,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {On the Switch Markov Chain for Perfect Matchings},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {12:1--12:33},
year = {2017},
url = {https://doi.org/10.1145/2822322},
doi = {10.1145/2822322},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FeldmanGRVX17,
author = {Vitaly Feldman and
Elena Grigorescu and
Lev Reyzin and
Santosh S. Vempala and
Ying Xiao},
title = {Statistical Algorithms and a Lower Bound for Detecting Planted Cliques},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {8:1--8:37},
year = {2017},
url = {https://doi.org/10.1145/3046674},
doi = {10.1145/3046674},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FeldmanGRVX17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalMPZ17,
author = {Ya'akov (Kobi) Gal and
Moshe Mash and
Ariel D. Procaccia and
Yair Zick},
title = {Which Is the Fairest (Rent Division) of Them All?},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {39:1--39:22},
year = {2017},
url = {https://doi.org/10.1145/3131361},
doi = {10.1145/3131361},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalMPZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Galanis0GLR17,
author = {Andreas Galanis and
Andreas G{\"{o}}bel and
Leslie Ann Goldberg and
John Lapinskas and
David Richerby},
title = {Amplifiers for the Moran Process},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {5:1--5:90},
year = {2017},
url = {https://doi.org/10.1145/3019609},
doi = {10.1145/3019609},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Galanis0GLR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldreichR17,
author = {Oded Goldreich and
Dana Ron},
title = {On Learning and Testing Dynamic Environments},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {21:1--21:90},
year = {2017},
url = {https://doi.org/10.1145/3088509},
doi = {10.1145/3088509},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoldreichR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GroheKS17,
author = {Martin Grohe and
Stephan Kreutzer and
Sebastian Siebertz},
title = {Deciding First-Order Properties of Nowhere Dense Graphs},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {17:1--17:32},
year = {2017},
url = {https://doi.org/10.1145/3051095},
doi = {10.1145/3051095},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GroheKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarveyHL17,
author = {David Harvey and
Joris van der Hoeven and
Gr{\'{e}}goire Lecerf},
title = {Faster Polynomial Multiplication over Finite Fields},
journal = {J. {ACM}},
volume = {63},
number = {6},
pages = {52:1--52:23},
year = {2017},
url = {https://doi.org/10.1145/3005344},
doi = {10.1145/3005344},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HarveyHL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HastadRST17,
author = {Johan H{\aa}stad and
Benjamin Rossman and
Rocco A. Servedio and
Li{-}Yang Tan},
title = {An Average-Case Depth Hierarchy Theorem for Boolean Circuits},
journal = {J. {ACM}},
volume = {64},
number = {5},
pages = {35:1--35:27},
year = {2017},
url = {https://doi.org/10.1145/3095799},
doi = {10.1145/3095799},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HastadRST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarbyshevBIRS17,
author = {Aleksandr Karbyshev and
Nikolaj S. Bj{\o}rner and
Shachar Itzhaky and
Noam Rinetzky and
Sharon Shoham},
title = {Property-Directed Inference of Universal Invariants or Proving Their
Absence},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {7:1--7:33},
year = {2017},
url = {https://doi.org/10.1145/3022187},
doi = {10.1145/3022187},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KarbyshevBIRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KawarabayashiT17,
author = {Ken{-}ichi Kawarabayashi and
Mikkel Thorup},
title = {Coloring 3-Colorable Graphs with Less than \emph{n}\({}^{\mbox{1/5}}\)
Colors},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {4:1--4:23},
year = {2017},
url = {https://doi.org/10.1145/3001582},
doi = {10.1145/3001582},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KawarabayashiT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KoppartyMRS17,
author = {Swastik Kopparty and
Or Meir and
Noga Ron{-}Zewi and
Shubhangi Saraf},
title = {High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial
Query Complexity},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {11:1--11:42},
year = {2017},
url = {https://doi.org/10.1145/3051093},
doi = {10.1145/3051093},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KoppartyMRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Potechin17,
author = {Aaron Potechin},
title = {Bounds on Monotone Switching Networks for Directed Connectivity},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {29:1--29:48},
year = {2017},
url = {https://doi.org/10.1145/3080520},
doi = {10.1145/3080520},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Potechin17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rothvoss17,
author = {Thomas Rothvoss},
title = {The Matching Polytope has Exponential Extension Complexity},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {41:1--41:19},
year = {2017},
url = {https://doi.org/10.1145/3127497},
doi = {10.1145/3127497},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Rothvoss17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SchulmanS17,
author = {Leonard J. Schulman and
Alistair Sinclair},
title = {Analysis of a Classical Matrix Preconditioning Algorithm},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {9:1--9:23},
year = {2017},
url = {https://doi.org/10.1145/2988227},
doi = {10.1145/2988227},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SchulmanS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {64},
number = {1},
pages = {6:1},
year = {2017},
url = {https://doi.org/10.1145/3055358},
doi = {10.1145/3055358},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17a,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {13:1},
year = {2017},
url = {https://doi.org/10.1145/3090997},
doi = {10.1145/3090997},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17b,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {22:1},
year = {2017},
url = {https://doi.org/10.1145/3090999},
doi = {10.1145/3090999},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17c,
author = {{\'{E}}va Tardos},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {64},
number = {4},
year = {2017},
url = {https://doi.org/10.1145/3119408},
doi = {10.1145/3119408},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17d,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {64},
number = {5},
year = {2017},
url = {https://doi.org/10.1145/3140539},
doi = {10.1145/3140539},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos17e,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {64},
number = {6},
year = {2017},
url = {https://doi.org/10.1145/3151720},
doi = {10.1145/3151720},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos17e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ValiantV17,
author = {Gregory Valiant and
Paul Valiant},
title = {Estimating the Unseen: Improved Estimators for Entropy and Other Properties},
journal = {J. {ACM}},
volume = {64},
number = {6},
pages = {37:1--37:41},
year = {2017},
url = {https://doi.org/10.1145/3125643},
doi = {10.1145/3125643},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ValiantV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VeanesBNB17,
author = {Margus Veanes and
Nikolaj S. Bj{\o}rner and
Lev Nachmanson and
Sergey Bereg},
title = {Monadic Decomposition},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {14:1--14:28},
year = {2017},
url = {https://doi.org/10.1145/3040488},
doi = {10.1145/3040488},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/VeanesBNB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/YamauchiUKY17,
author = {Yukiko Yamauchi and
Taichi Uehara and
Shuji Kijima and
Masafumi Yamashita},
title = {Plane Formation by Synchronous Mobile Robots in the Three-Dimensional
Euclidean Space},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {16:1--16:43},
year = {2017},
url = {https://doi.org/10.1145/3060272},
doi = {10.1145/3060272},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/YamauchiUKY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZhengZ17,
author = {Yu Zheng and
Louxin Zhang},
title = {Reconciliation With Nonbinary Gene Trees Revisited},
journal = {J. {ACM}},
volume = {64},
number = {4},
pages = {24:1--24:28},
year = {2017},
url = {https://doi.org/10.1145/3088512},
doi = {10.1145/3088512},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ZhengZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/0001KS16,
author = {George Christodoulou and
Annam{\'{a}}ria Kov{\'{a}}cs and
Michael Schapira},
title = {Bayesian Combinatorial Auctions},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {11:1--11:19},
year = {2016},
url = {https://doi.org/10.1145/2835172},
doi = {10.1145/2835172},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/0001KS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbrahamDFGW16,
author = {Ittai Abraham and
Daniel Delling and
Amos Fiat and
Andrew V. Goldberg and
Renato F. Werneck},
title = {Highway Dimension and Provably Efficient Shortest Path Algorithms},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {41:1--41:26},
year = {2016},
url = {https://doi.org/10.1145/2985473},
doi = {10.1145/2985473},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbrahamDFGW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AchlioptasI16,
author = {Dimitris Achlioptas and
Fotis Iliopoulos},
title = {Random Walks That Find Perfect Objects and the Lov{\'{a}}sz Local
Lemma},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {22:1--22:29},
year = {2016},
url = {https://doi.org/10.1145/2818352},
doi = {10.1145/2818352},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AchlioptasI16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlistarhCS16,
author = {Dan Alistarh and
Keren Censor{-}Hillel and
Nir Shavit},
title = {Are Lock-Free Concurrent Algorithms Practically Wait-Free?},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {31:1--31:20},
year = {2016},
url = {https://doi.org/10.1145/2903136},
doi = {10.1145/2903136},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlistarhCS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlmagorBK16,
author = {Shaull Almagor and
Udi Boker and
Orna Kupferman},
title = {Formally Reasoning About Quality},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {24:1--24:56},
year = {2016},
url = {https://doi.org/10.1145/2875421},
doi = {10.1145/2875421},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlmagorBK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndersenGPT16,
author = {Reid Andersen and
Shayan Oveis Gharan and
Yuval Peres and
Luca Trevisan},
title = {Almost Optimal Local Graph Clustering Using Evolving Sets},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {15:1--15:31},
year = {2016},
url = {https://doi.org/10.1145/2856030},
doi = {10.1145/2856030},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndersenGPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraK16,
author = {Sanjeev Arora and
Satyen Kale},
title = {A Combinatorial, Primal-Dual Approach to Semidefinite Programs},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {12:1--12:35},
year = {2016},
url = {https://doi.org/10.1145/2837020},
doi = {10.1145/2837020},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AroraK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Babichenko16,
author = {Yakov Babichenko},
title = {Query Complexity of Approximate Nash Equilibria},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {36:1--36:24},
year = {2016},
url = {https://doi.org/10.1145/2908734},
doi = {10.1145/2908734},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Babichenko16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Barenboim16,
author = {Leonid Barenboim},
title = {Deterministic ({\(\Delta\)} + 1)-Coloring in Sublinear (in {\(\Delta\)})
Time in Static, Dynamic, and Faulty Networks},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {47:1--47:22},
year = {2016},
url = {https://doi.org/10.1145/2979675},
doi = {10.1145/2979675},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Barenboim16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarenboimEPS16,
author = {Leonid Barenboim and
Michael Elkin and
Seth Pettie and
Johannes Schneider},
title = {The Locality of Distributed Symmetry Breaking},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {20:1--20:45},
year = {2016},
url = {https://doi.org/10.1145/2903137},
doi = {10.1145/2903137},
timestamp = {Fri, 03 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarenboimEPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-SassonKKMS16,
author = {Eli Ben{-}Sasson and
Yohay Kaplan and
Swastik Kopparty and
Or Meir and
Henning Stichtenoth},
title = {Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {32:1--32:57},
year = {2016},
url = {https://doi.org/10.1145/2901294},
doi = {10.1145/2901294},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonKKMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BilardiPPS016,
author = {Gianfranco Bilardi and
Andrea Pietracaprina and
Geppino Pucci and
Michele Scquizzato and
Francesco Silvestri},
title = {Network-Oblivious Algorithms},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {3:1--3:36},
year = {2016},
url = {https://doi.org/10.1145/2812804},
doi = {10.1145/2812804},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BilardiPPS016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodlaenderFLPST16,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Daniel Lokshtanov and
Eelko Penninkx and
Saket Saurabh and
Dimitrios M. Thilikos},
title = {(Meta) Kernelization},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {44:1--44:69},
year = {2016},
url = {https://doi.org/10.1145/2973749},
doi = {10.1145/2973749},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BodlaenderFLPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chan16,
author = {Siu On Chan},
title = {Approximation Resistance from Pairwise-Independent Subgroups},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {27:1--27:32},
year = {2016},
url = {https://doi.org/10.1145/2873054},
doi = {10.1145/2873054},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChanLRS16,
author = {Siu On Chan and
James R. Lee and
Prasad Raghavendra and
David Steurer},
title = {Approximate Constraint Satisfaction Requires Large {LP} Relaxations},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {34:1--34:22},
year = {2016},
url = {https://doi.org/10.1145/2811255},
doi = {10.1145/2811255},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChanLRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChekuriC16,
author = {Chandra Chekuri and
Julia Chuzhoy},
title = {Polynomial Bounds for the Grid-Minor Theorem},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {40:1--40:65},
year = {2016},
url = {https://doi.org/10.1145/2820609},
doi = {10.1145/2820609},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChekuriC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChonevOW16,
author = {Ventsislav Chonev and
Jo{\"{e}}l Ouaknine and
James Worrell},
title = {On the Complexity of the Orbit Problem},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {23:1--23:18},
year = {2016},
url = {https://doi.org/10.1145/2857050},
doi = {10.1145/2857050},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChonevOW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyL16,
author = {Julia Chuzhoy and
Shi Li},
title = {A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths
with Congestion 2},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {45:1--45:51},
year = {2016},
url = {https://doi.org/10.1145/2893472},
doi = {10.1145/2893472},
timestamp = {Thu, 29 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DobzinskiV16,
author = {Shahar Dobzinski and
Jan Vondr{\'{a}}k},
title = {Impossibility Results for Truthful Combinatorial Auctions with Submodular
Valuations},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {5:1--5:19},
year = {2016},
url = {https://doi.org/10.1145/2786754},
doi = {10.1145/2786754},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DobzinskiV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DoerrDST16,
author = {Benjamin Doerr and
Carola Doerr and
Reto Sp{\"{o}}hel and
Henning Thomas},
title = {Playing Mastermind With Many Colors},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {42:1--42:23},
year = {2016},
url = {https://doi.org/10.1145/2987372},
doi = {10.1145/2987372},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DoerrDST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DughmiRY16,
author = {Shaddin Dughmi and
Tim Roughgarden and
Qiqi Yan},
title = {Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public
Projects via Convex Rounding},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {30:1--30:33},
year = {2016},
url = {https://doi.org/10.1145/2908735},
doi = {10.1145/2908735},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DughmiRY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DvirG16,
author = {Zeev Dvir and
Sivakanth Gopi},
title = {2-Server {PIR} with Subpolynomial Communication},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {39:1--39:15},
year = {2016},
url = {https://doi.org/10.1145/2968443},
doi = {10.1145/2968443},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DvirG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EsparzaGM16,
author = {Javier Esparza and
Pierre Ganty and
Rupak Majumdar},
title = {Parameterized Verification of Asynchronous Shared-Memory Systems},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {10:1--10:48},
year = {2016},
url = {https://doi.org/10.1145/2842603},
doi = {10.1145/2842603},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EsparzaGM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FominLPS16,
author = {Fedor V. Fomin and
Daniel Lokshtanov and
Fahad Panolan and
Saket Saurabh},
title = {Efficient Computation of Representative Families with Applications
in Parameterized and Exact Algorithms},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {29:1--29:60},
year = {2016},
url = {https://doi.org/10.1145/2886094},
doi = {10.1145/2886094},
timestamp = {Fri, 27 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FominLPS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FraigniaudK16,
author = {Pierre Fraigniaud and
Amos Korman},
title = {An Optimal Ancestry Labeling Scheme with Applications to {XML} Trees
and Universal Posets},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {6:1--6:31},
year = {2016},
url = {https://doi.org/10.1145/2794076},
doi = {10.1145/2794076},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FraigniaudK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gabbay16,
author = {Murdoch James Gabbay},
title = {Semantics Out of Context: Nominal Absolute Denotations for First-Order
Logic and Computation},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {25:1--25:66},
year = {2016},
url = {https://doi.org/10.1145/2700819},
doi = {10.1145/2700819},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gabbay16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GanorKR16,
author = {Anat Ganor and
Gillat Kol and
Ran Raz},
title = {Exponential Separation of Information and Communication for Boolean
Functions},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {46:1--46:31},
year = {2016},
url = {https://doi.org/10.1145/2907939},
doi = {10.1145/2907939},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GanorKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GebauerST16,
author = {Heidi Gebauer and
Tibor Szab{\'{o}} and
G{\'{a}}bor Tardos},
title = {The Local Lemma Is Asymptotically Tight for {SAT}},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {43:1--43:32},
year = {2016},
url = {https://doi.org/10.1145/2975386},
doi = {10.1145/2975386},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GebauerST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GeertsUKFC16,
author = {Floris Geerts and
Thomas Unger and
Grigoris Karvounarakis and
Irini Fundulaki and
Vassilis Christophides},
title = {Algebraic Structures for Capturing the Provenance of {SPARQL} Queries},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {7:1--7:63},
year = {2016},
url = {https://doi.org/10.1145/2810037},
doi = {10.1145/2810037},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GeertsUKFC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiS16,
author = {Venkatesan Guruswami and
Adam D. Smith},
title = {Optimal Rate Code Constructions for Computationally Simple Channels},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {35:1--35:37},
year = {2016},
url = {https://doi.org/10.1145/2936015},
doi = {10.1145/2936015},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Haeupler16,
author = {Bernhard Haeupler},
title = {Analyzing Network Coding (Gossip) Made Easy},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {26:1--26:22},
year = {2016},
url = {https://doi.org/10.1145/2629696},
doi = {10.1145/2629696},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Haeupler16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Herrmann016,
author = {Christian Herrmann and
Martin Ziegler},
title = {Computational Complexity of Quantum Satisfiability},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {19:1--19:31},
year = {2016},
url = {https://doi.org/10.1145/2869073},
doi = {10.1145/2869073},
timestamp = {Thu, 28 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Herrmann016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HondaYC16,
author = {Kohei Honda and
Nobuko Yoshida and
Marco Carbone},
title = {Multiparty Asynchronous Session Types},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {9:1--9:67},
year = {2016},
url = {https://doi.org/10.1145/2827695},
doi = {10.1145/2827695},
timestamp = {Sun, 15 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HondaYC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JanssonSS16,
author = {Jesper Jansson and
Chuanqi Shen and
Wing{-}Kin Sung},
title = {Improved Algorithms for Constructing Consensus Trees},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {28:1--28:24},
year = {2016},
url = {https://doi.org/10.1145/2925985},
doi = {10.1145/2925985},
timestamp = {Tue, 17 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JanssonSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jez16,
author = {Artur Jez},
title = {Recompression: {A} Simple and Powerful Technique for Word Equations},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {4:1--4:51},
year = {2016},
url = {https://doi.org/10.1145/2743014},
doi = {10.1145/2743014},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Jez16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KingS16,
author = {Valerie King and
Jared Saia},
title = {Byzantine Agreement in Expected Polynomial Time},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {13:1--13:21},
year = {2016},
url = {https://doi.org/10.1145/2837019},
doi = {10.1145/2837019},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KingS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KuhnMW16,
author = {Fabian Kuhn and
Thomas Moscibroda and
Roger Wattenhofer},
title = {Local Computation: Lower and Upper Bounds},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {17:1--17:44},
year = {2016},
url = {https://doi.org/10.1145/2742012},
doi = {10.1145/2742012},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KuhnMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LibkinMV16,
author = {Leonid Libkin and
Wim Martens and
Domagoj Vrgoc},
title = {Querying Graphs with Data},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {14:1--14:53},
year = {2016},
url = {https://doi.org/10.1145/2850413},
doi = {10.1145/2850413},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LibkinMV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lovett16,
author = {Shachar Lovett},
title = {Communication is Bounded by Root of Rank},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {1:1--1:9},
year = {2016},
url = {https://doi.org/10.1145/2724704},
doi = {10.1145/2724704},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lovett16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MillerS16,
author = {Carl A. Miller and
Yaoyun Shi},
title = {Robust Protocols for Securely Expanding Randomness and Distributing
Keys Using Untrusted Quantum Devices},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {33:1--33:63},
year = {2016},
url = {https://doi.org/10.1145/2885493},
doi = {10.1145/2885493},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MillerS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MomkeS16,
author = {Tobias M{\"{o}}mke and
Ola Svensson},
title = {Removing and Adding Edges for the Traveling Salesman Problem},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {2:1--2:28},
year = {2016},
url = {https://doi.org/10.1145/2739008},
doi = {10.1145/2739008},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MomkeS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MoranY16,
author = {Shay Moran and
Amir Yehudayoff},
title = {Sample Compression Schemes for {VC} Classes},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {21:1--21:10},
year = {2016},
url = {https://doi.org/10.1145/2890490},
doi = {10.1145/2890490},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MoranY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Razborov16,
author = {Alexander A. Razborov},
title = {A New Kind of Tradeoffs in Propositional Proof Complexity},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {16:1--16:14},
year = {2016},
url = {https://doi.org/10.1145/2858790},
doi = {10.1145/2858790},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Razborov16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos16,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {63},
number = {1},
pages = {8:1},
year = {2016},
url = {https://doi.org/10.1145/2875947},
doi = {10.1145/2875947},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos16a,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {63},
number = {2},
pages = {18:1},
year = {2016},
url = {https://doi.org/10.1145/2896919},
doi = {10.1145/2896919},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos16b,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {63},
number = {3},
pages = {27e:1},
year = {2016},
url = {https://doi.org/10.1145/2940319},
doi = {10.1145/2940319},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos16b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos16c,
author = {{\'{E}}va Tardos},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {45e:1},
year = {2016},
url = {https://doi.org/10.1145/3018097},
doi = {10.1145/3018097},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos16c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ThapperZ16,
author = {Johan Thapper and
Stanislav Zivn{\'{y}}},
title = {The Complexity of Finite-Valued CSPs},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {37:1--37:33},
year = {2016},
url = {https://doi.org/10.1145/2974019},
doi = {10.1145/2974019},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ThapperZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/X16,
title = {Invited Paper Foreword},
journal = {J. {ACM}},
volume = {63},
number = {4},
pages = {38:1},
year = {2016},
url = {https://doi.org/10.1145/2989249},
doi = {10.1145/2989249},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/X16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgrawalAGT15,
author = {Manindra Agrawal and
S. Akshay and
Blaise Genest and
P. S. Thiagarajan},
title = {Approximate Verification of the Symbolic Dynamics of Markov Chains},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {2:1--2:34},
year = {2015},
url = {https://doi.org/10.1145/2629417},
doi = {10.1145/2629417},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AgrawalAGT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AnKS15,
author = {Hyung{-}Chan An and
Robert D. Kleinberg and
David B. Shmoys},
title = {Improving Christofides' Algorithm for the s-t Path {TSP}},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {34:1--34:28},
year = {2015},
url = {https://doi.org/10.1145/2818310},
doi = {10.1145/2818310},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AnKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndersonDH15,
author = {Matthew Anderson and
Anuj Dawar and
Bjarki Holm},
title = {Solving Linear Programs without Breaking Abstractions},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {48:1--48:26},
year = {2015},
url = {https://doi.org/10.1145/2822890},
doi = {10.1145/2822890},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndersonDH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraBS15,
author = {Sanjeev Arora and
Boaz Barak and
David Steurer},
title = {Subexponential Algorithms for Unique Games and Related Problems},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {42:1--42:25},
year = {2015},
url = {https://doi.org/10.1145/2775105},
doi = {10.1145/2775105},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AroraBS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesACE15,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel and
Faith Ellen},
title = {Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {3:1--3:22},
year = {2015},
url = {https://doi.org/10.1145/2732263},
doi = {10.1145/2732263},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AspnesACE15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AvronDG15,
author = {Haim Avron and
Alex Druinsky and
Anshul Gupta},
title = {Revisiting Asynchronous Linear Solvers: Provable Convergence Rate
through Randomization},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {51:1--51:27},
year = {2015},
url = {https://doi.org/10.1145/2814566},
doi = {10.1145/2814566},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AvronDG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BabaioffKS15,
author = {Moshe Babaioff and
Robert D. Kleinberg and
Aleksandrs Slivkins},
title = {Truthful Mechanisms with Implicit Payment Computation},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {10:1--10:37},
year = {2015},
url = {https://doi.org/10.1145/2724705},
doi = {10.1145/2724705},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BabaioffKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BansalBMN15,
author = {Nikhil Bansal and
Niv Buchbinder and
Aleksander Madry and
Joseph Naor},
title = {A Polylogarithmic-Competitive Algorithm for the \emph{k}-Server Problem},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {40:1--40:49},
year = {2015},
url = {https://doi.org/10.1145/2783434},
doi = {10.1145/2783434},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BansalBMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaranyCS15,
author = {Vince B{\'{a}}r{\'{a}}ny and
Balder ten Cate and
Luc Segoufin},
title = {Guarded Negation},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {22:1--22:26},
year = {2015},
url = {https://doi.org/10.1145/2701414},
doi = {10.1145/2701414},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaranyCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaruahBDLMSS15,
author = {Sanjoy K. Baruah and
Vincenzo Bonifaci and
Gianlorenzo D'Angelo and
Haohan Li and
Alberto Marchetti{-}Spaccamela and
Suzanne van der Ster and
Leen Stougie},
title = {Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task
Systems},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {14:1--14:33},
year = {2015},
url = {https://doi.org/10.1145/2699435},
doi = {10.1145/2699435},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaruahBDLMSS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BasinKMZ15,
author = {David A. Basin and
Felix Klaedtke and
Samuel M{\"{u}}ller and
Eugen Zalinescu},
title = {Monitoring Metric First-Order Temporal Properties},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {15:1--15:45},
year = {2015},
url = {https://doi.org/10.1145/2699444},
doi = {10.1145/2699444},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BasinKMZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodirskyP15,
author = {Manuel Bodirsky and
Michael Pinsker},
title = {Schaefer's Theorem for Graphs},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {19:1--19:52},
year = {2015},
url = {https://doi.org/10.1145/2764899},
doi = {10.1145/2764899},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BodirskyP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonacinaG15,
author = {Ilario Bonacina and
Nicola Galesi},
title = {A Framework for Space Complexity in Algebraic Proof Systems},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {23:1--23:20},
year = {2015},
url = {https://doi.org/10.1145/2699438},
doi = {10.1145/2699438},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BonacinaG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrunschR15,
author = {Tobias Brunsch and
Heiko R{\"{o}}glin},
title = {Improved Smoothed Analysis of Multiobjective Optimization},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {4:1--4:58},
year = {2015},
url = {https://doi.org/10.1145/2699445},
doi = {10.1145/2699445},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BrunschR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChatterjeeHJ015,
author = {Krishnendu Chatterjee and
Thomas A. Henzinger and
Barbara Jobstmann and
Rohit Singh},
title = {Measuring and Synthesizing Systems in Probabilistic Environments},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {9:1--9:34},
year = {2015},
url = {https://doi.org/10.1145/2699430},
doi = {10.1145/2699430},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChatterjeeHJ015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChierichettiK15,
author = {Flavio Chierichetti and
Ravi Kumar},
title = {LSH-Preserving Functions and Their Applications},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {33:1--33:25},
year = {2015},
url = {https://doi.org/10.1145/2816813},
doi = {10.1145/2816813},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChierichettiK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CyganGS15,
author = {Marek Cygan and
Harold N. Gabow and
Piotr Sankowski},
title = {Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles,
Diameter, and Matchings},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {28:1--28:30},
year = {2015},
url = {https://doi.org/10.1145/2736283},
doi = {10.1145/2736283},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CyganGS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DiekertKRW15,
author = {Volker Diekert and
Manfred Kufleitner and
Klaus Reinhardt and
Tobias Walter},
title = {Regular Languages Are Church-Rosser Congruential},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {39:1--39:20},
year = {2015},
url = {https://doi.org/10.1145/2808227},
doi = {10.1145/2808227},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DiekertKRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ElkinS15,
author = {Michael Elkin and
Shay Solomon},
title = {Optimal Euclidean Spanners: Really Short, Thin, and Lanky},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {35:1--35:45},
year = {2015},
url = {https://doi.org/10.1145/2819008},
doi = {10.1145/2819008},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ElkinS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EtessamiY15,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Markov Decision Processes and Recursive Stochastic Games},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {11:1--11:69},
year = {2015},
url = {https://doi.org/10.1145/2699431},
doi = {10.1145/2699431},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EtessamiY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaginKRV15,
author = {Ronald Fagin and
Benny Kimelfeld and
Frederick Reiss and
Stijn Vansummeren},
title = {Document Spanners: {A} Formal Approach to Information Extraction},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {12:1--12:51},
year = {2015},
url = {https://doi.org/10.1145/2699442},
doi = {10.1145/2699442},
timestamp = {Fri, 20 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaginKRV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FioriniMPTW15,
author = {Samuel Fiorini and
Serge Massar and
Sebastian Pokutta and
Hans Raj Tiwary and
Ronald de Wolf},
title = {Exponential Lower Bounds for Polytopes in Combinatorial Optimization},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {17:1--17:23},
year = {2015},
url = {https://doi.org/10.1145/2716307},
doi = {10.1145/2716307},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FioriniMPTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FranekK15,
author = {Peter Franek and
Marek Krc{\'{a}}l},
title = {Robust Satisfiability of Systems of Equations},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {26:1--26:19},
year = {2015},
url = {https://doi.org/10.1145/2751524},
doi = {10.1145/2751524},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FranekK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalanisSV15,
author = {Andreas Galanis and
Daniel Stefankovic and
Eric Vigoda},
title = {Inapproximability for Antiferromagnetic Spin Systems in the Tree Nonuniqueness
Region},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {50:1--50:60},
year = {2015},
url = {https://doi.org/10.1145/2785964},
doi = {10.1145/2785964},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GalanisSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoelML15,
author = {Gagan Goel and
Vahab S. Mirrokni and
Renato Paes Leme},
title = {Polyhedral Clinching Auctions and the AdWords Polytope},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {18:1--18:27},
year = {2015},
url = {https://doi.org/10.1145/2757277},
doi = {10.1145/2757277},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoelML15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldwasserKR15,
author = {Shafi Goldwasser and
Yael Tauman Kalai and
Guy N. Rothblum},
title = {Delegating Computation: Interactive Proofs for Muggles},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {27:1--27:64},
year = {2015},
url = {https://doi.org/10.1145/2699436},
doi = {10.1145/2699436},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoldwasserKR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GorbunovVW15,
author = {Sergey Gorbunov and
Vinod Vaikuntanathan and
Hoeteck Wee},
title = {Attribute-Based Encryption for Circuits},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {45:1--45:33},
year = {2015},
url = {https://doi.org/10.1145/2824233},
doi = {10.1145/2824233},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GorbunovVW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Haeupler15,
author = {Bernhard Haeupler},
title = {Simple, Fast and Deterministic Gossip and Rumor Spreading},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {47:1--47:18},
year = {2015},
url = {https://doi.org/10.1145/2767126},
doi = {10.1145/2767126},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Haeupler15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Har-PeledR15,
author = {Sariel Har{-}Peled and
Benjamin Raichel},
title = {Net and Prune: {A} Linear Time Algorithm for Euclidean Distance Problems},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {44:1--44:35},
year = {2015},
url = {https://doi.org/10.1145/2831230},
doi = {10.1145/2831230},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Har-PeledR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jain15,
author = {Rahul Jain},
title = {New Strong Direct Product Results in Communication Complexity},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {20:1--20:27},
year = {2015},
url = {https://doi.org/10.1145/2699432},
doi = {10.1145/2699432},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Jain15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KantorLPP15,
author = {Erez Kantor and
Zvi Lotker and
Merav Parter and
David Peleg},
title = {The Topology of Wireless Communication},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {37:1--37:32},
year = {2015},
url = {https://doi.org/10.1145/2807693},
doi = {10.1145/2807693},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KantorLPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KhotV15,
author = {Subhash Khot and
Nisheeth K. Vishnoi},
title = {The Unique Games Conjecture, Integrality Gap for Cut Problems and
Embeddability of Negative-Type Metrics into {\(\mathscr{l}\)}\({}_{\mbox{1}}\)},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {8:1--8:39},
year = {2015},
url = {https://doi.org/10.1145/2629614},
doi = {10.1145/2629614},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KhotV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KoutrisUBHS15,
author = {Paraschos Koutris and
Prasang Upadhyaya and
Magdalena Balazinska and
Bill Howe and
Dan Suciu},
title = {Query-Based Data Pricing},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {43:1--43:44},
year = {2015},
url = {https://doi.org/10.1145/2770870},
doi = {10.1145/2770870},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KoutrisUBHS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KuttenPP0T15,
author = {Shay Kutten and
Gopal Pandurangan and
David Peleg and
Peter Robinson and
Amitabh Trehan},
title = {On the Complexity of Universal Leader Election},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {7:1--7:27},
year = {2015},
url = {https://doi.org/10.1145/2699440},
doi = {10.1145/2699440},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KuttenPP0T15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LinP15,
author = {Huijia Lin and
Rafael Pass},
title = {Constant-Round Nonmalleable Commitments from Any One-Way Function},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {5:1--5:30},
year = {2015},
url = {https://doi.org/10.1145/2699446},
doi = {10.1145/2699446},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LinP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LotkerPP15,
author = {Zvi Lotker and
Boaz Patt{-}Shamir and
Seth Pettie},
title = {Improved Distributed Approximate Matching},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {38:1--38:17},
year = {2015},
url = {https://doi.org/10.1145/2786753},
doi = {10.1145/2786753},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LotkerPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mendelson15,
author = {Shahar Mendelson},
title = {Learning without Concentration},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {21:1--21:25},
year = {2015},
url = {https://doi.org/10.1145/2699439},
doi = {10.1145/2699439},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mendelson15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MilesV15,
author = {Eric Miles and
Emanuele Viola},
title = {Substitution-Permutation Networks, Pseudorandom Functions, and Natural
Proofs},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {46:1--46:29},
year = {2015},
url = {https://doi.org/10.1145/2792978},
doi = {10.1145/2792978},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MilesV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MostefaouiMR15,
author = {Achour Most{\'{e}}faoui and
Hamouma Moumen and
Michel Raynal},
title = {Signature-Free Asynchronous Binary Byzantine Consensus with t {\textless}
n/3, O(n2) Messages, and {O(1)} Expected Time},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {31:1--31:21},
year = {2015},
url = {https://doi.org/10.1145/2785953},
doi = {10.1145/2785953},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MostefaouiMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Pettie15,
author = {Seth Pettie},
title = {Sharp Bounds on Davenport-Schinzel Sequences of Every Order},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {36:1--36:40},
year = {2015},
url = {https://doi.org/10.1145/2794075},
doi = {10.1145/2794075},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Pettie15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Roughgarden15,
author = {Tim Roughgarden},
title = {Intrinsic Robustness of the Price of Anarchy},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {32:1--32:42},
year = {2015},
url = {https://doi.org/10.1145/2806883},
doi = {10.1145/2806883},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Roughgarden15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rubin15,
author = {Natan Rubin},
title = {On Kinetic Delaunay Triangulations: {A} Near-Quadratic Bound for Unit
Speed Motions},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {25:1--25:85},
year = {2015},
url = {https://doi.org/10.1145/2746228},
doi = {10.1145/2746228},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Rubin15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SinghL15,
author = {Mohit Singh and
Lap Chi Lau},
title = {Approximating Minimum Bounded Degree Spanning Trees to within One
of Optimal},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {1:1--1:19},
year = {2015},
url = {https://doi.org/10.1145/2629366},
doi = {10.1145/2629366},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SinghL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StewartEY15,
author = {Alistair Stewart and
Kousha Etessami and
Mihalis Yannakakis},
title = {Upper Bounds for Newton's Method on Monotone Polynomial Systems, and
P-Time Model Checking of Probabilistic One-Counter Automata},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {30:1--30:33},
year = {2015},
url = {https://doi.org/10.1145/2789208},
doi = {10.1145/2789208},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/StewartEY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Unruh15,
author = {Dominique Unruh},
title = {Revocable Quantum Timed-Release Encryption},
journal = {J. {ACM}},
volume = {62},
number = {6},
pages = {49:1--49:76},
year = {2015},
url = {https://doi.org/10.1145/2817206},
doi = {10.1145/2817206},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Unruh15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Valiant15,
author = {Gregory Valiant},
title = {Finding Correlations in Subquadratic Time, with Applications to Learning
Parities and the Closest Pair Problem},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {13:1--13:45},
year = {2015},
url = {https://doi.org/10.1145/2728167},
doi = {10.1145/2728167},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Valiant15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu15,
author = {Victor Vianu},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {6:1},
year = {2015},
url = {https://doi.org/10.1145/2734885},
doi = {10.1145/2734885},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu15a,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {16:1},
year = {2015},
url = {https://doi.org/10.1145/2754309},
doi = {10.1145/2754309},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu15b,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {62},
number = {3},
pages = {24:1},
year = {2015},
url = {https://doi.org/10.1145/2786600},
doi = {10.1145/2786600},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu15b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WigdersonK15,
author = {Avi Wigderson and
Phokion G. Kolaitis},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {62},
number = {5},
pages = {41:1},
year = {2015},
url = {https://doi.org/10.1145/2831493},
doi = {10.1145/2831493},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WigdersonK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/X15,
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {29:1},
year = {2015},
url = {https://doi.org/10.1145/2809927},
doi = {10.1145/2809927},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/X15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/0001KKS14,
author = {Ankit Gupta and
Pritish Kamath and
Neeraj Kayal and
Ramprasad Saptharishi},
title = {Approaching the Chasm at Depth Four},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {33:1--33:16},
year = {2014},
url = {https://doi.org/10.1145/2629541},
doi = {10.1145/2629541},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/0001KKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlistarhACGG14,
author = {Dan Alistarh and
James Aspnes and
Keren Censor{-}Hillel and
Seth Gilbert and
Rachid Guerraoui},
title = {Tight Bounds for Asynchronous Renaming},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {18:1--18:51},
year = {2014},
url = {https://doi.org/10.1145/2597630},
doi = {10.1145/2597630},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlistarhACGG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmanoDLM14,
author = {Shun'ichi Amano and
Claire David and
Leonid Libkin and
Filip Murlak},
title = {{XML} Schema Mappings: Data Exchange and Metadata Management},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {12:1--12:48},
year = {2014},
url = {https://doi.org/10.1145/2590773},
doi = {10.1145/2590773},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AmanoDLM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaldanC14,
author = {Paolo Baldan and
Silvia Crafa},
title = {A Logic for True Concurrency},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {24:1--24:36},
year = {2014},
url = {https://doi.org/10.1145/2629638},
doi = {10.1145/2629638},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaldanC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarceloLR14,
author = {Pablo Barcel{\'{o}} and
Leonid Libkin and
Juan L. Reutter},
title = {Querying Regular Graph Patterns},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {8:1--8:54},
year = {2014},
url = {https://doi.org/10.1145/2559905},
doi = {10.1145/2559905},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarceloLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BartoK14,
author = {Libor Barto and
Marcin Kozik},
title = {Constraint Satisfaction Problems Solvable by Local Consistency Methods},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {3:1--3:19},
year = {2014},
url = {https://doi.org/10.1145/2556646},
doi = {10.1145/2556646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BartoK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-AmramG14,
author = {Amir M. Ben{-}Amram and
Samir Genaim},
title = {Ranking Functions for Linear-Constraint Loops},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {26:1--26:55},
year = {2014},
url = {https://doi.org/10.1145/2629488},
doi = {10.1145/2629488},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-AmramG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-SassonLR14,
author = {Eli Ben{-}Sasson and
Shachar Lovett and
Noga Ron{-}Zewi},
title = {An Additive Combinatorics Approach Relating Rank to Communication
Complexity},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {22:1--22:18},
year = {2014},
url = {https://doi.org/10.1145/2629598},
doi = {10.1145/2629598},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-ZviM14,
author = {Ido Ben{-}Zvi and
Yoram Moses},
title = {Beyond Lamport's \emph{Happened-before}: On Time Bounds and the Ordering
of Events in Distributed Systems},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {13:1--13:26},
year = {2014},
url = {https://doi.org/10.1145/2542181},
doi = {10.1145/2542181},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-ZviM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrakerskiKN14,
author = {Zvika Brakerski and
Yael Tauman Kalai and
Moni Naor},
title = {Fast Interactive Coding against Adversarial Noise},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {35:1--35:30},
year = {2014},
url = {https://doi.org/10.1145/2661628},
doi = {10.1145/2661628},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrakerskiKN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrazdilKK14,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
Stefan Kiefer and
Anton{\'{\i}}n Kucera},
title = {Efficient Analysis of Probabilistic Programs with an Unbounded Counter},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {41:1--41:35},
year = {2014},
url = {https://doi.org/10.1145/2629599},
doi = {10.1145/2629599},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BrazdilKK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrotherstonK14,
author = {James Brotherston and
Max I. Kanovich},
title = {Undecidability of Propositional Separation Logic and Its Neighbours},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {14:1--14:43},
year = {2014},
url = {https://doi.org/10.1145/2542667},
doi = {10.1145/2542667},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrotherstonK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CadekKMSVW14,
author = {Martin Cadek and
Marek Krc{\'{a}}l and
Jir{\'{\i}} Matousek and
Francis Sergeraert and
Luk{\'{a}}s Vokr{\'{\i}}nek and
Uli Wagner},
title = {Computing All Maps into a Sphere},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {17:1--17:44},
year = {2014},
url = {https://doi.org/10.1145/2597629},
doi = {10.1145/2597629},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CadekKMSVW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CassaigneCSS14,
author = {Julien Cassaigne and
James D. Currie and
Luke Schaeffer and
Jeffrey O. Shallit},
title = {Avoiding Three Consecutive Blocks of the Same Size and Same Sum},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {10:1--10:17},
year = {2014},
url = {https://doi.org/10.1145/2590775},
doi = {10.1145/2590775},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CassaigneCSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChandranKOR14,
author = {Nishanth Chandran and
Bhavana Kanukurthi and
Rafail Ostrovsky and
Leonid Reyzin},
title = {Privacy amplification with asymptotically optimal entropy loss},
journal = {J. {ACM}},
volume = {61},
number = {5},
pages = {29:1--29:28},
year = {2014},
url = {https://doi.org/10.1145/2630064},
doi = {10.1145/2630064},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChandranKOR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChaputDPP14,
author = {Philippe Chaput and
Vincent Danos and
Prakash Panangaden and
Gordon D. Plotkin},
title = {Approximating Markov Processes by Averaging},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {5:1--5:45},
year = {2014},
url = {https://doi.org/10.1145/2537948},
doi = {10.1145/2537948},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChaputDPP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChatterjeeH14,
author = {Krishnendu Chatterjee and
Monika Henzinger},
title = {Efficient and Dynamic Algorithms for Alternating B{\"{u}}chi
Games and Maximal End-Component Decomposition},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {15:1--15:40},
year = {2014},
url = {https://doi.org/10.1145/2597631},
doi = {10.1145/2597631},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChatterjeeH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chazelle14,
author = {Bernard Chazelle},
title = {The Convergence of Bird Flocking},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {21:1--21:35},
year = {2014},
url = {https://doi.org/10.1145/2629613},
doi = {10.1145/2629613},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chazelle14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenYZG14,
author = {Binbin Chen and
Haifeng Yu and
Yuda Zhao and
Phillip B. Gibbons},
title = {The Cost of Fault Tolerance in Multi-Party Communication Complexity},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {19:1--19:64},
year = {2014},
url = {https://doi.org/10.1145/2597633},
doi = {10.1145/2597633},
timestamp = {Fri, 20 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenYZG14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DeDFS14,
author = {Anindya De and
Ilias Diakonikolas and
Vitaly Feldman and
Rocco A. Servedio},
title = {Nearly Optimal Solutions for the Chow Parameters Problem and Low-Weight
Approximation of Halfspaces},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {11:1--11:36},
year = {2014},
url = {https://doi.org/10.1145/2590772},
doi = {10.1145/2590772},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DeDFS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DellM14,
author = {Holger Dell and
Dieter van Melkebeek},
title = {Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time
Hierarchy Collapses},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {23:1--23:27},
year = {2014},
url = {https://doi.org/10.1145/2629620},
doi = {10.1145/2629620},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DellM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DolevFSL14,
author = {Danny Dolev and
Matthias F{\"{u}}gger and
Ulrich Schmid and
Christoph Lenzen},
title = {Fault-tolerant algorithms for tick-generation in asynchronous logic:
Robust pulse generation},
journal = {J. {ACM}},
volume = {61},
number = {5},
pages = {30:1--30:74},
year = {2014},
url = {https://doi.org/10.1145/2560561},
doi = {10.1145/2560561},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DolevFSL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuanP14,
author = {Ran Duan and
Seth Pettie},
title = {Linear-Time Approximation for Maximum Weight Matching},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {1:1--1:23},
year = {2014},
url = {https://doi.org/10.1145/2529989},
doi = {10.1145/2529989},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DuanP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuchiJW14,
author = {John C. Duchi and
Michael I. Jordan and
Martin J. Wainwright},
title = {Privacy Aware Learning},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {38:1--38:57},
year = {2014},
url = {https://doi.org/10.1145/2666468},
doi = {10.1145/2666468},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DuchiJW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaenzaOS14,
author = {Yuri Faenza and
Gianpaolo Oriolo and
Gautier Stauffer},
title = {Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {20:1--20:41},
year = {2014},
url = {https://doi.org/10.1145/2629600},
doi = {10.1145/2629600},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaenzaOS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HelmertHHN14,
author = {Malte Helmert and
Patrik Haslum and
J{\"{o}}rg Hoffmann and
Raz Nissim},
title = {Merge-and-Shrink Abstraction: {A} Method for Generating Lower Bounds
in Factored State Spaces},
journal = {J. {ACM}},
volume = {61},
number = {3},
pages = {16:1--16:63},
year = {2014},
url = {https://doi.org/10.1145/2559951},
doi = {10.1145/2559951},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HelmertHHN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HelmiHPW14,
author = {Maryam Helmi and
Lisa Higham and
Eduardo Pacheco and
Philipp Woelfel},
title = {The Space Complexity of Long-Lived and One-Shot Timestamp Implementations},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {7:1--7:25},
year = {2014},
url = {https://doi.org/10.1145/2559904},
doi = {10.1145/2559904},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HelmiHPW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HonSTV14,
author = {Wing{-}Kai Hon and
Rahul Shah and
Sharma V. Thankachan and
Jeffrey Scott Vitter},
title = {Space-Efficient Frameworks for Top-\emph{k} String Retrieval},
journal = {J. {ACM}},
volume = {61},
number = {2},
pages = {9:1--9:36},
year = {2014},
url = {https://doi.org/10.1145/2590774},
doi = {10.1145/2590774},
timestamp = {Wed, 28 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HonSTV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JacobRSST14,
author = {Riko Jacob and
Andr{\'{e}}a W. Richa and
Christian Scheideler and
Stefan Schmid and
Hanjo T{\"{a}}ubig},
title = {SKIP\({}^{\mbox{+}}\): {A} Self-Stabilizing Skip Graph},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {36:1--36:26},
year = {2014},
url = {https://doi.org/10.1145/2629695},
doi = {10.1145/2629695},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JacobRSST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaneN14,
author = {Daniel M. Kane and
Jelani Nelson},
title = {Sparser Johnson-Lindenstrauss Transforms},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {4:1--4:23},
year = {2014},
url = {https://doi.org/10.1145/2559902},
doi = {10.1145/2559902},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaneN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KimelfeldR14,
author = {Benny Kimelfeld and
Christopher R{\'{e}}},
title = {Transducing Markov sequences},
journal = {J. {ACM}},
volume = {61},
number = {5},
pages = {32:1--32:48},
year = {2014},
url = {https://doi.org/10.1145/2630065},
doi = {10.1145/2630065},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KimelfeldR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KoppartySY14,
author = {Swastik Kopparty and
Shubhangi Saraf and
Sergey Yekhanin},
title = {High-rate codes with sublinear-time decoding},
journal = {J. {ACM}},
volume = {61},
number = {5},
pages = {28:1--28:20},
year = {2014},
url = {https://doi.org/10.1145/2629416},
doi = {10.1145/2629416},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KoppartySY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeeGT14,
author = {James R. Lee and
Shayan Oveis Gharan and
Luca Trevisan},
title = {Multiway Spectral Partitioning and Higher-Order Cheeger Inequalities},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {37:1--37:30},
year = {2014},
url = {https://doi.org/10.1145/2665063},
doi = {10.1145/2665063},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeeGT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LoschP14,
author = {Steffen L{\"{o}}sch and
Andrew M. Pitts},
title = {Denotational Semantics with Nominal Scott Domains},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {27:1--27:46},
year = {2014},
url = {https://doi.org/10.1145/2629529},
doi = {10.1145/2629529},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LoschP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sherstov14,
author = {Alexander A. Sherstov},
title = {Communication Lower Bounds Using Directional Derivatives},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {34:1--34:71},
year = {2014},
url = {https://doi.org/10.1145/2629334},
doi = {10.1145/2629334},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sherstov14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu14,
author = {Victor Vianu},
title = {Foreword to Invited Articles Section},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {6:1},
year = {2014},
url = {https://doi.org/10.1145/2559908},
doi = {10.1145/2559908},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu14a,
author = {Victor Vianu},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {61},
number = {4},
pages = {25:1},
year = {2014},
url = {https://doi.org/10.1145/2632167},
doi = {10.1145/2632167},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu14b,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {61},
number = {5},
pages = {31:1},
year = {2014},
url = {https://doi.org/10.1145/2656280},
doi = {10.1145/2656280},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu14b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu14c,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {40:1},
year = {2014},
url = {https://doi.org/10.1145/2684458},
doi = {10.1145/2684458},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu14c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WangYCF14,
author = {Xiaojing Wang and
Qizhao Yuan and
Hongliang Cai and
Jiajia Fang},
title = {A New Approach to Image Sharing with High-Security Threshold Structure},
journal = {J. {ACM}},
volume = {61},
number = {6},
pages = {39:1--39:19},
year = {2014},
url = {https://doi.org/10.1145/2666470},
doi = {10.1145/2666470},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WangYCF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Williams14,
author = {Ryan Williams},
title = {Nonuniform {ACC} Circuit Lower Bounds},
journal = {J. {ACM}},
volume = {61},
number = {1},
pages = {2:1--2:32},
year = {2014},
url = {https://doi.org/10.1145/2559903},
doi = {10.1145/2559903},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Williams14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonY13,
author = {Noga Alon and
Raphael Yuster},
title = {Matrix sparsification and nested dissection over arbitrary fields},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {25:1--25:18},
year = {2013},
url = {https://doi.org/10.1145/2508028.2505989},
doi = {10.1145/2508028.2505989},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlonY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmelootNB13,
author = {Tom J. Ameloot and
Frank Neven and
Jan Van den Bussche},
title = {Relational transducers for declarative networking},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {15:1--15:38},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450151},
doi = {10.1145/2450142.2450151},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AmelootNB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AngelopoulosS13,
author = {Spyros Angelopoulos and
Pascal Schweitzer},
title = {Paging and list update under bijective analysis},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {7:1--7:18},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450143},
doi = {10.1145/2450142.2450143},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AngelopoulosS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Arenas0R13,
author = {Marcelo Arenas and
Jorge P{\'{e}}rez and
Juan L. Reutter},
title = {Data exchange beyond complete data},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {28:1--28:59},
year = {2013},
url = {https://doi.org/10.1145/2508028.2505985},
doi = {10.1145/2508028.2505985},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Arenas0R13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalcanBG13,
author = {Maria{-}Florina Balcan and
Avrim Blum and
Anupam Gupta},
title = {Clustering under approximation stability},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {8:1--8:34},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450144},
doi = {10.1145/2450142.2450144},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BalcanBG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BanerjeeN13,
author = {Anindya Banerjee and
David A. Naumann},
title = {Local Reasoning for Global Invariants, Part {II:} Dynamic Boundaries},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {19:1--19:73},
year = {2013},
url = {https://doi.org/10.1145/2485981},
doi = {10.1145/2485981},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BanerjeeN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BanerjeeNR13,
author = {Anindya Banerjee and
David A. Naumann and
Stan Rosenberg},
title = {Local Reasoning for Global Invariants, Part {I:} Region Logic},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {18:1--18:56},
year = {2013},
url = {https://doi.org/10.1145/2485982},
doi = {10.1145/2485982},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BanerjeeNR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BatuFRSW13,
author = {Tugkan Batu and
Lance Fortnow and
Ronitt Rubinfeld and
Warren D. Smith and
Patrick White},
title = {Testing Closeness of Discrete Distributions},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {4:1--4:25},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432626},
doi = {10.1145/2432622.2432626},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BatuFRSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumLR13,
author = {Avrim Blum and
Katrina Ligett and
Aaron Roth},
title = {A learning theory approach to noninteractive database privacy},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {12:1--12:25},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450148},
doi = {10.1145/2450142.2450148},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlumLR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bulatov13,
author = {Andrei A. Bulatov},
title = {The complexity of the counting constraint satisfaction problem},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {34:1--34:41},
year = {2013},
url = {https://doi.org/10.1145/2528400},
doi = {10.1145/2528400},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bulatov13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BulatovDGJM13,
author = {Andrei A. Bulatov and
Martin E. Dyer and
Leslie Ann Goldberg and
Mark Jerrum and
Colin McQuillan},
title = {The expressibility of functions on the boolean domain, with applications
to counting CSPs},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {32:1--32:36},
year = {2013},
url = {https://doi.org/10.1145/2528401},
doi = {10.1145/2528401},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BulatovDGJM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ByrkaGRS13,
author = {Jaroslaw Byrka and
Fabrizio Grandoni and
Thomas Rothvo{\ss} and
Laura Sanit{\`{a}}},
title = {Steiner Tree Approximation via Iterative Randomized Rounding},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {6:1--6:33},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432628},
doi = {10.1145/2432622.2432628},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ByrkaGRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChazalGOS13,
author = {Fr{\'{e}}d{\'{e}}ric Chazal and
Leonidas J. Guibas and
Steve Y. Oudot and
Primoz Skraba},
title = {Persistence-Based Clustering in Riemannian Manifolds},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {41:1--41:38},
year = {2013},
url = {https://doi.org/10.1145/2535927},
doi = {10.1145/2535927},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChazalGOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CheungKL13,
author = {Ho Yee Cheung and
Tsz Chiu Kwok and
Lap Chi Lau},
title = {Fast matrix rank algorithms and applications},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {31:1--31:25},
year = {2013},
url = {https://doi.org/10.1145/2528404},
doi = {10.1145/2528404},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CheungKL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DrmotaS13,
author = {Michael Drmota and
Wojciech Szpankowski},
title = {A Master Theorem for Discrete Divide and Conquer Recurrences},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {16:1--16:49},
year = {2013},
url = {https://doi.org/10.1145/2487241.2487242},
doi = {10.1145/2487241.2487242},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DrmotaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DvorakKT13,
author = {Zdenek Dvor{\'{a}}k and
Daniel Kr{\'{a}}l and
Robin Thomas},
title = {Testing first-order properties for subclasses of sparse graphs},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {36:1--36:24},
year = {2013},
url = {https://doi.org/10.1145/2499483},
doi = {10.1145/2499483},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DvorakKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FawziHS13,
author = {Omar Fawzi and
Patrick M. Hayden and
Pranab Sen},
title = {From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations
and Efficient Information Locking},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {44:1--44:61},
year = {2013},
url = {https://doi.org/10.1145/2518131},
doi = {10.1145/2518131},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FawziHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FraigniaudKP13,
author = {Pierre Fraigniaud and
Amos Korman and
David Peleg},
title = {Towards a complexity theory for local distributed computing},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {35:1--35:26},
year = {2013},
url = {https://doi.org/10.1145/2499228},
doi = {10.1145/2499228},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FraigniaudKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GeorgiouGGK13,
author = {Chryssis Georgiou and
Seth Gilbert and
Rachid Guerraoui and
Dariusz R. Kowalski},
title = {Asynchronous gossip},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {11:1--11:42},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450147},
doi = {10.1145/2450142.2450147},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GeorgiouGGK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GodoyG13,
author = {Guillem Godoy and
Omer Gim{\'{e}}nez},
title = {The {HOM} problem is decidable},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {23:1--23:44},
year = {2013},
url = {https://doi.org/10.1145/2508028.2501600},
doi = {10.1145/2508028.2501600},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GodoyG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoosHS13,
author = {Mika G{\"{o}}{\"{o}}s and
Juho Hirvonen and
Jukka Suomela},
title = {Lower bounds for local approximation},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {39:1--39:23},
year = {2013},
url = {https://doi.org/10.1145/2528405},
doi = {10.1145/2528405},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoosHS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobG13,
author = {Georg Gottlob and
Gianluigi Greco},
title = {Decomposing combinatorial auctions and set packing problems},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {24:1--24:39},
year = {2013},
url = {https://doi.org/10.1145/2508028.2505987},
doi = {10.1145/2508028.2505987},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GottlobG13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoyalOS13,
author = {Navin Goyal and
Neil Olver and
F. Bruce Shepherd},
title = {The {VPN} Conjecture Is True},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {17:1--17:17},
year = {2013},
url = {https://doi.org/10.1145/2487241.2487243},
doi = {10.1145/2487241.2487243},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoyalOS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HansenMZ13,
author = {Thomas Dueholm Hansen and
Peter Bro Miltersen and
Uri Zwick},
title = {Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based
Stochastic Games with a Constant Discount Factor},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {1:1--1:16},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432623},
doi = {10.1145/2432622.2432623},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HansenMZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarrowM13,
author = {Aram W. Harrow and
Ashley Montanaro},
title = {Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {3:1--3:43},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432625},
doi = {10.1145/2432622.2432625},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HarrowM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HillarL13,
author = {Christopher J. Hillar and
Lek{-}Heng Lim},
title = {Most Tensor Problems Are NP-Hard},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {45:1--45:39},
year = {2013},
url = {https://doi.org/10.1145/2512329},
doi = {10.1145/2512329},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HillarL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kobayashi13,
author = {Naoki Kobayashi},
title = {Model Checking Higher-Order Programs},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {20:1--20:62},
year = {2013},
url = {https://doi.org/10.1145/2487241.2487246},
doi = {10.1145/2487241.2487246},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Kobayashi13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KolaitisK13,
author = {Phokion G. Kolaitis and
Swastik Kopparty},
title = {Random graphs and the parity quantifier},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {37:1--37:34},
year = {2013},
url = {https://doi.org/10.1145/2528402},
doi = {10.1145/2528402},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KolaitisK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KolmogorovZ13,
author = {Vladimir Kolmogorov and
Stanislav Zivn{\'{y}}},
title = {The complexity of conservative valued CSPs},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {10:1--10:38},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450146},
doi = {10.1145/2450142.2450146},
timestamp = {Mon, 03 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KolmogorovZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Laird13,
author = {James Laird},
title = {Game semantics for a polymorphic programming language},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {29:1--29:27},
year = {2013},
url = {https://doi.org/10.1145/2508028.2505986},
doi = {10.1145/2508028.2505986},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Laird13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Levin13,
author = {Leonid A. Levin},
title = {Forbidden information},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {9:1--9:9},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450145},
doi = {10.1145/2450142.2450145},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Levin13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LyubashevskyPR13,
author = {Vadim Lyubashevsky and
Chris Peikert and
Oded Regev},
title = {On Ideal Lattices and Learning with Errors over Rings},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {43:1--43:35},
year = {2013},
url = {https://doi.org/10.1145/2535925},
doi = {10.1145/2535925},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LyubashevskyPR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Marx13,
author = {D{\'{a}}niel Marx},
title = {Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive
Queries},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {42:1--42:51},
year = {2013},
url = {https://doi.org/10.1145/2535926},
doi = {10.1145/2535926},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Marx13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PeresSSZ13,
author = {Yuval Peres and
Dmitry Sotnikov and
Benny Sudakov and
Uri Zwick},
title = {All-pairs shortest paths in \emph{O}(\emph{n}\({}^{\mbox{2}}\)) time
with high probability},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {26:1--26:25},
year = {2013},
url = {https://doi.org/10.1145/2508028.2505988},
doi = {10.1145/2508028.2505988},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PeresSSZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Raz13,
author = {Ran Raz},
title = {Tensor-Rank and Lower Bounds for Arithmetic Formulas},
journal = {J. {ACM}},
volume = {60},
number = {6},
pages = {40:1--40:15},
year = {2013},
url = {https://doi.org/10.1145/2535928},
doi = {10.1145/2535928},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Raz13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SarmaNPT13,
author = {Atish Das Sarma and
Danupon Nanongkai and
Gopal Pandurangan and
Prasad Tetali},
title = {Distributed Random Walks},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {2:1--2:31},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432624},
doi = {10.1145/2432622.2432624},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SarmaNPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SaxenaS13,
author = {Nitin Saxena and
C. Seshadhri},
title = {From sylvester-gallai configurations to rank bounds: Improved blackbox
identity test for depth-3 circuits},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {33:1--33:33},
year = {2013},
url = {https://doi.org/10.1145/2528403},
doi = {10.1145/2528403},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SaxenaS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SeshadhriPK13,
author = {C. Seshadhri and
Ali Pinar and
Tamara G. Kolda},
title = {An in-depth analysis of stochastic Kronecker graphs},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {13:1--13:32},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450149},
doi = {10.1145/2450142.2450149},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SeshadhriPK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SevcikVNJS13,
author = {Jaroslav Sevc{\'{\i}}k and
Viktor Vafeiadis and
Francesco Zappa Nardelli and
Suresh Jagannathan and
Peter Sewell},
title = {CompCertTSO: {A} Verified Compiler for Relaxed-Memory Concurrency},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {22:1--22:50},
year = {2013},
url = {https://doi.org/10.1145/2487241.2487248},
doi = {10.1145/2487241.2487248},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/SevcikVNJS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {60},
number = {1},
pages = {5:1},
year = {2013},
url = {https://doi.org/10.1145/2432622.2432627},
doi = {10.1145/2432622.2432627},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13a,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {60},
number = {2},
pages = {14:1},
year = {2013},
url = {https://doi.org/10.1145/2450142.2450150},
doi = {10.1145/2450142.2450150},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13b,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {60},
number = {3},
pages = {21:1},
year = {2013},
url = {https://doi.org/10.1145/2487241.2487247},
doi = {10.1145/2487241.2487247},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13c,
author = {Victor Vianu},
title = {Invited articles foreword},
journal = {J. {ACM}},
volume = {60},
number = {4},
pages = {27:1},
year = {2013},
url = {https://doi.org/10.1145/2508028.2508032},
doi = {10.1145/2508028.2508032},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13d,
author = {Victor Vianu},
title = {Editorial: {JACM} redux},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {30:1--30:2},
year = {2013},
url = {https://doi.org/10.1145/2528384.2528385},
doi = {10.1145/2528384.2528385},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu13e,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {60},
number = {5},
pages = {38:1},
year = {2013},
url = {https://doi.org/10.1145/2528384.2528386},
doi = {10.1145/2528384.2528386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu13e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisKS12,
author = {Andris Ambainis and
Julia Kempe and
Or Sattath},
title = {A quantum lov{\'{a}}sz local lemma},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {24:1--24:24},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371659},
doi = {10.1145/2371656.2371659},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AmbainisKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesAC12,
author = {James Aspnes and
Hagit Attiya and
Keren Censor{-}Hillel},
title = {Polylogarithmic concurrent data structures from monotone circuits},
journal = {J. {ACM}},
volume = {59},
number = {1},
pages = {2:1--2:24},
year = {2012},
url = {https://doi.org/10.1145/2108242.2108244},
doi = {10.1145/2108242.2108244},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AspnesAC12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AvinEKLPR12,
author = {Chen Avin and
Yuval Emek and
Erez Kantor and
Zvi Lotker and
David Peleg and
Liam Roditty},
title = {{SINR} Diagrams: Convexity and Its Applications in Wireless Networks},
journal = {J. {ACM}},
volume = {59},
number = {4},
pages = {18:1--18:34},
year = {2012},
url = {https://doi.org/10.1145/2339123.2339125},
doi = {10.1145/2339123.2339125},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AvinEKLPR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BadanidiyuruPCSR12,
author = {Ashwinkumar Badanidiyuru and
Arpita Patra and
Ashish Choudhury and
Kannan Srinathan and
C. Pandu Rangan},
title = {On the trade-off between network connectivity, round complexity, and
communication complexity of reliable message transmission},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {22:1--22:35},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371657},
doi = {10.1145/2371656.2371657},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BadanidiyuruPCSR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaierGB12,
author = {Christel Baier and
Marcus Gr{\"{o}}{\ss}er and
Nathalie Bertrand},
title = {Probabilistic {\(\omega\)}-automata},
journal = {J. {ACM}},
volume = {59},
number = {1},
pages = {1:1--1:52},
year = {2012},
url = {https://doi.org/10.1145/2108242.2108243},
doi = {10.1145/2108242.2108243},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BaierGB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BallardDHS12,
author = {Grey Ballard and
James Demmel and
Olga Holtz and
Oded Schwartz},
title = {Graph expansion and communication costs of fast matrix multiplication},
journal = {J. {ACM}},
volume = {59},
number = {6},
pages = {32:1--32:23},
year = {2012},
url = {https://doi.org/10.1145/2395116.2395121},
doi = {10.1145/2395116.2395121},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BallardDHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BansalBN12,
author = {Nikhil Bansal and
Niv Buchbinder and
Joseph Naor},
title = {A Primal-Dual Randomized Algorithm for Weighted Paging},
journal = {J. {ACM}},
volume = {59},
number = {4},
pages = {19:1--19:24},
year = {2012},
url = {https://doi.org/10.1145/2339123.2339126},
doi = {10.1145/2339123.2339126},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BansalBN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarakGIRSVY12,
author = {Boaz Barak and
Oded Goldreich and
Russell Impagliazzo and
Steven Rudich and
Amit Sahai and
Salil P. Vadhan and
Ke Yang},
title = {On the (im)possibility of obfuscating programs},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {6:1--6:48},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160159},
doi = {10.1145/2160158.2160159},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarakGIRSVY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CastanedaR12,
author = {Armando Casta{\~{n}}eda and
Sergio Rajsbaum},
title = {New combinatorial topology bounds for renaming: The upper bound},
journal = {J. {ACM}},
volume = {59},
number = {1},
pages = {3:1--3:49},
year = {2012},
url = {https://doi.org/10.1145/2108242.2108245},
doi = {10.1145/2108242.2108245},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CastanedaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenF12,
author = {Yijia Chen and
J{\"{o}}rg Flum},
title = {From Almost Optimal Algorithms to Logics for Complexity Classes via
Listings and a Halting Problem},
journal = {J. {ACM}},
volume = {59},
number = {4},
pages = {17:1--17:34},
year = {2012},
url = {https://doi.org/10.1145/2339123.2339124},
doi = {10.1145/2339123.2339124},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ClarksonHW12,
author = {Kenneth L. Clarkson and
Elad Hazan and
David P. Woodruff},
title = {Sublinear optimization for machine learning},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {23:1--23:49},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371658},
doi = {10.1145/2371656.2371658},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ClarksonHW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CormodeMYZ12,
author = {Graham Cormode and
S. Muthukrishnan and
Ke Yi and
Qin Zhang},
title = {Continuous sampling from distributed streams},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {10:1--10:25},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160163},
doi = {10.1145/2160158.2160163},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CormodeMYZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CousotCM12,
author = {Patrick Cousot and
Radhia Cousot and
Laurent Mauborgne},
title = {Theories, solvers and static analysis by abstract interpretation},
journal = {J. {ACM}},
volume = {59},
number = {6},
pages = {31:1--31:56},
year = {2012},
url = {https://doi.org/10.1145/2395116.2395120},
doi = {10.1145/2395116.2395120},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CousotCM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DalviS12,
author = {Nilesh N. Dalvi and
Dan Suciu},
title = {The dichotomy of probabilistic inference for unions of conjunctive
queries},
journal = {J. {ACM}},
volume = {59},
number = {6},
pages = {30:1--30:87},
year = {2012},
url = {https://doi.org/10.1145/2395116.2395119},
doi = {10.1145/2395116.2395119},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DalviS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldbergJ12,
author = {Leslie Ann Goldberg and
Mark Jerrum},
title = {Approximating the partition function of the ferromagnetic potts model},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {25:1--25:31},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371660},
doi = {10.1145/2371656.2371660},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoldbergJ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldreichJS12,
author = {Oded Goldreich and
Brendan Juba and
Madhu Sudan},
title = {A theory of goal-oriented communication},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {8:1--8:65},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160161},
doi = {10.1145/2160158.2160161},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoldreichJS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobLVV12,
author = {Georg Gottlob and
Stephanie Tien Lee and
Gregory Valiant and
Paul Valiant},
title = {Size and Treewidth Bounds for Conjunctive Queries},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {16:1--16:35},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220363},
doi = {10.1145/2220357.2220363},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobLVV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Grohe12,
author = {Martin Grohe},
title = {Fixed-point definability and polynomial time on graphs with excluded
minors},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {27:1--27:64},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371662},
doi = {10.1145/2371656.2371662},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Grohe12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GrothOS12,
author = {Jens Groth and
Rafail Ostrovsky and
Amit Sahai},
title = {New Techniques for Noninteractive Zero-Knowledge},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {11:1--11:35},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220358},
doi = {10.1145/2220357.2220358},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GrothOS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarshaKM12,
author = {Prahladh Harsha and
Adam R. Klivans and
Raghu Meka},
title = {An invariance principle for polytopes},
journal = {J. {ACM}},
volume = {59},
number = {6},
pages = {29:1--29:25},
year = {2012},
url = {https://doi.org/10.1145/2395116.2395118},
doi = {10.1145/2395116.2395118},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HarshaKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KirschMPPUV12,
author = {Adam Kirsch and
Michael Mitzenmacher and
Andrea Pietracaprina and
Geppino Pucci and
Eli Upfal and
Fabio Vandin},
title = {An Efficient Rigorous Approach for Identifying Statistically Significant
Frequent Itemsets},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {12:1--12:22},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220359},
doi = {10.1145/2220357.2220359},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KirschMPPUV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OstrovskyRSS12,
author = {Rafail Ostrovsky and
Yuval Rabani and
Leonard J. Schulman and
Chaitanya Swamy},
title = {The effectiveness of lloyd-type methods for the k-means problem},
journal = {J. {ACM}},
volume = {59},
number = {6},
pages = {28:1--28:22},
year = {2012},
url = {https://doi.org/10.1145/2395116.2395117},
doi = {10.1145/2395116.2395117},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OstrovskyRSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Otto12,
author = {Martin Otto},
title = {Highly acyclic groups, hypergraph covers, and the guarded fragment},
journal = {J. {ACM}},
volume = {59},
number = {1},
pages = {5:1--5:40},
year = {2012},
url = {https://doi.org/10.1145/2108242.2108247},
doi = {10.1145/2108242.2108247},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Otto12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PatrascuT12,
author = {Mihai Patrascu and
Mikkel Thorup},
title = {The Power of Simple Tabulation Hashing},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {14:1--14:50},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220361},
doi = {10.1145/2220357.2220361},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PatrascuT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vazirani12,
author = {Vijay V. Vazirani},
title = {The notion of a rational convex program, and an algorithm for the
arrow-debreu Nash bargaining game},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {7:1--7:36},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160160},
doi = {10.1145/2160158.2160160},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vazirani12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu12,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {59},
number = {1},
pages = {4:1},
year = {2012},
url = {https://doi.org/10.1145/2108242.2108246},
doi = {10.1145/2108242.2108246},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu12a,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {59},
number = {2},
pages = {9:1},
year = {2012},
url = {https://doi.org/10.1145/2160158.2160162},
doi = {10.1145/2160158.2160162},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu12a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu12b,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {15:1},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220362},
doi = {10.1145/2220357.2220362},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu12b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu12c,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {59},
number = {4},
pages = {20:1},
year = {2012},
url = {https://doi.org/10.1145/2339123.2339128},
doi = {10.1145/2339123.2339128},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu12c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu12d,
author = {Victor Vianu},
title = {Invited article foreword},
journal = {J. {ACM}},
volume = {59},
number = {5},
pages = {26:1},
year = {2012},
url = {https://doi.org/10.1145/2371656.2371661},
doi = {10.1145/2371656.2371661},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu12d.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VolzerV12,
author = {Hagen V{\"{o}}lzer and
Daniele Varacca},
title = {Defining Fairness in Reactive and Concurrent Systems},
journal = {J. {ACM}},
volume = {59},
number = {3},
pages = {13:1--13:37},
year = {2012},
url = {https://doi.org/10.1145/2220357.2220360},
doi = {10.1145/2220357.2220360},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VolzerV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yi12,
author = {Ke Yi},
title = {Dynamic Indexability and the Optimality of B-Trees},
journal = {J. {ACM}},
volume = {59},
number = {4},
pages = {21:1--21:19},
year = {2012},
url = {https://doi.org/10.1145/2339123.2339129},
doi = {10.1145/2339123.2339129},
timestamp = {Tue, 21 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Yi12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AguileraKMS11,
author = {Marcos Kawazoe Aguilera and
Idit Keidar and
Dahlia Malkhi and
Alexander Shraer},
title = {Dynamic atomic storage without consensus},
journal = {J. {ACM}},
volume = {58},
number = {2},
pages = {7:1--7:32},
year = {2011},
url = {https://doi.org/10.1145/1944345.1944348},
doi = {10.1145/1944345.1944348},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AguileraKMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArthurMR11,
author = {David Arthur and
Bodo Manthey and
Heiko R{\"{o}}glin},
title = {Smoothed Analysis of the k-Means Method},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {19:1--19:31},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027217},
doi = {10.1145/2027216.2027217},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ArthurMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AvronT11,
author = {Haim Avron and
Sivan Toledo},
title = {Randomized algorithms for estimating the trace of an implicit symmetric
positive semi-definite matrix},
journal = {J. {ACM}},
volume = {58},
number = {2},
pages = {8:1--8:34},
year = {2011},
url = {https://doi.org/10.1145/1944345.1944349},
doi = {10.1145/1944345.1944349},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AvronT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarenboimE11,
author = {Leonid Barenboim and
Michael Elkin},
title = {Deterministic Distributed Vertex Coloring in Polylogarithmic Time},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {23:1--23:25},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027221},
doi = {10.1145/2027216.2027221},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarenboimE11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BateniHM11,
author = {MohammadHossein Bateni and
Mohammad Taghi Hajiaghayi and
D{\'{a}}niel Marx},
title = {Approximation Schemes for Steiner Forest on Planar Graphs and Graphs
of Bounded Treewidth},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {21:1--21:37},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027219},
doi = {10.1145/2027216.2027219},
timestamp = {Mon, 12 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BateniHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BojanczykP11,
author = {Mikolaj Bojanczyk and
Pawel Parys},
title = {XPath evaluation in linear time},
journal = {J. {ACM}},
volume = {58},
number = {4},
pages = {17:1--17:33},
year = {2011},
url = {https://doi.org/10.1145/1989727.1989731},
doi = {10.1145/1989727.1989731},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BojanczykP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuchinM11,
author = {Kevin Buchin and
Wolfgang Mulzer},
title = {Delaunay triangulations in \emph{O}(sort(\emph{n})) time and more},
journal = {J. {ACM}},
volume = {58},
number = {2},
pages = {6:1--6:27},
year = {2011},
url = {https://doi.org/10.1145/1944345.1944347},
doi = {10.1145/1944345.1944347},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuchinM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CalcagnoDOY11,
author = {Cristiano Calcagno and
Dino Distefano and
Peter W. O'Hearn and
Hongseok Yang},
title = {Compositional Shape Analysis by Means of Bi-Abduction},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {26:1--26:66},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049700},
doi = {10.1145/2049697.2049700},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CalcagnoDOY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CandesLMW11,
author = {Emmanuel J. Cand{\`{e}}s and
Xiaodong Li and
Yi Ma and
John Wright},
title = {Robust principal component analysis?},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {11:1--11:37},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970395},
doi = {10.1145/1970392.1970395},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CandesLMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChazelleS11,
author = {Bernard Chazelle and
C. Seshadhri},
title = {Online geometric reconstruction},
journal = {J. {ACM}},
volume = {58},
number = {4},
pages = {14:1--14:32},
year = {2011},
url = {https://doi.org/10.1145/1989727.1989728},
doi = {10.1145/1989727.1989728},
timestamp = {Thu, 07 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChazelleS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CicaleseL11,
author = {Ferdinando Cicalese and
Eduardo Sany Laber},
title = {On the competitive ratio of evaluating priced functions},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {9:1--9:40},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970393},
doi = {10.1145/1970392.1970393},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CicaleseL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaginKK11,
author = {Ronald Fagin and
Benny Kimelfeld and
Phokion G. Kolaitis},
title = {Probabilistic data exchange},
journal = {J. {ACM}},
volume = {58},
number = {4},
pages = {15:1--15:55},
year = {2011},
url = {https://doi.org/10.1145/1989727.1989729},
doi = {10.1145/1989727.1989729},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaginKK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Goodrich11,
author = {Michael T. Goodrich},
title = {Randomized Shellsort: {A} Simple Data-Oblivious Sorting Algorithm},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {27:1--27:26},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049701},
doi = {10.1145/2049697.2049701},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Goodrich11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GordonHKL11,
author = {S. Dov Gordon and
Carmit Hazay and
Jonathan Katz and
Yehuda Lindell},
title = {Complete Fairness in Secure Two-Party Computation},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {24:1--24:37},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049698},
doi = {10.1145/2049697.2049698},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GordonHKL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HaeuplerSS11,
author = {Bernhard Haeupler and
Barna Saha and
Aravind Srinivasan},
title = {New Constructive Aspects of the Lov{\'{a}}sz Local Lemma},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {28:1--28:28},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049702},
doi = {10.1145/2049697.2049702},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HaeuplerSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainJUW11,
author = {Rahul Jain and
Zhengfeng Ji and
Sarvagya Upadhyay and
John Watrous},
title = {{QIP} = {PSPACE}},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {30:1--30:27},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049704},
doi = {10.1145/2049697.2049704},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainJUW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KingS11,
author = {Valerie King and
Jared Saia},
title = {Breaking the \emph{O}(\emph{n}\({}^{\mbox{2}}\)) bit barrier: Scalable
byzantine agreement with an adaptive adversary},
journal = {J. {ACM}},
volume = {58},
number = {4},
pages = {18:1--18:24},
year = {2011},
url = {https://doi.org/10.1145/1989727.1989732},
doi = {10.1145/1989727.1989732},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KingS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LaviS11,
author = {Ron Lavi and
Chaitanya Swamy},
title = {Truthful and Near-Optimal Mechanism Design via Linear Programming},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {25:1--25:24},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049699},
doi = {10.1145/2049697.2049699},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LaviS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MastrolilliS11,
author = {Monaldo Mastrolilli and
Ola Svensson},
title = {Hardness of Approximating Flow and Job Shop Scheduling Problems},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {20:1--20:32},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027218},
doi = {10.1145/2027216.2027218},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MastrolilliS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mulmuley11,
author = {Ketan Mulmuley},
title = {On {P} vs. {NP} and geometric complexity theory: Dedicated to Sri
Ramakrishna},
journal = {J. {ACM}},
volume = {58},
number = {2},
pages = {5:1--5:26},
year = {2011},
url = {https://doi.org/10.1145/1944345.1944346},
doi = {10.1145/1944345.1944346},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mulmuley11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SarmaGP11,
author = {Atish Das Sarma and
Sreenivas Gollapudi and
Rina Panigrahy},
title = {Estimating PageRank on graph streams},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {13:1--13:19},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970397},
doi = {10.1145/1970392.1970397},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SarmaGP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VaziraniY11,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Market equilibrium under separable, piecewise-linear, concave utilities},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {10:1--10:25},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970394},
doi = {10.1145/1970392.1970394},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VaziraniY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu11,
author = {Victor Vianu},
title = {Introduction to \emph{JACM} invited article},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {12:1},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970396},
doi = {10.1145/1970392.1970396},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu11a,
author = {Victor Vianu},
title = {Invited articles foreword},
journal = {J. {ACM}},
volume = {58},
number = {4},
pages = {16:1},
year = {2011},
url = {https://doi.org/10.1145/1989727.1989730},
doi = {10.1145/1989727.1989730},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu11b,
author = {Victor Vianu},
title = {Invited Articles Foreword},
journal = {J. {ACM}},
volume = {58},
number = {5},
pages = {22:1},
year = {2011},
url = {https://doi.org/10.1145/2027216.2027220},
doi = {10.1145/2027216.2027220},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu11b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu11c,
author = {Victor Vianu},
title = {Invited Article Foreword},
journal = {J. {ACM}},
volume = {58},
number = {6},
pages = {29:1},
year = {2011},
url = {https://doi.org/10.1145/2049697.2049703},
doi = {10.1145/2049697.2049703},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu11c.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AllenderK10,
author = {Eric Allender and
Michal Kouck{\'{y}}},
title = {Amplifying lower bounds by means of self-reducibility},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {14:1--14:36},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706594},
doi = {10.1145/1706591.1706594},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AllenderK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AltmanT10,
author = {Alon Altman and
Moshe Tennenholtz},
title = {An axiomatic approach to personalized ranking systems},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {26:1--26:35},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734220},
doi = {10.1145/1734213.1734220},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AltmanT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BalcanB10,
author = {Maria{-}Florina Balcan and
Avrim Blum},
title = {A discriminative model for semi-supervised learning},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {19:1--19:46},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706599},
doi = {10.1145/1706591.1706599},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BalcanB10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarakKSSW10,
author = {Boaz Barak and
Guy Kindler and
Ronen Shaltiel and
Benny Sudakov and
Avi Wigderson},
title = {Simulating independence: New constructions of condensers, ramsey graphs,
dispersers, and extractors},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {20:1--20:52},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734214},
doi = {10.1145/1734213.1734214},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BarakKSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarceloLPS10,
author = {Pablo Barcel{\'{o}} and
Leonid Libkin and
Antonella Poggi and
Cristina Sirangelo},
title = {{XML} with incomplete information},
journal = {J. {ACM}},
volume = {58},
number = {1},
pages = {4:1--4:62},
year = {2010},
url = {https://doi.org/10.1145/1870103.1870107},
doi = {10.1145/1870103.1870107},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarceloLPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BiswalLR10,
author = {Punyashloka Biswal and
James R. Lee and
Satish Rao},
title = {Eigenvalue bounds, spectral partitioning, and metrical deformations
via flows},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {13:1--13:23},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706593},
doi = {10.1145/1706591.1706593},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BiswalLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BleiGJ10,
author = {David M. Blei and
Thomas L. Griffiths and
Michael I. Jordan},
title = {The nested chinese restaurant process and bayesian nonparametric inference
of topic hierarchies},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {7:1--7:30},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667056},
doi = {10.1145/1667053.1667056},
timestamp = {Thu, 28 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BleiGJ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodirskyK10,
author = {Manuel Bodirsky and
Jan K{\'{a}}ra},
title = {The complexity of temporal constraint satisfaction problems},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {9:1--9:41},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667058},
doi = {10.1145/1667053.1667058},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BodirskyK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Braverman10,
author = {Mark Braverman},
title = {Polylogarithmic independence fools \emph{AC}\({}^{\mbox{0}}\) circuits},
journal = {J. {ACM}},
volume = {57},
number = {5},
pages = {28:1--28:10},
year = {2010},
url = {https://doi.org/10.1145/1754399.1754401},
doi = {10.1145/1754399.1754401},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Braverman10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CateS10,
author = {Balder ten Cate and
Luc Segoufin},
title = {Transitive closure logic, nested tree walking automata, and XPath},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {18:1--18:41},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706598},
doi = {10.1145/1706591.1706598},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CateS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chan10,
author = {Timothy M. Chan},
title = {A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor
queries},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {16:1--16:15},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706596},
doi = {10.1145/1706591.1706596},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChanGT10,
author = {T.{-}H. Hubert Chan and
Anupam Gupta and
Kunal Talwar},
title = {Ultra-low-dimensional embeddings for doubling metrics},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {21:1--21:26},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734215},
doi = {10.1145/1734213.1734215},
timestamp = {Wed, 18 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChanGT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CheboluFM10,
author = {Prasad Chebolu and
Alan M. Frieze and
P{\'{a}}ll Melsted},
title = {Finding a maximum matching in a sparse random graph in \emph{O}(\emph{n})
expected time},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {24:1--24:27},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734218},
doi = {10.1145/1734213.1734218},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CheboluFM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Delporte-GalletFG10,
author = {Carole Delporte{-}Gallet and
Hugues Fauconnier and
Rachid Guerraoui},
title = {Tight failure detection bounds on atomic object implementations},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {22:1--22:32},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734216},
doi = {10.1145/1734213.1734216},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Delporte-GalletFG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DolevEP10,
author = {Shlomi Dolev and
Yuval Elovici and
Rami Puzis},
title = {Routing betweenness centrality},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {25:1--25:27},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734219},
doi = {10.1145/1734213.1734219},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DolevEP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EsparzaKL10,
author = {Javier Esparza and
Stefan Kiefer and
Michael Luttenberger},
title = {Newtonian program analysis},
journal = {J. {ACM}},
volume = {57},
number = {6},
pages = {33:1--33:47},
year = {2010},
url = {https://doi.org/10.1145/1857914.1857917},
doi = {10.1145/1857914.1857917},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/EsparzaKL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EvfimievskiFW10,
author = {Alexandre V. Evfimievski and
Ronald Fagin and
David P. Woodruff},
title = {Epistemic privacy},
journal = {J. {ACM}},
volume = {58},
number = {1},
pages = {2:1--2:45},
year = {2010},
url = {https://doi.org/10.1145/1870103.1870105},
doi = {10.1145/1870103.1870105},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EvfimievskiFW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaginN10,
author = {Ronald Fagin and
Alan Nash},
title = {The structure of inverses in schema mappings},
journal = {J. {ACM}},
volume = {57},
number = {6},
pages = {31:1--31:57},
year = {2010},
url = {https://doi.org/10.1145/1857914.1857915},
doi = {10.1145/1857914.1857915},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaginN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FisherMW10,
author = {Kathleen Fisher and
Yitzhak Mandelbaum and
David Walker},
title = {The next 700 data description languages},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {10:1--10:51},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667059},
doi = {10.1145/1667053.1667059},
timestamp = {Mon, 08 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FisherMW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobS10,
author = {Georg Gottlob and
Pierre Senellart},
title = {Schema mapping discovery from data instances},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {6:1--6:37},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667055},
doi = {10.1145/1667053.1667055},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuhaMS10,
author = {Sudipto Guha and
Kamesh Munagala and
Peng Shi},
title = {Approximation algorithms for restless bandit problems},
journal = {J. {ACM}},
volume = {58},
number = {1},
pages = {3:1--3:50},
year = {2010},
url = {https://doi.org/10.1145/1870103.1870106},
doi = {10.1145/1870103.1870106},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuhaMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HallgrenMRRS10,
author = {Sean Hallgren and
Cristopher Moore and
Martin R{\"{o}}tteler and
Alexander Russell and
Pranab Sen},
title = {Limitations of quantum coset states for graph isomorphism},
journal = {J. {ACM}},
volume = {57},
number = {6},
pages = {34:1--34:33},
year = {2010},
url = {https://doi.org/10.1145/1857914.1857918},
doi = {10.1145/1857914.1857918},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HallgrenMRRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KumarSS10,
author = {Amit Kumar and
Yogish Sabharwal and
Sandeep Sen},
title = {Linear-time approximation schemes for clustering problems in any dimensions},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {5:1--5:32},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667054},
doi = {10.1145/1667053.1667054},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KumarSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LenzenLW10,
author = {Christoph Lenzen and
Thomas Locher and
Roger Wattenhofer},
title = {Tight bounds for clock synchronization},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {8:1--8:42},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667057},
doi = {10.1145/1667053.1667057},
timestamp = {Thu, 24 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LenzenLW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MandowP10,
author = {Lawrence Mandow and
Jos{\'{e}}{-}Luis P{\'{e}}rez{-}de{-}la{-}Cruz},
title = {Multiobjective A\({}^{\mbox{*}}\) search with consistent heuristics},
journal = {J. {ACM}},
volume = {57},
number = {5},
pages = {27:1--27:25},
year = {2010},
url = {https://doi.org/10.1145/1754399.1754400},
doi = {10.1145/1754399.1754400},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MandowP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MoserT10,
author = {Robin A. Moser and
G{\'{a}}bor Tardos},
title = {A constructive proof of the general lov{\'{a}}sz local lemma},
journal = {J. {ACM}},
volume = {57},
number = {2},
pages = {11:1--11:15},
year = {2010},
url = {https://doi.org/10.1145/1667053.1667060},
doi = {10.1145/1667053.1667060},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MoserT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MoshkovitzR10,
author = {Dana Moshkovitz and
Ran Raz},
title = {Two-query {PCP} with subconstant error},
journal = {J. {ACM}},
volume = {57},
number = {5},
pages = {29:1--29:29},
year = {2010},
url = {https://doi.org/10.1145/1754399.1754402},
doi = {10.1145/1754399.1754402},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MoshkovitzR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MotikR10,
author = {Boris Motik and
Riccardo Rosati},
title = {Reconciling description logics and rules},
journal = {J. {ACM}},
volume = {57},
number = {5},
pages = {30:1--30:62},
year = {2010},
url = {https://doi.org/10.1145/1754399.1754403},
doi = {10.1145/1754399.1754403},
timestamp = {Thu, 02 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MotikR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Nivasch10,
author = {Gabriel Nivasch},
title = {Improved bounds and new techniques for Davenport-Schinzel sequences
and their generalizations},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {17:1--17:44},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706597},
doi = {10.1145/1706591.1706597},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Nivasch10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Pacholski10,
author = {Witold Charatonik and
Leszek Pacholski},
title = {Set constraints with projections},
journal = {J. {ACM}},
volume = {57},
number = {4},
pages = {23:1--23:37},
year = {2010},
url = {https://doi.org/10.1145/1734213.1734217},
doi = {10.1145/1734213.1734217},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Pacholski10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Shibuya10,
author = {Tetsuo Shibuya},
title = {Geometric suffix tree: Indexing protein 3-D structures},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {15:1--15:17},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706595},
doi = {10.1145/1706591.1706595},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Shibuya10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vempala10,
author = {Santosh S. Vempala},
title = {A random-sampling-based algorithm for learning intersections of halfspaces},
journal = {J. {ACM}},
volume = {57},
number = {6},
pages = {32:1--32:14},
year = {2010},
url = {https://doi.org/10.1145/1857914.1857916},
doi = {10.1145/1857914.1857916},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Vempala10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu10,
author = {Victor Vianu},
title = {Editorial: {JACM} at the start of a new decade},
journal = {J. {ACM}},
volume = {57},
number = {3},
pages = {12:1--12:3},
year = {2010},
url = {https://doi.org/10.1145/1706591.1706592},
doi = {10.1145/1706591.1706592},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Vianu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vianu10a,
author = {Victor Vianu},
title = {Invited articles section foreword},
journal = {J. {ACM}},
volume = {58},
number = {1},
pages = {1:1},
year = {2010},
url = {https://doi.org/10.1145/1870103.1870104},
doi = {10.1145/1870103.1870104},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vianu10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AchlioptasCKM09,
author = {Dimitris Achlioptas and
Aaron Clauset and
David Kempe and
Cristopher Moore},
title = {On the bias of traceroute sampling: Or, power-law degree distributions
in regular graphs},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {21:1--21:28},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538905},
doi = {10.1145/1538902.1538905},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AchlioptasCKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlurM09,
author = {Rajeev Alur and
P. Madhusudan},
title = {Adding nesting structure to words},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {16:1--16:43},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516518},
doi = {10.1145/1516512.1516518},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlurM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraRV09,
author = {Sanjeev Arora and
Satish Rao and
Umesh V. Vazirani},
title = {Expander flows, geometric embeddings and graph partitioning},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {5:1--5:37},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502794},
doi = {10.1145/1502793.1502794},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AroraRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArvestadLS09,
author = {Lars Arvestad and
Jens Lagergren and
Bengt Sennblad},
title = {The gene evolution model and computing its associated probabilities},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {7:1--7:44},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502796},
doi = {10.1145/1502793.1502796},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ArvestadLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AryaMM09,
author = {Sunil Arya and
Theocharis Malamatos and
David M. Mount},
title = {Space-time tradeoffs for approximate nearest neighbor searching},
journal = {J. {ACM}},
volume = {57},
number = {1},
pages = {1:1--1:54},
year = {2009},
url = {https://doi.org/10.1145/1613676.1613677},
doi = {10.1145/1613676.1613677},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AryaMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaGHK09,
author = {Hagit Attiya and
Rachid Guerraoui and
Danny Hendler and
Petr Kuznetsov},
title = {The complexity of obstruction-free implementations},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {24:1--24:33},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538908},
doi = {10.1145/1538902.1538908},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaGHK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BabaioffLP09,
author = {Moshe Babaioff and
Ron Lavi and
Elan Pavlov},
title = {Single-value combinatorial auctions and algorithmic implementation
in undominated strategies},
journal = {J. {ACM}},
volume = {56},
number = {1},
pages = {4:1--4:32},
year = {2009},
url = {https://doi.org/10.1145/1462153.1462157},
doi = {10.1145/1462153.1462157},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BabaioffLP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BilardiEP09,
author = {Gianfranco Bilardi and
Kattamuri Ekanadham and
Pratap Pattnaik},
title = {On approximating the ideal random access machine by physical machines},
journal = {J. {ACM}},
volume = {56},
number = {5},
pages = {27:1--27:57},
year = {2009},
url = {https://doi.org/10.1145/1552285.1552288},
doi = {10.1145/1552285.1552288},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BilardiEP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BojanczykMSS09,
author = {Mikolaj Bojanczyk and
Anca Muscholl and
Thomas Schwentick and
Luc Segoufin},
title = {Two-variable logic on data trees and {XML} reasoning},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {13:1--13:48},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516515},
doi = {10.1145/1516512.1516515},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BojanczykMSS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BorradaileK09,
author = {Glencora Borradaile and
Philip N. Klein},
title = {An \emph{O}(\emph{n} log \emph{n}) algorithm for maximum \emph{st}-flow
in a directed planar graph},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {9:1--9:30},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502798},
doi = {10.1145/1502793.1502798},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BorradaileK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CateL09,
author = {Balder ten Cate and
Carsten Lutz},
title = {The complexity of query containment in expressive fragments of XPath
2.0},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {31:1--31:48},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568321},
doi = {10.1145/1568318.1568321},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CateL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChadhaSV09,
author = {Rohit Chadha and
A. Prasad Sistla and
Mahesh Viswanathan},
title = {On the expressiveness and complexity of randomization in finite state
monitors},
journal = {J. {ACM}},
volume = {56},
number = {5},
pages = {26:1--26:44},
year = {2009},
url = {https://doi.org/10.1145/1552285.1552287},
doi = {10.1145/1552285.1552287},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChadhaSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenDT09,
author = {Xi Chen and
Xiaotie Deng and
Shang{-}Hua Teng},
title = {Settling the complexity of computing two-player Nash equilibria},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {14:1--14:57},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516516},
doi = {10.1145/1516512.1516516},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenDT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyK09,
author = {Julia Chuzhoy and
Sanjeev Khanna},
title = {Polynomial flow-cut gaps and hardness of directed cut problems},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {6:1--6:28},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502795},
doi = {10.1145/1502793.1502795},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EtessamiY09,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Markov chains, stochastic grammars, and monotone systems
of nonlinear equations},
journal = {J. {ACM}},
volume = {56},
number = {1},
pages = {1:1--1:66},
year = {2009},
url = {https://doi.org/10.1145/1462153.1462154},
doi = {10.1145/1462153.1462154},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EtessamiY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EzraS09,
author = {Esther Ezra and
Micha Sharir},
title = {On the union of fat tetrahedra in three dimensions},
journal = {J. {ACM}},
volume = {57},
number = {1},
pages = {2:1--2:23},
year = {2009},
url = {https://doi.org/10.1145/1613676.1613678},
doi = {10.1145/1613676.1613678},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EzraS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerraginaLMM09,
author = {Paolo Ferragina and
Fabrizio Luccio and
Giovanni Manzini and
S. Muthukrishnan},
title = {Compressing and indexing labeled trees, with applications},
journal = {J. {ACM}},
volume = {57},
number = {1},
pages = {4:1--4:33},
year = {2009},
url = {https://doi.org/10.1145/1613676.1613680},
doi = {10.1145/1613676.1613680},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FerraginaLMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FominGK09,
author = {Fedor V. Fomin and
Fabrizio Grandoni and
Dieter Kratsch},
title = {A measure {\&} conquer approach for the analysis of exact algorithms},
journal = {J. {ACM}},
volume = {56},
number = {5},
pages = {25:1--25:32},
year = {2009},
url = {https://doi.org/10.1145/1552285.1552286},
doi = {10.1145/1552285.1552286},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FominGK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobMS09,
author = {Georg Gottlob and
Zolt{\'{a}}n Mikl{\'{o}}s and
Thomas Schwentick},
title = {Generalized hypertree decompositions: NP-hardness and tractable variants},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {30:1--30:32},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568320},
doi = {10.1145/1568318.1568320},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GroheHS09,
author = {Martin Grohe and
Andr{\'{e}} Hernich and
Nicole Schweikardt},
title = {Lower bounds for processing data with few random accesses to external
memory},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {12:1--12:58},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516514},
doi = {10.1145/1516512.1516514},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GroheHS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuruswamiUV09,
author = {Venkatesan Guruswami and
Christopher Umans and
Salil P. Vadhan},
title = {Unbalanced expanders and randomness extractors from Parvaresh-Vardy
codes},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {20:1--20:34},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538904},
doi = {10.1145/1538902.1538904},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GuruswamiUV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainRS09,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {A property of quantum relative entropy with an application to privacy
in quantum communication},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {33:1--33:32},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568323},
doi = {10.1145/1568318.1568323},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KatzOY09,
author = {Jonathan Katz and
Rafail Ostrovsky and
Moti Yung},
title = {Efficient and secure authenticated key exchange using weak passwords},
journal = {J. {ACM}},
volume = {57},
number = {1},
pages = {3:1--3:39},
year = {2009},
url = {https://doi.org/10.1145/1613676.1613679},
doi = {10.1145/1613676.1613679},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KatzOY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KhandekarRV09,
author = {Rohit Khandekar and
Satish Rao and
Umesh V. Vazirani},
title = {Graph partitioning using single commodity flows},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {19:1--19:15},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538903},
doi = {10.1145/1538902.1538903},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KhandekarRV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KleinbergSW09,
author = {Jon M. Kleinberg and
Aleksandrs Slivkins and
Tom Wexler},
title = {Triangulation and embedding using small sets of beacons},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {32:1--32:37},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568322},
doi = {10.1145/1568318.1568322},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KleinbergSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KumarMPS09,
author = {V. S. Anil Kumar and
Madhav V. Marathe and
Srinivasan Parthasarathy and
Aravind Srinivasan},
title = {A unified approach to scheduling on unrelated parallel machines},
journal = {J. {ACM}},
volume = {56},
number = {5},
pages = {28:1--28:31},
year = {2009},
url = {https://doi.org/10.1145/1552285.1552289},
doi = {10.1145/1552285.1552289},
timestamp = {Wed, 06 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KumarMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Leyton-BrownNS09,
author = {Kevin Leyton{-}Brown and
Eugene Nudelman and
Yoav Shoham},
title = {Empirical hardness models: Methodology and a case study on combinatorial
auctions},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {22:1--22:52},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538906},
doi = {10.1145/1538902.1538906},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Leyton-BrownNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LibkinV09,
author = {Leonid Libkin and
Victor Vianu},
title = {Introduction to {PODS} 2007 special section},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {29:1},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568319},
doi = {10.1145/1568318.1568319},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LibkinV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lueker09,
author = {George S. Lueker},
title = {Improved bounds on the average length of longest common subsequences},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {17:1--17:38},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516519},
doi = {10.1145/1516512.1516519},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lueker09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NaorR09,
author = {Moni Naor and
Guy N. Rothblum},
title = {The complexity of online memory checking},
journal = {J. {ACM}},
volume = {56},
number = {1},
pages = {2:1--2:46},
year = {2009},
url = {https://doi.org/10.1145/1462153.1462155},
doi = {10.1145/1462153.1462155},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NaorR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PuschelMH09,
author = {Markus P{\"{u}}schel and
Peter A. Milder and
James C. Hoe},
title = {Permuting streaming data using RAMs},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {10:1--10:34},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502799},
doi = {10.1145/1502793.1502799},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/PuschelMH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Raz09,
author = {Ran Raz},
title = {Multi-linear formulas for permanent and determinant are of super-polynomial
size},
journal = {J. {ACM}},
volume = {56},
number = {2},
pages = {8:1--8:17},
year = {2009},
url = {https://doi.org/10.1145/1502793.1502797},
doi = {10.1145/1502793.1502797},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Raz09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Regev09,
author = {Oded Regev},
title = {On lattices, learning with errors, random linear codes, and cryptography},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {34:1--34:40},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568324},
doi = {10.1145/1568318.1568324},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Regev09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RemyS09,
author = {Jan Remy and
Angelika Steger},
title = {A quasi-polynomial time approximation scheme for minimum weight triangulation},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {15:1--15:47},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516517},
doi = {10.1145/1516512.1516517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RemyS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RoughgardenS09,
author = {Tim Roughgarden and
Mukund Sundararajan},
title = {Quantifying inefficiency in cost-sharing mechanisms},
journal = {J. {ACM}},
volume = {56},
number = {4},
pages = {23:1--23:33},
year = {2009},
url = {https://doi.org/10.1145/1538902.1538907},
doi = {10.1145/1538902.1538907},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RoughgardenS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StefankovicVV09,
author = {Daniel Stefankovic and
Santosh S. Vempala and
Eric Vigoda},
title = {Adaptive simulated annealing: {A} near-optimal connection between
sampling and counting},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {18:1--18:36},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516520},
doi = {10.1145/1516512.1516520},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/StefankovicVV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Valiant09,
author = {Leslie G. Valiant},
title = {Evolvability},
journal = {J. {ACM}},
volume = {56},
number = {1},
pages = {3:1--3:21},
year = {2009},
url = {https://doi.org/10.1145/1462153.1462156},
doi = {10.1145/1462153.1462156},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Valiant09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VianuB09,
author = {Victor Vianu and
Jan Van den Bussche},
title = {Introduction to {PODS} 2006 special section},
journal = {J. {ACM}},
volume = {56},
number = {3},
pages = {11:1},
year = {2009},
url = {https://doi.org/10.1145/1516512.1516513},
doi = {10.1145/1516512.1516513},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VianuB09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbadiW08,
author = {Mart{\'{\i}}n Abadi and
Bogdan Warinschi},
title = {Security analysis of cryptographically controlled access to {XML}
documents},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {6:1--6:29},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346331},
doi = {10.1145/1346330.1346331},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbadiW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AckermannRV08,
author = {Heiner Ackermann and
Heiko R{\"{o}}glin and
Berthold V{\"{o}}cking},
title = {On the impact of combinatorial structure on congestion games},
journal = {J. {ACM}},
volume = {55},
number = {6},
pages = {25:1--25:22},
year = {2008},
url = {https://doi.org/10.1145/1455248.1455249},
doi = {10.1145/1455248.1455249},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AckermannRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AilonCN08,
author = {Nir Ailon and
Moses Charikar and
Alantha Newman},
title = {Aggregating inconsistent information: Ranking and clustering},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {23:1--23:27},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411513},
doi = {10.1145/1411509.1411513},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AilonCN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonKNSS08,
author = {Noga Alon and
Haim Kaplan and
Gabriel Nivasch and
Micha Sharir and
Shakhar Smorodinsky},
title = {Weak {\(\epsilon\)}-nets and interval chains},
journal = {J. {ACM}},
volume = {55},
number = {6},
pages = {28:1--28:32},
year = {2008},
url = {https://doi.org/10.1145/1455248.1455252},
doi = {10.1145/1455248.1455252},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AlonKNSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndrewsZ08,
author = {Matthew Andrews and
Lisa Zhang},
title = {Almost-tight hardness of directed congestion minimization},
journal = {J. {ACM}},
volume = {55},
number = {6},
pages = {27:1--27:20},
year = {2008},
url = {https://doi.org/10.1145/1455248.1455251},
doi = {10.1145/1455248.1455251},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndrewsZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArenasL08,
author = {Marcelo Arenas and
Leonid Libkin},
title = {{XML} data exchange: Consistency and query answering},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {7:1--7:72},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346332},
doi = {10.1145/1346330.1346332},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ArenasL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaC08,
author = {Hagit Attiya and
Keren Censor},
title = {Tight bounds for asynchronous randomized consensus},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {20:1--20:26},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411510},
doi = {10.1145/1411509.1411510},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaC08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AwerbuchCK08,
author = {Baruch Awerbuch and
Israel Cidon and
Shay Kutten},
title = {Optimal maintenance of a spanning tree},
journal = {J. {ACM}},
volume = {55},
number = {4},
pages = {18:1--18:45},
year = {2008},
url = {https://doi.org/10.1145/1391289.1391292},
doi = {10.1145/1391289.1391292},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AwerbuchCK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bar-YossefG08,
author = {Ziv Bar{-}Yossef and
Maxim Gurevich},
title = {Random sampling from a search engine's index},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {24:1--24:74},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411514},
doi = {10.1145/1411509.1411514},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bar-YossefG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenediktFG08,
author = {Michael Benedikt and
Wenfei Fan and
Floris Geerts},
title = {XPath satisfiability in the presence of DTDs},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {8:1--8:79},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346333},
doi = {10.1145/1346330.1346333},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenediktFG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenD08,
author = {Xi Chen and
Xiaotie Deng},
title = {Matching algorithmic bounds for finding a Brouwer fixed point},
journal = {J. {ACM}},
volume = {55},
number = {3},
pages = {13:1--13:26},
year = {2008},
url = {https://doi.org/10.1145/1379759.1379761},
doi = {10.1145/1379759.1379761},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenLLOR08,
author = {Jianer Chen and
Yang Liu and
Songjian Lu and
Barry O'Sullivan and
Igor Razgon},
title = {A fixed-parameter algorithm for the directed feedback vertex set problem},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {21:1--21:19},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411511},
doi = {10.1145/1411509.1411511},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenLLOR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DeinekoJKK08,
author = {Vladimir G. Deineko and
Peter Jonsson and
Mikael Klasson and
Andrei A. Krokhin},
title = {The approximability of {MAX} {CSP} with fixed-value constraints},
journal = {J. {ACM}},
volume = {55},
number = {4},
pages = {16:1--16:37},
year = {2008},
url = {https://doi.org/10.1145/1391289.1391290},
doi = {10.1145/1391289.1391290},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DeinekoJKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DevanurPSV08,
author = {Nikhil R. Devanur and
Christos H. Papadimitriou and
Amin Saberi and
Vijay V. Vazirani},
title = {Market equilibrium via a primal-dual algorithm for a convex program},
journal = {J. {ACM}},
volume = {55},
number = {5},
pages = {22:1--22:18},
year = {2008},
url = {https://doi.org/10.1145/1411509.1411512},
doi = {10.1145/1411509.1411512},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DevanurPSV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DinitzMR08,
author = {Yefim Dinitz and
Shlomo Moran and
Sergio Rajsbaum},
title = {Bit complexity of breaking and achieving symmetry in chains and rings},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {3:1--3:28},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326557},
doi = {10.1145/1326554.1326557},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DinitzMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlescaFM08,
author = {Sergio Flesca and
Filippo Furfaro and
Elio Masciari},
title = {On the minimization of XPath queries},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {2:1--2:46},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326556},
doi = {10.1145/1326554.1326556},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FlescaFM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FrischCB08,
author = {Alain Frisch and
Giuseppe Castagna and
V{\'{e}}ronique Benzaken},
title = {Semantic subtyping: Dealing set-theoretically with function, union,
intersection, and negation types},
journal = {J. {ACM}},
volume = {55},
number = {4},
pages = {19:1--19:64},
year = {2008},
url = {https://doi.org/10.1145/1391289.1391293},
doi = {10.1145/1391289.1391293},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FrischCB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobN08,
author = {Georg Gottlob and
Alan Nash},
title = {Efficient core computation in data exchange},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {9:1--9:49},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346334},
doi = {10.1145/1346330.1346334},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HalpernW08,
author = {Joseph Y. Halpern and
Vicky Weissman},
title = {A formal foundation for XrML},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {4:1--4:42},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326558},
doi = {10.1145/1326554.1326558},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HalpernW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JancarS08,
author = {Petr Jancar and
Jir{\'{\i}} Srba},
title = {Undecidability of bisimilarity by defender's forcing},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {5:1--5:26},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326559},
doi = {10.1145/1326554.1326559},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JancarS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Korf08,
author = {Richard E. Korf},
title = {Linear-time disk-based implicit graph search},
journal = {J. {ACM}},
volume = {55},
number = {6},
pages = {26:1--26:40},
year = {2008},
url = {https://doi.org/10.1145/1455248.1455250},
doi = {10.1145/1455248.1455250},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Korf08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LiW08,
author = {Ninghui Li and
Qihua Wang},
title = {Beyond separation of duty: An algebra for specifying high-level security
policies},
journal = {J. {ACM}},
volume = {55},
number = {3},
pages = {12:1--12:46},
year = {2008},
url = {https://doi.org/10.1145/1379759.1379760},
doi = {10.1145/1379759.1379760},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LiW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MulzerR08,
author = {Wolfgang Mulzer and
G{\"{u}}nter Rote},
title = {Minimum-weight triangulation is NP-hard},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {11:1--11:29},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346336},
doi = {10.1145/1346330.1346336},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MulzerR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PapadimitriouR08,
author = {Christos H. Papadimitriou and
Tim Roughgarden},
title = {Computing correlated equilibria in multi-player games},
journal = {J. {ACM}},
volume = {55},
number = {3},
pages = {14:1--14:29},
year = {2008},
url = {https://doi.org/10.1145/1379759.1379762},
doi = {10.1145/1379759.1379762},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/PapadimitriouR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reingold08,
author = {Omer Reingold},
title = {Undirected connectivity in log-space},
journal = {J. {ACM}},
volume = {55},
number = {4},
pages = {17:1--17:24},
year = {2008},
url = {https://doi.org/10.1145/1391289.1391291},
doi = {10.1145/1391289.1391291},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reingold08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rossman08,
author = {Benjamin Rossman},
title = {Homomorphism preservation theorems},
journal = {J. {ACM}},
volume = {55},
number = {3},
pages = {15:1--15:53},
year = {2008},
url = {https://doi.org/10.1145/1379759.1379763},
doi = {10.1145/1379759.1379763},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rossman08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tardos08,
author = {G{\'{a}}bor Tardos},
title = {Optimal probabilistic fingerprint codes},
journal = {J. {ACM}},
volume = {55},
number = {2},
pages = {10:1--10:24},
year = {2008},
url = {https://doi.org/10.1145/1346330.1346335},
doi = {10.1145/1346330.1346335},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tardos08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yekhanin08,
author = {Sergey Yekhanin},
title = {Towards 3-query locally decodable codes of subexponential length},
journal = {J. {ACM}},
volume = {55},
number = {1},
pages = {1:1--1:16},
year = {2008},
url = {https://doi.org/10.1145/1326554.1326555},
doi = {10.1145/1326554.1326555},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yekhanin08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AchlioptasM07,
author = {Dimitris Achlioptas and
Frank McSherry},
title = {Fast computation of low-rank matrix approximations},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {9},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219097},
doi = {10.1145/1219092.1219097},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AchlioptasM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AchlioptasNP07,
author = {Dimitris Achlioptas and
Assaf Naor and
Yuval Peres},
title = {On the maximum satisfiability of random formulas},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {10},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219098},
doi = {10.1145/1219092.1219098},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AchlioptasNP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AnderssonT07,
author = {Arne Andersson and
Mikkel Thorup},
title = {Dynamic ordered sets with exponential search trees},
journal = {J. {ACM}},
volume = {54},
number = {3},
pages = {13},
year = {2007},
url = {https://doi.org/10.1145/1236457.1236460},
doi = {10.1145/1236457.1236460},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AnderssonT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaetenCG07,
author = {Jos C. M. Baeten and
Flavio Corradini and
Clemens Grabmayer},
title = {A characterization of regular expressions under bisimulation},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {6},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219094},
doi = {10.1145/1219092.1219094},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BaetenCG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BansalKP07,
author = {Nikhil Bansal and
Tracy Kimbrel and
Kirk Pruhs},
title = {Speed scaling to manage energy and temperature},
journal = {J. {ACM}},
volume = {54},
number = {1},
pages = {3:1--3:39},
year = {2007},
url = {https://doi.org/10.1145/1206035.1206038},
doi = {10.1145/1206035.1206038},
timestamp = {Tue, 15 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BansalKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BergstraT07,
author = {Jan A. Bergstra and
John V. Tucker},
title = {The rational numbers as an abstract data type},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {7},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219095},
doi = {10.1145/1219092.1219095},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BergstraT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenKLRSV07,
author = {Jiangzhuo Chen and
Robert D. Kleinberg and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
Rajmohan Rajaraman and
Ravi Sundaram and
Adrian Vetta},
title = {(Almost) Tight bounds and existence theorems for single-commodity
confluent flows},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {16},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255444},
doi = {10.1145/1255443.1255444},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenKLRSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CheungSV07,
author = {Ling Cheung and
Mari{\"{e}}lle Stoelinga and
Frits W. Vaandrager},
title = {A testing scenario for probabilistic processes},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {29},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314693},
doi = {10.1145/1314690.1314693},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CheungSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CohenNS07,
author = {Sara Cohen and
Werner Nutt and
Yehoshua Sagiv},
title = {Deciding equivalences among conjunctive aggregate queries},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {5},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219093},
doi = {10.1145/1219092.1219093},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CohenNS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ConitzerSL07,
author = {Vincent Conitzer and
Tuomas Sandholm and
J{\'{e}}r{\^{o}}me Lang},
title = {When are elections with few candidates hard to manipulate?},
journal = {J. {ACM}},
volume = {54},
number = {3},
pages = {14},
year = {2007},
url = {https://doi.org/10.1145/1236457.1236461},
doi = {10.1145/1236457.1236461},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ConitzerSL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DanosKP07,
author = {Vincent Danos and
Elham Kashefi and
Prakash Panangaden},
title = {The measurement calculus},
journal = {J. {ACM}},
volume = {54},
number = {2},
pages = {8},
year = {2007},
url = {https://doi.org/10.1145/1219092.1219096},
doi = {10.1145/1219092.1219096},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DanosKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Dinur07,
author = {Irit Dinur},
title = {The {PCP} theorem by gap amplification},
journal = {J. {ACM}},
volume = {54},
number = {3},
pages = {12},
year = {2007},
url = {https://doi.org/10.1145/1236457.1236459},
doi = {10.1145/1236457.1236459},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Dinur07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuffieldLT07,
author = {Nick G. Duffield and
Carsten Lund and
Mikkel Thorup},
title = {Priority sampling for estimation of arbitrary subset sums},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {32},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314696},
doi = {10.1145/1314690.1314696},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DuffieldLT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerGP07,
author = {Martin E. Dyer and
Leslie Ann Goldberg and
Mike Paterson},
title = {On counting homomorphisms to directed acyclic graphs},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {27},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314691},
doi = {10.1145/1314690.1314691},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerGP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EiterM07,
author = {Thomas Eiter and
Kazuhisa Makino},
title = {On computing all abductive explanations from a propositional Horn
theory},
journal = {J. {ACM}},
volume = {54},
number = {5},
pages = {24},
year = {2007},
url = {https://doi.org/10.1145/1284320.1284323},
doi = {10.1145/1284320.1284323},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EiterM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EllenFR07,
author = {Faith Ellen and
Panagiota Fatourou and
Eric Ruppert},
title = {Time lower bounds for implementations of multi-writer snapshots},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {30},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314694},
doi = {10.1145/1314690.1314694},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EllenFR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GilpinS07,
author = {Andrew Gilpin and
Tuomas Sandholm},
title = {Lossless abstraction of imperfect information games},
journal = {J. {ACM}},
volume = {54},
number = {5},
pages = {25},
year = {2007},
url = {https://doi.org/10.1145/1284320.1284324},
doi = {10.1145/1284320.1284324},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GilpinS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Grohe07,
author = {Martin Grohe},
title = {The complexity of homomorphism and constraint satisfaction problems
seen from the other side},
journal = {J. {ACM}},
volume = {54},
number = {1},
pages = {1:1--1:24},
year = {2007},
url = {https://doi.org/10.1145/1206035.1206036},
doi = {10.1145/1206035.1206036},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Grohe07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GuptaKPR07,
author = {Anupam Gupta and
Amit Kumar and
Martin P{\'{a}}l and
Tim Roughgarden},
title = {Approximation via cost sharing: Simpler and better approximation algorithms
for network design},
journal = {J. {ACM}},
volume = {54},
number = {3},
pages = {11},
year = {2007},
url = {https://doi.org/10.1145/1236457.1236458},
doi = {10.1145/1236457.1236458},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GuptaKPR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HaldarV07,
author = {Sibsankar Haldar and
K. Vidyasankar},
title = {On specification of Read/Write shared variables},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {31},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314695},
doi = {10.1145/1314690.1314695},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HaldarV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hallgren07,
author = {Sean Hallgren},
title = {Polynomial-time quantum algorithms for Pell's equation and the principal
ideal problem},
journal = {J. {ACM}},
volume = {54},
number = {1},
pages = {4:1--4:19},
year = {2007},
url = {https://doi.org/10.1145/1206035.1206039},
doi = {10.1145/1206035.1206039},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hallgren07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HalpernP07,
author = {Joseph Y. Halpern and
Riccardo Pucella},
title = {Characterizing and reasoning about probabilistic and non-probabilistic
expectation},
journal = {J. {ACM}},
volume = {54},
number = {3},
pages = {15},
year = {2007},
url = {https://doi.org/10.1145/1236457.1236462},
doi = {10.1145/1236457.1236462},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HalpernP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HarjuN07,
author = {Tero Harju and
Dirk Nowotka},
title = {Periodicity and unbordered words: {A} proof of the extended duval
conjecture},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {20},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255448},
doi = {10.1145/1255443.1255448},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HarjuN07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JouannaudR07,
author = {Jean{-}Pierre Jouannaud and
Albert Rubio},
title = {Polymorphic higher-order recursive path orderings},
journal = {J. {ACM}},
volume = {54},
number = {1},
pages = {2:1--2:48},
year = {2007},
url = {https://doi.org/10.1145/1206035.1206037},
doi = {10.1145/1206035.1206037},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JouannaudR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ManevaMW07,
author = {Elitza N. Maneva and
Elchanan Mossel and
Martin J. Wainwright},
title = {A new look at survey propagation and its generalizations},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {17},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255445},
doi = {10.1145/1255443.1255445},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ManevaMW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MehtaSVV07,
author = {Aranyak Mehta and
Amin Saberi and
Umesh V. Vazirani and
Vijay V. Vazirani},
title = {AdWords and generalized online matching},
journal = {J. {ACM}},
volume = {54},
number = {5},
pages = {22},
year = {2007},
url = {https://doi.org/10.1145/1284320.1284321},
doi = {10.1145/1284320.1284321},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MehtaSVV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OstrovskyR07,
author = {Rafail Ostrovsky and
Yuval Rabani},
title = {Low distortion embeddings for edit distance},
journal = {J. {ACM}},
volume = {54},
number = {5},
pages = {23},
year = {2007},
url = {https://doi.org/10.1145/1284320.1284322},
doi = {10.1145/1284320.1284322},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OstrovskyR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RudelsonV07,
author = {Mark Rudelson and
Roman Vershynin},
title = {Sampling from large matrices: An approach through geometric functional
analysis},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {21},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255449},
doi = {10.1145/1255443.1255449},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RudelsonV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SumiiP07,
author = {Eijiro Sumii and
Benjamin C. Pierce},
title = {A bisimulation for type abstraction and recursion},
journal = {J. {ACM}},
volume = {54},
number = {5},
pages = {26},
year = {2007},
url = {https://doi.org/10.1145/1284320.1284325},
doi = {10.1145/1284320.1284325},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SumiiP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Thorup07,
author = {Mikkel Thorup},
title = {Equivalence between priority queues and sorting},
journal = {J. {ACM}},
volume = {54},
number = {6},
pages = {28},
year = {2007},
url = {https://doi.org/10.1145/1314690.1314692},
doi = {10.1145/1314690.1314692},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Thorup07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vansummeren07,
author = {Stijn Vansummeren},
title = {On deciding well-definedness for query languages on trees},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {19},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255447},
doi = {10.1145/1255443.1255447},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vansummeren07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VerdiereL07,
author = {{\'{E}}ric Colin de Verdi{\`{e}}re and
Francis Lazarus},
title = {Optimal pants decompositions and shortest homotopic cycles on an orientable
surface},
journal = {J. {ACM}},
volume = {54},
number = {4},
pages = {18},
year = {2007},
url = {https://doi.org/10.1145/1255443.1255446},
doi = {10.1145/1255443.1255446},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VerdiereL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisSV06,
author = {Andris Ambainis and
Leonard J. Schulman and
Umesh V. Vazirani},
title = {Computing with highly mixed states},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {507--531},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147962},
doi = {10.1145/1147954.1147962},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AmbainisSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndrewsZ06,
author = {Matthew Andrews and
Lisa Zhang},
title = {Logarithmic hardness of the undirected edge-disjoint paths problem},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {745--761},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183910},
doi = {10.1145/1183907.1183910},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndrewsZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasDK06,
author = {Albert Atserias and
Anuj Dawar and
Phokion G. Kolaitis},
title = {On preservation under homomorphisms and unions of conjunctive queries},
journal = {J. {ACM}},
volume = {53},
number = {2},
pages = {208--237},
year = {2006},
url = {https://doi.org/10.1145/1131342.1131344},
doi = {10.1145/1131342.1131344},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasDK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BanER06,
author = {Yih{-}En Andrew Ban and
Herbert Edelsbrunner and
Johannes Rudolph},
title = {Interface surfaces for protein-protein complexes},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {361--378},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147957},
doi = {10.1145/1147954.1147957},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BanER06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-AmramP06,
author = {Amir M. Ben{-}Amram and
Holger Petersen},
title = {Backing up in singly linked lists},
journal = {J. {ACM}},
volume = {53},
number = {4},
pages = {681--705},
year = {2006},
url = {https://doi.org/10.1145/1162349.1162353},
doi = {10.1145/1162349.1162353},
timestamp = {Fri, 15 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-AmramP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenediktKLBW06,
author = {Michael Benedikt and
Bart Kuijpers and
Christof L{\"{o}}ding and
Jan Van den Bussche and
Thomas Wilke},
title = {A characterization of first-order topological properties of planar
spatial data},
journal = {J. {ACM}},
volume = {53},
number = {2},
pages = {273--305},
year = {2006},
url = {https://doi.org/10.1145/1131342.1131346},
doi = {10.1145/1131342.1131346},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BenediktKLBW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumSZ06,
author = {Avrim Blum and
Tuomas Sandholm and
Martin Zinkevich},
title = {Online algorithms for market clearing},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {845--879},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183913},
doi = {10.1145/1183907.1183913},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlumSZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bulatov06,
author = {Andrei A. Bulatov},
title = {A dichotomy theorem for constraint satisfaction problems on a 3-element
set},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {66--120},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120584},
doi = {10.1145/1120582.1120584},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bulatov06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChorT06,
author = {Benny Chor and
Tamir Tuller},
title = {Finding a maximum likelihood tree is hard},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {722--744},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183909},
doi = {10.1145/1183907.1183909},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChorT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyN06,
author = {Julia Chuzhoy and
Joseph Naor},
title = {New hardness results for congestion minimization and machine scheduling},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {707--721},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183908},
doi = {10.1145/1183907.1183908},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyN06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CsirikJKOSW06,
author = {J{\'{a}}nos Csirik and
David S. Johnson and
Claire Kenyon and
James B. Orlin and
Peter W. Shor and
Richard R. Weber},
title = {On the Sum-of-Squares algorithm for bin packing},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {1--65},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120583},
doi = {10.1145/1120582.1120583},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CsirikJKOSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FariasM06,
author = {Daniela Pucci de Farias and
Nimrod Megiddo},
title = {Combining expert advice in reactive environments},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {762--799},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183911},
doi = {10.1145/1183907.1183911},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FariasM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlajoletSV06,
author = {Philippe Flajolet and
Wojciech Szpankowski and
Brigitte Vall{\'{e}}e},
title = {Hidden word statistics},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {147--183},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120586},
doi = {10.1145/1120582.1120586},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FlajoletSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gabow06,
author = {Harold N. Gabow},
title = {Using expander graphs to find vertex connectivity},
journal = {J. {ACM}},
volume = {53},
number = {5},
pages = {800--844},
year = {2006},
url = {https://doi.org/10.1145/1183907.1183912},
doi = {10.1145/1183907.1183912},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gabow06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GandhiKPS06,
author = {Rajiv Gandhi and
Samir Khuller and
Srinivasan Parthasarathy and
Aravind Srinivasan},
title = {Dependent rounding and its applications to approximation algorithms},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {324--360},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147956},
doi = {10.1145/1147954.1147956},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GandhiKPS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldreichS06,
author = {Oded Goldreich and
Madhu Sudan},
title = {Locally testable codes and PCPs of almost-linear length},
journal = {J. {ACM}},
volume = {53},
number = {4},
pages = {558--655},
year = {2006},
url = {https://doi.org/10.1145/1162349.1162351},
doi = {10.1145/1162349.1162351},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GoldreichS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobKS06,
author = {Georg Gottlob and
Christoph Koch and
Klaus U. Schulz},
title = {Conjunctive queries over trees},
journal = {J. {ACM}},
volume = {53},
number = {2},
pages = {238--272},
year = {2006},
url = {https://doi.org/10.1145/1131342.1131345},
doi = {10.1145/1131342.1131345},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobKS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Indyk06,
author = {Piotr Indyk},
title = {Stable distributions, pseudorandom generators, embeddings, and data
stream computation},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {307--323},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147955},
doi = {10.1145/1147954.1147955},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Indyk06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarkkainenSB06,
author = {Juha K{\"{a}}rkk{\"{a}}inen and
Peter Sanders and
Stefan Burkhardt},
title = {Linear work suffix array construction},
journal = {J. {ACM}},
volume = {53},
number = {6},
pages = {918--936},
year = {2006},
url = {https://doi.org/10.1145/1217856.1217858},
doi = {10.1145/1217856.1217858},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KarkkainenSB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LindellLR06,
author = {Yehuda Lindell and
Anna Lysyanskaya and
Tal Rabin},
title = {On the composition of authenticated Byzantine Agreement},
journal = {J. {ACM}},
volume = {53},
number = {6},
pages = {881--917},
year = {2006},
url = {https://doi.org/10.1145/1217856.1217857},
doi = {10.1145/1217856.1217857},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LindellLR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NayakS06,
author = {Ashwin Nayak and
Julia Salzman},
title = {Limits on the ability of quantum states to convey classical messages},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {184--206},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120587},
doi = {10.1145/1120582.1120587},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/NayakS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NederhofS06,
author = {Mark{-}Jan Nederhof and
Giorgio Satta},
title = {Probabilistic parsing strategies},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {406--436},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147959},
doi = {10.1145/1147954.1147959},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NederhofS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NieuwenhuisOT06,
author = {Robert Nieuwenhuis and
Albert Oliveras and
Cesare Tinelli},
title = {Solving {SAT} and {SAT} Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland
procedure to DPLL(\emph{T})},
journal = {J. {ACM}},
volume = {53},
number = {6},
pages = {937--977},
year = {2006},
url = {https://doi.org/10.1145/1217856.1217859},
doi = {10.1145/1217856.1217859},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/NieuwenhuisOT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Pitts06,
author = {Andrew M. Pitts},
title = {Alpha-structural recursion and induction},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {459--506},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147961},
doi = {10.1145/1147954.1147961},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Pitts06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ScharbrodtSS06,
author = {Mark Scharbrodt and
Thomas Schickinger and
Angelika Steger},
title = {A new average case analysis for completion time scheduling},
journal = {J. {ACM}},
volume = {53},
number = {1},
pages = {121--146},
year = {2006},
url = {https://doi.org/10.1145/1120582.1120585},
doi = {10.1145/1120582.1120585},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ScharbrodtSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ShalevS06,
author = {Ori Shalev and
Nir Shavit},
title = {Split-ordered lists: Lock-free extensible hash tables},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {379--405},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147958},
doi = {10.1145/1147954.1147958},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ShalevS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ShmoysS06,
author = {David B. Shmoys and
Chaitanya Swamy},
title = {An approximation scheme for stochastic linear programming and its
application to stochastic integer programs},
journal = {J. {ACM}},
volume = {53},
number = {6},
pages = {978--1012},
year = {2006},
url = {https://doi.org/10.1145/1217856.1217860},
doi = {10.1145/1217856.1217860},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ShmoysS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SittersS06,
author = {Ren{\'{e}} A. Sitters and
Leen Stougie},
title = {The generalized two-server problem},
journal = {J. {ACM}},
volume = {53},
number = {3},
pages = {437--458},
year = {2006},
url = {https://doi.org/10.1145/1147954.1147960},
doi = {10.1145/1147954.1147960},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SittersS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SuciuV06,
author = {Dan Suciu and
Victor Vianu},
title = {Introduction},
journal = {J. {ACM}},
volume = {53},
number = {2},
pages = {207},
year = {2006},
url = {https://doi.org/10.1145/1131342.1131343},
doi = {10.1145/1131342.1131343},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SuciuV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VitterH06,
author = {Jeffrey Scott Vitter and
David A. Hutchinson},
title = {Distribution sort with randomized cycling},
journal = {J. {ACM}},
volume = {53},
number = {4},
pages = {656--680},
year = {2006},
url = {https://doi.org/10.1145/1162349.1162352},
doi = {10.1145/1162349.1162352},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VitterH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/XuB06,
author = {Jinbo Xu and
Bonnie Berger},
title = {Fast and accurate algorithms for protein side-chain packing},
journal = {J. {ACM}},
volume = {53},
number = {4},
pages = {533--557},
year = {2006},
url = {https://doi.org/10.1145/1162349.1162350},
doi = {10.1145/1162349.1162350},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/XuB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbadiB05,
author = {Mart{\'{\i}}n Abadi and
Bruno Blanchet},
title = {Analyzing security protocols with secrecy types and logic programs},
journal = {J. {ACM}},
volume = {52},
number = {1},
pages = {102--146},
year = {2005},
url = {https://doi.org/10.1145/1044731.1044735},
doi = {10.1145/1044731.1044735},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbadiB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Adler05,
author = {Micah Adler},
title = {Trade-offs in probabilistic packet marking for {IP} traceback},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {217--244},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059517},
doi = {10.1145/1059513.1059517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Adler05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AharonovR05,
author = {Dorit Aharonov and
Oded Regev},
title = {Lattice problems in {NP} cap coNP},
journal = {J. {ACM}},
volume = {52},
number = {5},
pages = {749--765},
year = {2005},
url = {https://doi.org/10.1145/1089023.1089025},
doi = {10.1145/1089023.1089025},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AharonovR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AilonC05,
author = {Nir Ailon and
Bernard Chazelle},
title = {Lower bounds for linear degeneracy testing},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {157--171},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059515},
doi = {10.1145/1059513.1059515},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AilonC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AleksandrovMS05,
author = {Lyudmil Aleksandrov and
Anil Maheshwari and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Determining approximate shortest paths on weighted polyhedral surfaces},
journal = {J. {ACM}},
volume = {52},
number = {1},
pages = {25--53},
year = {2005},
url = {https://doi.org/10.1145/1044731.1044733},
doi = {10.1145/1044731.1044733},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AleksandrovMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndrewsFGZ05,
author = {Matthew Andrews and
Antonio Fern{\'{a}}ndez and
Ashish Goel and
Lisa Zhang},
title = {Source routing and scheduling in packet networks},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {582--601},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082040},
doi = {10.1145/1082036.1082040},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndrewsFGZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndrewsZ05,
author = {Matthew Andrews and
Lisa Zhang},
title = {Scheduling over a time-varying user-dependent channel with applications
to high-speed wireless data},
journal = {J. {ACM}},
volume = {52},
number = {5},
pages = {809--834},
year = {2005},
url = {https://doi.org/10.1145/1089023.1089028},
doi = {10.1145/1089023.1089028},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndrewsZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArenasL05,
author = {Marcelo Arenas and
Leonid Libkin},
title = {An information-theoretic approach to normal forms for relational and
{XML} data},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {246--283},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059519},
doi = {10.1145/1059513.1059519},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ArenasL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BanerjeeN05,
author = {Anindya Banerjee and
David A. Naumann},
title = {Ownership confinement ensures representation independence for object-oriented
programs},
journal = {J. {ACM}},
volume = {52},
number = {6},
pages = {894--960},
year = {2005},
url = {https://doi.org/10.1145/1101821.1101824},
doi = {10.1145/1101821.1101824},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BanerjeeN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Boyland05,
author = {John Tang Boyland},
title = {Remote attribute grammars},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {627--687},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082042},
doi = {10.1145/1082036.1082042},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Boyland05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrinkmanC05,
author = {Bo Brinkman and
Moses Charikar},
title = {On the impossibility of dimension reduction in l\({}_{\mbox{1}}\)},
journal = {J. {ACM}},
volume = {52},
number = {5},
pages = {766--788},
year = {2005},
url = {https://doi.org/10.1145/1089023.1089026},
doi = {10.1145/1089023.1089026},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BrinkmanC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChuzhoyGHKKKN05,
author = {Julia Chuzhoy and
Sudipto Guha and
Eran Halperin and
Sanjeev Khanna and
Guy Kortsarz and
Robert Krauthgamer and
Joseph Naor},
title = {Asymmetric \emph{k}-center is log\({}^{\mbox{*}}\) \emph{n}-hard to
approximate},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {538--551},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082038},
doi = {10.1145/1082036.1082038},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChuzhoyGHKKKN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DemaineFHT05,
author = {Erik D. Demaine and
Fedor V. Fomin and
Mohammad Taghi Hajiaghayi and
Dimitrios M. Thilikos},
title = {Subexponential parameterized algorithms on bounded-genus graphs and
\emph{H}-minor-free graphs},
journal = {J. {ACM}},
volume = {52},
number = {6},
pages = {866--893},
year = {2005},
url = {https://doi.org/10.1145/1101821.1101823},
doi = {10.1145/1101821.1101823},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DemaineFHT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DemetrescuI05,
author = {Camil Demetrescu and
Giuseppe F. Italiano},
title = {Trade-offs for fully dynamic transitive closure on DAGs: breaking
through the O(n\({}^{\mbox{2}}\) barrier},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {147--156},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059514},
doi = {10.1145/1059513.1059514},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DemetrescuI05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DetlefsNS05,
author = {David Detlefs and
Greg Nelson and
James B. Saxe},
title = {Simplify: a theorem prover for program checking},
journal = {J. {ACM}},
volume = {52},
number = {3},
pages = {365--473},
year = {2005},
url = {https://doi.org/10.1145/1066100.1066102},
doi = {10.1145/1066100.1066102},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DetlefsNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerraginaGMS05,
author = {Paolo Ferragina and
Raffaele Giancarlo and
Giovanni Manzini and
Marinella Sciortino},
title = {Boosting textual compression in optimal linear time},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {688--713},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082043},
doi = {10.1145/1082036.1082043},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FerraginaGMS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerraginaM05,
author = {Paolo Ferragina and
Giovanni Manzini},
title = {Indexing compressed text},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {552--581},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082039},
doi = {10.1145/1082036.1082039},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FerraginaM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FortnowLMV05,
author = {Lance Fortnow and
Richard J. Lipton and
Dieter van Melkebeek and
Anastasios Viglas},
title = {Time-space lower bounds for satisfiability},
journal = {J. {ACM}},
volume = {52},
number = {6},
pages = {835--865},
year = {2005},
url = {https://doi.org/10.1145/1101821.1101822},
doi = {10.1145/1101821.1101822},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FortnowLMV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FranceschiniG05,
author = {Gianni Franceschini and
Viliam Geffert},
title = {An in-place sorting with \emph{O}(\emph{n}log \emph{n}) comparisons
and \emph{O}(\emph{n}) moves},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {515--537},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082037},
doi = {10.1145/1082036.1082037},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FranceschiniG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobKPS05,
author = {Georg Gottlob and
Christoph Koch and
Reinhard Pichler and
Luc Segoufin},
title = {The complexity of XPath query evaluation and {XML} typing},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {284--335},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059520},
doi = {10.1145/1059513.1059520},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobKPS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaplanLSS05,
author = {Haim Kaplan and
Moshe Lewenstein and
Nira Shafrir and
Maxim Sviridenko},
title = {Approximation algorithms for asymmetric {TSP} by decomposing directed
regular multigraphs},
journal = {J. {ACM}},
volume = {52},
number = {4},
pages = {602--626},
year = {2005},
url = {https://doi.org/10.1145/1082036.1082041},
doi = {10.1145/1082036.1082041},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaplanLSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Khot05,
author = {Subhash Khot},
title = {Hardness of approximating the shortest vector problem in lattices},
journal = {J. {ACM}},
volume = {52},
number = {5},
pages = {789--808},
year = {2005},
url = {https://doi.org/10.1145/1089023.1089027},
doi = {10.1145/1089023.1089027},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Khot05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KorfZTH05,
author = {Richard E. Korf and
Weixiong Zhang and
Ignacio Thayer and
Heath Hohwald},
title = {Frontier search},
journal = {J. {ACM}},
volume = {52},
number = {5},
pages = {715--748},
year = {2005},
url = {https://doi.org/10.1145/1089023.1089024},
doi = {10.1145/1089023.1089024},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KorfZTH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LiMW05,
author = {Ninghui Li and
John C. Mitchell and
William H. Winsborough},
title = {Beyond proof-of-compliance: security analysis in trust management},
journal = {J. {ACM}},
volume = {52},
number = {3},
pages = {474--514},
year = {2005},
url = {https://doi.org/10.1145/1066100.1066103},
doi = {10.1145/1066100.1066103},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LiMW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MerroN05,
author = {Massimo Merro and
Francesco Zappa Nardelli},
title = {Behavioral theory for mobile ambients},
journal = {J. {ACM}},
volume = {52},
number = {6},
pages = {961--1023},
year = {2005},
url = {https://doi.org/10.1145/1101821.1101825},
doi = {10.1145/1101821.1101825},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MerroN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MiloV05,
author = {Tova Milo and
Victor Vianu},
title = {Introduction},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {245},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059518},
doi = {10.1145/1059513.1059518},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MiloV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PaturiPSZ05,
author = {Ramamohan Paturi and
Pavel Pudl{\'{a}}k and
Michael E. Saks and
Francis Zane},
title = {An improved exponential-time algorithm for \emph{k}-SAT},
journal = {J. {ACM}},
volume = {52},
number = {3},
pages = {337--364},
year = {2005},
url = {https://doi.org/10.1145/1066100.1066101},
doi = {10.1145/1066100.1066101},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/PaturiPSZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RossSG05,
author = {Robert B. Ross and
V. S. Subrahmanian and
John Grant},
title = {Aggregate operators in probabilistic databases},
journal = {J. {ACM}},
volume = {52},
number = {1},
pages = {54--101},
year = {2005},
url = {https://doi.org/10.1145/1044731.1044734},
doi = {10.1145/1044731.1044734},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RossSG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ShaltielU05,
author = {Ronen Shaltiel and
Christopher Umans},
title = {Simple extractors for all min-entropies and a new pseudorandom generator},
journal = {J. {ACM}},
volume = {52},
number = {2},
pages = {172--216},
year = {2005},
url = {https://doi.org/10.1145/1059513.1059516},
doi = {10.1145/1059513.1059516},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ShaltielU05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ThorupZ05,
author = {Mikkel Thorup and
Uri Zwick},
title = {Approximate distance oracles},
journal = {J. {ACM}},
volume = {52},
number = {1},
pages = {1--24},
year = {2005},
url = {https://doi.org/10.1145/1044731.1044732},
doi = {10.1145/1044731.1044732},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ThorupZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AaronsonS04,
author = {Scott Aaronson and
Yaoyun Shi},
title = {Quantum lower bounds for the collision and the element distinctness
problems},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {595--605},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008735},
doi = {10.1145/1008731.1008735},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AaronsonS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgarwalHV04,
author = {Pankaj K. Agarwal and
Sariel Har{-}Peled and
Kasturi R. Varadarajan},
title = {Approximating extent measures of points},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {606--635},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008736},
doi = {10.1145/1008731.1008736},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AgarwalHV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgarwalNPPSS04,
author = {Pankaj K. Agarwal and
Eran Nevo and
J{\'{a}}nos Pach and
Rom Pinchasi and
Micha Sharir and
Shakhar Smorodinsky},
title = {Lenses in arrangements of pseudo-circles and their applications},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {139--186},
year = {2004},
url = {https://doi.org/10.1145/972639.972641},
doi = {10.1145/972639.972641},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AgarwalNPPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlberFN04,
author = {Jochen Alber and
Michael R. Fellows and
Rolf Niedermeier},
title = {Polynomial-time data reduction for dominating set},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {363--384},
year = {2004},
url = {https://doi.org/10.1145/990308.990309},
doi = {10.1145/990308.990309},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlberFN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Atserias04,
author = {Albert Atserias},
title = {On sufficient conditions for unsatisfiability of random formulas},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {281--311},
year = {2004},
url = {https://doi.org/10.1145/972639.972645},
doi = {10.1145/972639.972645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Atserias04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BecchettiL04,
author = {Luca Becchetti and
Stefano Leonardi},
title = {Nonclairvoyant scheduling to minimize the total flow time on single
and parallel machines},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {517--539},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008732},
doi = {10.1145/1008731.1008732},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BecchettiL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BertsimasV04,
author = {Dimitris Bertsimas and
Santosh S. Vempala},
title = {Solving convex programs by random walks},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {540--556},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008733},
doi = {10.1145/1008731.1008733},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BertsimasV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BurgisserL04,
author = {Peter B{\"{u}}rgisser and
Martin Lotz},
title = {Lower bounds on the bounded coefficient complexity of bilinear maps},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {464--482},
year = {2004},
url = {https://doi.org/10.1145/990308.990311},
doi = {10.1145/990308.990311},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BurgisserL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CanettiGH04,
author = {Ran Canetti and
Oded Goldreich and
Shai Halevi},
title = {The random oracle methodology, revisited},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {557--594},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008734},
doi = {10.1145/1008731.1008734},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CanettiGH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenC04,
author = {Chung{-}Min Chen and
Christine T. Cheng},
title = {From discrepancy to declustering: Near-optimal multidimensional declustering
strategies for range queries},
journal = {J. {ACM}},
volume = {51},
number = {1},
pages = {46--73},
year = {2004},
url = {https://doi.org/10.1145/962446.962449},
doi = {10.1145/962446.962449},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CrescenziM04,
author = {Valter Crescenzi and
Giansalvatore Mecca},
title = {Automatic information extraction from large websites},
journal = {J. {ACM}},
volume = {51},
number = {5},
pages = {731--779},
year = {2004},
url = {https://doi.org/10.1145/1017460.1017462},
doi = {10.1145/1017460.1017462},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CrescenziM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DemetrescuI04,
author = {Camil Demetrescu and
Giuseppe F. Italiano},
title = {A new approach to dynamic all pairs shortest paths},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {968--992},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039492},
doi = {10.1145/1039488.1039492},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DemetrescuI04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DolevW04,
author = {Shlomi Dolev and
Jennifer L. Welch},
title = {Self-stabilizing clock synchronization in the presence of Byzantine
faults},
journal = {J. {ACM}},
volume = {51},
number = {5},
pages = {780--799},
year = {2004},
url = {https://doi.org/10.1145/1017460.1017463},
doi = {10.1145/1017460.1017463},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DolevW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DworkNS04,
author = {Cynthia Dwork and
Moni Naor and
Amit Sahai},
title = {Concurrent zero-knowledge},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {851--898},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039489},
doi = {10.1145/1039488.1039489},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DworkNS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FriezeKV04,
author = {Alan M. Frieze and
Ravi Kannan and
Santosh S. Vempala},
title = {Fast monte-carlo algorithms for finding low-rank approximations},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {1025--1041},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039494},
doi = {10.1145/1039488.1039494},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FriezeKV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobK04,
author = {Georg Gottlob and
Christoph Koch},
title = {Monadic datalog and the expressive power of languages for Web information
extraction},
journal = {J. {ACM}},
volume = {51},
number = {1},
pages = {74--113},
year = {2004},
url = {https://doi.org/10.1145/962446.962450},
doi = {10.1145/962446.962450},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobKS04,
author = {Georg Gottlob and
Phokion G. Kolaitis and
Thomas Schwentick},
title = {Existential second-order logic over graphs: Charting the tractability
frontier},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {312--362},
year = {2004},
url = {https://doi.org/10.1145/972639.972646},
doi = {10.1145/972639.972646},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobKS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HastadN04,
author = {Johan H{\aa}stad and
Mats N{\"{a}}slund},
title = {The security of all {RSA} and discrete log bits},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {187--230},
year = {2004},
url = {https://doi.org/10.1145/972639.972642},
doi = {10.1145/972639.972642},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HastadN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HochsteinW04,
author = {Jan M. Hochstein and
Karsten Weihe},
title = {Edge-disjoint routing in plane switch graphs in linear time},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {636--670},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008737},
doi = {10.1145/1008731.1008737},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HochsteinW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JerrumSV04,
author = {Mark Jerrum and
Alistair Sinclair and
Eric Vigoda},
title = {A polynomial-time approximation algorithm for the permanent of a matrix
with nonnegative entries},
journal = {J. {ACM}},
volume = {51},
number = {4},
pages = {671--697},
year = {2004},
url = {https://doi.org/10.1145/1008731.1008738},
doi = {10.1145/1008731.1008738},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JerrumSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KannanVV04,
author = {Ravi Kannan and
Santosh S. Vempala and
Adrian Vetta},
title = {On clusterings: Good, bad and spectral},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {497--515},
year = {2004},
url = {https://doi.org/10.1145/990308.990313},
doi = {10.1145/990308.990313},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KannanVV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KempeKD04,
author = {David Kempe and
Jon M. Kleinberg and
Alan J. Demers},
title = {Spatial gossip and resource location protocols},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {943--967},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039491},
doi = {10.1145/1039488.1039491},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KempeKD04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KleinbergPR04,
author = {Jon M. Kleinberg and
Christos H. Papadimitriou and
Prabhakar Raghavan},
title = {Segmentation problems},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {263--280},
year = {2004},
url = {https://doi.org/10.1145/972639.972644},
doi = {10.1145/972639.972644},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KleinbergPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KolaitisV04,
author = {Phokion G. Kolaitis and
Victor Vianu},
title = {Foreword},
journal = {J. {ACM}},
volume = {51},
number = {1},
pages = {1},
year = {2004},
url = {https://doi.org/10.1145/962446.962447},
doi = {10.1145/962446.962447},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KolaitisV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Koltun04,
author = {Vladlen Koltun},
title = {Almost tight upper bounds for vertical decompositions in four dimensions},
journal = {J. {ACM}},
volume = {51},
number = {5},
pages = {699--730},
year = {2004},
url = {https://doi.org/10.1145/1017460.1017461},
doi = {10.1145/1017460.1017461},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Koltun04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MiklauS04,
author = {Gerome Miklau and
Dan Suciu},
title = {Containment and equivalence for a fragment of XPath},
journal = {J. {ACM}},
volume = {51},
number = {1},
pages = {2--45},
year = {2004},
url = {https://doi.org/10.1145/962446.962448},
doi = {10.1145/962446.962448},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MiklauS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NaorR04,
author = {Moni Naor and
Omer Reingold},
title = {Number-theoretic constructions of efficient pseudo-random functions},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {231--262},
year = {2004},
url = {https://doi.org/10.1145/972639.972643},
doi = {10.1145/972639.972643},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NaorR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Plandowski04,
author = {Wojciech Plandowski},
title = {Satisfiability of word equations with constants is in {PSPACE}},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {483--496},
year = {2004},
url = {https://doi.org/10.1145/990308.990312},
doi = {10.1145/990308.990312},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Plandowski04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Raz04,
author = {Ran Raz},
title = {Resolution lower bounds for the weak pigeonhole principle},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {115--138},
year = {2004},
url = {https://doi.org/10.1145/972639.972640},
doi = {10.1145/972639.972640},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Raz04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Regev04,
author = {Oded Regev},
title = {New lattice-based cryptographic constructions},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {899--942},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039490},
doi = {10.1145/1039488.1039490},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Regev04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SpielmanT04,
author = {Daniel A. Spielman and
Shang{-}Hua Teng},
title = {Smoothed analysis of algorithms: Why the simplex algorithm usually
takes polynomial time},
journal = {J. {ACM}},
volume = {51},
number = {3},
pages = {385--463},
year = {2004},
url = {https://doi.org/10.1145/990308.990310},
doi = {10.1145/990308.990310},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SpielmanT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SteinkeN04,
author = {Robert C. Steinke and
Gary J. Nutt},
title = {A unified theory of shared memory consistency},
journal = {J. {ACM}},
volume = {51},
number = {5},
pages = {800--849},
year = {2004},
url = {https://doi.org/10.1145/1017460.1017464},
doi = {10.1145/1017460.1017464},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SteinkeN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Thorup04,
author = {Mikkel Thorup},
title = {Compact oracles for reachability and approximate distances in planar
digraphs},
journal = {J. {ACM}},
volume = {51},
number = {6},
pages = {993--1024},
year = {2004},
url = {https://doi.org/10.1145/1039488.1039493},
doi = {10.1145/1039488.1039493},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Thorup04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgrawalB03,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Primality and identity testing via Chinese remaindering},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {429--443},
year = {2003},
url = {https://doi.org/10.1145/792538.792540},
doi = {10.1145/792538.792540},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AgrawalB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Alt03,
author = {Franz L. Alt},
title = {Journal of the {ACM} - the beginnings},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {10--11},
year = {2003},
url = {https://doi.org/10.1145/602382.602386},
doi = {10.1145/602382.602386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Alt03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaF03,
author = {Hagit Attiya and
Arie Fouren},
title = {Algorithms adapting to point contention},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {444--468},
year = {2003},
url = {https://doi.org/10.1145/792538.792541},
doi = {10.1145/792538.792541},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BarvinokFJTWW03,
author = {Alexander I. Barvinok and
S{\'{a}}ndor P. Fekete and
David S. Johnson and
Arie Tamir and
Gerhard J. Woeginger and
Russell Woodroofe},
title = {The geometric maximum traveling salesman problem},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {641--664},
year = {2003},
url = {https://doi.org/10.1145/876638.876640},
doi = {10.1145/876638.876640},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BarvinokFJTWW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BealP03,
author = {Marie{-}Pierre B{\'{e}}al and
Dominique Perrin},
title = {On the generating sequences of regular languages on \emph{k} symbols},
journal = {J. {ACM}},
volume = {50},
number = {6},
pages = {955--980},
year = {2003},
url = {https://doi.org/10.1145/950620.950625},
doi = {10.1145/950620.950625},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BealP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeameSSV03,
author = {Paul Beame and
Michael E. Saks and
Xiaodong Sun and
Erik Vee},
title = {Time-space trade-off lower bounds for randomized computation of decision
problems},
journal = {J. {ACM}},
volume = {50},
number = {2},
pages = {154--195},
year = {2003},
url = {https://doi.org/10.1145/636865.636867},
doi = {10.1145/636865.636867},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeameSSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenediktLSS03,
author = {Michael Benedikt and
Leonid Libkin and
Thomas Schwentick and
Luc Segoufin},
title = {Definable relations and first-order query languages over strings},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {694--751},
year = {2003},
url = {https://doi.org/10.1145/876638.876642},
doi = {10.1145/876638.876642},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenediktLSS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BilardiP03,
author = {Gianfranco Bilardi and
Keshav Pingali},
title = {Algorithms for computing the static single assignment form},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {375--425},
year = {2003},
url = {https://doi.org/10.1145/765568.765573},
doi = {10.1145/765568.765573},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BilardiP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumKW03,
author = {Avrim Blum and
Adam Kalai and
Hal Wasserman},
title = {Noise-tolerant learning, the parity problem, and the statistical query
model},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {506--519},
year = {2003},
url = {https://doi.org/10.1145/792538.792543},
doi = {10.1145/792538.792543},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlumKW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Brooks03,
author = {Frederick P. Brooks Jr.},
title = {Three great challenges for half-century-old computer science},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {25--26},
year = {2003},
url = {https://doi.org/10.1145/602382.602397},
doi = {10.1145/602382.602397},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Brooks03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuchsbaumFG03,
author = {Adam L. Buchsbaum and
Glenn S. Fowler and
Raffaele Giancarlo},
title = {Improving table compression with combinatorial optimization},
journal = {J. {ACM}},
volume = {50},
number = {6},
pages = {825--851},
year = {2003},
url = {https://doi.org/10.1145/950620.950622},
doi = {10.1145/950620.950622},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuchsbaumFG03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ClarkeGJLV03,
author = {Edmund M. Clarke and
Orna Grumberg and
Somesh Jha and
Yuan Lu and
Helmut Veith},
title = {Counterexample-guided abstraction refinement for symbolic model checking},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {752--794},
year = {2003},
url = {https://doi.org/10.1145/876638.876643},
doi = {10.1145/876638.876643},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ClarkeGJLV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Coffman03,
author = {Edward G. Coffman Jr.},
title = {{JACM} 1976-1979},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {16},
year = {2003},
url = {https://doi.org/10.1145/602382.602390},
doi = {10.1145/602382.602390},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Coffman03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cook03,
author = {Stephen A. Cook},
title = {The importance of the {P} versus {NP} question},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {27--29},
year = {2003},
url = {https://doi.org/10.1145/602382.602398},
doi = {10.1145/602382.602398},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cook03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Corbato03,
author = {Fernando J. Corbat{\'{o}}},
title = {On computer system challenges},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {30--31},
year = {2003},
url = {https://doi.org/10.1145/602382.602399},
doi = {10.1145/602382.602399},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Corbato03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Darwiche03,
author = {Adnan Darwiche},
title = {A differential approach to inference in Bayesian networks},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {280--305},
year = {2003},
url = {https://doi.org/10.1145/765568.765570},
doi = {10.1145/765568.765570},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Darwiche03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DechterR03,
author = {Rina Dechter and
Irina Rish},
title = {Mini-buckets: {A} general scheme for bounded inference},
journal = {J. {ACM}},
volume = {50},
number = {2},
pages = {107--153},
year = {2003},
url = {https://doi.org/10.1145/636865.636866},
doi = {10.1145/636865.636866},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DechterR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Drmota03,
author = {Michael Drmota},
title = {An analytic approach to the height of binary search trees {II}},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {333--374},
year = {2003},
url = {https://doi.org/10.1145/765568.765572},
doi = {10.1145/765568.765572},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Drmota03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DworkNRS03,
author = {Cynthia Dwork and
Moni Naor and
Omer Reingold and
Larry J. Stockmeyer},
title = {Magic Functions},
journal = {J. {ACM}},
volume = {50},
number = {6},
pages = {852--921},
year = {2003},
url = {https://doi.org/10.1145/950620.950623},
doi = {10.1145/950620.950623},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DworkNRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Feigenbaum03,
author = {Edward A. Feigenbaum},
title = {Some challenges and grand challenges for computational intelligence},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {32--40},
year = {2003},
url = {https://doi.org/10.1145/602382.602400},
doi = {10.1145/602382.602400},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Feigenbaum03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Fischer03,
author = {Michael J. Fischer},
title = {{JACM} 1983-1986},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {17},
year = {2003},
url = {https://doi.org/10.1145/602382.602391},
doi = {10.1145/602382.602391},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Fischer03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gotlieb03,
author = {C. C. Gotlieb},
title = {A Golden Age for {JACM}},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {14},
year = {2003},
url = {https://doi.org/10.1145/602382.602388},
doi = {10.1145/602382.602388},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gotlieb03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gray03,
author = {Jim Gray},
title = {What next?: {A} dozen information-technology research goals},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {41--57},
year = {2003},
url = {https://doi.org/10.1145/602382.602401},
doi = {10.1145/602382.602401},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gray03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Halpern03,
author = {Joseph Y. Halpern},
title = {JACM's 50th anniversary},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {3--7},
year = {2003},
url = {https://doi.org/10.1145/602382.602383},
doi = {10.1145/602382.602383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Halpern03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hartmanis03,
author = {Juris Hartmanis},
title = {Separation of complexity classes},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {58--62},
year = {2003},
url = {https://doi.org/10.1145/602382.602402},
doi = {10.1145/602382.602402},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hartmanis03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hoare03,
author = {C. A. R. Hoare},
title = {The verifying compiler: {A} grand challenge for computing research},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {63--69},
year = {2003},
url = {https://doi.org/10.1145/602382.602403},
doi = {10.1145/602382.602403},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Hoare03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainMMSV03,
author = {Kamal Jain and
Mohammad Mahdian and
Evangelos Markakis and
Amin Saberi and
Vijay V. Vazirani},
title = {Greedy facility location algorithms analyzed using dual fitting with
factor-revealing {LP}},
journal = {J. {ACM}},
volume = {50},
number = {6},
pages = {795--824},
year = {2003},
url = {https://doi.org/10.1145/950620.950621},
doi = {10.1145/950620.950621},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainMMSV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JayasimhaSMM03,
author = {Doddaballapur Narasimha{-}Murthy Jayasimha and
Loren Schwiebert and
D. Manivannan and
Jeff A. May},
title = {A foundation for designing deadlock-free routing algorithms in wormhole
networks},
journal = {J. {ACM}},
volume = {50},
number = {2},
pages = {250--275},
year = {2003},
url = {https://doi.org/10.1145/636865.636869},
doi = {10.1145/636865.636869},
timestamp = {Sun, 03 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JayasimhaSMM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Juncosa03,
author = {Mario L. Juncosa},
title = {Transitions 1959-1964},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {12--13},
year = {2003},
url = {https://doi.org/10.1145/602382.602387},
doi = {10.1145/602382.602387},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Juncosa03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KalyanasundaramP03,
author = {Bala Kalyanasundaram and
Kirk Pruhs},
title = {Minimizing flow time nonclairvoyantly},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {551--567},
year = {2003},
url = {https://doi.org/10.1145/792538.792545},
doi = {10.1145/792538.792545},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KalyanasundaramP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KrokhinJJ03,
author = {Andrei A. Krokhin and
Peter Jeavons and
Peter Jonsson},
title = {Reasoning about temporal relations: The tractable subalgebras of Allen's
interval algebra},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {591--640},
year = {2003},
url = {https://doi.org/10.1145/876638.876639},
doi = {10.1145/876638.876639},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KrokhinJJ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lampson03,
author = {Butler W. Lampson},
title = {Getting computers to understand},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {70--72},
year = {2003},
url = {https://doi.org/10.1145/602382.602404},
doi = {10.1145/602382.602404},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lampson03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Leighton03,
author = {Frank Thomson Leighton},
title = {{JACM} 1991-1997},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {19},
year = {2003},
url = {https://doi.org/10.1145/602382.602393},
doi = {10.1145/602382.602393},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Leighton03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeonardiMNM03,
author = {Emilio Leonardi and
Marco Mellia and
Fabio Neri and
Marco Ajmone Marsan},
title = {Bounds on delays and queue lengths in input-queued cell switches},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {520--550},
year = {2003},
url = {https://doi.org/10.1145/792538.792544},
doi = {10.1145/792538.792544},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeonardiMNM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mandelbaum03,
author = {Mark Mandelbaum},
title = {A report from Headquarters},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {21--23},
year = {2003},
url = {https://doi.org/10.1145/602382.602395},
doi = {10.1145/602382.602395},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mandelbaum03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/McCarthy03,
author = {John McCarthy},
title = {Problems and projections in {CS} for the next 49 year},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {73--79},
year = {2003},
url = {https://doi.org/10.1145/602382.602405},
doi = {10.1145/602382.602405},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/McCarthy03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Miller03,
author = {Raymond E. Miller},
title = {{JACM} 1973-1975},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {15},
year = {2003},
url = {https://doi.org/10.1145/602382.602389},
doi = {10.1145/602382.602389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Miller03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MostefaouiRR03,
author = {Achour Most{\'{e}}faoui and
Sergio Rajsbaum and
Michel Raynal},
title = {Conditions on input vectors for consensus solvability in asynchronous
distributed systems},
journal = {J. {ACM}},
volume = {50},
number = {6},
pages = {922--954},
year = {2003},
url = {https://doi.org/10.1145/950620.950624},
doi = {10.1145/950620.950624},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MostefaouiRR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Raghavan03,
author = {Prabhakar Raghavan},
title = {Editorial: Preserving excellence through change},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {427--428},
year = {2003},
url = {https://doi.org/10.1145/792538.792539},
doi = {10.1145/792538.792539},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Raghavan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Razborov03,
author = {Alexander A. Razborov},
title = {Propositional proof complexity},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {80--82},
year = {2003},
url = {https://doi.org/10.1145/602382.602406},
doi = {10.1145/602382.602406},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Razborov03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reddy03,
author = {Raj Reddy},
title = {Three open problems in {AI}},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {83--86},
year = {2003},
url = {https://doi.org/10.1145/602382.602407},
doi = {10.1145/602382.602407},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reddy03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reed03,
author = {Bruce A. Reed},
title = {The height of a random binary search tree},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {306--332},
year = {2003},
url = {https://doi.org/10.1145/765568.765571},
doi = {10.1145/765568.765571},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reed03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rosenkrantz03,
author = {Daniel J. Rosenkrantz},
title = {{JACM} 1986-1990},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {18},
year = {2003},
url = {https://doi.org/10.1145/602382.602392},
doi = {10.1145/602382.602392},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rosenkrantz03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SahaiV03,
author = {Amit Sahai and
Salil P. Vadhan},
title = {A complete problem for statistical zero knowledge},
journal = {J. {ACM}},
volume = {50},
number = {2},
pages = {196--249},
year = {2003},
url = {https://doi.org/10.1145/636865.636868},
doi = {10.1145/636865.636868},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SahaiV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Shor03,
author = {Peter W. Shor},
title = {Why haven't more quantum algorithms been found?},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {87--90},
year = {2003},
url = {https://doi.org/10.1145/602382.602408},
doi = {10.1145/602382.602408},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Shor03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Stearns03,
author = {Richard Edwin Stearns},
title = {Deterministic versus nondeterministic time and lower bound problems},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {91--95},
year = {2003},
url = {https://doi.org/10.1145/602382.602409},
doi = {10.1145/602382.602409},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Stearns03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Valiant03,
author = {Leslie G. Valiant},
title = {Three problems in computer science},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {96--99},
year = {2003},
url = {https://doi.org/10.1145/602382.602410},
doi = {10.1145/602382.602410},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Valiant03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vocking03,
author = {Berthold V{\"{o}}cking},
title = {How asymmetry helps load balancing},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {568--589},
year = {2003},
url = {https://doi.org/10.1145/792538.792546},
doi = {10.1145/792538.792546},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vocking03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WuR03,
author = {Wei Biao Wu and
Chinya V. Ravishankar},
title = {The performance of difference coding for sets and relational tables},
journal = {J. {ACM}},
volume = {50},
number = {5},
pages = {665--693},
year = {2003},
url = {https://doi.org/10.1145/876638.876641},
doi = {10.1145/876638.876641},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WuR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/X03a,
title = {{JACM} editors-in-chief},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {9},
year = {2003},
url = {https://doi.org/10.1145/602382.602385},
doi = {10.1145/602382.602385},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/X03a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yao03,
author = {Andrew Chi{-}Chih Yao},
title = {Classical physics and the Church-Turing Thesis},
journal = {J. {ACM}},
volume = {50},
number = {1},
pages = {100--105},
year = {2003},
url = {https://doi.org/10.1145/602382.602411},
doi = {10.1145/602382.602411},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yao03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZhangY03,
author = {Yuanlin Zhang and
Roland H. C. Yap},
title = {Erratum: P. van Beek and R. Dechter's theorem on constraint looseness
and local consistency},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {277--279},
year = {2003},
url = {https://doi.org/10.1145/765568.765569},
doi = {10.1145/765568.765569},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ZhangY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZhongW03,
author = {Ning Zhong and
Klaus Weihrauch},
title = {Computatbility theory of generalized functions},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {469--505},
year = {2003},
url = {https://doi.org/10.1145/792538.792542},
doi = {10.1145/792538.792542},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ZhongW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AjtaiBFLS02,
author = {Mikl{\'{o}}s Ajtai and
Randal C. Burns and
Ronald Fagin and
Darrell D. E. Long and
Larry J. Stockmeyer},
title = {Compactly encoding unstructured inputs with differential compression},
journal = {J. {ACM}},
volume = {49},
number = {3},
pages = {318--367},
year = {2002},
url = {https://doi.org/10.1145/567112.567116},
doi = {10.1145/567112.567116},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AjtaiBFLS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlurHK02,
author = {Rajeev Alur and
Thomas A. Henzinger and
Orna Kupferman},
title = {Alternating-time temporal logic},
journal = {J. {ACM}},
volume = {49},
number = {5},
pages = {672--713},
year = {2002},
url = {https://doi.org/10.1145/585265.585270},
doi = {10.1145/585265.585270},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AlurHK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AmbainisNTV02,
author = {Andris Ambainis and
Ashwin Nayak and
Amnon Ta{-}Shma and
Umesh V. Vazirani},
title = {Dense quantum coding and quantum finite automata},
journal = {J. {ACM}},
volume = {49},
number = {4},
pages = {496--511},
year = {2002},
url = {https://doi.org/10.1145/581771.581773},
doi = {10.1145/581771.581773},
timestamp = {Mon, 18 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AmbainisNTV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AsarinCM02,
author = {Eugene Asarin and
Paul Caspi and
Oded Maler},
title = {Timed regular expressions},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {172--206},
year = {2002},
url = {https://doi.org/10.1145/506147.506151},
doi = {10.1145/506147.506151},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AsarinCM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BhargavanOG02,
author = {Karthikeyan Bhargavan and
Davor Obradovic and
Carl A. Gunter},
title = {Formal verification of standards for distance vector routing protocols},
journal = {J. {ACM}},
volume = {49},
number = {4},
pages = {538--576},
year = {2002},
url = {https://doi.org/10.1145/581771.581775},
doi = {10.1145/581771.581775},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BhargavanOG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Caplain02,
author = {Gilbert Caplain},
title = {Correctness properties in a shared-memory parallel language},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {785--827},
year = {2002},
url = {https://doi.org/10.1145/602220.602224},
doi = {10.1145/602220.602224},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Caplain02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenGP02,
author = {Zhi{-}Zhong Chen and
Michelangelo Grigni and
Christos H. Papadimitriou},
title = {Map graphs},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {127--138},
year = {2002},
url = {https://doi.org/10.1145/506147.506148},
doi = {10.1145/506147.506148},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChenGP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DuboisFPP02,
author = {Didier Dubois and
H{\'{e}}l{\`{e}}ne Fargier and
Henri Prade and
Patrice Perny},
title = {Qualitative decision theory: from savage's axioms to nonmonotonic
reasoning},
journal = {J. {ACM}},
volume = {49},
number = {4},
pages = {455--495},
year = {2002},
url = {https://doi.org/10.1145/581771.581772},
doi = {10.1145/581771.581772},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DuboisFPP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FanL02,
author = {Wenfei Fan and
Leonid Libkin},
title = {On {XML} integrity constraints in the presence of DTDs},
journal = {J. {ACM}},
volume = {49},
number = {3},
pages = {368--406},
year = {2002},
url = {https://doi.org/10.1145/567112.567117},
doi = {10.1145/567112.567117},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FanL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FlumFG02,
author = {J{\"{o}}rg Flum and
Markus Frick and
Martin Grohe},
title = {Query evaluation via tree-decompositions},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {716--752},
year = {2002},
url = {https://doi.org/10.1145/602220.602222},
doi = {10.1145/602220.602222},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FlumFG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FrumkinW02,
author = {Michael A. Frumkin and
Rob F. Van der Wijngaart},
title = {Tight bounds on cache use for stencil operations on rectangular grids},
journal = {J. {ACM}},
volume = {49},
number = {3},
pages = {434--453},
year = {2002},
url = {https://doi.org/10.1145/567112.567115},
doi = {10.1145/567112.567115},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FrumkinW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HaldarV02,
author = {Sibsankar Haldar and
Paul M. B. Vit{\'{a}}nyi},
title = {Bounded concurrent timestamp systems using vector clocks},
journal = {J. {ACM}},
volume = {49},
number = {1},
pages = {101--126},
year = {2002},
url = {https://doi.org/10.1145/505241.505246},
doi = {10.1145/505241.505246},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HaldarV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Halpern02,
author = {Joseph Y. Halpern},
title = {Update: Time to publication statistics},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {715},
year = {2002},
url = {https://doi.org/10.1145/602220.602221},
doi = {10.1145/602220.602221},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Halpern02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Harchol-Balter02,
author = {Mor Harchol{-}Balter},
title = {Task assignment with unknown duration},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {260--288},
year = {2002},
url = {https://doi.org/10.1145/506147.506154},
doi = {10.1145/506147.506154},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Harchol-Balter02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HellersteinKMPS02,
author = {Joseph M. Hellerstein and
Elias Koutsoupias and
Daniel P. Miranker and
Christos H. Papadimitriou and
Vasilis Samoladas},
title = {On a model of indexability and its bounds for range queries},
journal = {J. {ACM}},
volume = {49},
number = {1},
pages = {35--55},
year = {2002},
url = {https://doi.org/10.1145/505241.505244},
doi = {10.1145/505241.505244},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HellersteinKMPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HusonRM02,
author = {Daniel H. Huson and
Knut Reinert and
Eugene W. Myers},
title = {The greedy path-merging algorithm for contig scaffolding},
journal = {J. {ACM}},
volume = {49},
number = {5},
pages = {603--615},
year = {2002},
url = {https://doi.org/10.1145/585265.585267},
doi = {10.1145/585265.585267},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/HusonRM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KamedaP02,
author = {Hisao Kameda and
Odile Pourtallier},
title = {Paradoxes in distributed decisions on optimal load balancing for networks
of homogeneous computers},
journal = {J. {ACM}},
volume = {49},
number = {3},
pages = {407--433},
year = {2002},
url = {https://doi.org/10.1145/567112.567113},
doi = {10.1145/567112.567113},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KamedaP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KleinbergT02,
author = {Jon M. Kleinberg and
{\'{E}}va Tardos},
title = {Approximation algorithms for classification problems with pairwise
relationships: metric labeling and Markov random fields},
journal = {J. {ACM}},
volume = {49},
number = {5},
pages = {616--639},
year = {2002},
url = {https://doi.org/10.1145/585265.585268},
doi = {10.1145/585265.585268},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KleinbergT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lee02,
author = {Lillian Lee},
title = {Fast context-free grammar parsing requires fast boolean matrix multiplication},
journal = {J. {ACM}},
volume = {49},
number = {1},
pages = {1--15},
year = {2002},
url = {https://doi.org/10.1145/505241.505242},
doi = {10.1145/505241.505242},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lee02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LehmannOS02,
author = {Daniel Lehmann and
Liadan O'Callaghan and
Yoav Shoham},
title = {Truth revelation in approximately efficient combinatorial auctions},
journal = {J. {ACM}},
volume = {49},
number = {5},
pages = {577--602},
year = {2002},
url = {https://doi.org/10.1145/585265.585266},
doi = {10.1145/585265.585266},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LehmannOS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LiMW02,
author = {Ming Li and
Bin Ma and
Lusheng Wang},
title = {On the closest string and substring problems},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {157--171},
year = {2002},
url = {https://doi.org/10.1145/506147.506150},
doi = {10.1145/506147.506150},
timestamp = {Mon, 13 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LiMW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LowPW02,
author = {Steven H. Low and
Larry L. Peterson and
Limin Wang},
title = {Understanding {TCP} Vegas: a duality model},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {207--235},
year = {2002},
url = {https://doi.org/10.1145/506147.506152},
doi = {10.1145/506147.506152},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LowPW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/McAllester02,
author = {David A. McAllester},
title = {On the complexity analysis of static analyses},
journal = {J. {ACM}},
volume = {49},
number = {4},
pages = {512--537},
year = {2002},
url = {https://doi.org/10.1145/581771.581774},
doi = {10.1145/581771.581774},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/McAllester02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NevenB02,
author = {Frank Neven and
Jan Van den Bussche},
title = {Expressiveness of structured document query languages based on attribute
grammars},
journal = {J. {ACM}},
volume = {49},
number = {1},
pages = {56--100},
year = {2002},
url = {https://doi.org/10.1145/505241.505245},
doi = {10.1145/505241.505245},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/NevenB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OstrovskyR02,
author = {Rafail Ostrovsky and
Yuval Rabani},
title = {Polynomial-time approximation schemes for geometric min-sum median
clustering},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {139--156},
year = {2002},
url = {https://doi.org/10.1145/506147.506149},
doi = {10.1145/506147.506149},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OstrovskyR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PettieR02,
author = {Seth Pettie and
Vijaya Ramachandran},
title = {An optimal minimum spanning tree algorithm},
journal = {J. {ACM}},
volume = {49},
number = {1},
pages = {16--34},
year = {2002},
url = {https://doi.org/10.1145/505241.505243},
doi = {10.1145/505241.505243},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PettieR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RoughgardenT02,
author = {Tim Roughgarden and
{\'{E}}va Tardos},
title = {How bad is selfish routing?},
journal = {J. {ACM}},
volume = {49},
number = {2},
pages = {236--259},
year = {2002},
url = {https://doi.org/10.1145/506147.506153},
doi = {10.1145/506147.506153},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RoughgardenT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Seiden02,
author = {Steven S. Seiden},
title = {On the online bin packing problem},
journal = {J. {ACM}},
volume = {49},
number = {5},
pages = {640--671},
year = {2002},
url = {https://doi.org/10.1145/585265.585269},
doi = {10.1145/585265.585269},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Seiden02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SenCD02,
author = {Sandeep Sen and
Siddhartha Chatterjee and
Neeraj Dumir},
title = {Towards a theory of cache-efficient algorithms},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {828--858},
year = {2002},
url = {https://doi.org/10.1145/602220.602225},
doi = {10.1145/602220.602225},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SenCD02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StockmeyerM02,
author = {Larry J. Stockmeyer and
Albert R. Meyer},
title = {Cosmological lower bound on the circuit complexity of a small problem
in logic},
journal = {J. {ACM}},
volume = {49},
number = {6},
pages = {753--784},
year = {2002},
url = {https://doi.org/10.1145/602220.602223},
doi = {10.1145/602220.602223},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/StockmeyerM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Zwick02,
author = {Uri Zwick},
title = {All pairs shortest paths using bridging sets and rectangular matrix
multiplication},
journal = {J. {ACM}},
volume = {49},
number = {3},
pages = {289--317},
year = {2002},
url = {https://doi.org/10.1145/567112.567114},
doi = {10.1145/567112.567114},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Zwick02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndrewsAFLLK01,
author = {Matthew Andrews and
Baruch Awerbuch and
Antonio Fern{\'{a}}ndez and
Frank Thomson Leighton and
Zhiyong Liu and
Jon M. Kleinberg},
title = {Universal-stability results and performance bounds for greedy contention-resolution
protocols},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {39--69},
year = {2001},
url = {https://doi.org/10.1145/363647.363677},
doi = {10.1145/363647.363677},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndrewsAFLLK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaD01,
author = {Hagit Attiya and
Eyal Dagan},
title = {Improved implementations of binary universal operations},
journal = {J. {ACM}},
volume = {48},
number = {5},
pages = {1013--1037},
year = {2001},
url = {https://doi.org/10.1145/502102.502105},
doi = {10.1145/502102.502105},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaD01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bar-NoyBFNS01,
author = {Amotz Bar{-}Noy and
Reuven Bar{-}Yehuda and
Ari Freund and
Joseph Naor and
Baruch Schieber},
title = {A unified approach to approximating resource allocation and scheduling},
journal = {J. {ACM}},
volume = {48},
number = {5},
pages = {1069--1090},
year = {2001},
url = {https://doi.org/10.1145/502102.502107},
doi = {10.1145/502102.502107},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bar-NoyBFNS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BasinG01,
author = {David A. Basin and
Harald Ganzinger},
title = {Automated complexity analysis based on ordered resolution},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {70--109},
year = {2001},
url = {https://doi.org/10.1145/363647.363681},
doi = {10.1145/363647.363681},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BasinG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BazziN01,
author = {Rida A. Bazzi and
Gil Neiger},
title = {Simplifying fault-tolerance: providing the abstraction of crash failures},
journal = {J. {ACM}},
volume = {48},
number = {3},
pages = {499--554},
year = {2001},
url = {https://doi.org/10.1145/382780.382784},
doi = {10.1145/382780.382784},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BazziN01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BealsBCMW01,
author = {Robert Beals and
Harry Buhrman and
Richard Cleve and
Michele Mosca and
Ronald de Wolf},
title = {Quantum lower bounds by polynomials},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {778--797},
year = {2001},
url = {https://doi.org/10.1145/502090.502097},
doi = {10.1145/502090.502097},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BealsBCMW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ben-SassonW01,
author = {Eli Ben{-}Sasson and
Avi Wigderson},
title = {Short proofs are narrow - resolution made simple},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {149--169},
year = {2001},
url = {https://doi.org/10.1145/375827.375835},
doi = {10.1145/375827.375835},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ben-SassonW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BergstraP01,
author = {Jan A. Bergstra and
Alban Ponse},
title = {Register-machine based processes},
journal = {J. {ACM}},
volume = {48},
number = {6},
pages = {1207--1241},
year = {2001},
url = {https://doi.org/10.1145/504794.504799},
doi = {10.1145/504794.504799},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BergstraP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BonehF01,
author = {Dan Boneh and
Matthew K. Franklin},
title = {Efficient generation of shared {RSA} keys},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {702--722},
year = {2001},
url = {https://doi.org/10.1145/502090.502094},
doi = {10.1145/502090.502094},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BonehF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BorodinKRSW01,
author = {Allan Borodin and
Jon M. Kleinberg and
Prabhakar Raghavan and
Madhu Sudan and
David P. Williamson},
title = {Adversarial queuing theory},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {13--38},
year = {2001},
url = {https://doi.org/10.1145/363647.363659},
doi = {10.1145/363647.363659},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BorodinKRSW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BroderFU01,
author = {Andrei Z. Broder and
Alan M. Frieze and
Eli Upfal},
title = {A general approach to dynamic packet routing with bounded buffers},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {324--349},
year = {2001},
url = {https://doi.org/10.1145/375827.375849},
doi = {10.1145/375827.375849},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BroderFU01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CaseRS01,
author = {John Case and
Dayanand S. Rajan and
Anil M. Shende},
title = {Lattice computers for approximating Euclidean space},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {110--144},
year = {2001},
url = {https://doi.org/10.1145/363647.363688},
doi = {10.1145/363647.363688},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CaseRS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chan01,
author = {Timothy M. Chan},
title = {Dynamic planar convex hull operations in near-logarithmaic amortized
time},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {1--12},
year = {2001},
url = {https://doi.org/10.1145/363647.363652},
doi = {10.1145/363647.363652},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChongHL01,
author = {Ka Wong Chong and
Yijie Han and
Tak Wah Lam},
title = {Concurrent threads and optimal parallel minimum spanning trees algorithm},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {297--323},
year = {2001},
url = {https://doi.org/10.1145/375827.375847},
doi = {10.1145/375827.375847},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChongHL01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Darwiche01,
author = {Adnan Darwiche},
title = {Decomposable negation normal form},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {608--647},
year = {2001},
url = {https://doi.org/10.1145/502090.502091},
doi = {10.1145/502090.502091},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Darwiche01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DaviesP01,
author = {Rowan Davies and
Frank Pfenning},
title = {A modal analysis of staged computation},
journal = {J. {ACM}},
volume = {48},
number = {3},
pages = {555--604},
year = {2001},
url = {https://doi.org/10.1145/382780.382785},
doi = {10.1145/382780.382785},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DaviesP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DoolyGS01,
author = {Daniel R. Dooly and
Sally A. Goldman and
Stephen D. Scott},
title = {On-line analysis of the {TCP} acknowledgment delay problem},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {243--273},
year = {2001},
url = {https://doi.org/10.1145/375827.375843},
doi = {10.1145/375827.375843},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DoolyGS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FrickG01,
author = {Markus Frick and
Martin Grohe},
title = {Deciding first-order properties of locally tree-decomposable structures},
journal = {J. {ACM}},
volume = {48},
number = {6},
pages = {1184--1206},
year = {2001},
url = {https://doi.org/10.1145/504794.504798},
doi = {10.1145/504794.504798},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FrickG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FriedmanH01,
author = {Nir Friedman and
Joseph Y. Halpern},
title = {Plausibility measures and default reasoning},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {648--685},
year = {2001},
url = {https://doi.org/10.1145/502090.502092},
doi = {10.1145/502090.502092},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FriedmanH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalE01,
author = {Avigdor Gal and
Jonathan Eckstein},
title = {Managing periodically updated data in relational databases: a stochastic
modeling approach},
journal = {J. {ACM}},
volume = {48},
number = {6},
pages = {1141--1183},
year = {2001},
url = {https://doi.org/10.1145/504794.504797},
doi = {10.1145/504794.504797},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GottlobLS01,
author = {Georg Gottlob and
Nicola Leone and
Francesco Scarcello},
title = {The complexity of acyclic conjunctive queries},
journal = {J. {ACM}},
volume = {48},
number = {3},
pages = {431--498},
year = {2001},
url = {https://doi.org/10.1145/382780.382783},
doi = {10.1145/382780.382783},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GottlobLS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HalevyMSS01,
author = {Alon Y. Halevy and
Inderpal Singh Mumick and
Yehoshua Sagiv and
Oded Shmueli},
title = {Static analysis in datalog extensions},
journal = {J. {ACM}},
volume = {48},
number = {5},
pages = {971--1012},
year = {2001},
url = {https://doi.org/10.1145/502102.502104},
doi = {10.1145/502102.502104},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HalevyMSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hastad01,
author = {Johan H{\aa}stad},
title = {Some optimal inapproximability results},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {798--859},
year = {2001},
url = {https://doi.org/10.1145/502090.502098},
doi = {10.1145/502090.502098},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hastad01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HellaLNW01,
author = {Lauri Hella and
Leonid Libkin and
Juha Nurmonen and
Limsoon Wong},
title = {Logics with aggregate operators},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {880--907},
year = {2001},
url = {https://doi.org/10.1145/502090.502100},
doi = {10.1145/502090.502100},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HellaLNW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HickeyJE01,
author = {Timothy J. Hickey and
Qun Ju and
Maarten H. van Emden},
title = {Interval arithmetic: From principles to implementation},
journal = {J. {ACM}},
volume = {48},
number = {5},
pages = {1038--1068},
year = {2001},
url = {https://doi.org/10.1145/502102.502106},
doi = {10.1145/502102.502106},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HickeyJE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hochbaum01,
author = {Dorit S. Hochbaum},
title = {An efficient algorithm for image segmentation, Markov random fields
and related problems},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {686--701},
year = {2001},
url = {https://doi.org/10.1145/502090.502093},
doi = {10.1145/502090.502093},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hochbaum01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HolmLT01,
author = {Jacob Holm and
Kristian de Lichtenberg and
Mikkel Thorup},
title = {Poly-logarithmic deterministic fully-dynamic algorithms for connectivity,
minimum spanning tree, 2-edge, and biconnectivity},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {723--760},
year = {2001},
url = {https://doi.org/10.1145/502090.502095},
doi = {10.1145/502090.502095},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HolmLT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IwataFF01,
author = {Satoru Iwata and
Lisa Fleischer and
Satoru Fujishige},
title = {A combinatorial strongly polynomial algorithm for minimizing submodular
functions},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {761--777},
year = {2001},
url = {https://doi.org/10.1145/502090.502096},
doi = {10.1145/502090.502096},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/IwataFF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainV01,
author = {Kamal Jain and
Vijay V. Vazirani},
title = {Approximation algorithms for metric facility location and \emph{k}-Median
problems using the primal-dual schema and Lagrangian relaxation},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {274--296},
year = {2001},
url = {https://doi.org/10.1145/375827.375845},
doi = {10.1145/375827.375845},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LasserreZ01,
author = {Jean B. Lasserre and
Eduardo S. Zeron},
title = {A Laplace transform algorithm for the volume of a convex polytope},
journal = {J. {ACM}},
volume = {48},
number = {6},
pages = {1126--1140},
year = {2001},
url = {https://doi.org/10.1145/504794.504796},
doi = {10.1145/504794.504796},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LasserreZ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Liberatore01,
author = {Paolo Liberatore},
title = {Monotonic reductions, representative equivalence, and compilation
of intractable problems},
journal = {J. {ACM}},
volume = {48},
number = {6},
pages = {1091--1125},
year = {2001},
url = {https://doi.org/10.1145/504794.504795},
doi = {10.1145/504794.504795},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Liberatore01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Manzini01,
author = {Giovanni Manzini},
title = {An analysis of the Burrows-Wheeler transform},
journal = {J. {ACM}},
volume = {48},
number = {3},
pages = {407--430},
year = {2001},
url = {https://doi.org/10.1145/382780.382782},
doi = {10.1145/382780.382782},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Manzini01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mayers01,
author = {Dominic Mayers},
title = {Unconditional security in quantum cryptography},
journal = {J. {ACM}},
volume = {48},
number = {3},
pages = {351--406},
year = {2001},
url = {https://doi.org/10.1145/382780.382781},
doi = {10.1145/382780.382781},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mayers01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MeghiniSS01,
author = {Carlo Meghini and
Fabrizio Sebastiani and
Umberto Straccia},
title = {A model of multimedia information retrieval},
journal = {J. {ACM}},
volume = {48},
number = {5},
pages = {909--970},
year = {2001},
url = {https://doi.org/10.1145/502102.502103},
doi = {10.1145/502102.502103},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MeghiniSS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Roura01,
author = {Salvador Roura},
title = {Improved master theorems for divide-and-conquer recurrences},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {170--205},
year = {2001},
url = {https://doi.org/10.1145/375827.375837},
doi = {10.1145/375827.375837},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Roura01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SiekmannW01,
author = {J{\"{o}}rg H. Siekmann and
Graham Wrightson},
title = {Erratum: a counterexample to W. Bibel's and E. Eder's strong completeness
result for connection graph resolution},
journal = {J. {ACM}},
volume = {48},
number = {1},
pages = {145--147},
year = {2001},
url = {https://doi.org/10.1145/363647.363697},
doi = {10.1145/363647.363697},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SiekmannW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Skutella01,
author = {Martin Skutella},
title = {Convex quadratic and semidefinite programming relaxations in scheduling},
journal = {J. {ACM}},
volume = {48},
number = {2},
pages = {206--242},
year = {2001},
url = {https://doi.org/10.1145/375827.375840},
doi = {10.1145/375827.375840},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Skutella01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Trevisan01,
author = {Luca Trevisan},
title = {Extractors and pseudorandom generators},
journal = {J. {ACM}},
volume = {48},
number = {4},
pages = {860--879},
year = {2001},
url = {https://doi.org/10.1145/502090.502099},
doi = {10.1145/502090.502099},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Trevisan01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlbersGL00,
author = {Susanne Albers and
Naveen Garg and
Stefano Leonardi},
title = {Minimizing stall time in single and parallel disk systems},
journal = {J. {ACM}},
volume = {47},
number = {6},
pages = {969--986},
year = {2000},
url = {https://doi.org/10.1145/355541.355542},
doi = {10.1145/355541.355542},
timestamp = {Tue, 27 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlbersGL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AltmanGH00,
author = {Eitan Altman and
Bruno Gaujal and
Arie Hordijk},
title = {Balanced sequences and optimal routing},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {752--775},
year = {2000},
url = {https://doi.org/10.1145/347476.347482},
doi = {10.1145/347476.347482},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AltmanGH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AntoyEH00,
author = {Sergio Antoy and
Rachid Echahed and
Michael Hanus},
title = {A needed narrowing strategy},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {776--822},
year = {2000},
url = {https://doi.org/10.1145/347476.347484},
doi = {10.1145/347476.347484},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AntoyEH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArmoniTWZ00,
author = {Roy Armoni and
Amnon Ta{-}Shma and
Avi Wigderson and
Shiyu Zhou},
title = {An \emph{O}(log(\emph{n})\({}^{\mbox{4/3}}\)) space algorithm for
(\emph{s, t}) connectivity in undirected graphs},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {294--311},
year = {2000},
url = {https://doi.org/10.1145/333979.333984},
doi = {10.1145/333979.333984},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ArmoniTWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BartalG00,
author = {Yair Bartal and
Eddie Grove},
title = {The harmonic \emph{k}-server algorithm is competitive},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {1--15},
year = {2000},
url = {https://doi.org/10.1145/331605.331606},
doi = {10.1145/331605.331606},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BartalG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeimelBBKV00,
author = {Amos Beimel and
Francesco Bergadano and
Nader H. Bshouty and
Eyal Kushilevitz and
Stefano Varricchio},
title = {Learning functions represented as multiplicity automata},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {506--530},
year = {2000},
url = {https://doi.org/10.1145/337244.337257},
doi = {10.1145/337244.337257},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BeimelBBKV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BenediktL00,
author = {Michael Benedikt and
Leonid Libkin},
title = {Relational queries over interpreted structures},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {644--680},
year = {2000},
url = {https://doi.org/10.1145/347476.347477},
doi = {10.1145/347476.347477},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BenediktL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrafmanT00,
author = {Ronen I. Brafman and
Moshe Tennenholtz},
title = {An axiomatic treatment of three qualitative decision criteria},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {452--482},
year = {2000},
url = {https://doi.org/10.1145/337244.337251},
doi = {10.1145/337244.337251},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BrafmanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CannyE00,
author = {John F. Canny and
Ioannis Z. Emiris},
title = {A subdivision-based algorithm for the sparse resultant},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {417--451},
year = {2000},
url = {https://doi.org/10.1145/337244.337247},
doi = {10.1145/337244.337247},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CannyE00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChaudhuriHLT00,
author = {Soma Chaudhuri and
Maurice Herlihy and
Nancy A. Lynch and
Mark R. Tuttle},
title = {Tight bounds for \emph{k}-set agreement},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {912--943},
year = {2000},
url = {https://doi.org/10.1145/355483.355489},
doi = {10.1145/355483.355489},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChaudhuriHLT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chazelle00,
author = {Bernard Chazelle},
title = {The soft heap: an approximate priority queue with optimal error rate},
journal = {J. {ACM}},
volume = {47},
number = {6},
pages = {1012--1027},
year = {2000},
url = {https://doi.org/10.1145/355541.355554},
doi = {10.1145/355541.355554},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chazelle00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chazelle00a,
author = {Bernard Chazelle},
title = {A minimum spanning tree algorithm with Inverse-Ackermann type complexity},
journal = {J. {ACM}},
volume = {47},
number = {6},
pages = {1028--1047},
year = {2000},
url = {https://doi.org/10.1145/355541.355562},
doi = {10.1145/355541.355562},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chazelle00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChengDEFT00,
author = {Siu{-}Wing Cheng and
Tamal K. Dey and
Herbert Edelsbrunner and
Michael A. Facello and
Shang{-}Hua Teng},
title = {Sliver exudation},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {883--904},
year = {2000},
url = {https://doi.org/10.1145/355483.355487},
doi = {10.1145/355483.355487},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChengDEFT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cohen00,
author = {Edith Cohen},
title = {Polylog-time and near-linear work approximation scheme for undirected
shortest paths},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {132--166},
year = {2000},
url = {https://doi.org/10.1145/331605.331610},
doi = {10.1145/331605.331610},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Cohen00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CohenJJK00,
author = {David A. Cohen and
Peter Jeavons and
Peter Jonsson and
Manolis Koubarakis},
title = {Building tractable disjunctive constraints},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {826--853},
year = {2000},
url = {https://doi.org/10.1145/355483.355485},
doi = {10.1145/355483.355485},
timestamp = {Mon, 17 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/CohenJJK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DymondR00,
author = {Patrick W. Dymond and
Walter L. Ruzzo},
title = {Parallel RAMs with owned global memory and deterministic context-free
language recognition},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {16--45},
year = {2000},
url = {https://doi.org/10.1145/331605.331607},
doi = {10.1145/331605.331607},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DymondR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EiterGG00,
author = {Thomas Eiter and
Yuri Gurevich and
Georg Gottlob},
title = {Existential second-order logic over strings},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {77--131},
year = {2000},
url = {https://doi.org/10.1145/331605.331609},
doi = {10.1145/331605.331609},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EiterGG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EvenNRS00,
author = {Guy Even and
Joseph Naor and
Satish Rao and
Baruch Schieber},
title = {Divide-and-conquer approximation algorithms via spreading metrics},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {585--616},
year = {2000},
url = {https://doi.org/10.1145/347476.347478},
doi = {10.1145/347476.347478},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EvenNRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Farach-ColtonFM00,
author = {Martin Farach{-}Colton and
Paolo Ferragina and
S. Muthukrishnan},
title = {On the sorting-complexity of suffix tree construction},
journal = {J. {ACM}},
volume = {47},
number = {6},
pages = {987--1011},
year = {2000},
url = {https://doi.org/10.1145/355541.355547},
doi = {10.1145/355541.355547},
timestamp = {Fri, 07 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Farach-ColtonFM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FranklinGY00,
author = {Matthew K. Franklin and
Zvi Galil and
Moti Yung},
title = {Eavesdropping games: a graph-theoretic approach to privacy in distributed
systems},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {225--243},
year = {2000},
url = {https://doi.org/10.1145/333979.333980},
doi = {10.1145/333979.333980},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FranklinGY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GiacobazziRS00,
author = {Roberto Giacobazzi and
Francesco Ranzato and
Francesca Scozzari},
title = {Making abstract interpretations complete},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {361--416},
year = {2000},
url = {https://doi.org/10.1145/333979.333989},
doi = {10.1145/333979.333989},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GiacobazziRS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldbergMPS00,
author = {Leslie Ann Goldberg and
Philip D. MacKenzie and
Mike Paterson and
Aravind Srinivasan},
title = {Contention resolution with constant expected delay},
journal = {J. {ACM}},
volume = {47},
number = {6},
pages = {1048--1096},
year = {2000},
url = {https://doi.org/10.1145/355541.355567},
doi = {10.1145/355541.355567},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoldbergMPS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Halpern00,
author = {Joseph Y. Halpern},
title = {Editorial: a bill of rights and responsibilities},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {823--825},
year = {2000},
url = {https://doi.org/10.1145/355483.355484},
doi = {10.1145/355483.355484},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Halpern00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JiangLV00,
author = {Tao Jiang and
Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {A lower bound on the average-case complexity of shellsort},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {905--911},
year = {2000},
url = {https://doi.org/10.1145/355483.355488},
doi = {10.1145/355483.355488},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JiangLV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KalyanasundaramP00,
author = {Bala Kalyanasundaram and
Kirk Pruhs},
title = {Speed is as powerful as clairvoyance},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {617--643},
year = {2000},
url = {https://doi.org/10.1145/347476.347479},
doi = {10.1145/347476.347479},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KalyanasundaramP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Karger00,
author = {David R. Karger},
title = {Minimum cuts in near-linear time},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {46--76},
year = {2000},
url = {https://doi.org/10.1145/331605.331608},
doi = {10.1145/331605.331608},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Karger00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KarhumakiMP00,
author = {Juhani Karhum{\"{a}}ki and
Filippo Mignosi and
Wojciech Plandowski},
title = {The expressibility of languages and relations by word equations},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {483--505},
year = {2000},
url = {https://doi.org/10.1145/337244.337255},
doi = {10.1145/337244.337255},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KarhumakiMP00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KupfermanVW00,
author = {Orna Kupferman and
Moshe Y. Vardi and
Pierre Wolper},
title = {An automata-theoretic approach to branching-time model checking},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {312--360},
year = {2000},
url = {https://doi.org/10.1145/333979.333987},
doi = {10.1145/333979.333987},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KupfermanVW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KutylowskiLOW00,
author = {Miroslaw Kutylowski and
Krzysztof Lorys and
Brigitte Oesterdiekhoff and
Rolf Wanka},
title = {Periodification scheme: constructing sorting networks with constant
period},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {944--967},
year = {2000},
url = {https://doi.org/10.1145/355483.355490},
doi = {10.1145/355483.355490},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KutylowskiLOW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MundhenkGLA00,
author = {Martin Mundhenk and
Judy Goldsmith and
Christopher Lusena and
Eric Allender},
title = {Complexity of finite-horizon Markov decision process problems},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {681--720},
year = {2000},
url = {https://doi.org/10.1145/347476.347480},
doi = {10.1145/347476.347480},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MundhenkGLA00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OHearnR00,
author = {Peter W. O'Hearn and
John C. Reynolds},
title = {From Algol to polymorphic linear lambda-calculus},
journal = {J. {ACM}},
volume = {47},
number = {1},
pages = {167--223},
year = {2000},
url = {https://doi.org/10.1145/331605.331611},
doi = {10.1145/331605.331611},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/OHearnR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PierceS00,
author = {Benjamin C. Pierce and
Davide Sangiorgi},
title = {Behavioral equivalence in the polymorphic pi-calculus},
journal = {J. {ACM}},
volume = {47},
number = {3},
pages = {531--584},
year = {2000},
url = {https://doi.org/10.1145/337244.337261},
doi = {10.1145/337244.337261},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PierceS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RawlingS00,
author = {J. P. Rawling and
Stephen A. Selesnick},
title = {Orthologic and quantum logic: models and computational elements},
journal = {J. {ACM}},
volume = {47},
number = {4},
pages = {721--751},
year = {2000},
url = {https://doi.org/10.1145/347476.347481},
doi = {10.1145/347476.347481},
timestamp = {Mon, 22 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RawlingS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Valiant00,
author = {Leslie G. Valiant},
title = {A neuroidal architecture for cognitive computation},
journal = {J. {ACM}},
volume = {47},
number = {5},
pages = {854--882},
year = {2000},
url = {https://doi.org/10.1145/355483.355486},
doi = {10.1145/355483.355486},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Valiant00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VargheseJ00,
author = {George Varghese and
Mahesh Jayaram},
title = {The fault span of crash failures},
journal = {J. {ACM}},
volume = {47},
number = {2},
pages = {244--293},
year = {2000},
url = {https://doi.org/10.1145/333979.333982},
doi = {10.1145/333979.333982},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VargheseJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonDMPT99,
author = {Noga Alon and
Martin Dietzfelbinger and
Peter Bro Miltersen and
Erez Petrank and
G{\'{a}}bor Tardos},
title = {Linear Hash Functions},
journal = {J. {ACM}},
volume = {46},
number = {5},
pages = {667--683},
year = {1999},
url = {https://doi.org/10.1145/324133.324179},
doi = {10.1145/324133.324179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlonDMPT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Basu99,
author = {Saugata Basu},
title = {New Results on Quantifier Elimination over Real Closed Fields and
Applications to Constraint Databases},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {537--555},
year = {1999},
url = {https://doi.org/10.1145/320211.320240},
doi = {10.1145/320211.320240},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Basu99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BergerKL99,
author = {Bonnie Berger and
Jon M. Kleinberg and
Frank Thomson Leighton},
title = {Reconstructing a Three-Dimensional Model with Arbitrary Errors},
journal = {J. {ACM}},
volume = {46},
number = {2},
pages = {212--235},
year = {1999},
url = {https://doi.org/10.1145/301970.301972},
doi = {10.1145/301970.301972},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BergerKL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlellochGM99,
author = {Guy E. Blelloch and
Phillip B. Gibbons and
Yossi Matias},
title = {Provably Efficient Scheduling for Languages with Fine-Grained Parallelism},
journal = {J. {ACM}},
volume = {46},
number = {2},
pages = {281--321},
year = {1999},
url = {https://doi.org/10.1145/301970.301974},
doi = {10.1145/301970.301974},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlellochGM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumofeL99,
author = {Robert D. Blumofe and
Charles E. Leiserson},
title = {Scheduling Multithreaded Computations by Work Stealing},
journal = {J. {ACM}},
volume = {46},
number = {5},
pages = {720--748},
year = {1999},
url = {https://doi.org/10.1145/324133.324234},
doi = {10.1145/324133.324234},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BlumofeL99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuhrmanFGHTV99,
author = {Harry Buhrman and
Matthew K. Franklin and
Juan A. Garay and
Jaap{-}Henk Hoepman and
John Tromp and
Paul M. B. Vit{\'{a}}nyi},
title = {Mutual Search},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {517--536},
year = {1999},
url = {https://doi.org/10.1145/320211.320232},
doi = {10.1145/320211.320232},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuhrmanFGHTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Cesa-BianchiDFSS99,
author = {Nicol{\`{o}} Cesa{-}Bianchi and
Eli Dichterman and
Paul Fischer and
Eli Shamir and
Hans Ulrich Simon},
title = {Sample-Efficient Strategies for Learning in the Presence of Noise},
journal = {J. {ACM}},
volume = {46},
number = {5},
pages = {684--719},
year = {1999},
url = {https://doi.org/10.1145/324133.324221},
doi = {10.1145/324133.324221},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Cesa-BianchiDFSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CuckerS99,
author = {Felipe Cucker and
Steve Smale},
title = {Complexity Estimates Depending on Condition and Round-Off Error},
journal = {J. {ACM}},
volume = {46},
number = {1},
pages = {113--184},
year = {1999},
url = {https://doi.org/10.1145/300515.300519},
doi = {10.1145/300515.300519},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CuckerS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FarachK99,
author = {Martin Farach and
Sampath Kannan},
title = {Efficient Algorithms for Inverting Evolution},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {437--449},
year = {1999},
url = {https://doi.org/10.1145/320211.320212},
doi = {10.1145/320211.320212},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FarachK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FerraginaG99,
author = {Paolo Ferragina and
Roberto Grossi},
title = {The String B-tree: {A} New Data Structure for String Search in External
Memory and Its Applications},
journal = {J. {ACM}},
volume = {46},
number = {2},
pages = {236--280},
year = {1999},
url = {https://doi.org/10.1145/301970.301973},
doi = {10.1145/301970.301973},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FerraginaG99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Fredman99,
author = {Michael L. Fredman},
title = {On the Efficiency of Pairing Heaps and Related Data Structures},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {473--501},
year = {1999},
url = {https://doi.org/10.1145/320211.320214},
doi = {10.1145/320211.320214},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Fredman99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilIS99,
author = {Zvi Galil and
Giuseppe F. Italiano and
Neil Sarnak},
title = {Fully Dynamic Planarity Testing with Applications},
journal = {J. {ACM}},
volume = {46},
number = {1},
pages = {28--91},
year = {1999},
url = {https://doi.org/10.1145/300515.300517},
doi = {10.1145/300515.300517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilIS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoldwasserK99,
author = {Shafi Goldwasser and
Joe Kilian},
title = {Primality Testing Using Elliptic Curves},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {450--472},
year = {1999},
url = {https://doi.org/10.1145/320211.320213},
doi = {10.1145/320211.320213},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoldwasserK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HannenhalliP99,
author = {Sridhar Hannenhalli and
Pavel A. Pevzner},
title = {Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting
Signed Permutations by Reversals},
journal = {J. {ACM}},
volume = {46},
number = {1},
pages = {1--27},
year = {1999},
url = {https://doi.org/10.1145/300515.300516},
doi = {10.1145/300515.300516},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HannenhalliP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HassLP99,
author = {Joel Hass and
J. C. Lagarias and
Nicholas Pippenger},
title = {The Computational Complexity of Knot and Link Problems},
journal = {J. {ACM}},
volume = {46},
number = {2},
pages = {185--211},
year = {1999},
url = {https://doi.org/10.1145/301970.301971},
doi = {10.1145/301970.301971},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HassLP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HenzingerK99,
author = {Monika Rauch Henzinger and
Valerie King},
title = {Randomized Fully Dynamic Graph Algorithms with Polylogarithmic Time
per Operation},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {502--516},
year = {1999},
url = {https://doi.org/10.1145/320211.320215},
doi = {10.1145/320211.320215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HenzingerK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HerlihyS99,
author = {Maurice Herlihy and
Nir Shavit},
title = {The topological structure of asynchronous computability},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {858--923},
year = {1999},
url = {https://doi.org/10.1145/331524.331529},
doi = {10.1145/331524.331529},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HerlihyS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kleinberg99,
author = {Jon M. Kleinberg},
title = {Authoritative Sources in a Hyperlinked Environment},
journal = {J. {ACM}},
volume = {46},
number = {5},
pages = {604--632},
year = {1999},
url = {https://doi.org/10.1145/324133.324140},
doi = {10.1145/324133.324140},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kleinberg99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LeightonR99,
author = {Frank Thomson Leighton and
Satish Rao},
title = {Multicommodity max-flow min-cut theorems and their use in designing
approximation algorithms},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {787--832},
year = {1999},
url = {https://doi.org/10.1145/331524.331526},
doi = {10.1145/331524.331526},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LeightonR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MohringSU99,
author = {Rolf H. M{\"{o}}hring and
Andreas S. Schulz and
Marc Uetz},
title = {Approximation in stochastic scheduling: the power of LP-based priority
policies},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {924--942},
year = {1999},
url = {https://doi.org/10.1145/331524.331530},
doi = {10.1145/331524.331530},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MohringSU99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Myers99,
author = {Gene Myers},
title = {A Fast Bit-Vector Algorithm for Approximate String Matching Based
on Dynamic Programming},
journal = {J. {ACM}},
volume = {46},
number = {3},
pages = {395--415},
year = {1999},
url = {https://doi.org/10.1145/316542.316550},
doi = {10.1145/316542.316550},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Myers99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ONeilOW99,
author = {Elizabeth J. O'Neil and
Patrick E. O'Neil and
Gerhard Weikum},
title = {An Optimality Proof of the LRU-\emph{K} Page Replacement Algorithm},
journal = {J. {ACM}},
volume = {46},
number = {1},
pages = {92--112},
year = {1999},
url = {https://doi.org/10.1145/300515.300518},
doi = {10.1145/300515.300518},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ONeilOW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PirriR99,
author = {Fiora Pirri and
Raymond Reiter},
title = {Some Contributions to the Metatheory of the Situation Calculus},
journal = {J. {ACM}},
volume = {46},
number = {3},
pages = {325--361},
year = {1999},
url = {https://doi.org/10.1145/316542.316545},
doi = {10.1145/316542.316545},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PirriR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RodehS99,
author = {Michael Rodeh and
Shmuel Sagiv},
title = {Finding Circular Attributes in Attribute Grammars},
journal = {J. {ACM}},
volume = {46},
number = {4},
pages = {556},
year = {1999},
url = {https://doi.org/10.1145/320211.320243},
doi = {10.1145/320211.320243},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RodehS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Thorup99,
author = {Mikkel Thorup},
title = {Undirected Single-Source Shortest Paths with Positive Integer Weights
in Linear Time},
journal = {J. {ACM}},
volume = {46},
number = {3},
pages = {362--394},
year = {1999},
url = {https://doi.org/10.1145/316542.316548},
doi = {10.1145/316542.316548},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Thorup99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/YoungCW99,
author = {Fung Yu Young and
Chris C. N. Chu and
D. F. Wong},
title = {Generation of Universal Series-Parallel Boolean Functions},
journal = {J. {ACM}},
volume = {46},
number = {3},
pages = {416--435},
year = {1999},
url = {https://doi.org/10.1145/316542.316551},
doi = {10.1145/316542.316551},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/YoungCW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ZhouS99,
author = {Yunhong Zhou and
Subhash Suri},
title = {Analysis of a bounding box heuristic for object intersection},
journal = {J. {ACM}},
volume = {46},
number = {6},
pages = {833--857},
year = {1999},
url = {https://doi.org/10.1145/331524.331528},
doi = {10.1145/331524.331528},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ZhouS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbiteboulK98,
author = {Serge Abiteboul and
Paris C. Kanellakis},
title = {Object Identity as a Query Language Primitive},
journal = {J. {ACM}},
volume = {45},
number = {5},
pages = {798--842},
year = {1998},
url = {https://doi.org/10.1145/290179.290182},
doi = {10.1145/290179.290182},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbiteboulK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AndreevCR98,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim},
title = {A New General Derandomization Method},
journal = {J. {ACM}},
volume = {45},
number = {1},
pages = {179--213},
year = {1998},
url = {https://doi.org/10.1145/273865.273933},
doi = {10.1145/273865.273933},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AndreevCR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Arora98,
author = {Sanjeev Arora},
title = {Polynomial Time Approximation Schemes for Euclidean Traveling Salesman
and other Geometric Problems},
journal = {J. {ACM}},
volume = {45},
number = {5},
pages = {753--782},
year = {1998},
url = {https://doi.org/10.1145/290179.290180},
doi = {10.1145/290179.290180},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Arora98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraLMSS98,
author = {Sanjeev Arora and
Carsten Lund and
Rajeev Motwani and
Madhu Sudan and
Mario Szegedy},
title = {Proof Verification and the Hardness of Approximation Problems},
journal = {J. {ACM}},
volume = {45},
number = {3},
pages = {501--555},
year = {1998},
url = {https://doi.org/10.1145/278298.278306},
doi = {10.1145/278298.278306},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AroraLMSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AroraS98,
author = {Sanjeev Arora and
Shmuel Safra},
title = {Probabilistic Checking of Proofs: {A} New Characterization of {NP}},
journal = {J. {ACM}},
volume = {45},
number = {1},
pages = {70--122},
year = {1998},
url = {https://doi.org/10.1145/273865.273901},
doi = {10.1145/273865.273901},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AroraS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AryaMNSW98,
author = {Sunil Arya and
David M. Mount and
Nathan S. Netanyahu and
Ruth Silverman and
Angela Y. Wu},
title = {An Optimal Algorithm for Approximate Nearest Neighbor Searching Fixed
Dimensions},
journal = {J. {ACM}},
volume = {45},
number = {6},
pages = {891--923},
year = {1998},
url = {https://doi.org/10.1145/293347.293348},
doi = {10.1145/293347.293348},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AryaMNSW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-07-08 11:30 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
