Search dblp for Publications

export results for "toc:db/journals/acta/acta15.bht:"

 download as .bib file

@article{DBLP:journals/acta/AnderaaB81,
  author       = {St{\aa}l O. Aanderaa and
                  Egon B{\"{o}}rger},
  title        = {The Equivalence of Horn and Network Complexity for Boolean Functions},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {303--307},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289267},
  doi          = {10.1007/BF00289267},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/AnderaaB81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Apt81,
  author       = {Krzysztof R. Apt},
  title        = {Recursive Assertions and Parallel Programs},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {219--232},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289262},
  doi          = {10.1007/BF00289262},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Apt81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/ArakiT81,
  author       = {Toshiro Araki and
                  Nobuki Tokura},
  title        = {Flow Languages Equal Recursively Enumerable Languages},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {209--217},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289261},
  doi          = {10.1007/BF00289261},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/ArakiT81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Baccelli81,
  author       = {Fran{\c{c}}ois Baccelli},
  title        = {Analysis of a Service Facility with Periodic Checkpointing},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {67--81},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00269809},
  doi          = {10.1007/BF00269809},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Baccelli81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Back81,
  author       = {Ralph{-}Johan Back},
  title        = {Proving Total Correctness of Nondeterministic Programs in Infinitary
                  Logic},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {233--249},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289263},
  doi          = {10.1007/BF00289263},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Back81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BauerEPP81,
  author       = {Friedrich L. Bauer and
                  Andrei P. Ershov and
                  Manfred Paul and
                  Alan J. Perlis},
  title        = {Klaus Samelson},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {1--2},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00269806},
  doi          = {10.1007/BF00269806},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BauerEPP81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Berry81,
  author       = {Daniel M. Berry},
  title        = {Remarks on R. D. Tennent's Language Design Methods Based on Semantic
                  Principles: Algol 68, {A} Language Designed Using Semantic Principles},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {83--98},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00269810},
  doi          = {10.1007/BF00269810},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Berry81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BoothL81,
  author       = {Kellogg S. Booth and
                  Richard J. Lipton},
  title        = {Computing Extremal and Approximate Distances in Graphs Having Unit
                  Cost Edges},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {319--328},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264532},
  doi          = {10.1007/BF00264532},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BoothL81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BoxmaK81,
  author       = {Onno J. Boxma and
                  Alan G. Konheim},
  title        = {Approximate Analysis of Exponential Queueing Systems with Blocking},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {19--66},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00269808},
  doi          = {10.1007/BF00269808},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BoxmaK81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Bruin81,
  author       = {Arie de Bruin},
  title        = {Goto Statements: Semantics and Deduction Systems},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {385--424},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264536},
  doi          = {10.1007/BF00264536},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Bruin81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/CartwrightO81,
  author       = {Robert Cartwright and
                  Derek C. Oppen},
  title        = {The Logic of Aliasing},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {365--384},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264535},
  doi          = {10.1007/BF00264535},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/CartwrightO81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/CasanovaB81,
  author       = {Marco A. Casanova and
                  Philip A. Bernstein},
  title        = {General Purpose Schedulers for Database System},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {471},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264539},
  doi          = {10.1007/BF00264539},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/CasanovaB81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/DadunaS81,
  author       = {Hans Daduna and
                  Rolf Schassberger},
  title        = {A Discrete-Time Round-Robin Queue with Bernoulli Input and General
                  Arithmetic Service Time Distributions},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {251--263},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289264},
  doi          = {10.1007/BF00289264},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/DadunaS81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/IglehartS81,
  author       = {Donald L. Iglehart and
                  Gerald S. Shedler},
  title        = {Regenerative Simulation of Response Times in Networks of Queues: Statistical
                  Efficiency},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {347--363},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264534},
  doi          = {10.1007/BF00264534},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/IglehartS81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Kemp81,
  author       = {Rainer Kemp},
  title        = {\emph{ {LR} } {(0)} Grammars Generated by \emph{ {LR} } {(0)} Parsers},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {265--280},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289265},
  doi          = {10.1007/BF00289265},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Kemp81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/KouMB81,
  author       = {Lawrence T. Kou and
                  George Markowsky and
                  Leonard Berman},
  title        = {A Fast Algorithm for Steiner Trees},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {141--145},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288961},
  doi          = {10.1007/BF00288961},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/KouMB81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Kuich81,
  author       = {Werner Kuich},
  title        = {The Characterization of Parallel Ultralinear Grammars by Rational
                  Power Series},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {129--139},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288960},
  doi          = {10.1007/BF00288960},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Kuich81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/LevinG81,
  author       = {Gary Levin and
                  David Gries},
  title        = {A Proof Technique for Communicating Sequential Processes},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {281--302},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289266},
  doi          = {10.1007/BF00289266},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/LevinG81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/LipskiP81,
  author       = {Witold Lipski Jr. and
                  Franco P. Preparata},
  title        = {Efficient Algorithms for Finding Maximum Matchings in Convex Bipartite
                  Graphs and Related Problems},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {329--346},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264533},
  doi          = {10.1007/BF00264533},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/LipskiP81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Mayr81,
  author       = {Ernst W. Mayr},
  title        = {Persistence of Vector Replacement Systems is Decidable},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {309--318},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289268},
  doi          = {10.1007/BF00289268},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Mayr81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/MooreR81,
  author       = {Daniel J. Moore and
                  Bruce Russell},
  title        = {Axiomatic Data Type Specifications: {A} First Order Theory of Linear
                  Lists},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {193--207},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00289260},
  doi          = {10.1007/BF00289260},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/MooreR81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/PurdomB81,
  author       = {Paul Walton Purdom Jr. and
                  Cynthia A. Brown},
  title        = {Parsing Extended \emph{ LR(k) } Grammars},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {115--127},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288959},
  doi          = {10.1007/BF00288959},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/PurdomB81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/PurdomBR81,
  author       = {Paul Walton Purdom Jr. and
                  Cynthia A. Brown and
                  Edward L. Robertson},
  title        = {Backtracking with Multi-Level Dynamic Search Rearrangement},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {99--113},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288958},
  doi          = {10.1007/BF00288958},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/PurdomBR81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Reisch81,
  author       = {Stefan Reisch},
  title        = {Hex ist PSPACE-vollst{\"{a}}ndig},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {167--191},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288964},
  doi          = {10.1007/BF00288964},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Reisch81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Rodriguez81,
  author       = {F. Rodriguez},
  title        = {Ind{\'{e}}pendance Forte de Certaines Op{\'{e}}rations},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {153--166},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288963},
  doi          = {10.1007/BF00288963},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Rodriguez81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Tokuda81,
  author       = {Takehiro Tokuda},
  title        = {Eliminating Unit Reductions from \emph{ LR(k) } Parsers Using Minimum
                  Contexts},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {447--470},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264538},
  doi          = {10.1007/BF00264538},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Tokuda81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Wegener81,
  author       = {Ingo Wegener},
  title        = {An Improved Complexity Hierarchy on the Depth of Boolean Functions},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {147--152},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00288962},
  doi          = {10.1007/BF00288962},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Wegener81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Wright81,
  author       = {William E. Wright},
  title        = {Binary Search Trees in Secondary Memory},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {3--17},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00269807},
  doi          = {10.1007/BF00269807},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Wright81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Wurgers81,
  author       = {Harald W{\"{u}}rgers},
  title        = {A Specification Technique Based on Predicate Transformers},
  journal      = {Acta Informatica},
  volume       = {15},
  pages        = {425--445},
  year         = {1981},
  url          = {https://doi.org/10.1007/BF00264537},
  doi          = {10.1007/BF00264537},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Wurgers81.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.