default search action
Search dblp for Publications
export results for "toc:db/journals/tcs/tcs85.bht:"
@article{DBLP:journals/tcs/Bethke91, author = {Inge Bethke}, title = {Coherence Spaces are Untopological}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {353--357}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90187-7}, doi = {10.1016/0304-3975(91)90187-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Bethke91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/CherubiniCCM91, author = {Alessandra Cherubini and Claudio Citrini and Stefano Crespi{-}Reghizzi and Dino Mandrioli}, title = {{QRT} {FIFO} Automata, Breath-First Grammars and Their Relations}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {171--203}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90053-5}, doi = {10.1016/0304-3975(91)90053-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/CherubiniCCM91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Cialdea91, author = {Marta Cialdea}, title = {Resolution for Some First-Order Modal Systems}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {213--229}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90181-Z}, doi = {10.1016/0304-3975(91)90181-Z}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Cialdea91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DevolderL91, author = {Jeanne Devolder and Igor Litovsky}, title = {Finitely Generated bi-omega-Languages}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {33--52}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90046-5}, doi = {10.1016/0304-3975(91)90046-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DevolderL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DoggazK91, author = {Narjes Doggaz and Claude Kirchner}, title = {Completion for Unification}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {231--251}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90182-2}, doi = {10.1016/0304-3975(91)90182-2}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DoggazK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Goto91, author = {Shigeki Goto}, title = {Proof Normalization with Nonstandard Objects}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {333--351}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90186-6}, doi = {10.1016/0304-3975(91)90186-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Goto91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/IbarraW91, author = {Oscar H. Ibarra and Hui Wang}, title = {Parallel Parsing on a One-Way Linear Array of Finite-State Machines}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {53--74}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90047-6}, doi = {10.1016/0304-3975(91)90047-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/IbarraW91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kamper91, author = {J{\"{u}}rgen K{\"{a}}mper}, title = {Nonuniform Proof Systems: {A} New Framework to Describe Nonuniform and Probabilistic Complexity Classes}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {305--331}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90185-5}, doi = {10.1016/0304-3975(91)90185-5}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kamper91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Kutylowski91, author = {Miroslaw Kutylowski}, title = {Multihead One-Way Finite Automata}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {135--153}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90051-3}, doi = {10.1016/0304-3975(91)90051-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Kutylowski91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Lindell91, author = {Steven Lindell}, title = {An Analysis of Fixed-Point Queries on Binary Trees}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {75--95}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90048-7}, doi = {10.1016/0304-3975(91)90048-7}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Lindell91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Michel91, author = {Pascal Michel}, title = {An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {205--212}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90054-6}, doi = {10.1016/0304-3975(91)90054-6}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Michel91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Rodenburg91, author = {Pieter Hendrik Rodenburg}, title = {Algebraic Specifiability of Data Types with minimal Computable Parameters}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {97--116}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90049-8}, doi = {10.1016/0304-3975(91)90049-8}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Rodenburg91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Sopena91, author = {{\'{E}}ric Sopena}, title = {Hypermap Rewriting: {A} Combinatorial Approach}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {253--281}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90183-3}, doi = {10.1016/0304-3975(91)90183-3}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Sopena91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Szpankowski91, author = {Wojciech Szpankowski}, title = {A Characterization of Digital Search Trees from the Successful Search Viewpoint}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {117--134}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90050-C}, doi = {10.1016/0304-3975(91)90050-C}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Szpankowski91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/TennentT91, author = {Robert D. Tennent and J. K. Tobin}, title = {Continuations in Possible-World Semantics}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {2}, pages = {283--303}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90184-4}, doi = {10.1016/0304-3975(91)90184-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/TennentT91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wang91, author = {Jie Wang}, title = {On p-Creative Sets and p-Completely Creative Sets}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {1--31}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90045-4}, doi = {10.1016/0304-3975(91)90045-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Wang91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/Wegener91, author = {Ingo Wegener}, title = {The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits}, journal = {Theor. Comput. Sci.}, volume = {85}, number = {1}, pages = {155--170}, year = {1991}, url = {https://doi.org/10.1016/0304-3975(91)90052-4}, doi = {10.1016/0304-3975(91)90052-4}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/Wegener91.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.