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/jacm27.bht:"
download as .bib file
@article{DBLP:journals/jacm/Abelson80,
author = {Harold Abelson},
title = {Lower Bounds on Information Transfer in Distributed Computations},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {384--392},
year = {1980},
url = {https://doi.org/10.1145/322186.322200},
doi = {10.1145/322186.322200},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Abelson80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AbramsonBL80,
author = {Fred G. Abramson and
Yuri Breitbart and
Forbes D. Lewis},
title = {Complex Properties of Grammars},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {484--498},
year = {1980},
url = {https://doi.org/10.1145/322203.322210},
doi = {10.1145/322203.322210},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AbramsonBL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AltenkampM80,
author = {Doris Altenkamp and
Kurt Mehlhorn},
title = {Codes: Unequal Probabilities, Unequal Letter Cost},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {412--427},
year = {1980},
url = {https://doi.org/10.1145/322203.322205},
doi = {10.1145/322203.322205},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AltenkampM80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AronsonJM80,
author = {Alan R. Aronson and
Barry E. Jacobs and
Jack Minker},
title = {A Note on Fuzzy Deduction},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {599--603},
year = {1980},
url = {https://doi.org/10.1145/322217.322218},
doi = {10.1145/322217.322218},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AronsonJM80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bender80,
author = {Edward A. Bender},
title = {The Number of Fanout-Free Functions with Various Gates},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {181--190},
year = {1980},
url = {https://doi.org/10.1145/322169.322184},
doi = {10.1145/322169.322184},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Bender80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Chow80,
author = {We{-}Min Chow},
title = {The Cycle Time Distribution of Exponential Cyclic Queues},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {281--286},
year = {1980},
url = {https://doi.org/10.1145/322186.322193},
doi = {10.1145/322186.322193},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Chow80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DeMilloEL80,
author = {Richard A. DeMillo and
Stanley C. Eisenstat and
Richard J. Lipton},
title = {Space-Time Trade-Offs in Structured Programming: An Improved Combinatorial
Embedding Theorem},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {123--127},
year = {1980},
url = {https://doi.org/10.1145/322169.322180},
doi = {10.1145/322169.322180},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DeMilloEL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DowneyST80,
author = {Peter J. Downey and
Ravi Sethi and
Robert Endre Tarjan},
title = {Variations on the Common Subexpression Problem},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {758--771},
year = {1980},
url = {https://doi.org/10.1145/322217.322228},
doi = {10.1145/322217.322228},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DowneyST80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EhrenfeuchtR80,
author = {Andrzej Ehrenfeucht and
Grzegorz Rozenberg},
title = {The Sequence Equivalence Problem is Decidable for 0S Systems},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {656--663},
year = {1980},
url = {https://doi.org/10.1145/322217.322222},
doi = {10.1145/322217.322222},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EhrenfeuchtR80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EngelfrietR80,
author = {Joost Engelfriet and
Grzegorz Rozenberg},
title = {Fixed Point Languages, Equality Languages, and Representation of Recursively
Enumerable Languages},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {499--518},
year = {1980},
url = {https://doi.org/10.1145/322203.322211},
doi = {10.1145/322203.322211},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EngelfrietR80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EngelfrietSL80,
author = {Joost Engelfriet and
Erik Meineche Schmidt and
Jan van Leeuwen},
title = {Stack Machines and Classes of Nonnested Macro Languages},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {96--117},
year = {1980},
url = {https://doi.org/10.1145/322169.322178},
doi = {10.1145/322169.322178},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EngelfrietSL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FayolleMI80,
author = {Guy Fayolle and
Isi Mitrani and
R. Iasnogorodski},
title = {Sharing a Processor Among Many Job Classes},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {519--532},
year = {1980},
url = {https://doi.org/10.1145/322203.322212},
doi = {10.1145/322203.322212},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FayolleMI80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FisherH80,
author = {Marshall L. Fisher and
Dorit S. Hochbaum},
title = {Database Location in Computer Networks},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {718--735},
year = {1980},
url = {https://doi.org/10.1145/322217.322226},
doi = {10.1145/322217.322226},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/FisherH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GhezziM80,
author = {Carlo Ghezzi and
Dino Mandrioli},
title = {Augmenting Parsers to Support Incrementality},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {564--579},
year = {1980},
url = {https://doi.org/10.1145/322203.322215},
doi = {10.1145/322203.322215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GhezziM80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GonzalezJ80,
author = {Teofilo F. Gonzalez and
Donald B. Johnson},
title = {A New Algorithm for Preemptive Scheduling of Trees},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {287--312},
year = {1980},
url = {https://doi.org/10.1145/322186.322194},
doi = {10.1145/322186.322194},
timestamp = {Tue, 18 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GonzalezJ80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GrahamYY80,
author = {Ronald L. Graham and
Andrew Chi{-}Chih Yao and
F. Frances Yao},
title = {Information Bounds Are Weak in the Shortest Distance Problem},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {428--444},
year = {1980},
url = {https://doi.org/10.1145/322203.322206},
doi = {10.1145/322203.322206},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/GrahamYY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GreibachF80,
author = {Sheila A. Greibach and
Emily P. Friedman},
title = {Superdeterministic PDAs: {A} Subcase with a Decidable Inclusion problem},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {675--700},
year = {1980},
url = {https://doi.org/10.1145/322217.322224},
doi = {10.1145/322217.322224},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GreibachF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HendersonZ80,
author = {Peter B. Henderson and
Yechezkel Zalcstein},
title = {Synchronization Problems Solvable by Generalized {PV} Systems},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {60--71},
year = {1980},
url = {https://doi.org/10.1145/322169.322175},
doi = {10.1145/322169.322175},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/HendersonZ80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Huet80,
author = {G{\'{e}}rard P. Huet},
title = {Confluent Reductions: Abstract Properties and Applications to Term
Rewriting Systems: Abstract Properties and Applications to Term Rewriting
Systems},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {797--821},
year = {1980},
url = {https://doi.org/10.1145/322217.322230},
doi = {10.1145/322217.322230},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Huet80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JaJa80,
author = {Joseph F. J{\'{a}}J{\'{a}}},
title = {Computations of Bilinear Forms over Finite Fields},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {822--830},
year = {1980},
url = {https://doi.org/10.1145/322217.322231},
doi = {10.1145/322217.322231},
timestamp = {Fri, 02 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/JaJa80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kameda80,
author = {Tiko Kameda},
title = {Testing Deadlock-Freedom of Computer Systems},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {270--280},
year = {1980},
url = {https://doi.org/10.1145/322186.322192},
doi = {10.1145/322186.322192},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kameda80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kannan80,
author = {Ravindran Kannan},
title = {A Polynomial Algorithm for the Two-Variable Integer Programming Problem},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {118--122},
year = {1980},
url = {https://doi.org/10.1145/322169.322179},
doi = {10.1145/322169.322179},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Kannan80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KaplanU80,
author = {Marc A. Kaplan and
Jeffrey D. Ullman},
title = {A Scheme for the Automatic Inference of Variable Types},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {128--145},
year = {1980},
url = {https://doi.org/10.1145/322169.322181},
doi = {10.1145/322169.322181},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KaplanU80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/KrishnaswamyP80,
author = {Ramachandran Krishnaswamy and
Arthur B. Pyster},
title = {On the Correctness of Semantic-Syntax-Directed Translations},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {338--355},
year = {1980},
url = {https://doi.org/10.1145/322186.322197},
doi = {10.1145/322186.322197},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/KrishnaswamyP80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LadnerF80,
author = {Richard E. Ladner and
Michael J. Fischer},
title = {Parallel Prefix Computation},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {831--838},
year = {1980},
url = {https://doi.org/10.1145/322217.322232},
doi = {10.1145/322217.322232},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LadnerF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lee80,
author = {D. T. Lee},
title = {Two-Dimensional Voronoi Diagrams in the L\({}_{\mbox{p}}\)-Metric},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {604--618},
year = {1980},
url = {https://doi.org/10.1145/322217.322219},
doi = {10.1145/322217.322219},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Lee80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LichtensteinS80,
author = {David Lichtenstein and
Michael Sipser},
title = {{GO} Is Polynomial-Space Hard},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {393--401},
year = {1980},
url = {https://doi.org/10.1145/322186.322201},
doi = {10.1145/322186.322201},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LichtensteinS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LiptonRY80,
author = {Richard J. Lipton and
Arnold L. Rosenberg and
Andrew Chi{-}Chih Yao},
title = {External Hashing Schemes for Collections of Data Structures},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {81--95},
year = {1980},
url = {https://doi.org/10.1145/322169.322177},
doi = {10.1145/322169.322177},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LiptonRY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Maier80,
author = {David Maier},
title = {Minimum Covers in Relational Database Model},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {664--674},
year = {1980},
url = {https://doi.org/10.1145/322217.322223},
doi = {10.1145/322217.322223},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Maier80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MendelsonY80,
author = {Haim Mendelson and
Uri Yechiali},
title = {A New Approach to the Analysis of Linear Probing Schemes},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {474--483},
year = {1980},
url = {https://doi.org/10.1145/322203.322209},
doi = {10.1145/322203.322209},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/MendelsonY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NassimiS80,
author = {David Nassimi and
Sartaj Sahni},
title = {An optimal routing algorithm for mesh-connected Parallel computers},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {6--29},
year = {1980},
url = {https://doi.org/10.1145/322169.322172},
doi = {10.1145/322169.322172},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NassimiS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NelsonO80,
author = {Greg Nelson and
Derek C. Oppen},
title = {Fast Decision Procedures Based on Congruence Closure},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {356--364},
year = {1980},
url = {https://doi.org/10.1145/322186.322198},
doi = {10.1145/322186.322198},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/NelsonO80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Oppen80,
author = {Derek C. Oppen},
title = {Reasoning About Recursively Defined Data Structures},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {403--411},
year = {1980},
url = {https://doi.org/10.1145/322203.322204},
doi = {10.1145/322203.322204},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Oppen80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PapadimitriouK80,
author = {Christos H. Papadimitriou and
Paris C. Kanellakis},
title = {Flowshop scheduling with limited temporary storage},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {533--549},
year = {1980},
url = {https://doi.org/10.1145/322203.322213},
doi = {10.1145/322203.322213},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PapadimitriouK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Parchmann80,
author = {Rainer Parchmann},
title = {Corrigendum: "Control System Model for Critically Timed Success"},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {402},
year = {1980},
url = {https://doi.org/10.1145/322186.322202},
doi = {10.1145/322186.322202},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Parchmann80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Pawlikowski80,
author = {Krzysztof Pawlikowski},
title = {Message Waiting Time in a Packet Switching System},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {30--41},
year = {1980},
url = {https://doi.org/10.1145/322169.322173},
doi = {10.1145/322169.322173},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Pawlikowski80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PeaseSL80,
author = {Marshall C. Pease and
Robert E. Shostak and
Leslie Lamport},
title = {Reaching Agreement in the Presence of Faults},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {228--234},
year = {1980},
url = {https://doi.org/10.1145/322186.322188},
doi = {10.1145/322186.322188},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PeaseSL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PrabhalaS80,
author = {Bhaskaram Prabhala and
Ravi Sethi},
title = {Efficient Computation of Expressions with Common Subexpressions},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {146--163},
year = {1980},
url = {https://doi.org/10.1145/322169.322182},
doi = {10.1145/322169.322182},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PrabhalaS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Proskurowski80,
author = {Andrzej Proskurowski},
title = {On the Generation of Binary Trees},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {1--2},
year = {1980},
url = {https://doi.org/10.1145/322169.322170},
doi = {10.1145/322169.322170},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Proskurowski80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ramakrishnan80,
author = {K. G. Ramakrishnan},
title = {Solving Two-Commodity Transportation Problems with Coupling Constraints},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {736--757},
year = {1980},
url = {https://doi.org/10.1145/322217.322227},
doi = {10.1145/322217.322227},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Ramakrishnan80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/RaoultV80,
author = {Jean{-}Claude Raoult and
Jean Vuillemin},
title = {Operational and Semantic Equivalence Between Recursive Programs},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {772--796},
year = {1980},
url = {https://doi.org/10.1145/322217.322229},
doi = {10.1145/322217.322229},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/RaoultV80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reischuk80,
author = {R{\"{u}}diger Reischuk},
title = {Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble
Game},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {839--849},
year = {1980},
url = {https://doi.org/10.1145/322217.322233},
doi = {10.1145/322217.322233},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reischuk80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ReiserL80,
author = {Martin Reiser and
Stephen S. Lavenberg},
title = {Mean-Value Analysis of Closed Multichain Queuing Networks},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {313--322},
year = {1980},
url = {https://doi.org/10.1145/322186.322195},
doi = {10.1145/322186.322195},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ReiserL80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reiter80,
author = {Raymond Reiter},
title = {Equality and Domain Closure in First-Order Databases},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {235--249},
year = {1980},
url = {https://doi.org/10.1145/322186.322189},
doi = {10.1145/322186.322189},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reiter80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sagiv80,
author = {Yehoshua Sagiv},
title = {An Algorithm for Inferring Multivalued Dependencies with an Application
to Propositional Logic},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {250--262},
year = {1980},
url = {https://doi.org/10.1145/322186.322190},
doi = {10.1145/322186.322190},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Sagiv80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SagivY80,
author = {Yehoshua Sagiv and
Mihalis Yannakakis},
title = {Equivalences Among Relational Expressions with the Union and Difference
Operators},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {633--655},
year = {1980},
url = {https://doi.org/10.1145/322217.322221},
doi = {10.1145/322217.322221},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SagivY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SahniC80,
author = {Sartaj Sahni and
Yookun Cho},
title = {Scheduling Independent Tasks with Due Times on a Uniform Processor
System},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {550--563},
year = {1980},
url = {https://doi.org/10.1145/322203.322214},
doi = {10.1145/322203.322214},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SahniC80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Schwartz80,
author = {Jacob T. Schwartz},
title = {Fast Probabilistic Algorithms for Verification of Polynomial Identities},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {701--717},
year = {1980},
url = {https://doi.org/10.1145/322217.322225},
doi = {10.1145/322217.322225},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Schwartz80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SethiT80,
author = {Ravi Sethi and
Adrian Tang},
title = {Constructing Call-by-Value Continuation Semantics},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {580--597},
year = {1980},
url = {https://doi.org/10.1145/322203.322216},
doi = {10.1145/322203.322216},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SethiT80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Shiloach80,
author = {Yossi Shiloach},
title = {A Polynomial Solution to the Undirected Two Paths Problem},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {445--456},
year = {1980},
url = {https://doi.org/10.1145/322203.322207},
doi = {10.1145/322203.322207},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Shiloach80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SilberschatzK80,
author = {Abraham Silberschatz and
Zvi M. Kedem},
title = {Consistency in Hierarchical Database Systems},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {72--80},
year = {1980},
url = {https://doi.org/10.1145/322169.322176},
doi = {10.1145/322169.322176},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SilberschatzK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SolomonF80,
author = {Marvin H. Solomon and
Raphael A. Finkel},
title = {A Note on Enumerating Binary Trees},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {3--5},
year = {1980},
url = {https://doi.org/10.1145/322169.322171},
doi = {10.1145/322169.322171},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SolomonF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SuzukiJ80,
author = {Norihisa Suzuki and
David Jefferson},
title = {Verification Decidability of Presburger Array Programs},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {191--205},
year = {1980},
url = {https://doi.org/10.1145/322169.322185},
doi = {10.1145/322169.322185},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SuzukiJ80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Swartz80,
author = {G. Boyd Swartz},
title = {Polling in a Loop System},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {42--59},
year = {1980},
url = {https://doi.org/10.1145/322169.322174},
doi = {10.1145/322169.322174},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Swartz80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Towsley80,
author = {Donald F. Towsley},
title = {Queuing Network Models with State-Dependent Routing},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {323--337},
year = {1980},
url = {https://doi.org/10.1145/322186.322196},
doi = {10.1145/322186.322196},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/Towsley80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TrivediWS80,
author = {Kishor S. Trivedi and
Robert A. Wagner and
Timothy M. Sigmon},
title = {Optimal Selection of {CPU} Speed, Device Capacities, and File Assignments},
journal = {J. {ACM}},
volume = {27},
number = {3},
pages = {457--473},
year = {1980},
url = {https://doi.org/10.1145/322203.322208},
doi = {10.1145/322203.322208},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/TrivediWS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TsukiyamaSOA80,
author = {Shuji Tsukiyama and
Isao Shirakawa and
Hiroshi Ozaki and
Hiromu Ariyoshi},
title = {An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per
Cutset},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {619--632},
year = {1980},
url = {https://doi.org/10.1145/322217.322220},
doi = {10.1145/322217.322220},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/TsukiyamaSOA80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Wand80,
author = {Mitchell Wand},
title = {Continuation-Based Program Transformation Strategies},
journal = {J. {ACM}},
volume = {27},
number = {1},
pages = {164--180},
year = {1980},
url = {https://doi.org/10.1145/322169.322183},
doi = {10.1145/322169.322183},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Wand80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/WardH80,
author = {Stephen A. Ward and
Robert H. Halstead Jr.},
title = {A Syntactic Theory of Message Passing},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {365--383},
year = {1980},
url = {https://doi.org/10.1145/322186.322199},
doi = {10.1145/322186.322199},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/WardH80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Wasilkowski80,
author = {Grzegorz W. Wasilkowski},
title = {Can Any Stationary Iteration Using Linear Information Be Globally
Convergent?},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {263--269},
year = {1980},
url = {https://doi.org/10.1145/322186.322191},
doi = {10.1145/322186.322191},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Wasilkowski80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yao80,
author = {Andrew Chi{-}Chih Yao},
title = {New Algorithms for Bin Packing},
journal = {J. {ACM}},
volume = {27},
number = {2},
pages = {207--227},
year = {1980},
url = {https://doi.org/10.1145/322186.322187},
doi = {10.1145/322186.322187},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yao80.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-06-02 07:43 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:
