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/mst37.bht:"
download as .bib file
@article{DBLP:journals/mst/AidaCRW04,
author = {Shin Aida and
Marcel Cr{\^{a}}smaru and
Kenneth W. Regan and
Osamu Watanabe},
title = {Games with Uniqueness Properties},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {29--47},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1105-7},
doi = {10.1007/S00224-003-1105-7},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AidaCRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AlstrupGKR04,
author = {Stephen Alstrup and
Cyril Gavoille and
Haim Kaplan and
Theis Rauhe},
title = {Nearest Common Ancestors: {A} Survey and a New Algorithm for a Distributed
Environment},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {441--456},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1155-5},
doi = {10.1007/S00224-004-1155-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AlstrupGKR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BarthB04,
author = {Dominique Barth and
Pascal Berthom{\'{e}}},
title = {Periodic Gossiping in Commuted Networks},
journal = {Theory Comput. Syst.},
volume = {37},
number = {5},
pages = {559--584},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1197-8},
doi = {10.1007/S00224-004-1197-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BarthB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BealC04,
author = {Marie{-}Pierre B{\'{e}}al and
Olivier Carton},
title = {Determinization of Transducers over Infinite Words: The General Case},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {483--502},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1014-9},
doi = {10.1007/S00224-003-1014-9},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BealC04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BerwangerG04,
author = {Dietmar Berwanger and
Erich Gr{\"{a}}del},
title = {Fixed-Point Logics and Solitaire Games},
journal = {Theory Comput. Syst.},
volume = {37},
number = {6},
pages = {675--694},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1147-5},
doi = {10.1007/S00224-004-1147-5},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BerwangerG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Blumensath04,
author = {Achim Blumensath},
title = {Axiomatising Tree-Interpretable Structures},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {3--27},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1104-8},
doi = {10.1007/S00224-003-1104-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Blumensath04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BlumensathG04,
author = {Achim Blumensath and
Erich Gr{\"{a}}del},
title = {Finite Presentations of Infinite Structures: Automata and Interpretations},
journal = {Theory Comput. Syst.},
volume = {37},
number = {6},
pages = {641--674},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1133-y},
doi = {10.1007/S00224-004-1133-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BlumensathG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BurckelM04,
author = {Serge Burckel and
Marianne Morillon},
title = {Quadratic Sequential Computations of Boolean Mappings},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {519--525},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1069-7},
doi = {10.1007/S00224-003-1069-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BurckelM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Busch04,
author = {Costas Busch},
title = {{\~{O}}(Congestion + Dilation) Hot-Potato Routing on Leveled Networks},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {371--396},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1136-8},
doi = {10.1007/S00224-004-1136-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Busch04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChenCH04,
author = {Wei{-}Mei Chen and
Gen{-}Huey Chen and
D. Frank Hsu},
title = {Generalized Diameters of the Mesh of Trees},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {547--556},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1115-0},
doi = {10.1007/S00224-004-1115-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChenCH04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChongNP04,
author = {Ka Wong Chong and
Stavros D. Nikolopoulos and
Leonidas Palios},
title = {An Optimal Parallel Co-Connectivity Algorithm},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {527--546},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1074-x},
doi = {10.1007/S00224-003-1074-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChongNP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DiekertL04,
author = {Volker Diekert and
Markus Lohrey},
title = {Existential and Positive Theories of Equations in Graph Products},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {133--156},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1110-x},
doi = {10.1007/S00224-003-1110-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DiekertL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Frick04,
author = {Markus Frick},
title = {Generalized Model-Checking over Locally Tree-Decomposable Classes},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {157--191},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1111-9},
doi = {10.1007/S00224-003-1111-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Frick04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GibbonsT04,
author = {Phillip B. Gibbons and
Srikanta Tirthapura},
title = {Distributed Streams Algorithms for Sliding Windows},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {457--478},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1156-4},
doi = {10.1007/S00224-004-1156-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GibbonsT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GodardMM04,
author = {Emmanuel Godard and
Yves M{\'{e}}tivier and
Anca Muscholl},
title = {Characterizations of Classes of Graphs Recognizable by Local Computations},
journal = {Theory Comput. Syst.},
volume = {37},
number = {2},
pages = {249--293},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1062-1},
doi = {10.1007/S00224-003-1062-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GodardMM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GottlobHR04,
author = {Georg Gottlob and
Miki Hermann and
Micha{\"{e}}l Rusinowitch},
title = {2nd International Workshop on Complexity in Automated Deduction (CiAD)
- Foreword},
journal = {Theory Comput. Syst.},
volume = {37},
number = {6},
pages = {639--640},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-3706-1},
doi = {10.1007/S00224-004-3706-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GottlobHR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GroheT04,
author = {Martin Grohe and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Learnability and Definability in Trees and Similar Structures},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {193--220},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1112-8},
doi = {10.1007/S00224-003-1112-8},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GroheT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hatano04,
author = {Kohei Hatano},
title = {A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {503--518},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1064-z},
doi = {10.1007/S00224-003-1064-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hatano04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HeideSVG04,
author = {Friedhelm Meyer auf der Heide and
Christian Schindelhauer and
Klaus Volbert and
Matthias Gr{\"{u}}newald},
title = {Congestion, Dilation, and Energy in Radio Networks},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {343--370},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1124-z},
doi = {10.1007/S00224-004-1124-Z},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HeideSVG04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HildrumKRZ04,
author = {Kirsten Hildrum and
John D. Kubiatowicz and
Satish Rao and
Ben Y. Zhao},
title = {Distributed Object Location in a Dynamic Network},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {405--440},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1146-6},
doi = {10.1007/S00224-004-1146-6},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HildrumKRZ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KirousisK04,
author = {Lefteris M. Kirousis and
Phokion G. Kolaitis},
title = {A Dichotomy in the Complexity of Propositional Circumscription},
journal = {Theory Comput. Syst.},
volume = {37},
number = {6},
pages = {695--715},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1152-8},
doi = {10.1007/S00224-004-1152-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KirousisK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Klauck04,
author = {Hartmut Klauck},
title = {Quantum and Approximate Privacy},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {221--246},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1113-7},
doi = {10.1007/S00224-003-1113-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Klauck04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KooLNT04,
author = {Chiu{-}Yuen Koo and
Tak Wah Lam and
Tsuen{-}Wan Ngan and
Kar{-}Keung To},
title = {Extra Processors versus Future Information in Optimal Deadline Scheduling},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {323--341},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1116-z},
doi = {10.1007/S00224-004-1116-Z},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/KooLNT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KormanPR04,
author = {Amos Korman and
David Peleg and
Yoav Rodeh},
title = {Labeling Schemes for Dynamic Tree Networks},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {49--75},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1106-6},
doi = {10.1007/S00224-003-1106-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KormanPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KrizancLR04,
author = {Danny Krizanc and
Flaminia L. Luccio and
Rajeev Raman},
title = {Compact Routing Schemes for Dynamic Ring Networks},
journal = {Theory Comput. Syst.},
volume = {37},
number = {5},
pages = {585--607},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1080-z},
doi = {10.1007/S00224-004-1080-Z},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/KrizancLR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Peserico04,
author = {Enoch Peserico},
title = {The Lazy Adversary Conjecture Fails},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {397--403},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1137-7},
doi = {10.1007/S00224-004-1137-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Peserico04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Rosenberg04,
author = {Arnold L. Rosenberg},
title = {Obituary: Shimon Even},
journal = {Theory Comput. Syst.},
volume = {37},
number = {4},
pages = {481},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-3704-3},
doi = {10.1007/S00224-004-3704-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Rosenberg04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Ruohonen04,
author = {Keijo Ruohonen},
title = {Chomskian Hierarchies of Families of Sets of Piecewise Continuous
Functions},
journal = {Theory Comput. Syst.},
volume = {37},
number = {5},
pages = {609--638},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1176-0},
doi = {10.1007/S00224-004-1176-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Ruohonen04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Schmidt-SchaussS04,
author = {Manfred Schmidt{-}Schau{\ss} and
J{\"{u}}rgen Stuber},
title = {The Complexity of Linear and Stratified Context Matching Problems},
journal = {Theory Comput. Syst.},
volume = {37},
number = {6},
pages = {717--740},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-1151-9},
doi = {10.1007/S00224-004-1151-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Schmidt-SchaussS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Simon04,
author = {Hans Ulrich Simon},
title = {How Many Missing Answers Can Be Tolerated by Query Learners?},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {77--94},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1107-5},
doi = {10.1007/S00224-003-1107-5},
timestamp = {Fri, 08 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Simon04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Snir04,
author = {Marc Snir},
title = {A Note on N-Body Computations with Cutoffs},
journal = {Theory Comput. Syst.},
volume = {37},
number = {2},
pages = {295--318},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1071-0},
doi = {10.1007/S00224-003-1071-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Snir04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Tantau04,
author = {Till Tantau},
title = {Comparing Verboseness for Finite Automata and Turing Machines},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {95--109},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1108-4},
doi = {10.1007/S00224-003-1108-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Tantau04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TherienW04,
author = {Denis Th{\'{e}}rien and
Thomas Wilke},
title = {Nesting Until and Since in Linear Temporal Logic},
journal = {Theory Comput. Syst.},
volume = {37},
number = {1},
pages = {111--131},
year = {2004},
url = {https://doi.org/10.1007/s00224-003-1109-3},
doi = {10.1007/S00224-003-1109-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TherienW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TorreMRV04,
author = {Pilar de la Torre and
Michael Mitzenmacher and
Rajmohan Rajaraman and
Berthold V{\"{o}}cking},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {37},
number = {3},
pages = {321},
year = {2004},
url = {https://doi.org/10.1007/s00224-004-3500-0},
doi = {10.1007/S00224-004-3500-0},
timestamp = {Tue, 12 Mar 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/TorreMRV04.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-12 13:58 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:
