Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mst/mst24.bht:"
download as .bib file
@article{DBLP:journals/mst/AielloLMN91,
author = {William Aiello and
Frank Thomson Leighton and
Bruce M. Maggs and
Mark Newman},
title = {Fast Algorithms for Bit-Serial Routing on a Hypercube},
journal = {Math. Syst. Theory},
volume = {24},
number = {4},
pages = {253--271},
year = {1991},
url = {https://doi.org/10.1007/BF02090402},
doi = {10.1007/BF02090402},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AielloLMN91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Allender91,
author = {Eric Allender},
title = {Limitations of the Upward Separation Technique},
journal = {Math. Syst. Theory},
volume = {24},
number = {1},
pages = {53--67},
year = {1991},
url = {https://doi.org/10.1007/BF02090390},
doi = {10.1007/BF02090390},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Allender91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BaumslagA91,
author = {Marc Baumslag and
Fred S. Annexstein},
title = {A Unified Framework for Off-Line Permutation Routing in Parallel Networks},
journal = {Math. Syst. Theory},
volume = {24},
number = {4},
pages = {233--251},
year = {1991},
url = {https://doi.org/10.1007/BF02090401},
doi = {10.1007/BF02090401},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BaumslagA91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanHT91,
author = {Harry Buhrman and
Steven Homer and
Leen Torenvliet},
title = {Completeness for Nondeterministic Complexity Classes},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {179--200},
year = {1991},
url = {https://doi.org/10.1007/BF02090397},
doi = {10.1007/BF02090397},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanHT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CourcelleNP91,
author = {Bruno Courcelle and
Damian Niwinski and
Andreas Podelski},
title = {A Geometrical View of the Determinization and Minimization of Finite-State
Automata},
journal = {Math. Syst. Theory},
volume = {24},
number = {2},
pages = {117--146},
year = {1991},
url = {https://doi.org/10.1007/BF02090394},
doi = {10.1007/BF02090394},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CourcelleNP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GreenbergB91,
author = {David S. Greenberg and
Sandeep N. Bhatt},
title = {Routing Multiple Paths in Hypercubes},
journal = {Math. Syst. Theory},
volume = {24},
number = {4},
pages = {295--321},
year = {1991},
url = {https://doi.org/10.1007/BF02090404},
doi = {10.1007/BF02090404},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GreenbergB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HaralambidesMM91,
author = {James Haralambides and
Fillia Makedon and
Burkhard Monien},
title = {Bandwidth Minimization: An Approximation Algorithm for Caterpillars},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {169--177},
year = {1991},
url = {https://doi.org/10.1007/BF02090396},
doi = {10.1007/BF02090396},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HaralambidesMM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hromkovic91,
author = {Juraj Hromkovic},
title = {On Problems for Which no Oracle Can Help},
journal = {Math. Syst. Theory},
volume = {24},
number = {1},
pages = {41--52},
year = {1991},
url = {https://doi.org/10.1007/BF02090389},
doi = {10.1007/BF02090389},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hromkovic91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KaklamanisKT91,
author = {Christos Kaklamanis and
Danny Krizanc and
Thanasis Tsantilas},
title = {Tight Bounds for Oblivious Routing in the Hypercube},
journal = {Math. Syst. Theory},
volume = {24},
number = {4},
pages = {223--232},
year = {1991},
url = {https://doi.org/10.1007/BF02090400},
doi = {10.1007/BF02090400},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KaklamanisKT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KravetsP91,
author = {Dina Kravets and
James K. Park},
title = {Selection and Sorting in Totally Monotone Arrays},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {201--220},
year = {1991},
url = {https://doi.org/10.1007/BF02090398},
doi = {10.1007/BF02090398},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KravetsP91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LozanoT91,
author = {Antoni Lozano and
Jacobo Tor{\'{a}}n},
title = {Self-Reducible Sets of Small Sensity},
journal = {Math. Syst. Theory},
volume = {24},
number = {2},
pages = {83--100},
year = {1991},
url = {https://doi.org/10.1007/BF02090392},
doi = {10.1007/BF02090392},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LozanoT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Lyuu91,
author = {Yuh{-}Dauh Lyuu},
title = {Fast Fault-Tolerant Parallel Communication and On-Line Maintenance
for Hypercubes Using Information Dispersal},
journal = {Math. Syst. Theory},
volume = {24},
number = {4},
pages = {273--294},
year = {1991},
url = {https://doi.org/10.1007/BF02090403},
doi = {10.1007/BF02090403},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Lyuu91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MillerS91,
author = {Zevi Miller and
Ivan Hal Sudborough},
title = {A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs},
journal = {Math. Syst. Theory},
volume = {24},
number = {1},
pages = {11--40},
year = {1991},
url = {https://doi.org/10.1007/BF02090388},
doi = {10.1007/BF02090388},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MillerS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Parberry91,
author = {Ian Parberry},
title = {A Computer-Assisted Optimal Depth Lower Bound for Nine-Input Sorting
Networks},
journal = {Math. Syst. Theory},
volume = {24},
number = {2},
pages = {101--116},
year = {1991},
url = {https://doi.org/10.1007/BF02090393},
doi = {10.1007/BF02090393},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Parberry91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SloughW91,
author = {William Slough and
Karl Winklmann},
title = {On Limitations of Transformations Between Combinatorial Problems},
journal = {Math. Syst. Theory},
volume = {24},
number = {3},
pages = {149--168},
year = {1991},
url = {https://doi.org/10.1007/BF02090395},
doi = {10.1007/BF02090395},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SloughW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Toda91,
author = {Seinosuke Toda},
title = {On Polynomial-Time Truth-Table Reducibility of Intractable Sets to
P-Selective Sets},
journal = {Math. Syst. Theory},
volume = {24},
number = {2},
pages = {68--82},
year = {1991},
url = {https://doi.org/10.1007/BF02090391},
doi = {10.1007/BF02090391},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Toda91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Watanabe91,
author = {Osamu Watanabe},
title = {On Intractability of the Class {UP}},
journal = {Math. Syst. Theory},
volume = {24},
number = {1},
pages = {1--10},
year = {1991},
url = {https://doi.org/10.1007/BF02090387},
doi = {10.1007/BF02090387},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Watanabe91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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-05-24 10:13 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:
