Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/acta/Berry85,
  author       = {Daniel M. Berry},
  title        = {A Denotational Semantics for Shared-Memory Parallelism and Nondeterminism},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {599--627},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289713},
  doi          = {10.1007/BF00289713},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Berry85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/ChenR85,
  author       = {Marina C. Chen and
                  Martin Rem},
  title        = {Deadlock-Freedom in Resource Contentions},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {585--598},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289712},
  doi          = {10.1007/BF00289712},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/ChenR85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Fisher85,
  author       = {A. J. Fisher},
  title        = {Practical LL(1)-Based Parsing of van Wijngaarden Grammars},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {559--584},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289711},
  doi          = {10.1007/BF00289711},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Fisher85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/LenfantT85,
  author       = {Jacques Lenfant and
                  Serge Tah{\'{e}}},
  title        = {Permuting Data with the Omega Network},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {629--641},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289714},
  doi          = {10.1007/BF00289714},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/LenfantT85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/ValkJ85,
  author       = {R{\"{u}}diger Valk and
                  Matthias Jantzen},
  title        = {The Residue of Vector Sets with Applications to Decidability Problems
                  in Petri Nets},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {643--674},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289715},
  doi          = {10.1007/BF00289715},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/ValkJ85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Wright85,
  author       = {William E. Wright},
  title        = {Some Average Performance Measures for the B-Tree},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {541--557},
  year         = {1985},
  url          = {https://doi.org/10.1007/BF00289710},
  doi          = {10.1007/BF00289710},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Wright85.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/AutebertBBG84,
  author       = {Jean{-}Michel Autebert and
                  Joffroy Beauquier and
                  Luc Boasson and
                  Fran{\c{c}}oise Gire},
  title        = {Bicentres de langages alg{\'{e}}briques},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {209--227},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289241},
  doi          = {10.1007/BF00289241},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/AutebertBBG84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BarringerCJ84,
  author       = {Howard Barringer and
                  J. H. Cheng and
                  Cliff B. Jones},
  title        = {A Logic Covering Undefinedness in Program Proofs},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {251--269},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264250},
  doi          = {10.1007/BF00264250},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BarringerCJ84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BauerO84,
  author       = {G. Bauer and
                  Friedrich Otto},
  title        = {Finite Complete Rewriting Systems and the Complexity of the Word Problem},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {521--540},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271645},
  doi          = {10.1007/BF00271645},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BauerO84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BayerS84,
  author       = {Rudolf Bayer and
                  Peter Schlichtiger},
  title        = {Data Management Support for Database Management},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {1--28},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289137},
  doi          = {10.1007/BF00289137},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BayerS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BergstraT84,
  author       = {Jan A. Bergstra and
                  John V. Tucker},
  title        = {The Axiomatic Semantics of Programs Based on Hoare's Logic},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {293--320},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264252},
  doi          = {10.1007/BF00264252},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BergstraT84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BestV84,
  author       = {Eike Best and
                  Klaus Voss},
  title        = {Free Choice Systems Have Home States},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {89--100},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289141},
  doi          = {10.1007/BF00289141},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BestV84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Bird84,
  author       = {Richard S. Bird},
  title        = {Using Circular Programs to Eliminate Multiple Traversals of Data},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {239--250},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264249},
  doi          = {10.1007/BF00264249},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Bird84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/BlumS84,
  author       = {Norbert Blum and
                  Martin Seysen},
  title        = {Characterization of all Optimal Networks for a Simultaneous Computation
                  of {AND} and {NOR}},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {171--181},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289238},
  doi          = {10.1007/BF00289238},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/BlumS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Bulyonkov84,
  author       = {Mikhail A. Bulyonkov},
  title        = {Polyvariant Mixed Computation for Analyzer Programs},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {473--484},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271642},
  doi          = {10.1007/BF00271642},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Bulyonkov84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Chapman84,
  author       = {Nigel P. Chapman},
  title        = {\emph{ {LALR} } (1, 1) Parser Generation for Regular Right Part Grammars},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {29--45},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289138},
  doi          = {10.1007/BF00289138},
  timestamp    = {Sun, 01 Oct 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Chapman84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/ChoffrutC84,
  author       = {Christian Choffrut and
                  Karel Cul{\'{\i}}k II},
  title        = {On Real-Time Cellular Automata and Trellis Automata},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {393--407},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264617},
  doi          = {10.1007/BF00264617},
  timestamp    = {Wed, 24 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/acta/ChoffrutC84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/CoffmanL84,
  author       = {Edward G. Coffman Jr. and
                  Michael A. Langston},
  title        = {A Performance Guarantee for the Greedy Set-Partitioning Algorithm},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {409--415},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264618},
  doi          = {10.1007/BF00264618},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/CoffmanL84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/CostaS84,
  author       = {Gerardo Costa and
                  Colin Stirling},
  title        = {A Fair Calculus of Communicating Systems},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {417--441},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271640},
  doi          = {10.1007/BF00271640},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/CostaS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/DeransartJL84,
  author       = {Pierre Deransart and
                  Martin Jourdan and
                  Bernard Lorho},
  title        = {Speeding up Circularity Tests for Attribute Grammars},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {375--391},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264616},
  doi          = {10.1007/BF00264616},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/DeransartJL84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Devroye84,
  author       = {Luc Devroye},
  title        = {A Probabilistic Analysis of the Height of Tries and of the Complexity
                  of Triesort},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {229--237},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264248},
  doi          = {10.1007/BF00264248},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Devroye84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Gillett84,
  author       = {Will D. Gillett},
  title        = {On Binary Tree Encodements},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {183--192},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289239},
  doi          = {10.1007/BF00289239},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Gillett84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Guting84,
  author       = {Ralf Hartmut G{\"{u}}ting},
  title        = {Optimal Divide-and-Conquer to Compute Measure and Contour for a Set
                  of Iso-Rectangles},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {271--291},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264251},
  doi          = {10.1007/BF00264251},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Guting84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Hennessy84,
  author       = {Matthew Hennessy},
  title        = {Axiomatising Finite Delay Operators},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {61--88},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289140},
  doi          = {10.1007/BF00289140},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Hennessy84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/HertelMMN84,
  author       = {Stefan Hertel and
                  Martti M{\"{a}}ntyl{\"{a}} and
                  Kurt Mehlhorn and
                  J{\"{u}}rg Nievergelt},
  title        = {Space Sweep Solves Intersection of Convex Polyhedra},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {501--519},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271644},
  doi          = {10.1007/BF00271644},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/HertelMMN84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/HuangW84,
  author       = {Shou{-}Hsuan Stephen Huang and
                  C. K. Wong},
  title        = {Generalized Binary Split Trees},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {113--123},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289143},
  doi          = {10.1007/BF00289143},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/HuangW84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/IbarraK84,
  author       = {Oscar H. Ibarra and
                  Sam M. Kim},
  title        = {A Characterization of Systolic Binary Tree Automata and Applications},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {193--207},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289240},
  doi          = {10.1007/BF00289240},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/IbarraK84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/IglehartS84,
  author       = {Donald L. Iglehart and
                  Gerald S. Shedler},
  title        = {Simulation Output Analysis for Local Area Computer Networks},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {321--338},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264614},
  doi          = {10.1007/BF00264614},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/IglehartS84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/LeungC84,
  author       = {Clement H. C. Leung and
                  Qui Hoon Choo},
  title        = {The Paging Drum Queue: {A} Uniform Perspective and Further Results},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {485--500},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271643},
  doi          = {10.1007/BF00271643},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/LeungC84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Lubachevsky84,
  author       = {Boris D. Lubachevsky},
  title        = {An Approach to Automating the Verification of Compact Parallel Coordination
                  Programs {I}},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {125--169},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289237},
  doi          = {10.1007/BF00289237},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Lubachevsky84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/MehlhornV84,
  author       = {Kurt Mehlhorn and
                  Uzi Vishkin},
  title        = {Randomized and Deterministic Simulations of PRAMs by Parallel Machines
                  with Restricted Granularity of Parallel Memories},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {339--374},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00264615},
  doi          = {10.1007/BF00264615},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/MehlhornV84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Sannella84,
  author       = {Donald Sannella},
  title        = {A Set-Theoretic Semantics for Clear},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {443--472},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00271641},
  doi          = {10.1007/BF00271641},
  timestamp    = {Sun, 25 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Sannella84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Szwarcfiter84,
  author       = {Jayme Luiz Szwarcfiter},
  title        = {Optimal Multiway Search Trees for Variable Size Keys},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {47--60},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289139},
  doi          = {10.1007/BF00289139},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Szwarcfiter84.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/acta/Tsakalidis84,
  author       = {Athanasios K. Tsakalidis},
  title        = {Maintaining Order in a Generalized Linked List},
  journal      = {Acta Informatica},
  volume       = {21},
  pages        = {101--112},
  year         = {1984},
  url          = {https://doi.org/10.1007/BF00289142},
  doi          = {10.1007/BF00289142},
  timestamp    = {Sun, 21 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/acta/Tsakalidis84.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.