Search dblp for Publications

export results for "toc:db/journals/jacm/jacm54.bht:"

 download as .bib file

@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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics