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/jacm30.bht:"
download as .bib file
@article{DBLP:journals/jacm/Apt83,
author = {Krzysztof R. Apt},
title = {Formal Justification of a Proof System for Communicating Sequential
Processes},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {197--216},
year = {1983},
url = {https://doi.org/10.1145/322358.322372},
doi = {10.1145/322358.322372},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Apt83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArjomandiFL83,
author = {Eshrat Arjomandi and
Michael J. Fischer and
Nancy A. Lynch},
title = {Efficiency of Synchronous Versus Asynchronous Distributed Systems},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {449--456},
year = {1983},
url = {https://doi.org/10.1145/2402.322387},
doi = {10.1145/2402.322387},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ArjomandiFL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AusielloDS83,
author = {Giorgio Ausiello and
Alessandro D'Atri and
Domenico Sacc{\`{a}}},
title = {Graph Algorithms for Functional Dependency Manipulation},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {752--766},
year = {1983},
url = {https://doi.org/10.1145/2157.322404},
doi = {10.1145/2157.322404},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AusielloDS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BagchiM83,
author = {Amitava Bagchi and
A. Mahanti},
title = {Search Algorithms Under Different Kinds of Heuristics-A Comparative
Study},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {1--21},
year = {1983},
url = {https://doi.org/10.1145/322358.322359},
doi = {10.1145/322358.322359},
timestamp = {Thu, 26 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BagchiM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeeriFMY83,
author = {Catriel Beeri and
Ronald Fagin and
David Maier and
Mihalis Yannakakis},
title = {On the Desirability of Acyclic Database Schemes},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {479--513},
year = {1983},
url = {https://doi.org/10.1145/2402.322389},
doi = {10.1145/2402.322389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeeriFMY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrandZ83,
author = {Daniel Brand and
Pitro Zafiropulo},
title = {On Communicating Finite-State Machines},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {323--342},
year = {1983},
url = {https://doi.org/10.1145/322374.322380},
doi = {10.1145/322374.322380},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BrandZ83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Champeaux83,
author = {Dennis de Champeaux},
title = {Bidirectional Heuristic Search Again},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {22--32},
year = {1983},
url = {https://doi.org/10.1145/322358.322360},
doi = {10.1145/322358.322360},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Champeaux83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChandyM83,
author = {K. Mani Chandy and
Alain J. Martin},
title = {A Characterization of Product-Form Queuing Networks},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {286--299},
year = {1983},
url = {https://doi.org/10.1145/322374.322378},
doi = {10.1145/322374.322378},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ChandyM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ClarkeGH83,
author = {Edmund M. Clarke and
Steven M. German and
Joseph Y. Halpern},
title = {Effective Axiomatizations of Hoare Logics},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {612--636},
year = {1983},
url = {https://doi.org/10.1145/2402.322394},
doi = {10.1145/2402.322394},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ClarkeGH83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CoffmanS83,
author = {Edward G. Coffman Jr. and
Ravi Sethi},
title = {Instruction Sets for Evaluating Arithmetic Expressions},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {457--478},
year = {1983},
url = {https://doi.org/10.1145/2402.322388},
doi = {10.1145/2402.322388},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CoffmanS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Fagin83,
author = {Ronald Fagin},
title = {Degrees of Acyclicity for Hypergraphs and Relational Database Schemes},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {514--550},
year = {1983},
url = {https://doi.org/10.1145/2402.322390},
doi = {10.1145/2402.322390},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Fagin83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FortuneLO83,
author = {Steven Fortune and
Daniel Leivant and
Michael J. O'Donnell},
title = {The Expressiveness of Simple and Second-Order Type Structures},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {151--185},
year = {1983},
url = {https://doi.org/10.1145/322358.322370},
doi = {10.1145/322358.322370},
timestamp = {Thu, 01 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/FortuneLO83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Frederickson83,
author = {Greg N. Frederickson},
title = {Implicit Data Structures for the Dictionary Problem},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {80--94},
year = {1983},
url = {https://doi.org/10.1145/322358.322364},
doi = {10.1145/322358.322364},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Frederickson83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GalilP83,
author = {Zvi Galil and
Wolfgang J. Paul},
title = {An Efficient General-Purpose Parallel Computer},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {360--387},
year = {1983},
url = {https://doi.org/10.1145/322374.322382},
doi = {10.1145/322374.322382},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GalilP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gati83,
author = {Georg Gati},
title = {The Complexity of Solving Polynomial Equations by Quadrature},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {637--640},
year = {1983},
url = {https://doi.org/10.1145/2402.322395},
doi = {10.1145/2402.322395},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gati83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gavish83,
author = {Bezalel Gavish},
title = {Formulations and Algorithms for the Capacitated Minimal Directed Tree
Problem},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {118--132},
year = {1983},
url = {https://doi.org/10.1145/322358.322367},
doi = {10.1145/322358.322367},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gavish83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoodmanS83,
author = {Nathan Goodman and
Oded Shmueli},
title = {Syntactic Characterization of Tree Database Schemas},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {767--786},
year = {1983},
url = {https://doi.org/10.1145/2157.322405},
doi = {10.1145/2157.322405},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoodmanS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gusfield83,
author = {Dan Gusfield},
title = {Parametric Combinatorial Computing and a Problem of Program Module
Distribution},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {551--563},
year = {1983},
url = {https://doi.org/10.1145/2402.322391},
doi = {10.1145/2402.322391},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Gusfield83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hajek83,
author = {Bruce E. Hajek},
title = {The Proof of a Folk Theorem on Queuing Delay with Applications to
Routing in Networks},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {834--851},
year = {1983},
url = {https://doi.org/10.1145/2157.322409},
doi = {10.1145/2157.322409},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Hajek83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HongMR83,
author = {Jia{-}Wei Hong and
Kurt Mehlhorn and
Arnold L. Rosenberg},
title = {Cost Trade-offs in Graph Embeddings, with Applications},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {709--728},
year = {1983},
url = {https://doi.org/10.1145/2157.322401},
doi = {10.1145/2157.322401},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HongMR83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IbaraL83,
author = {Oscar H. Ibarra and
Brian S. Leininger},
title = {On the Simplification and Equivalence Problems for Straight-Line Programs},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {641--656},
year = {1983},
url = {https://doi.org/10.1145/2402.322396},
doi = {10.1145/2402.322396},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/IbaraL83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IbarakiAK83,
author = {Toshihide Ibaraki and
Hussein M. Abdel{-}Wahab and
Tiko Kameda},
title = {Design of Minimum-Cost Deadlock-Free Systems},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {736--751},
year = {1983},
url = {https://doi.org/10.1145/2157.322403},
doi = {10.1145/2157.322403},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/IbarakiAK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/IbarraM83,
author = {Oscar H. Ibarra and
Shlomo Moran},
title = {Probabilistic Algorithms for Deciding Equivalence of Straight-Line
Programs},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {217--228},
year = {1983},
url = {https://doi.org/10.1145/322358.322373},
doi = {10.1145/322358.322373},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/IbarraM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JaJa83,
author = {Joseph F. J{\'{a}}J{\'{a}}},
title = {Time-Space Trade-offs for Some Algebraic Problems},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {657--667},
year = {1983},
url = {https://doi.org/10.1145/2402.2403},
doi = {10.1145/2402.2403},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JaJa83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jaffe83,
author = {Jeffrey M. Jaffe},
title = {Decentralized Simulation of Resource Managers},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {300--322},
year = {1983},
url = {https://doi.org/10.1145/322374.322379},
doi = {10.1145/322374.322379},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Jaffe83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kannan83,
author = {Ravindran Kannan},
title = {Polynomial-Time Aggregation of Integer Programming Problems},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {133--145},
year = {1983},
url = {https://doi.org/10.1145/322358.322368},
doi = {10.1145/322358.322368},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kannan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KedemS83,
author = {Zvi M. Kedem and
Abraham Silberschatz},
title = {Locking Protocols: From Exclusive to Shared Locks},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {787--804},
year = {1983},
url = {https://doi.org/10.1145/2157.322406},
doi = {10.1145/2157.322406},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KedemS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Klug83,
author = {Anthony C. Klug},
title = {Locking Expressions for Increased Database Concurrency},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {36--54},
year = {1983},
url = {https://doi.org/10.1145/322358.322362},
doi = {10.1145/322358.322362},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Klug83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Korth83,
author = {Henry F. Korth},
title = {Locking Primitives in a Database System},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {55--79},
year = {1983},
url = {https://doi.org/10.1145/322358.322363},
doi = {10.1145/322358.322363},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Korth83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KrevnerY83,
author = {Yael Krevner and
Amiram Yehudai},
title = {An Iteration Theorem for Simple Precedence Languages},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {820--833},
year = {1983},
url = {https://doi.org/10.1145/2157.322408},
doi = {10.1145/2157.322408},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KrevnerY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lamport83,
author = {Leslie Lamport},
title = {The Weak Byzantine Generals Problem},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {668--676},
year = {1983},
url = {https://doi.org/10.1145/2402.322398},
doi = {10.1145/2402.322398},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lamport83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Larson83,
author = {Per{-}{\AA}ke Larson},
title = {Analysis of Uniform Hashing},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {805--819},
year = {1983},
url = {https://doi.org/10.1145/2157.322407},
doi = {10.1145/2157.322407},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Larson83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LordKK83,
author = {Robert E. Lord and
Janusz S. Kowalik and
Swarn P. Kumar},
title = {Solving Linear Algebraic Equations on an {MIMD} Computer},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {103--117},
year = {1983},
url = {https://doi.org/10.1145/322358.322366},
doi = {10.1145/322358.322366},
timestamp = {Wed, 10 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/LordKK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MatulaB83,
author = {David W. Matula and
Leland L. Beck},
title = {Smallest-Last Ordering and clustering and Graph Coloring Algorithms},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {417--427},
year = {1983},
url = {https://doi.org/10.1145/2402.322385},
doi = {10.1145/2402.322385},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MatulaB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MaurerSW83,
author = {Hermann A. Maurer and
Arto Salomaa and
Derick Wood},
title = {A Supernormal-Form Theorem for Context-Free Grammars},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {95--102},
year = {1983},
url = {https://doi.org/10.1145/322358.322365},
doi = {10.1145/322358.322365},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MaurerSW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Megiddo83,
author = {Nimrod Megiddo},
title = {Applying Parallel Computation Algorithms in the Design of Serial Algorithms},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {852--865},
year = {1983},
url = {https://doi.org/10.1145/2157.322410},
doi = {10.1145/2157.322410},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Megiddo83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Mei-ruiDB83,
author = {Xu Mei{-}Rui and
John E. Donner and
Ronald V. Book},
title = {Refining Nondeterminism in Relativizations of Complexity Classes},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {677--685},
year = {1983},
url = {https://doi.org/10.1145/2402.322399},
doi = {10.1145/2402.322399},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Mei-ruiDB83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Nau83,
author = {Dana S. Nau},
title = {Decision Quality As a Function of Search Depth on Game Trees},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {687--708},
year = {1983},
url = {https://doi.org/10.1145/2157.322400},
doi = {10.1145/2157.322400},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Nau83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Nourani83,
author = {Cyrus F. Nourani},
title = {Abstract Implementations and Their Correctness Proofs},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {343--359},
year = {1983},
url = {https://doi.org/10.1145/322374.322381},
doi = {10.1145/322374.322381},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Nourani83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RaoultS83,
author = {Jean{-}Claude Raoult and
Ravi Sethi},
title = {Properties of a Notation for Combining Functions},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {595--611},
year = {1983},
url = {https://doi.org/10.1145/2402.322393},
doi = {10.1145/2402.322393},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RaoultS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rosenberg83,
author = {Arnold L. Rosenberg},
title = {Three-Dimensional {VLSI:} {A} Case Study},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {397--416},
year = {1983},
url = {https://doi.org/10.1145/2402.322384},
doi = {10.1145/2402.322384},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Rosenberg83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sarwate83,
author = {Dilip V. Sarwate},
title = {A Note on "A Note on Multiple Error Detection in {ASCII} Numeric Data
Communication"},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {33--35},
year = {1983},
url = {https://doi.org/10.1145/322358.322361},
doi = {10.1145/322358.322361},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Sarwate83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SchassbergerD83,
author = {Rolf Schassberger and
Hans Daduna},
title = {The Time for a Round Trip in a Cycle of Exponential Queues},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {146--150},
year = {1983},
url = {https://doi.org/10.1145/322358.322369},
doi = {10.1145/322358.322369},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SchassbergerD83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SippuSU83,
author = {Seppo Sippu and
Eljas Soisalon{-}Soininen and
Esko Ukkonen},
title = {The Complexity of LALR(k) Testing},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {259--270},
year = {1983},
url = {https://doi.org/10.1145/322374.322376},
doi = {10.1145/322374.322376},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SippuSU83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Stewart83,
author = {G. W. Stewart},
title = {Computable Error Bounds for Aggregated Markov Chains},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {271--285},
year = {1983},
url = {https://doi.org/10.1145/322374.322377},
doi = {10.1145/322374.322377},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Stewart83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Strong83,
author = {H. Raymond Strong},
title = {Vector Execution of Flow Graphs},
journal = {J. {ACM}},
volume = {30},
number = {1},
pages = {186--196},
year = {1983},
url = {https://doi.org/10.1145/322358.322371},
doi = {10.1145/322358.322371},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Strong83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Supowit83,
author = {Kenneth J. Supowit},
title = {The Relative Neighborhood Graph, with an Application to Minimum Spanning
Trees},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {428--448},
year = {1983},
url = {https://doi.org/10.1145/2402.322386},
doi = {10.1145/2402.322386},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Supowit83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Suri83,
author = {Rajan Suri},
title = {Robustness of Queuing Network Formulas},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {564--594},
year = {1983},
url = {https://doi.org/10.1145/2402.2995},
doi = {10.1145/2402.2995},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Suri83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tarsi83,
author = {Michael Tarsi},
title = {Optimal Search on Some Game Trees},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {389--396},
year = {1983},
url = {https://doi.org/10.1145/2402.322383},
doi = {10.1145/2402.322383},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Tarsi83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Vitter83,
author = {Jeffrey Scott Vitter},
title = {Analysis of the Search Performance of Coalesced Hashing},
journal = {J. {ACM}},
volume = {30},
number = {2},
pages = {231--258},
year = {1983},
url = {https://doi.org/10.1145/322374.322375},
doi = {10.1145/322374.322375},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Vitter83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Wigderson83,
author = {Avi Wigderson},
title = {Improving the Performance Guarantee for Approximate Graph Coloring},
journal = {J. {ACM}},
volume = {30},
number = {4},
pages = {729--735},
year = {1983},
url = {https://doi.org/10.1145/2157.2158},
doi = {10.1145/2157.2158},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Wigderson83.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-30 09:24 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:
