Search dblp for Publications

export results for "toc:db/journals/mst/mst34.bht:"

 download as .bib file

@article{DBLP:journals/mst/Al-AmmalGM01,
  author       = {Hesham Al{-}Ammal and
                  Leslie Ann Goldberg and
                  Philip D. MacKenzie},
  title        = {An Improved Stability Bound for Binary Exponential Backoff},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {3},
  pages        = {229--244},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0005-y},
  doi          = {10.1007/S00224-001-0005-Y},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Al-AmmalGM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AroraBP01,
  author       = {Nimar S. Arora and
                  Robert D. Blumofe and
                  C. Greg Plaxton},
  title        = {Thread Scheduling for Multiprogrammed Multiprocessors},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {2},
  pages        = {115--144},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0004-z},
  doi          = {10.1007/S00224-001-0004-Z},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/AroraBP01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BarbosaBF01,
  author       = {Valmir Carneiro Barbosa and
                  Mario R. F. Benevides and
                  Felipe M. G. Fran{\c{c}}a},
  title        = {Sharing Resources at Nonuniform Access Rates},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {13--26},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010008},
  doi          = {10.1007/S002240010008},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BarbosaBF01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeckerLLS01,
  author       = {Ronald I. Becker and
                  Isabella Lari and
                  Mario Lucertini and
                  Bruno Simeone},
  title        = {A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {353--374},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0008-8},
  doi          = {10.1007/S00224-001-0008-8},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/BeckerLLS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CarpiLV01,
  author       = {Arturo Carpi and
                  Aldo de Luca and
                  Stefano Varricchio},
  title        = {Special Factors and Uniqueness Conditions in Rational Trees},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {375--395},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-1006-6},
  doi          = {10.1007/S00224-001-1006-6},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CarpiLV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaucalK01,
  author       = {Didier Caucal and
                  Teodor Knapik},
  title        = {An Internal Presentation of Regular Graphs by Prefix-Recognizable
                  Graphs},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {299--336},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-1015-5},
  doi          = {10.1007/S00224-001-1015-5},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/CaucalK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DittrichHM01,
  author       = {Wolfgang Dittrich and
                  David A. Hutchinson and
                  Anil Maheshwari},
  title        = {Blocking in Parallel Multisearch Problems},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {2},
  pages        = {145--189},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0002-1},
  doi          = {10.1007/S00224-001-0002-1},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/DittrichHM01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FortnowPS01,
  author       = {Lance Fortnow and
                  Aduri Pavan and
                  Alan L. Selman},
  title        = {Distributionally Hard Languages},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {3},
  pages        = {245--261},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0003-0},
  doi          = {10.1007/S00224-001-0003-0},
  timestamp    = {Fri, 02 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/FortnowPS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Honkala01,
  author       = {Juha Honkala},
  title        = {A Polynomial Bound for Certain Cases of the {D0L} Sequence Equivalence
                  Problem},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {3},
  pages        = {263--272},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0001-2},
  doi          = {10.1007/S00224-001-0001-2},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Honkala01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KimS01,
  author       = {Sung Kwon Kim and
                  Chan{-}Su Shin},
  title        = {Computing the Optimal Bridge between Two Polygons},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {337--352},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-1018-2},
  doi          = {10.1007/S00224-001-1018-2},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KimS01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KirstenR01,
  author       = {Daniel Kirsten and
                  Gw{\'{e}}na{\"{e}}l Richomme},
  title        = {Decidability Equivalence between the Star Problem and the Finite Power
                  Problem in Trace Monoids},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {3},
  pages        = {193--227},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-0006-x},
  doi          = {10.1007/S00224-001-0006-X},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/KirstenR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KranakisKL01,
  author       = {Evangelos Kranakis and
                  Danny Krizanc and
                  Flaminia L. Luccio},
  title        = {On Recognizing a String on an Anonymous Ring},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {3--12},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010007},
  doi          = {10.1007/S002240010007},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/KranakisKL01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LecomteR01,
  author       = {Pierre B. A. Lecomte and
                  Michel Rigo},
  title        = {Numeration Systems on a Regular Language},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {27--44},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010014},
  doi          = {10.1007/S002240010014},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/LecomteR01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mitzenmacher01,
  author       = {Michael Mitzenmacher},
  title        = {Analyses of Load Stealing Models Based on Families of Differential
                  Equations},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {77--98},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010010},
  doi          = {10.1007/S002240010010},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Mitzenmacher01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NollV01,
  author       = {Thomas Noll and
                  Heiko Vogler},
  title        = {The Universality of Higher-Order Attributed Tree Transducers},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {45--75},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010018},
  doi          = {10.1007/S002240010018},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/NollV01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Rajasekaran01,
  author       = {Sanguthevar Rajasekaran},
  title        = {A Framework for Simple Sorting Algorithms on Parallel Disk Systems},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {2},
  pages        = {101--114},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010020},
  doi          = {10.1007/S002240010020},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Rajasekaran01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Selman01,
  author       = {Alan L. Selman},
  title        = {Editorial Statement},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {1},
  pages        = {1},
  year         = {2001},
  url          = {https://doi.org/10.1007/s002240010019},
  doi          = {10.1007/S002240010019},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/Selman01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TorreK01,
  author       = {Pilar de la Torre and
                  Clyde P. Kruskal},
  title        = {Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic
                  Depth-First Search, Breadth-First Search, and Topological-First Search},
  journal      = {Theory Comput. Syst.},
  volume       = {34},
  number       = {4},
  pages        = {275--298},
  year         = {2001},
  url          = {https://doi.org/10.1007/s00224-001-1008-4},
  doi          = {10.1007/S00224-001-1008-4},
  timestamp    = {Sun, 28 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mst/TorreK01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics