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/mst45.bht:"
download as .bib file
@article{DBLP:journals/mst/Adriaans09,
author = {Pieter W. Adriaans},
title = {Between Order and Chaos: The Quest for Meaningful Information},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {650--674},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9173-y},
doi = {10.1007/S00224-009-9173-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Adriaans09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AllenderBCDR09,
author = {Eric Allender and
David A. Mix Barrington and
Tanmoy Chakraborty and
Samir Datta and
Sambuddha Roy},
title = {Planar and Grid Graph Reachability Problems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {675--723},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9172-z},
doi = {10.1007/S00224-009-9172-Z},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AllenderBCDR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AlonAAP09,
author = {Noga Alon and
Baruch Awerbuch and
Yossi Azar and
Boaz Patt{-}Shamir},
title = {Tell Me Who {I} Am: An Interactive Recommendation System},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {261--279},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9100-7},
doi = {10.1007/S00224-008-9100-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AlonAAP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AntunesF09,
author = {Luis Filipe Coelho Antunes and
Lance Fortnow},
title = {Sophistication Revisited},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {150--161},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9095-5},
doi = {10.1007/S00224-007-9095-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntunesF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AntunesMSV09,
author = {Luis Filipe Coelho Antunes and
Armando Matos and
Andre Souto and
Paul M. B. Vit{\'{a}}nyi},
title = {Depth as Randomness Deficiency},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {724--739},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9171-0},
doi = {10.1007/S00224-009-9171-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntunesMSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AthanassopoulosCK09,
author = {Stavros Athanassopoulos and
Ioannis Caragiannis and
Christos Kaklamanis},
title = {Analysis of Approximation Algorithms for \emph{k}-Set Cover Using
Factor-Revealing Linear Programs},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {555--576},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9112-3},
doi = {10.1007/S00224-008-9112-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AthanassopoulosCK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AwerbuchS09,
author = {Baruch Awerbuch and
Christian Scheideler},
title = {Towards a Scalable and Robust {DHT}},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {234--260},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9099-9},
doi = {10.1007/S00224-008-9099-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AwerbuchS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bar-NoyGZ09,
author = {Amotz Bar{-}Noy and
Mordecai J. Golin and
Yan Zhang},
title = {Online Dynamic Programming Speedups},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {429--445},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9166-x},
doi = {10.1007/S00224-009-9166-X},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bar-NoyGZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BergCH09,
author = {Mark de Berg and
Sergio Cabello and
Sariel Har{-}Peled},
title = {Covering Many or Few Points with Unit Disks},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {446--469},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9135-9},
doi = {10.1007/S00224-008-9135-9},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BergCH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BienvenuDS09,
author = {Laurent Bienvenu and
David Doty and
Frank Stephan},
title = {Constructive Dimension and Turing Degrees},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {740--755},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9170-1},
doi = {10.1007/S00224-009-9170-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BienvenuDS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Blanchet-SadriBKPW09,
author = {Francine Blanchet{-}Sadri and
N. C. Brownstein and
Andy Kalcic and
Justin Palumbo and
Tracy Weyand},
title = {Unavoidable Sets of Partial Words},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {381--406},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9106-1},
doi = {10.1007/S00224-008-9106-1},
timestamp = {Sat, 28 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Blanchet-SadriBKPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BonifaciS09,
author = {Vincenzo Bonifaci and
Leen Stougie},
title = {Online \emph{k}-Server Routing Problems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {470--485},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9103-4},
doi = {10.1007/S00224-008-9103-4},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BonifaciS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaiCL09,
author = {Jin{-}yi Cai and
Vinay Choudhary and
Pinyan Lu},
title = {On the Theory of Matchgate Computations},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {108--132},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9092-8},
doi = {10.1007/S00224-007-9092-8},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaiCL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Case09,
author = {John Case},
title = {Resource Restricted Computability Theoretic Learning: Illustrative
Topics and Problems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {773--786},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9169-7},
doi = {10.1007/S00224-009-9169-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Case09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaseM09,
author = {John Case and
Samuel E. Moelius},
title = {Characterizing Programming Systems Allowing Program Self-Reference},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {756--772},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9168-8},
doi = {10.1007/S00224-009-9168-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaseM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChanZ09,
author = {Timothy M. Chan and
Hamid Zarrabi{-}Zadeh},
title = {A Randomized Algorithm for Online Unit Clustering},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {486--496},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9085-7},
doi = {10.1007/S00224-007-9085-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChanZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChenR09,
author = {Ho{-}Lin Chen and
Tim Roughgarden},
title = {Network Design with Weighted Players},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {302--324},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9128-8},
doi = {10.1007/S00224-008-9128-8},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChenR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChiolaCGHNS09,
author = {Giovanni Chiola and
Gennaro Cordasco and
Luisa Gargano and
Mikael Hammar and
Alberto Negro and
Vittorio Scarano},
title = {Degree-Optimal Routing for {P2P} Systems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {43--63},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9074-x},
doi = {10.1007/S00224-007-9074-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChiolaCGHNS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CooperMS09,
author = {S. Barry Cooper and
Elvira Mayordomo and
Andrea Sorbi},
title = {Computation and Logic in the Real World: CiE 2007},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {647--649},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9164-4},
doi = {10.1007/S00224-008-9164-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CooperMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Dai09,
author = {Jack Jie Dai},
title = {An Outer-Measure Approach for Resource-Bounded Measure},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {64--73},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9075-9},
doi = {10.1007/S00224-007-9075-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Dai09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DannerR09,
author = {Norman Danner and
James S. Royer},
title = {Two Algorithms in Search of a Type-System},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {787--821},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9181-y},
doi = {10.1007/S00224-009-9181-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DannerR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DasK09,
author = {Aparna Das and
Claire Kenyon{-}Mathieu},
title = {On Hierarchical Diameter-Clustering and the Supplier Problem},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {497--511},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9186-6},
doi = {10.1007/S00224-009-9186-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DasK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Dorn09,
author = {Sebastian D{\"{o}}rn},
title = {Quantum Algorithms for Matching Problems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {613--628},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9118-x},
doi = {10.1007/S00224-008-9118-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Dorn09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachK09,
author = {Thomas Erlebach and
Christos Kaklamanis},
title = {{WAOA} 2006 Special Issue of {TOCS}},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {427--428},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9189-3},
doi = {10.1007/S00224-009-9189-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FellowsLMMRS09,
author = {Michael R. Fellows and
Daniel Lokshtanov and
Neeldhara Misra and
Matthias Mnich and
Frances A. Rosamond and
Saket Saurabh},
title = {The Complexity Ecology of Parameters: An Illustration Using Bounded
Max Leaf Number},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {822--848},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9167-9},
doi = {10.1007/S00224-009-9167-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FellowsLMMRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FennerGP09,
author = {Stephen A. Fenner and
William I. Gasarch and
Brian Postow},
title = {The Complexity of Finding SUBSEQ(\emph{A})},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {577--612},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9111-4},
doi = {10.1007/S00224-008-9111-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FennerGP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FlocchiniPS09,
author = {Paola Flocchini and
Andrzej Pelc and
Nicola Santoro},
title = {Fault-Tolerant Sequential Scan},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {1--26},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9065-y},
doi = {10.1007/S00224-007-9065-Y},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FlocchiniPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ForysO09,
author = {Wit Forys and
Piotr Oprocha},
title = {Infinite Traces and Symbolic Dynamics},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {133--149},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9093-7},
doi = {10.1007/S00224-007-9093-7},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ForysO09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FriedlISV09,
author = {Katalin Friedl and
G{\'{a}}bor Ivanyos and
Miklos Santha and
Yves F. Verhoeven},
title = {On the Black-Box Complexity of Sperner's Lemma},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {629--646},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9121-2},
doi = {10.1007/S00224-008-9121-2},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FriedlISV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FrigoS09,
author = {Matteo Frigo and
Volker Strumpen},
title = {The Cache Complexity of Multithreaded Cache Oblivious Algorithms},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {203--233},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9098-2},
doi = {10.1007/S00224-007-9098-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FrigoS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FukunagaN09,
author = {Takuro Fukunaga and
Hiroshi Nagamochi},
title = {Network Design with Edge-Connectivity and Degree Constraints},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {512--532},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9149-3},
doi = {10.1007/S00224-008-9149-3},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FukunagaN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Gall09,
author = {Fran{\c{c}}ois Le Gall},
title = {Exponential Separation of Quantum and Classical Online Space Complexity},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {188--202},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9097-3},
doi = {10.1007/S00224-007-9097-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Gall09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GodfreyK09,
author = {Brighten Godfrey and
Richard M. Karp},
title = {On the Price of Heterogeneity in Parallel Systems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {280--301},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9102-5},
doi = {10.1007/S00224-008-9102-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GodfreyK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HarksHP09,
author = {Tobias Harks and
Stefan Heinz and
Marc E. Pfetsch},
title = {Competitive Online Multicommodity Routing},
journal = {Theory Comput. Syst.},
volume = {45},
number = {3},
pages = {533--554},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9187-5},
doi = {10.1007/S00224-009-9187-5},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HarksHP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HsiehW09,
author = {Sun{-}Yuan Hsieh and
Yu{-}Fen Weng},
title = {Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths
on a Faulty Hypercube with Edge Faults},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {407--425},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9108-z},
doi = {10.1007/S00224-008-9108-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HsiehW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/IliopoulosR09,
author = {Costas S. Iliopoulos and
Mohammad Sohel Rahman},
title = {A New Efficient Algorithm for Computing the Longest Common Subsequence},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {355--371},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9101-6},
doi = {10.1007/S00224-008-9101-6},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/IliopoulosR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JainMS09,
author = {Sanjay Jain and
Eric Martin and
Frank Stephan},
title = {Input-Dependence in Function-Learning},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {849--864},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9174-x},
doi = {10.1007/S00224-009-9174-X},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JainMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Jurdzinski09,
author = {Tomasz Jurdzinski},
title = {Probabilistic Length-Reducing Two-Pushdown Automata},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {74--107},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9066-x},
doi = {10.1007/S00224-007-9066-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Jurdzinski09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KleinbergS09,
author = {Robert D. Kleinberg and
Christian Scheideler},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {187},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9202-x},
doi = {10.1007/S00224-009-9202-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KleinbergS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Koucky09,
author = {Michal Kouck{\'{y}}},
title = {Circuit Complexity of Regular Languages},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {865--879},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9180-z},
doi = {10.1007/S00224-009-9180-Z},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Koucky09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kral09,
author = {Daniel Kr{\'{a}}l},
title = {Polynomial-Size Binary Decision Diagrams for the Exactly Half-\emph{d}-Hyperclique
Problem Reading Each Input Bit Twice},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {27--42},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9067-9},
doi = {10.1007/S00224-007-9067-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Kral09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Li09,
author = {Chung{-}Chih Li},
title = {Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {880--896},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9182-x},
doi = {10.1007/S00224-009-9182-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Li09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Lipets09,
author = {Vladimir Lipets},
title = {Bounds on Mincut for Cayley Graphs over Abelian Groups},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {372--380},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9105-2},
doi = {10.1007/S00224-008-9105-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Lipets09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LitmanM09,
author = {Ami Litman and
Shiri Moran{-}Schein},
title = {Smooth Scheduling under Variable Rates or the Analog-Digital Confinement
Game},
journal = {Theory Comput. Syst.},
volume = {45},
number = {2},
pages = {325--354},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9134-x},
doi = {10.1007/S00224-008-9134-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LitmanM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Melnikov09,
author = {Alexander G. Melnikov},
title = {Enumerations and Completely Decomposable Torsion-Free Abelian Groups},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {897--916},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9175-9},
doi = {10.1007/S00224-009-9175-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Melnikov09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Olsen09,
author = {Martin Olsen},
title = {Nash Stability in Additively Separable Hedonic Games and Community
Structures},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {917--925},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9176-8},
doi = {10.1007/S00224-009-9176-8},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Olsen09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/OnsjoW09,
author = {Mikael Onsj{\"{o}} and
Osamu Watanabe},
title = {Theory of Computing Systems {(TOCS)} Submission Version Finding Most
Likely Solutions},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {926--942},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9179-5},
doi = {10.1007/S00224-009-9179-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/OnsjoW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/OnsjoW09a,
author = {Mikael Onsj{\"{o}} and
Osamu Watanabe},
title = {Finding Most Likely Solutions},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {943},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9218-2},
doi = {10.1007/S00224-009-9218-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/OnsjoW09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Pinto09,
author = {Alexandre Pinto},
title = {Comparing Notions of Computational Entropy},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {944--962},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9177-7},
doi = {10.1007/S00224-009-9177-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Pinto09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Santo09,
author = {Jos{\'{e}} Esp{\'{\i}}rito Santo},
title = {The \emph{lambda}-Calculus and the Unity of Structural Proof Theory},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {963--994},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9183-9},
doi = {10.1007/S00224-009-9183-9},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Santo09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TsaggourisZ09,
author = {George Tsaggouris and
Christos D. Zaroliagis},
title = {Multiobjective Optimization: Improved {FPTAS} for Shortest Paths and
Non-Linear Objectives with Applications},
journal = {Theory Comput. Syst.},
volume = {45},
number = {1},
pages = {162--186},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9096-4},
doi = {10.1007/S00224-007-9096-4},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TsaggourisZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/WiedermannP09,
author = {Jir{\'{\i}} Wiedermann and
Luk{\'{a}}s Petru},
title = {On the Universal Computing Power of Amorphous Computing Systems},
journal = {Theory Comput. Syst.},
volume = {45},
number = {4},
pages = {995--1010},
year = {2009},
url = {https://doi.org/10.1007/s00224-009-9178-6},
doi = {10.1007/S00224-009-9178-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/WiedermannP09.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-06-06 07:44 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:
