Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jacm/jacm63.bht:"
download as .bib file
@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/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/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/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/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}
}
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-05-23 15:23 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:
