default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mst/mst30.bht:"
download as .bib file
@article{DBLP:journals/mst/AlloucheCGPSS97,
author = {Jean{-}Paul Allouche and
Emmanuel Cateland and
William J. Gilbert and
Heinz{-}Otto Peitgen and
Jeffrey O. Shallit and
Guentcho Skordev},
title = {Automatic Maps in Exotic Numeration System},
journal = {Theory Comput. Syst.},
volume = {30},
number = {3},
pages = {285--331},
year = {1997},
url = {https://doi.org/10.1007/BF02679463},
doi = {10.1007/BF02679463},
timestamp = {Mon, 02 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AlloucheCGPSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AmanoM97,
author = {Kazuyuki Amano and
Akira Maruoka},
title = {Approximation Algorithms for {DNF} Under Distributions with Limited
Independence},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {181--196},
year = {1997},
url = {https://doi.org/10.1007/s002240000049},
doi = {10.1007/S002240000049},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AmanoM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BilardiP97,
author = {Gianfranco Bilardi and
Franco P. Preparata},
title = {Processor-Time Tradeoffs under Bounded-Speed Message Propagation:
Part I, Upper Bounds},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {523--546},
year = {1997},
url = {https://doi.org/10.1007/s002240000066},
doi = {10.1007/S002240000066},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BilardiP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BurtschickL97,
author = {Hans{-}J{\"{o}}rg Burtschick and
Wolfgang Lindner},
title = {On Sets Turing Reducible to p-Selective Sets},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {135--143},
year = {1997},
url = {https://doi.org/10.1007/BF02679445},
doi = {10.1007/BF02679445},
timestamp = {Fri, 01 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BurtschickL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChM97,
author = {Eric Goles Ch. and
Mart{\'{\i}}n Matamala},
title = {Reaction-Diffusion Automata: Three States Implies Universality},
journal = {Theory Comput. Syst.},
volume = {30},
number = {3},
pages = {223--229},
year = {1997},
url = {https://doi.org/10.1007/s002240000051},
doi = {10.1007/S002240000051},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CintioliS97,
author = {Patrizio Cintioli and
Riccardo Silvestri},
title = {Helping by Unambiguous Computation and Probabilistic Computation},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {165--180},
year = {1997},
url = {https://doi.org/10.1007/BF02679447},
doi = {10.1007/BF02679447},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CintioliS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DammHR97,
author = {Carsten Damm and
Markus Holzer and
Peter Rossmanith},
title = {Expressing Uniformity via Oracles},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {355--366},
year = {1997},
url = {https://doi.org/10.1007/s002240000056},
doi = {10.1007/S002240000056},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DammHR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DehneDDFK97,
author = {Frank K. H. A. Dehne and
Xiaotie Deng and
Patrick W. Dymond and
Andreas Fabri and
Ashfaq A. Khokhar},
title = {A Randomized Parallel Three-Dimensional Convex Hull Algorithm for
Coarse-Grained Multicomputers},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {547--558},
year = {1997},
url = {https://doi.org/10.1007/s002240000067},
doi = {10.1007/S002240000067},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/DehneDDFK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EvenR97,
author = {Shimon Even and
Sergio Rajsbaum},
title = {The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed
Networks},
journal = {Theory Comput. Syst.},
volume = {30},
number = {5},
pages = {447--474},
year = {1997},
url = {https://doi.org/10.1007/s002240000062},
doi = {10.1007/S002240000062},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EvenR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FrancesL97,
author = {Moti Frances and
Ami Litman},
title = {On Covering Problems of Codes},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {113--119},
year = {1997},
url = {https://doi.org/10.1007/s002240000044},
doi = {10.1007/S002240000044},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FrancesL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HaralambidesM97,
author = {James Haralambides and
Fillia Makedon},
title = {Approximation Algorithms for the Bandwidth Minimization Problem for
a Large Class of Trees},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {67--90},
year = {1997},
url = {https://doi.org/10.1007/BF02679454},
doi = {10.1007/BF02679454},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HaralambidesM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Heath97,
author = {Lenwood S. Heath},
title = {Graph Embeddings and Simplicial Maps},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {51--65},
year = {1997},
url = {https://doi.org/10.1007/s002240000041},
doi = {10.1007/S002240000041},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Heath97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HeideSW97,
author = {Friedhelm Meyer auf der Heide and
Martin Storch and
Rolf Wanka},
title = {Optimal Tradeoffs Between Size and Slowdown for Universal Parallel
Networks},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {627--644},
year = {1997},
url = {https://doi.org/10.1007/s002240000071},
doi = {10.1007/S002240000071},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HeideSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HoogeboomP97,
author = {Hendrik Jan Hoogeboom and
Paulien ten Pas},
title = {Monadic Second-Order Definable Text Languages},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {335--354},
year = {1997},
url = {https://doi.org/10.1007/s002240000055},
doi = {10.1007/S002240000055},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HoogeboomP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KaklamanisKR97,
author = {Christos Kaklamanis and
Danny Krizanc and
Satish Rao},
title = {New Graph Decompositions with Applications to Emulations},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {39--49},
year = {1997},
url = {https://doi.org/10.1007/BF02679452},
doi = {10.1007/BF02679452},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KaklamanisKR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LeightonMS97,
author = {Frank Thomson Leighton and
Yuan Ma and
Torsten Suel},
title = {On Probabilistic Networks for Selection, Merging, and Sorting},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {559--582},
year = {1997},
url = {https://doi.org/10.1007/s002240000068},
doi = {10.1007/S002240000068},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LeightonMS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LeisersonR97,
author = {Charles E. Leiserson and
Keith H. Randall},
title = {Parallel Algorithms for the Circuit Value Update Problem},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {583--597},
year = {1997},
url = {https://doi.org/10.1007/s002240000069},
doi = {10.1007/S002240000069},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LeisersonR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Lutz97,
author = {Jack H. Lutz},
title = {Observations on Measure and Lowness for {\textbackslash}Deltap{\_}2},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {429--442},
year = {1997},
url = {https://doi.org/10.1007/s002240000060},
doi = {10.1007/S002240000060},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Lutz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MacKenzie97,
author = {Philip D. MacKenzie},
title = {Lower Bounds for Randomized Exclusive Write PRAMs},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {599--626},
year = {1997},
url = {https://doi.org/10.1007/s002240000070},
doi = {10.1007/S002240000070},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MacKenzie97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Macarie97,
author = {Ioan I. Macarie},
title = {Multihead Two-Way Probabilistic Finite Automata},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {91--109},
year = {1997},
url = {https://doi.org/10.1007/s002240000043},
doi = {10.1007/S002240000043},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Macarie97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MeinelS97,
author = {Christoph Meinel and
Anna Slobodov{\'{a}}},
title = {A Reducibility Concept for Problems Defined in Terms of Ordered Binary
Decision Diagrams},
journal = {Theory Comput. Syst.},
volume = {30},
number = {5},
pages = {495--518},
year = {1997},
url = {https://doi.org/10.1007/s002240000064},
doi = {10.1007/S002240000064},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MeinelS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Morales97,
author = {Luis B. Morales},
title = {Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {367--382},
year = {1997},
url = {https://doi.org/10.1007/s002240000057},
doi = {10.1007/S002240000057},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Morales97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PietracaprinaP97,
author = {Andrea Pietracaprina and
Franco P. Preparata},
title = {Practical Constructive Schemes for Deterministic Shared-Memory Access},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {3--37},
year = {1997},
url = {https://doi.org/10.1007/BF02679451},
doi = {10.1007/BF02679451},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PietracaprinaP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PietracaprinaP97a,
author = {Andrea Pietracaprina and
Geppino Pucci},
title = {The Complexity of Deterministic {PRAM} Simulation on Distributed Memory
Machines},
journal = {Theory Comput. Syst.},
volume = {30},
number = {3},
pages = {231--247},
year = {1997},
url = {https://doi.org/10.1007/s002240000052},
doi = {10.1007/S002240000052},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PietracaprinaP97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PinW97,
author = {Jean{-}Eric Pin and
Pascal Weil},
title = {Ponynominal Closure and Unambiguous Product},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {383--422},
year = {1997},
url = {https://doi.org/10.1007/BF02679467},
doi = {10.1007/BF02679467},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PinW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Pippenger97,
author = {Nicholas Pippenger},
title = {Regular Languages and Stone Duality},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {121--134},
year = {1997},
url = {https://doi.org/10.1007/s002240000045},
doi = {10.1007/S002240000045},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Pippenger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PointB97,
author = {Fran{\c{c}}oise Point and
V{\'{e}}ronique Bruy{\`{e}}re},
title = {On the Cobham-Semenov Theorem},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {197--220},
year = {1997},
url = {https://doi.org/10.1007/BF02679449},
doi = {10.1007/BF02679449},
timestamp = {Fri, 11 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PointB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RaghavanW97,
author = {Vijay Raghavan and
Dawn Wilkins},
title = {A Characterization and Nearly Linear-Time Equivalence Test for {\(\mathrm{\mu}\)}-Branching
Programs},
journal = {Theory Comput. Syst.},
volume = {30},
number = {3},
pages = {249--283},
year = {1997},
url = {https://doi.org/10.1007/s002240000053},
doi = {10.1007/S002240000053},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RaghavanW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Schoning97,
author = {Uwe Sch{\"{o}}ning},
title = {Complexity of Presburger Arithmetic with Fixed Quantifier Dimension},
journal = {Theory Comput. Syst.},
volume = {30},
number = {4},
pages = {423--428},
year = {1997},
url = {https://doi.org/10.1007/s002240000059},
doi = {10.1007/S002240000059},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Schoning97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ShavitT97,
author = {Nir Shavit and
Dan Touitou},
title = {Elimination Trees and the Construction of Pools and Stacks},
journal = {Theory Comput. Syst.},
volume = {30},
number = {6},
pages = {645--670},
year = {1997},
url = {https://doi.org/10.1007/s002240000072},
doi = {10.1007/S002240000072},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ShavitT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Spirakis97,
author = {Paul G. Spirakis},
title = {Editor's Foreword},
journal = {Theory Comput. Syst.},
volume = {30},
number = {1},
pages = {1},
year = {1997},
url = {https://doi.org/10.1007/BF02679450},
doi = {10.1007/BF02679450},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Spirakis97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SyrotiukCP97,
author = {Violet R. Syrotiuk and
Charles J. Colbourn and
Jan K. Pachl},
title = {Wang Tilings and Distributed Verification on Anonymous Torus Networks},
journal = {Theory Comput. Syst.},
volume = {30},
number = {2},
pages = {145--163},
year = {1997},
url = {https://doi.org/10.1007/BF02679446},
doi = {10.1007/BF02679446},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SyrotiukCP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/YenWY97,
author = {Hsu{-}Chun Yen and
Bow{-}Yaw Wang and
Ming{-}Sheng Yang},
title = {Deciding a Class of Path Formulas for Conflict-Free Petri Nets},
journal = {Theory Comput. Syst.},
volume = {30},
number = {5},
pages = {475--494},
year = {1997},
url = {https://doi.org/10.1007/s002240000063},
doi = {10.1007/S002240000063},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/YenWY97.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-11-27 04:42 CET 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:
