default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mst/mst27.bht:"
download as .bib file
@article{DBLP:journals/mst/Anderson94,
author = {Richard J. Anderson},
title = {Primitives for Asynchronous List Compression},
journal = {Math. Syst. Theory},
volume = {27},
number = {5},
pages = {453--470},
year = {1994},
url = {https://doi.org/10.1007/BF01184934},
doi = {10.1007/BF01184934},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Anderson94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AttiyaM94,
author = {Hagit Attiya and
Marios Mavronicolas},
title = {Efficiency of Semisynchronous Versus},
journal = {Math. Syst. Theory},
volume = {27},
number = {6},
pages = {547--571},
year = {1994},
url = {https://doi.org/10.1007/BF01191625},
doi = {10.1007/BF01191625},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AttiyaM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bar-NoyK94,
author = {Amotz Bar{-}Noy and
Shlomo Kipnis},
title = {Designing Broadcasting Algorithms in the Postal Model for Message-Passing
Systems},
journal = {Math. Syst. Theory},
volume = {27},
number = {5},
pages = {431--452},
year = {1994},
url = {https://doi.org/10.1007/BF01184933},
doi = {10.1007/BF01184933},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bar-NoyK94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BerendF94,
author = {Daniel Berend and
Christiane Frougny},
title = {Computability by Finite Automata and Pisot Bases},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {275--282},
year = {1994},
url = {https://doi.org/10.1007/BF01578846},
doi = {10.1007/BF01578846},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BerendF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BookLW94,
author = {Ronald V. Book and
Jack H. Lutz and
Klaus W. Wagner},
title = {An Observation on Probability Versus Randomness with Applications
to Complexity Classes},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {201--209},
year = {1994},
url = {https://doi.org/10.1007/BF01578842},
doi = {10.1007/BF01578842},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BookLW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChamberlainF94,
author = {Robert F. Chamberlain and
Charles M. Fiduccia},
title = {Universality of Iterated Networks},
journal = {Math. Syst. Theory},
volume = {27},
number = {5},
pages = {381--430},
year = {1994},
url = {https://doi.org/10.1007/BF01184932},
doi = {10.1007/BF01184932},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChamberlainF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EhrenfeuchtRS94,
author = {Andrzej Ehrenfeucht and
Grzegorz Rozenberg and
Kai Salomaa},
title = {Semantics of Trees},
journal = {Math. Syst. Theory},
volume = {27},
number = {2},
pages = {159--181},
year = {1994},
url = {https://doi.org/10.1007/BF01195201},
doi = {10.1007/BF01195201},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EhrenfeuchtRS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EvenL94,
author = {Shimon Even and
Ami Litman},
title = {On the Capabilities of Systolic Systems},
journal = {Math. Syst. Theory},
volume = {27},
number = {1},
pages = {3--28},
year = {1994},
url = {https://doi.org/10.1007/BF01187090},
doi = {10.1007/BF01187090},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EvenL94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FrandsenVB94,
author = {Gudmund Skovbjerg Frandsen and
Mark Valence and
David A. Mix Barrington},
title = {Some Results on Uniform Arithmetic Circuit Complexity},
journal = {Math. Syst. Theory},
volume = {27},
number = {2},
pages = {105--124},
year = {1994},
url = {https://doi.org/10.1007/BF01195199},
doi = {10.1007/BF01195199},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FrandsenVB94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FuLZ94,
author = {Bin Fu and
Hong{-}Zhou Li and
Yong Zhong},
title = {An Application of the Translational Method},
journal = {Math. Syst. Theory},
volume = {27},
number = {2},
pages = {183--186},
year = {1994},
url = {https://doi.org/10.1007/BF01195202},
doi = {10.1007/BF01195202},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FuLZ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HermoM94,
author = {Montserrat Hermo and
Elvira Mayordomo},
title = {A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov
Complexity},
journal = {Math. Syst. Theory},
volume = {27},
number = {4},
pages = {347--356},
year = {1994},
url = {https://doi.org/10.1007/BF01192144},
doi = {10.1007/BF01192144},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HermoM94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hertz94,
author = {Alain Hertz},
title = {A New Polynomial-Time Algorithm for the Maximum Weighted ({\textbackslash}chi(G)
- 1)-Coloring Problem in Comparability Graphs},
journal = {Math. Syst. Theory},
volume = {27},
number = {4},
pages = {357--363},
year = {1994},
url = {https://doi.org/10.1007/BF01192145},
doi = {10.1007/BF01192145},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hertz94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KaklamanisP94,
author = {Christos Kaklamanis and
Giuseppe Persiano},
title = {Branch-and-Bound and Backtrack Search on Mesh-Connected Arrays of
Processors},
journal = {Math. Syst. Theory},
volume = {27},
number = {5},
pages = {471--489},
year = {1994},
url = {https://doi.org/10.1007/BF01184935},
doi = {10.1007/BF01184935},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KaklamanisP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KratschH94,
author = {Dieter Kratsch and
Lane A. Hemaspaandra},
title = {On the Complexity of Graph Reconstruction},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {257--273},
year = {1994},
url = {https://doi.org/10.1007/BF01578845},
doi = {10.1007/BF01578845},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KratschH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LiV94,
author = {Ming Li and
Paul M. B. Vit{\'{a}}nyi},
title = {Statistical Properties of Finite Sequences with High Kolmogorov Complexity},
journal = {Math. Syst. Theory},
volume = {27},
number = {4},
pages = {365--376},
year = {1994},
url = {https://doi.org/10.1007/BF01192146},
doi = {10.1007/BF01192146},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LiV94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LinP94,
author = {Geng Lin and
Nicholas Pippenger},
title = {Parallel Algorithms for Routing in Nonblocking Networks},
journal = {Math. Syst. Theory},
volume = {27},
number = {1},
pages = {29--40},
year = {1994},
url = {https://doi.org/10.1007/BF01187091},
doi = {10.1007/BF01187091},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LinP94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Obrenic94,
author = {Bojana Obrenic},
title = {An Approach To Emulating Separable Graphs},
journal = {Math. Syst. Theory},
volume = {27},
number = {1},
pages = {41--63},
year = {1994},
url = {https://doi.org/10.1007/BF01187092},
doi = {10.1007/BF01187092},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Obrenic94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ogiwara94,
author = {Mitsunori Ogiwara},
title = {Generalized Theorems on Relationships Among Reducibility Notions to
Certain Complexity Classes},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {189--200},
year = {1994},
url = {https://doi.org/10.1007/BF01578841},
doi = {10.1007/BF01578841},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Ogiwara94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Papaefthymiou94,
author = {Marios C. Papaefthymiou},
title = {Understanding Retiming Through Maximum Avarage-Delay Cycles},
journal = {Math. Syst. Theory},
volume = {27},
number = {1},
pages = {65--84},
year = {1994},
url = {https://doi.org/10.1007/BF01187093},
doi = {10.1007/BF01187093},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Papaefthymiou94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PlaxtonS94,
author = {C. Greg Plaxton and
Torsten Suel},
title = {A Lower Bound for Sorting Networks Based on the Shuffle Permutation},
journal = {Math. Syst. Theory},
volume = {27},
number = {5},
pages = {491--508},
year = {1994},
url = {https://doi.org/10.1007/BF01184936},
doi = {10.1007/BF01184936},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PlaxtonS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ranade94,
author = {Abhiram G. Ranade},
title = {Optimal Speedup for Backtrack Search on a Butterfly Network},
journal = {Math. Syst. Theory},
volume = {27},
number = {1},
pages = {85--101},
year = {1994},
url = {https://doi.org/10.1007/BF01187094},
doi = {10.1007/BF01187094},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Ranade94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Seidl94,
author = {Helmut Seidl},
title = {Equivalence of Finite-Valued Tree Transducers Is Decidable},
journal = {Math. Syst. Theory},
volume = {27},
number = {4},
pages = {285--346},
year = {1994},
url = {https://doi.org/10.1007/BF01192143},
doi = {10.1007/BF01192143},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Seidl94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Stewart94,
author = {Iain A. Stewart},
title = {On Completeness for {NP} via Projection Translations},
journal = {Math. Syst. Theory},
volume = {27},
number = {2},
pages = {125--157},
year = {1994},
url = {https://doi.org/10.1007/BF01195200},
doi = {10.1007/BF01195200},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Stewart94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Vijay-ShankerW94,
author = {K. Vijay{-}Shanker and
David J. Weir},
title = {The Equivalence of Four Extensions of Context-Free Grammars},
journal = {Math. Syst. Theory},
volume = {27},
number = {6},
pages = {511--546},
year = {1994},
url = {https://doi.org/10.1007/BF01191624},
doi = {10.1007/BF01191624},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Vijay-ShankerW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Watanabe94,
author = {Osamu Watanabe},
title = {A Framework for Polynomial-Time Query Learnability},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {211--229},
year = {1994},
url = {https://doi.org/10.1007/BF01578843},
doi = {10.1007/BF01578843},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Watanabe94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/WatanabeG94,
author = {Osamu Watanabe and
Ricard Gavald{\`{a}}},
title = {Structural Analysis of Polynomial-Time Query Learnability},
journal = {Math. Syst. Theory},
volume = {27},
number = {3},
pages = {231--256},
year = {1994},
url = {https://doi.org/10.1007/BF01578844},
doi = {10.1007/BF01578844},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/WatanabeG94.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-09-19 23:51 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:
