Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/jacm/Angluin82,
  author       = {Dana Angluin},
  title        = {Inference of Reversible Languages},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {741--765},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322334},
  doi          = {10.1145/322326.322334},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Angluin82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AptE82,
  author       = {Krzysztof R. Apt and
                  Maarten H. van Emden},
  title        = {Contributions to the Theory of Logic Programming},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {841--862},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322339},
  doi          = {10.1145/322326.322339},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/AptE82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArbibM82,
  author       = {Michael A. Arbib and
                  Ernest G. Manes},
  title        = {The Pattern-of-Calls Expansion Is the Canonical Fixpoint for Recursive
                  Definitions},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {577--602},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322325},
  doi          = {10.1145/322307.322325},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/ArbibM82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BaderM82,
  author       = {Christopher Bader and
                  Arnaldo Moura},
  title        = {A Generalization of Ogden's Lemma},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {404--407},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322315},
  doi          = {10.1145/322307.322315},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BaderM82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Beatty82,
  author       = {John C. Beatty},
  title        = {On the relationship between {LL(1)} and {LR(1)} grammars},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1007--1022},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322350},
  doi          = {10.1145/322344.322350},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Beatty82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeckerPS82,
  author       = {Ronald I. Becker and
                  Stephen R. Schach and
                  Yehoshua Perl},
  title        = {A Shifting Algorithm for Min-Max Tree Partitioning},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {58--67},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322294},
  doi          = {10.1145/322290.322294},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BeckerPS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Book82,
  author       = {Ronald V. Book},
  title        = {Confluent and Other Types of Thue Systems},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {171--182},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322301},
  doi          = {10.1145/322290.322301},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Book82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BrentK82,
  author       = {Richard P. Brent and
                  H. T. Kung},
  title        = {Corrigendum: "The Area-Time Complexity of Binary Multiplication"},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {904},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322343},
  doi          = {10.1145/322326.322343},
  timestamp    = {Tue, 28 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/BrentK82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Brown82,
  author       = {Theodore Brown},
  title        = {Determination of the conditional response for quantum allocation algorithms},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {448--460},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322318},
  doi          = {10.1145/322307.322318},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Brown82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Bryant82,
  author       = {Raymond M. Bryant},
  title        = {Maximum Processing Rates of Memory Bound Systems},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {461--477},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322319},
  doi          = {10.1145/322307.322319},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Bryant82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BurnsJLFP82,
  author       = {James E. Burns and
                  Paul Jackson and
                  Nancy A. Lynch and
                  Michael J. Fischer and
                  Gary L. Peterson},
  title        = {Data Requirements for Implementation of N-Process Mutual Exclusion
                  Using a Single Shared Variable},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {183--205},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322302},
  doi          = {10.1145/322290.322302},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BurnsJLFP82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChowY82,
  author       = {D. Chow and
                  Clement T. Yu},
  title        = {On the Construction of Feedback Queries},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {127--151},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322299},
  doi          = {10.1145/322290.322299},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/ChowY82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CohenHK82,
  author       = {Jacques Cohen and
                  Timothy J. Hickey and
                  Joel Katcoff},
  title        = {Upper Bounds for Speedup in Parallel Parsing},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {408--428},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322316},
  doi          = {10.1145/322307.322316},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/CohenHK82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ehrich82,
  author       = {Hans{-}Dieter Ehrich},
  title        = {On the Theory of Specification, Implementation, and Parametrization
                  of Abstract Data Types},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {206--227},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322303},
  doi          = {10.1145/322290.322303},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ehrich82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ErnstG82,
  author       = {George W. Ernst and
                  Michael M. Goldstein},
  title        = {Mechanical Discovery of Classes of Problem-Solving Strategies},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {1--23},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322291},
  doi          = {10.1145/322290.322291},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/ErnstG82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Fagin82,
  author       = {Ronald Fagin},
  title        = {Horn clauses and database dependencies},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {952--985},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322347},
  doi          = {10.1145/322344.322347},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Fagin82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/FloydU82,
  author       = {Robert W. Floyd and
                  Jeffrey D. Ullman},
  title        = {The Compilation of Regular Expressions into Integrated Circuits},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {603--622},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322327},
  doi          = {10.1145/322326.322327},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/FloydU82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Fredman82,
  author       = {Michael L. Fredman},
  title        = {The Complexity of Maintaining an Array and Computing Its Partial Sums},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {250--260},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322305},
  doi          = {10.1145/322290.322305},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Fredman82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Freuder82,
  author       = {Eugene C. Freuder},
  title        = {A Sufficient Condition for Backtrack-Free Search},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {24--32},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322292},
  doi          = {10.1145/322290.322292},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Freuder82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Gabow82,
  author       = {Harold N. Gabow},
  title        = {An Almost-Linear Algorithm for Two-Processor Scheduling},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {766--780},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322335},
  doi          = {10.1145/322326.322335},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Gabow82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Galil82,
  author       = {Zvi Galil},
  title        = {An Almost Linear-Time Algorithm for Computing a Dependency Basis in
                  a Relational Database},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {96--102},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322296},
  doi          = {10.1145/322290.322296},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Galil82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GinsburgZ82,
  author       = {Seymour Ginsburg and
                  Sami Mohammed Zaiddan},
  title        = {Properties of functional-dependency families},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {678--698},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322331},
  doi          = {10.1145/322326.322331},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GinsburgZ82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Goldschlager82,
  author       = {Leslie M. Goldschlager},
  title        = {A universal interconnection pattern for parallel computers},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1073--1086},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322353},
  doi          = {10.1145/322344.322353},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Goldschlager82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GrantJ82,
  author       = {John Grant and
                  Barry E. Jacobs},
  title        = {On the family of generalized dependency constraints},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {986--997},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322348},
  doi          = {10.1145/322344.322348},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GrantJ82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GurariI82,
  author       = {Eitan M. Gurari and
                  Oscar H. Ibarra},
  title        = {Two-Way Counter Machines and Diophantine Equations},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {863--873},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322340},
  doi          = {10.1145/322326.322340},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/GurariI82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/HoffmannO82,
  author       = {Christoph M. Hoffmann and
                  Michael J. O'Donnell},
  title        = {Pattern Matching in Trees},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {68--95},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322295},
  doi          = {10.1145/322290.322295},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/HoffmannO82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Honeyman82,
  author       = {Peter Honeyman},
  title        = {Testing satisfaction of functional dependencies},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {668--677},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322330},
  doi          = {10.1145/322326.322330},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Honeyman82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hunt82,
  author       = {Harry B. Hunt III},
  title        = {On the Complexity of Flowchart and Loop Program Schemes and Programming
                  Languages},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {228--249},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322304},
  doi          = {10.1145/322290.322304},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Hunt82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Hunt82a,
  author       = {Harry B. Hunt III},
  title        = {On the Decidability of Grammar Problems},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {429--447},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322317},
  doi          = {10.1145/322307.322317},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Hunt82a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Jacobs82,
  author       = {Barry E. Jacobs},
  title        = {On Database Logic},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {310--332},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322310},
  doi          = {10.1145/322307.322310},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Jacobs82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JerrumS82,
  author       = {Mark Jerrum and
                  Marc Snir},
  title        = {Some Exact Complexity Results for Straight-Line Computations over
                  Semirings},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {874--897},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322341},
  doi          = {10.1145/322326.322341},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/JerrumS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Kameda82,
  author       = {Hisao Kameda},
  title        = {A Finite-Source Queue with Different Customers},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {478--491},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322320},
  doi          = {10.1145/322307.322320},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Kameda82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Klug82,
  author       = {Anthony C. Klug},
  title        = {Equivalence of Relational Algebra and Relational Calculus Query Languages
                  Having Aggregate Functions},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {699--717},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322332},
  doi          = {10.1145/322326.322332},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Klug82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lam82,
  author       = {Simon S. Lam},
  title        = {Dynamic Scaling and Growth Behavior of Queuing Network Normalization
                  Constants},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {492--513},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322321},
  doi          = {10.1145/322307.322321},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Lam82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LengauerT82,
  author       = {Thomas Lengauer and
                  Robert Endre Tarjan},
  title        = {Asymptotically tight bounds on time-space trade-offs in a pebble game},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1087--1130},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322354},
  doi          = {10.1145/322344.322354},
  timestamp    = {Thu, 13 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/LengauerT82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lien82,
  author       = {Y. Edmund Lien},
  title        = {On the Equivalence of Database Models},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {333--362},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322311},
  doi          = {10.1145/322307.322311},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Lien82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Lloyd82,
  author       = {Errol L. Lloyd},
  title        = {Critical Path Scheduling with Resource and Processor Constraints},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {781--811},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322336},
  doi          = {10.1145/322326.322336},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Lloyd82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Martel82,
  author       = {Charles U. Martel},
  title        = {Preemptive Scheduling with Release Times, Deadlines, and Due Times},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {812--829},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322337},
  doi          = {10.1145/322326.322337},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Martel82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Matula82,
  author       = {David W. Matula},
  title        = {Basic digit sets for radix representation},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1131--1143},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322355},
  doi          = {10.1145/322344.322355},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Matula82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MaurerSW82,
  author       = {Hermann A. Maurer and
                  Arto Salomaa and
                  Derick Wood},
  title        = {Dense Hierarchies of Grammatical Families},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {118--126},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322298},
  doi          = {10.1145/322290.322298},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/MaurerSW82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/McDermott82,
  author       = {Drew V. McDermott},
  title        = {Nonmonotonic Logic {II:} Nonmonotonic Modal Theories},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {33--57},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322293},
  doi          = {10.1145/322290.322293},
  timestamp    = {Thu, 23 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/McDermott82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MeyerH82,
  author       = {Albert R. Meyer and
                  Joseph Y. Halpern},
  title        = {Axiomatic Definitions of Programming Languages: {A} Theoretical Assessment},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {555--576},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322324},
  doi          = {10.1145/322307.322324},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/MeyerH82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Minoura82,
  author       = {Toshimi Minoura},
  title        = {Deadlock avoidance revisited},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1023--1048},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322351},
  doi          = {10.1145/322344.322351},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Minoura82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/NassimiS82,
  author       = {David Nassimi and
                  Sartaj Sahni},
  title        = {Parallel permutation and sorting algorithms and a new generalized
                  connection network},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {642--667},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322329},
  doi          = {10.1145/322326.322329},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/NassimiS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Papadimitriou82,
  author       = {Christos H. Papadimitriou},
  title        = {A theorem in database concurrency control},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {998--1006},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322349},
  doi          = {10.1145/322344.322349},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Papadimitriou82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PapadimitriouY82,
  author       = {Christos H. Papadimitriou and
                  Mihalis Yannakakis},
  title        = {The complexity of restricted spanning tree problems},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {285--309},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322309},
  doi          = {10.1145/322307.322309},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/PapadimitriouY82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Rackoff82,
  author       = {Charles Rackoff},
  title        = {Relativized Questions Involving Probabilistic Algorithms},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {261--268},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322306},
  doi          = {10.1145/322290.322306},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Rackoff82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ruschitzka82,
  author       = {Manfred Ruschitzka},
  title        = {The Performance of Job Classes with Distinct Policy Functions},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {514--526},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322322},
  doi          = {10.1145/322307.322322},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ruschitzka82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SadriU82,
  author       = {Fereidoon Sadri and
                  Jeffrey D. Ullman},
  title        = {Template Dependencies: {A} Large Class of Dependencies in Relational
                  Databases and Its Complete Axiomatization},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {363--372},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322312},
  doi          = {10.1145/322307.322312},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SadriU82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SagivW82,
  author       = {Yehoshua Sagiv and
                  Scott F. Walecka},
  title        = {Subset Dependencies and a Completeness Result for a Subclass of Embedded
                  Multivalued Dependencies},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {103--117},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322297},
  doi          = {10.1145/322290.322297},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/SagivW82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SamelsonB82,
  author       = {Christopher L. Samelson and
                  William G. Bulgren},
  title        = {A Note on Product-Form Solution for Queuing Networks with Poisson
                  Arrivals and General Service-Time Distributions with Finite Means},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {830--840},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322338},
  doi          = {10.1145/322326.322338},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/SamelsonB82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sciore82,
  author       = {Edward Sciore},
  title        = {A Complete Axiomatization of Full Join Dependencies},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {373--393},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322313},
  doi          = {10.1145/322307.322313},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/Sciore82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Sethi82,
  author       = {Ravi Sethi},
  title        = {Useless Actions Make a Difference: Strict Serializability of Database
                  Updates},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {394--403},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322314},
  doi          = {10.1145/322307.322314},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Sethi82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Smith82,
  author       = {Carl H. Smith},
  title        = {The Power of Pluralism for Automatic Program Synthesis},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1144--1165},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322356},
  doi          = {10.1145/322344.322356},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Smith82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Stark82,
  author       = {Eugene W. Stark},
  title        = {Semaphore primitives and starvation-free mutual exclusion},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1049--1072},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322352},
  doi          = {10.1145/322344.322352},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Stark82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StorerS82,
  author       = {James A. Storer and
                  Thomas G. Szymanski},
  title        = {Data compression via textual substitution},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {928--951},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322346},
  doi          = {10.1145/322344.322346},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/StorerS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TakamizawaNS82,
  author       = {K. Takamizawa and
                  Takao Nishizeki and
                  Nobuji Saito},
  title        = {Linear-time computability of combinatorial problems on series-parallel
                  graphs},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {623--641},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322328},
  doi          = {10.1145/322326.322328},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/TakamizawaNS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Tobagi82,
  author       = {Fouad A. Tobagi},
  title        = {Distributions of packet delay and interdeparture time in slotted {ALOHA}
                  and carrier sense multiple access},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {907--927},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322345},
  doi          = {10.1145/322344.322345},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Tobagi82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TzelnicG82,
  author       = {Percy Tzelnic and
                  Izidor Gertner},
  title        = {An Approach to Program Behavior Modeling and Optimal Memory Control},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {527--554},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322323},
  doi          = {10.1145/322307.322323},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/TzelnicG82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Ukkonen82,
  author       = {Esko Ukkonen},
  title        = {The equivalence problem for some non-real-time deterministic pushdown
                  automata},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {4},
  pages        = {1166--1181},
  year         = {1982},
  url          = {https://doi.org/10.1145/322344.322357},
  doi          = {10.1145/322344.322357},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Ukkonen82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Winker82,
  author       = {Steve Winker},
  title        = {Generation and Verification of Finite Models and Counterexamples Using
                  an Automated Theorem Prover Answering Two Open Questions},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {2},
  pages        = {273--284},
  year         = {1982},
  url          = {https://doi.org/10.1145/322307.322308},
  doi          = {10.1145/322307.322308},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Winker82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis82,
  author       = {Mihalis Yannakakis},
  title        = {A Theory of Safe Locking Policies in Database Systems},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {718--740},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322333},
  doi          = {10.1145/322326.322333},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Yannakakis82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yao82,
  author       = {Andrew Chi{-}Chih Yao},
  title        = {On Parallel Computation for the Knapsack Problem},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {3},
  pages        = {898--903},
  year         = {1982},
  url          = {https://doi.org/10.1145/322326.322342},
  doi          = {10.1145/322326.322342},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/Yao82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/YuLS82,
  author       = {Clement T. Yu and
                  K. Lam and
                  Gerard Salton},
  title        = {Term Weighting in Information Retrieval Using the Term Precision Model},
  journal      = {J. {ACM}},
  volume       = {29},
  number       = {1},
  pages        = {152--170},
  year         = {1982},
  url          = {https://doi.org/10.1145/322290.322300},
  doi          = {10.1145/322290.322300},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/YuLS82.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics