Search dblp for Publications

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

 download as .bib file

@article{DBLP:journals/tcs/Book76,
  author       = {Ronald V. Book},
  title        = {Translational Lemmas, Polynomial Time, and (log n)j-Space},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {3},
  pages        = {215--226},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90057-8},
  doi          = {10.1016/0304-3975(76)90057-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Book76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtRS76,
  author       = {Andrzej Ehrenfeucht and
                  Grzegorz Rozenberg and
                  Sven Skyum},
  title        = {A Relationship between {ET0L} and {EDT0L} Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {325--330},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90076-1},
  doi          = {10.1016/0304-3975(76)90076-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtRS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Fredman76,
  author       = {Michael L. Fredman},
  title        = {How Good is the Information Theory Bound in Sorting?},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {355--361},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90078-5},
  doi          = {10.1016/0304-3975(76)90078-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Fredman76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Friedman76,
  author       = {Emily P. Friedman},
  title        = {The Inclusion Problem for Simple Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {297--316},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90074-8},
  doi          = {10.1016/0304-3975(76)90074-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Friedman76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/GareyJS76,
  author       = {M. R. Garey and
                  David S. Johnson and
                  Larry J. Stockmeyer},
  title        = {Some Simplified NP-Complete Graph Problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {3},
  pages        = {237--267},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90059-1},
  doi          = {10.1016/0304-3975(76)90059-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/GareyJS76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Greibach76,
  author       = {Sheila A. Greibach},
  title        = {Remarks on the Complexity of Nondeterministic Counter Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {269--288},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90072-4},
  doi          = {10.1016/0304-3975(76)90072-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Greibach76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Karhumaki76,
  author       = {Juhani Karhum{\"{a}}ki},
  title        = {Two Theorems Concerning Recognizable N-Subsets of sigma*},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {317--323},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90075-X},
  doi          = {10.1016/0304-3975(76)90075-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Karhumaki76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LeeuwenW76,
  author       = {Jan van Leeuwen and
                  Derick Wood},
  title        = {A Decomposition Theorem for Hyper-Algebraic Extensions of Language
                  Families},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {3},
  pages        = {199--214},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90056-6},
  doi          = {10.1016/0304-3975(76)90056-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LeeuwenW76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/MarekP76,
  author       = {V. Wiktor Marek and
                  Zdzislaw Pawlak},
  title        = {Information Storage and Retrieval Systems: Mathematical Foundations},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {331--354},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90077-3},
  doi          = {10.1016/0304-3975(76)90077-3},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/MarekP76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Mignotte76,
  author       = {Maurice Mignotte},
  title        = {Algorithmes r{\'{e}}latifs {\'{a}} la d{\'{e}}composition
                  dds oolyn{\^{o}}mes},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {3},
  pages        = {227--235},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90058-X},
  doi          = {10.1016/0304-3975(76)90058-X},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Mignotte76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Moll76,
  author       = {Robert Moll},
  title        = {An Operator Embedding Theorem for Complexity Classes of Recursive
                  Functions},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {3},
  pages        = {193--198},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90055-4},
  doi          = {10.1016/0304-3975(76)90055-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Moll76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Schnorr76,
  author       = {Claus{-}Peter Schnorr},
  title        = {The Combinational Complexity of Equivalence},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {4},
  pages        = {289--295},
  year         = {1976},
  url          = {https://doi.org/10.1016/0304-3975(76)90073-6},
  doi          = {10.1016/0304-3975(76)90073-6},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schnorr76.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/EhrenfeuchtLR75,
  author       = {Andrzej Ehrenfeucht and
                  K. P. Lee and
                  Grzegorz Rozenberg},
  title        = {Subword Complexities of Various Classes of Deterministic Developmental
                  Languages without Interactions},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {59--75},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90012-2},
  doi          = {10.1016/0304-3975(75)90012-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/EhrenfeuchtLR75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/HarperHS75,
  author       = {Lawrence H. Harper and
                  W. N. Hsieh and
                  S. E. Savage},
  title        = {A Class of Boolean Functions with Linear Combinational Complexity},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {161--183},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90018-3},
  doi          = {10.1016/0304-3975(75)90018-3},
  timestamp    = {Fri, 22 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/HarperHS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Huet75,
  author       = {G{\'{e}}rard P. Huet},
  title        = {A Unification Algorithm for Typed lambda-Calculus},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {27--57},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90011-0},
  doi          = {10.1016/0304-3975(75)90011-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Huet75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/LadnerLS75,
  author       = {Richard E. Ladner and
                  Nancy A. Lynch and
                  Alan L. Selman},
  title        = {A Comparison of Polynomial Time Reducibilities},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {103--123},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90016-X},
  doi          = {10.1016/0304-3975(75)90016-X},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/LadnerLS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Paterson75,
  author       = {Mike Paterson},
  title        = {Complexity of Monotone Networks for Boolean Matrix Product},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {13--20},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90009-2},
  doi          = {10.1016/0304-3975(75)90009-2},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Paterson75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Plotkin75,
  author       = {Gordon D. Plotkin},
  title        = {Call-by-Name, Call-by-Value and the lambda-Calculus},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {125--159},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90017-1},
  doi          = {10.1016/0304-3975(75)90017-1},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Plotkin75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Preparata75,
  author       = {Franco P. Preparata},
  title        = {A Fast Stable Sorting Algorithm with Absolutely Minimum Storage},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {185--190},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90019-5},
  doi          = {10.1016/0304-3975(75)90019-5},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Preparata75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/ReedyS75,
  author       = {Ann Reedy and
                  Walter J. Savitch},
  title        = {The Turing Degree of the Inherent Ambiguity Problem for Context-Free
                  Languages},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {77--91},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90013-4},
  doi          = {10.1016/0304-3975(75)90013-4},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/ReedyS75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Restivo75,
  author       = {Antonio Restivo},
  title        = {A Combinatorial Property of Codes Having Finite Synchronization Delay},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {2},
  pages        = {95--101},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90015-8},
  doi          = {10.1016/0304-3975(75)90015-8},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Restivo75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Schonhage75,
  author       = {Arnold Sch{\"{o}}nhage},
  title        = {A Lower Bound for the Length of Addition Chains},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {1--12},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90008-0},
  doi          = {10.1016/0304-3975(75)90008-0},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Schonhage75.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/Strassen75,
  author       = {Volker Strassen},
  title        = {Die Berechnungskomplexit{\"{a}}t der Symbolischen Differentiation
                  von Interpolationspolynomen},
  journal      = {Theor. Comput. Sci.},
  volume       = {1},
  number       = {1},
  pages        = {21--25},
  year         = {1975},
  url          = {https://doi.org/10.1016/0304-3975(75)90010-9},
  doi          = {10.1016/0304-3975(75)90010-9},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Strassen75.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.