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/jacm51.bht:"
download as .bib file
@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, 06 Nov 2018 00:00:00 +0100},
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}
}
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-04 13:36 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:
