Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

export results for "toc:db/journals/tcs/tcs58.bht:"

> Home > Search

download as .bib file

@article{DBLP:journals/tcs/ArquesFGG88,
  author       = {Didier Arqu{\`{e}}s and
                  Jean Fran{\c{c}}on and
                  M. T. Guichet and
                  P. Guichet},
  title        = {Comparison of Algorithms Controlling Concurrent Access to a Database:
                  {A} Combinatorial Approach},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {3--16},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90016-3},
  doi          = {10.1016/0304-3975(88)90016-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ArquesFGG88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/AverbuchGW88,
  author       = {Amir Averbuch and
                  Zvi Galil and
                  Shmuel Winograd},
  title        = {Classification of All the Minimal Bilinear Algorithms for Computing
                  the Coefficients of the Product of Two Polynomials Modulo a Polynomial,
                  Part {I:} The Algeabra G[u] / {\textless} Q(u)l {\textgreater}, l
                  {\textgreater} 1},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {17--56},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90017-5},
  doi          = {10.1016/0304-3975(88)90017-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AverbuchGW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BorodinFHUW88,
  author       = {Allan Borodin and
                  Faith E. Fich and
                  Friedhelm Meyer auf der Heide and
                  Eli Upfal and
                  Avi Wigderson},
  title        = {A Tradeoff Between Search and Update Time for the Implicit Dictionary
                  Problem},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {57--68},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90018-7},
  doi          = {10.1016/0304-3975(88)90018-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BorodinFHUW88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Brandenburg88,
  author       = {Franz{-}Josef Brandenburg},
  title        = {On the Intersection of Stacks and Queues},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {69--80},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90019-9},
  doi          = {10.1016/0304-3975(88)90019-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Brandenburg88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ChoffrutS88,
  author       = {Christian Choffrut and
                  Marcel Paul Sch{\"{u}}tzenberger},
  title        = {Counting with Rational Functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {81--101},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90020-5},
  doi          = {10.1016/0304-3975(88)90020-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ChoffrutS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Felice88,
  author       = {Clelia de Felice},
  title        = {Finite Biprefix Sets of Paths in a Graph},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {103--128},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90021-7},
  doi          = {10.1016/0304-3975(88)90021-7},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Felice88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HartmanisH88,
  author       = {Juris Hartmanis and
                  Lane A. Hemachandra},
  title        = {Complexity Classes without Machines: On Complete Languages for {UP}},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {129--142},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90022-9},
  doi          = {10.1016/0304-3975(88)90022-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/HartmanisH88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KirschenhoferP88,
  author       = {Peter Kirschenhofer and
                  Helmut Prodinger},
  title        = {Further Results on Digital Search Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {143--154},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90023-0},
  doi          = {10.1016/0304-3975(88)90023-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KirschenhoferP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/KrausL88,
  author       = {Sarit Kraus and
                  Daniel Lehmann},
  title        = {Knowledge, Belief and Time},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {155--174},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90024-2},
  doi          = {10.1016/0304-3975(88)90024-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/KrausL88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lange88,
  author       = {Klaus{-}J{\"{o}}rn Lange},
  title        = {Decompositions of Nondeterministic Reductions},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {175--181},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90025-4},
  doi          = {10.1016/0304-3975(88)90025-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lange88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Lisper88,
  author       = {Bj{\"{o}}rn Lisper},
  title        = {Synthesis and Equivalence of Concurrent Systems},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {183--199},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90026-6},
  doi          = {10.1016/0304-3975(88)90026-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Lisper88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Metivier88,
  author       = {Yves M{\'{e}}tivier},
  title        = {On Recognizable Subsets of Free Partially Commutative Monoids},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {201--208},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90027-8},
  doi          = {10.1016/0304-3975(88)90027-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Metivier88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MonienS88,
  author       = {Burkhard Monien and
                  Ivan Hal Sudborough},
  title        = {Min Cut is NP-Complete for Edge Weighted Treees},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {209--229},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90028-X},
  doi          = {10.1016/0304-3975(88)90028-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MonienS88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Pecuchet88,
  author       = {Jean{-}Pierre P{\'{e}}cuchet},
  title        = {Etude Syntaxique des Parties Reconnaissables de Mots Infinis},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {231--248},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90029-1},
  doi          = {10.1016/0304-3975(88)90029-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Pecuchet88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ReedR88,
  author       = {George M. Reed and
                  A. W. Roscoe},
  title        = {A Timed Model for Communicating Sequential Processes},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {249--261},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90030-8},
  doi          = {10.1016/0304-3975(88)90030-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ReedR88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/RosierY88,
  author       = {Louis E. Rosier and
                  Hsu{-}Chun Yen},
  title        = {On the Complexity of Deciding fair Termination of Probabilistic Concurrent
                  Finite-State Programs},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {263--324},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90031-X},
  doi          = {10.1016/0304-3975(88)90031-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/RosierY88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Schutzenberger88,
  author       = {Marcel Paul Sch{\"{u}}tzenberger},
  title        = {Counting with Rational Functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {81--101},
  year         = {1988},
  timestamp    = {Wed, 19 Nov 2003 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schutzenberger88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Simon88,
  author       = {Klaus Simon},
  title        = {An Improved Algorithm for Transitive Closure on Acyclic Digraphs},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {325--346},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90032-1},
  doi          = {10.1016/0304-3975(88)90032-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Simon88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Stirling88,
  author       = {Colin Stirling},
  title        = {A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while
                  Language},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {347--359},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90033-3},
  doi          = {10.1016/0304-3975(88)90033-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Stirling88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Straubing88,
  author       = {Howard Straubing},
  title        = {Semigroups and Languages of Dot-Depth Two},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {361--378},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90034-5},
  doi          = {10.1016/0304-3975(88)90034-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Straubing88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/VarmanD88,
  author       = {Peter J. Varman and
                  Kshitij A. Doshi},
  title        = {An Efficient Parallel Algorithm for Updating Minimum Spanning Trees},
  journal      = {Theor. Comput. Sci.},
  volume       = {58},
  pages        = {379--397},
  year         = {1988},
  url          = {https://doi.org/10.1016/0304-3975(88)90035-7},
  doi          = {10.1016/0304-3975(88)90035-7},
  timestamp    = {Sun, 29 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/VarmanD88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.