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/jacm53.bht:"
download as .bib file
@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}
}
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-06-10 07:27 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:
