default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/tcs/tcs64.bht:"
download as .bib file
@article{DBLP:journals/tcs/AkyildizB89,
author = {Ian F. Akyildiz and
Horst von Brand},
title = {Exact Solutions for Open, Closed and Mixed Queueing Networks with
Rejection Blocking},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {2},
pages = {203--219},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90062-5},
doi = {10.1016/0304-3975(89)90062-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AkyildizB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlonZ89,
author = {Noga Alon and
Uri Zwick},
title = {On Neciporuk's Theorem for Branching Programs},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {331--342},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90054-6},
doi = {10.1016/0304-3975(89)90054-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlonZ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BermondF89,
author = {Jean{-}Claude Bermond and
Jean{-}Michel Fourneau},
title = {Independent Connections: An Easy Characterization of Baseline-Equivalent
Multistage Interconnection Networks},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {2},
pages = {191--201},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90061-3},
doi = {10.1016/0304-3975(89)90061-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BermondF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BuningLM89,
author = {Hans Kleine{ }B{\"{u}}ning and
Theodor Lettmann and
Ernst W. Mayr},
title = {Projections of Vector Addition System Reachability Sets are Semilinear},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {343--350},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90055-8},
doi = {10.1016/0304-3975(89)90055-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BuningLM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GalilG89,
author = {Zvi Galil and
Raffaele Giancarlo},
title = {Speeding up Dynamic Programming with Applications to Molecular Biology},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {107--118},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90101-1},
doi = {10.1016/0304-3975(89)90101-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GalilG89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Hindley89,
author = {J. Roger Hindley},
title = {BCK-Combinators and Linear lambda-Terms have Types},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {97--105},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90100-X},
doi = {10.1016/0304-3975(89)90100-X},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Hindley89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HowellR89,
author = {Rodney R. Howell and
Louis E. Rosier},
title = {Problems Concerning Fairness and Temporal Logic for Conflict-Free
Petri Nets},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {305--329},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90053-4},
doi = {10.1016/0304-3975(89)90053-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HowellR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HungK89,
author = {Dang Van Hung and
El{\"{o}}d Knuth},
title = {Semi-Commutations and Petri Nets},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {67--81},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90098-4},
doi = {10.1016/0304-3975(89)90098-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HungK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JojczykKK89,
author = {K. Jojczyk and
J. Konieczny and
T. Kuzak},
title = {On Interleaving Behaviour of PT-Nets},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {25--38},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90095-9},
doi = {10.1016/0304-3975(89)90095-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JojczykKK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KorachMZ89,
author = {Ephraim Korach and
Shlomo Moran and
Shmuel Zaks},
title = {Optimal Lower Bounds for Some Distributed Algorithms for a Complete
Network of Processors},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {125--132},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90103-5},
doi = {10.1016/0304-3975(89)90103-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KorachMZ89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KruskalRS89,
author = {Clyde P. Kruskal and
Larry Rudolph and
Marc Snir},
title = {Techniques for Parallel Manipulation of Sparse Matrices},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {2},
pages = {135--157},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90058-3},
doi = {10.1016/0304-3975(89)90058-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KruskalRS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Lyon89,
author = {Gordon Lyon},
title = {Design Factors for Parallel Processing Benchmarks},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {2},
pages = {175--189},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90060-1},
doi = {10.1016/0304-3975(89)90060-1},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Lyon89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MazurkiewiczOP89,
author = {Antoni W. Mazurkiewicz and
Edward Ochmanski and
Wojciech Penczek},
title = {Concurrent Systems and Inevitability},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {281--304},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90052-2},
doi = {10.1016/0304-3975(89)90052-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MazurkiewiczOP89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ProtasiT89,
author = {Marco Protasi and
Maurizio Talamo},
title = {On the Number of Arithmetical Operations for Finding Fibonacci Numbers},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {119--124},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90102-3},
doi = {10.1016/0304-3975(89)90102-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ProtasiT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/RobertT89,
author = {Yves Robert and
Denis Trystram},
title = {Optimal Scheduling Algorithms for Parallel Gaussian Elimination},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {2},
pages = {159--173},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90059-5},
doi = {10.1016/0304-3975(89)90059-5},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/RobertT89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Sato89,
author = {Hiroyuki Sato},
title = {{E-CCC:} Between {CCC} and Topos},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {55--66},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90097-2},
doi = {10.1016/0304-3975(89)90097-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Sato89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ShamirS89,
author = {Eli Shamir and
Assaf Schuster},
title = {Communication Aspects of Networks Based on Geometric Incidence Relations},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {83--96},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90099-6},
doi = {10.1016/0304-3975(89)90099-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ShamirS89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Stark89,
author = {Eugene W. Stark},
title = {Concurrent Transition Systems},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {221--269},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90050-9},
doi = {10.1016/0304-3975(89)90050-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Stark89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Stoss89,
author = {Hans{-}J{\"{o}}rg Sto{\ss}},
title = {On the Representation of Rational Functions of Bounded Complexity},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {1--13},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90093-5},
doi = {10.1016/0304-3975(89)90093-5},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Stoss89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Stoss89a,
author = {Hans{-}J{\"{o}}rg Sto{\ss}},
title = {Lower Bounds for the Complexity of Polynomials},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {15--23},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90094-7},
doi = {10.1016/0304-3975(89)90094-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Stoss89a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Therien89,
author = {Denis Th{\'{e}}rien},
title = {Programs over Aperiodic Monoids},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {3},
pages = {271--280},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90051-0},
doi = {10.1016/0304-3975(89)90051-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Therien89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/TomitaS89,
author = {Etsuji Tomita and
Kazushi Seino},
title = {A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic
Pushdown Transducers, one of which is Real-Time Strict},
journal = {Theor. Comput. Sci.},
volume = {64},
number = {1},
pages = {39--53},
year = {1989},
url = {https://doi.org/10.1016/0304-3975(89)90096-0},
doi = {10.1016/0304-3975(89)90096-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/TomitaS89.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.
retrieved on 2024-10-09 22:19 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
