Search dblp for Publications

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

 download as .bib file

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

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.