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/jacm41.bht:"
download as .bib file
@article{DBLP:journals/jacm/AbrahamsonAHK94,
author = {Karl R. Abrahamson and
Andrew Adler and
Lisa Higham and
David G. Kirkpatrick},
title = {Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous
Rings},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {277--310},
year = {1994},
url = {https://doi.org/10.1145/174652.174656},
doi = {10.1145/174652.174656},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbrahamsonAHK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AfekAFFLMWZ94,
author = {Yehuda Afek and
Hagit Attiya and
Alan D. Fekete and
Michael J. Fischer and
Nancy A. Lynch and
Yishay Mansour and
Da{-}Wei Wang and
Lenore D. Zuck},
title = {Reliable Communication Over Unreliable Channels},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1267--1297},
year = {1994},
url = {https://doi.org/10.1145/195613.195651},
doi = {10.1145/195613.195651},
timestamp = {Tue, 17 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AfekAFFLMWZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlonM94,
author = {Noga Alon and
Nimrod Megiddo},
title = {Parallel Linear Programming in Fixed Dimension Almost Surely in Constant
Time},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {422--434},
year = {1994},
url = {https://doi.org/10.1145/174652.174661},
doi = {10.1145/174652.174661},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlonM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AlurH94,
author = {Rajeev Alur and
Thomas A. Henzinger},
title = {A Really Temporal Logic},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {181--204},
year = {1994},
url = {https://doi.org/10.1145/174644.174651},
doi = {10.1145/174644.174651},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AlurH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AspnesHS94,
author = {James Aspnes and
Maurice Herlihy and
Nir Shavit},
title = {Counting Networks},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {1020--1048},
year = {1994},
url = {https://doi.org/10.1145/185675.185815},
doi = {10.1145/185675.185815},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AspnesHS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtallahGK94,
author = {Mikhail J. Atallah and
Michael T. Goodrich and
S. Rao Kosaraju},
title = {Parallel Algorithms for Evaluating Sequences of Set-Manipulation Operations},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1049--1088},
year = {1994},
url = {https://doi.org/10.1145/195613.195617},
doi = {10.1145/195613.195617},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AtallahGK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaDLS94,
author = {Hagit Attiya and
Cynthia Dwork and
Nancy A. Lynch and
Larry J. Stockmeyer},
title = {Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {122--152},
year = {1994},
url = {https://doi.org/10.1145/174644.174649},
doi = {10.1145/174644.174649},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaDLS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AttiyaLS94,
author = {Hagit Attiya and
Nancy A. Lynch and
Nir Shavit},
title = {Are Wait-Free Algorithms Fast?},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {725--763},
year = {1994},
url = {https://doi.org/10.1145/179812.179902},
doi = {10.1145/179812.179902},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AttiyaLS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BachmairD94,
author = {Leo Bachmair and
Nachum Dershowitz},
title = {Equational Inference, Canonical Proofs, and Proof Orderings},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {236--276},
year = {1994},
url = {https://doi.org/10.1145/174652.174655},
doi = {10.1145/174652.174655},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BachmairD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Baker94,
author = {Brenda S. Baker},
title = {Approximation Algorithms for NP-Complete Problems on Planar Graphs},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {153--180},
year = {1994},
url = {https://doi.org/10.1145/174644.174650},
doi = {10.1145/174644.174650},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Baker94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BellNNS94,
author = {Colin Bell and
Anil Nerode and
Raymond T. Ng and
V. S. Subrahmanian},
title = {Mixed Integer Programming Methods for Computing Nonmonotonic Deductive
Databases},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1178--1215},
year = {1994},
url = {https://doi.org/10.1145/195613.195637},
doi = {10.1145/195613.195637},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BellNNS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BellW94,
author = {Timothy C. Bell and
Ian H. Witten},
title = {The Relationship between Greedy Parsing and Symbolwise Text Compression},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {708--724},
year = {1994},
url = {https://doi.org/10.1145/179812.179892},
doi = {10.1145/179812.179892},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BellW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Blum94,
author = {Avrim Blum},
title = {New Approximation Algorithms for Graph Coloring},
journal = {J. {ACM}},
volume = {41},
number = {3},
pages = {470--516},
year = {1994},
url = {https://doi.org/10.1145/176584.176586},
doi = {10.1145/176584.176586},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Blum94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumLTY94,
author = {Avrim Blum and
Tao Jiang and
Ming Li and
John Tromp and
Mihalis Yannakakis},
title = {Linear Approximation of Shortest Superstrings},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {630--647},
year = {1994},
url = {https://doi.org/10.1145/179812.179818},
doi = {10.1145/179812.179818},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlumLTY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BuntineB94,
author = {Wray L. Buntine and
Hans{-}J{\"{u}}rgen B{\"{u}}rckert},
title = {On Solving Equations and Disequations},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {591--629},
year = {1994},
url = {https://doi.org/10.1145/179812.179813},
doi = {10.1145/179812.179813},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BuntineB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ConwayPT94,
author = {Adrian E. Conway and
Eugene Pinsky and
Srinivasan Tridandapani},
title = {Efficient Decomposition Methods for the Analysis of Multi-Facility
Blocking Models},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {648--675},
year = {1994},
url = {https://doi.org/10.1145/179812.179838},
doi = {10.1145/179812.179838},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ConwayPT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CosnardD94,
author = {Michel Cosnard and
El Mostafa Daoudi},
title = {Optimal Algorithms for Parallel Givens Factorization on a Coarse-Grained
{PRAM}},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {399--421},
year = {1994},
url = {https://doi.org/10.1145/174652.174660},
doi = {10.1145/174652.174660},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CosnardD94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DalleryLT94,
author = {Yves Dallery and
Zhen Liu and
Donald F. Towsley},
title = {Equivalence, Reversibility, Symmetry and Concavity Properties in Fork-Join
Queueing Networks with Blocking},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {903--942},
year = {1994},
url = {https://doi.org/10.1145/185675.185776},
doi = {10.1145/185675.185776},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/DalleryLT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DriscollST94,
author = {James R. Driscoll and
Daniel Dominic Sleator and
Robert Endre Tarjan},
title = {Fully Persistent Lists with Catenation},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {943--959},
year = {1994},
url = {https://doi.org/10.1145/185675.185791},
doi = {10.1145/185675.185791},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DriscollST94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DrusinskyH94,
author = {Doron Drusinsky and
David Harel},
title = {On the Power of Bounded Concurrency {I:} Finite Automata},
journal = {J. {ACM}},
volume = {41},
number = {3},
pages = {517--539},
year = {1994},
url = {https://doi.org/10.1145/176584.176587},
doi = {10.1145/176584.176587},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DrusinskyH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DubinerGM94,
author = {Moshe Dubiner and
Zvi Galil and
Edith Magen},
title = {Faster Tree Pattern Matching},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {205--213},
year = {1994},
url = {https://doi.org/10.1145/174652.174653},
doi = {10.1145/174652.174653},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DubinerGM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FaginH94,
author = {Ronald Fagin and
Joseph Y. Halpern},
title = {Reasoning About Knowledge and Probability},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {340--367},
year = {1994},
url = {https://doi.org/10.1145/174652.174658},
doi = {10.1145/174652.174658},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FaginH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FischerP94,
author = {Michael J. Fischer and
Mike Paterson},
title = {Fishspear: {A} Priority Queue Algorithm},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {3--30},
year = {1994},
url = {https://doi.org/10.1145/174644.174645},
doi = {10.1145/174644.174645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FischerP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GaoK94,
author = {Shaodi Gao and
Michael Kaufmann},
title = {Channel Routing of Multiterminal Nets},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {791--818},
year = {1994},
url = {https://doi.org/10.1145/179812.179927},
doi = {10.1145/179812.179927},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GaoK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GlassN94,
author = {Christopher J. Glass and
Lionel M. Ni},
title = {The Turn Model for Adaptive Routing},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {874--902},
year = {1994},
url = {https://doi.org/10.1145/185675.185682},
doi = {10.1145/185675.185682},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GlassN94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HirstH94,
author = {Tirza Hirst and
David Harel},
title = {On the Power of Bounded Concurrency {II:} Pushdown Automata},
journal = {J. {ACM}},
volume = {41},
number = {3},
pages = {540--554},
year = {1994},
url = {https://doi.org/10.1145/176584.176588},
doi = {10.1145/176584.176588},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HirstH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Karp94,
author = {Richard M. Karp},
title = {Probabilistic Recurrence Relations},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1136--1150},
year = {1994},
url = {https://doi.org/10.1145/195613.195632},
doi = {10.1145/195613.195632},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Karp94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KearnsLV94,
author = {Michael J. Kearns and
Ming Li and
Leslie G. Valiant},
title = {Learning Boolean Formulas},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1298--1328},
year = {1994},
url = {https://doi.org/10.1145/195613.195656},
doi = {10.1145/195613.195656},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KearnsLV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KearnsV94,
author = {Michael J. Kearns and
Leslie G. Valiant},
title = {Cryptographic Limitations on Learning Boolean Formulae and Finite
Automata},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {67--95},
year = {1994},
url = {https://doi.org/10.1145/174644.174647},
doi = {10.1145/174644.174647},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/KearnsV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KfouryTU94,
author = {A. J. Kfoury and
Jerzy Tiuryn and
Pawel Urzyczyn},
title = {An Analysis of {ML} Typability},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {368--398},
year = {1994},
url = {https://doi.org/10.1145/174652.174659},
doi = {10.1145/174652.174659},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KfouryTU94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KhullerV94,
author = {Samir Khuller and
Uzi Vishkin},
title = {Biconnectivity Approximations and Graph Carvings},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {214--235},
year = {1994},
url = {https://doi.org/10.1145/174652.174654},
doi = {10.1145/174652.174654},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KhullerV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LadkinM94,
author = {Peter B. Ladkin and
Roger D. Maddux},
title = {On Binary Constraint Problems},
journal = {J. {ACM}},
volume = {41},
number = {3},
pages = {435--469},
year = {1994},
url = {https://doi.org/10.1145/176584.176585},
doi = {10.1145/176584.176585},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LadkinM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LuiM94,
author = {John C. S. Lui and
Richard R. Muntz},
title = {Computing Bounds on Steady State Availability of Repairable Computer
Systems},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {676--707},
year = {1994},
url = {https://doi.org/10.1145/179812.179848},
doi = {10.1145/179812.179848},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LuiM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LundY94,
author = {Carsten Lund and
Mihalis Yannakakis},
title = {On the Hardness of Approximating Minimization Problems},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {960--981},
year = {1994},
url = {https://doi.org/10.1145/185675.306789},
doi = {10.1145/185675.306789},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LundY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Motwani94,
author = {Rajeev Motwani},
title = {Average-Case Analysis of Algorithms for Matchings and Related Problems},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1329--1356},
year = {1994},
url = {https://doi.org/10.1145/195613.195663},
doi = {10.1145/195613.195663},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Motwani94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NaughtonR94,
author = {Jeffrey F. Naughton and
Raghu Ramakrishnan},
title = {How to Forget the Past Without Repeating It},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1151--1177},
year = {1994},
url = {https://doi.org/10.1145/195613.195634},
doi = {10.1145/195613.195634},
timestamp = {Thu, 02 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/NaughtonR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/OrponenKSW94,
author = {Pekka Orponen and
Ker{-}I Ko and
Uwe Sch{\"{o}}ning and
Osamu Watanabe},
title = {Instance Complexity},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {96--121},
year = {1994},
url = {https://doi.org/10.1145/174644.174648},
doi = {10.1145/174644.174648},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/OrponenKSW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rabin94,
author = {Tal Rabin},
title = {Robust Sharing of Secrets When the Dealer is Honest or Cheating},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1089--1109},
year = {1994},
url = {https://doi.org/10.1145/195613.195621},
doi = {10.1145/195613.195621},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rabin94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RathmannWM94,
author = {Peter K. Rathmann and
Marianne Winslett and
Mark S. Manasse},
title = {Circumscription with Homomorphisms: Solving the Equality and Counterexample
Problems},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {819--873},
year = {1994},
url = {https://doi.org/10.1145/185675.185678},
doi = {10.1145/185675.185678},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RathmannWM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ReifS94,
author = {John H. Reif and
Micha Sharir},
title = {Motion Planning in the Presence of Moving Obstacles},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {764--790},
year = {1994},
url = {https://doi.org/10.1145/179812.179911},
doi = {10.1145/179812.179911},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ReifS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ReifS94a,
author = {John H. Reif and
James A. Storer},
title = {A Single-Exponential Upper Bound for Finding Shortest Paths in Three
Dimensions},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {1013--1019},
year = {1994},
url = {https://doi.org/10.1145/185675.185811},
doi = {10.1145/185675.185811},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ReifS94a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RivestS94,
author = {Ronald L. Rivest and
Robert E. Schapire},
title = {Diversity-Based Inference of Finite Automata},
journal = {J. {ACM}},
volume = {41},
number = {3},
pages = {555--589},
year = {1994},
url = {https://doi.org/10.1145/176584.176589},
doi = {10.1145/176584.176589},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RivestS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rockmore94,
author = {Daniel N. Rockmore},
title = {Efficient Computation of Fourier Inversion for Finite Groups},
journal = {J. {ACM}},
volume = {41},
number = {1},
pages = {31--66},
year = {1994},
url = {https://doi.org/10.1145/174644.174646},
doi = {10.1145/174644.174646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rockmore94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ross94,
author = {Kenneth A. Ross},
title = {Modular Stratification and Magic Sets for Datalog Programs with Negation},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1216--1266},
year = {1994},
url = {https://doi.org/10.1145/195613.195646},
doi = {10.1145/195613.195646},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ross94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RossTW94,
author = {Keith W. Ross and
Danny H. K. Tsang and
Jie Wang},
title = {Monte Carlo Summation and Integration Applied to Multiclass Queuing
Networks},
journal = {J. {ACM}},
volume = {41},
number = {6},
pages = {1110--1135},
year = {1994},
url = {https://doi.org/10.1145/195613.195630},
doi = {10.1145/195613.195630},
timestamp = {Thu, 23 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/RossTW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SinghAG94,
author = {Ambuj K. Singh and
James H. Anderson and
Mohamed G. Gouda},
title = {The Elusive Atomic Register},
journal = {J. {ACM}},
volume = {41},
number = {2},
pages = {311--339},
year = {1994},
url = {https://doi.org/10.1145/174652.174657},
doi = {10.1145/174652.174657},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SinghAG94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StorerR94,
author = {James A. Storer and
John H. Reif},
title = {Shortest Paths in the Plane with Polygonal Obstacles},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {982--1012},
year = {1994},
url = {https://doi.org/10.1145/185675.185795},
doi = {10.1145/185675.185795},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/StorerR94.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-24 03:47 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:
