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/mst38.bht:"
download as .bib file
@article{DBLP:journals/mst/Alt05,
author = {Helmut Alt},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {133},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-3802-2},
doi = {10.1007/S00224-004-3802-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Alt05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AmbuhlW05,
author = {Christoph Amb{\"{u}}hl and
Uli Wagner},
title = {The Clique Problem in Intersection Graphs of Ellipses and Triangles},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {279--292},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1141-6},
doi = {10.1007/S00224-005-1141-6},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AmbuhlW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AvidorZ05,
author = {Adi Avidor and
Uri Zwick},
title = {Approximating {MIN} 2-SAT and {MIN} 3-SAT},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {329--345},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1140-7},
doi = {10.1007/S00224-005-1140-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AvidorZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BiedlW05,
author = {Therese C. Biedl and
Dana F. Wilkinson},
title = {Bounded-Degree Independent Sets in Planar Graphs},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {253--278},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1139-0},
doi = {10.1007/S00224-005-1139-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BiedlW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BolligW05,
author = {Beate Bollig and
Philipp Woelfel},
title = {A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching
Programs and Its Applications},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {671--685},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1130-1},
doi = {10.1007/S00224-004-1130-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BolligW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BongiovanniP05,
author = {Gian Carlo Bongiovanni and
Paolo Penna},
title = {XOR-Based Schemes for Fast Parallel {IP} Lookups},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {481--501},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1183-1},
doi = {10.1007/S00224-004-1183-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BongiovanniP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrandstadtDLM05,
author = {Andreas Brandst{\"{a}}dt and
Feodor F. Dragan and
Ho{\`{a}}ng{-}Oanh Le and
Raffaele Mosca},
title = {New Graph Classes of Bounded Clique-Width},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {623--645},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1154-6},
doi = {10.1007/S00224-004-1154-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrandstadtDLM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BruceHKR05,
author = {Richard Bruce and
Michael Hoffmann and
Danny Krizanc and
Rajeev Raman},
title = {Efficient Update Strategies for Geometric Computing with Uncertainty},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {411--423},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1180-4},
doi = {10.1007/S00224-004-1180-4},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BruceHKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BruyereC05,
author = {V{\'{e}}ronique Bruy{\`{e}}re and
Olivier Carton},
title = {Hierarchy Among Automata on Linear Orderings},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {593--621},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1129-2},
doi = {10.1007/S00224-005-1129-2},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BruyereC05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuchheimH05,
author = {Christoph Buchheim and
Seok{-}Hee Hong},
title = {Crossing Minimization for Symmetries},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {293--311},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1142-5},
doi = {10.1007/S00224-005-1142-5},
timestamp = {Thu, 27 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuchheimH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFP05,
author = {Harry Buhrman and
Lance Fortnow and
Aduri Pavan},
title = {Some Results on Derandomization},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {211--227},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1194-y},
doi = {10.1007/S00224-004-1194-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanFP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChanLTW05,
author = {Wun{-}Tat Chan and
Tak Wah Lam and
Hing{-}Fung Ting and
Prudence W. H. Wong},
title = {On-line Stream Merging with Max Span and Min Coverage},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {461--479},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1182-2},
doi = {10.1007/S00224-004-1182-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ChanLTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DemangeP05,
author = {Marc Demange and
Vangelis Th. Paschos},
title = {Improved Approximations for Weighted and Unweighted Graph Problems},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {763--787},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1162-6},
doi = {10.1007/S00224-004-1162-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DemangeP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DrostePV05,
author = {Manfred Droste and
Christian Pech and
Heiko Vogler},
title = {A Kleene Theorem for Weighted Tree Automata},
journal = {Theory Comput. Syst.},
volume = {38},
number = {1},
pages = {1--38},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1096-z},
doi = {10.1007/S00224-004-1096-Z},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DrostePV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErtenK05,
author = {Cesim Erten and
Stephen G. Kobourov},
title = {Simultaneous Embedding of a Planar Graph and Its Dual on the Grid},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {313--327},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1143-4},
doi = {10.1007/S00224-005-1143-4},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ErtenK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FinocchiP05,
author = {Irene Finocchi and
Rossella Petreschi},
title = {Structure-Preserving Hierarchical Decompositions},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {687--700},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1132-z},
doi = {10.1007/S00224-004-1132-Z},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FinocchiP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FotakisPSS05,
author = {Dimitris Fotakis and
Rasmus Pagh and
Peter Sanders and
Paul G. Spirakis},
title = {Space Efficient Hash Tables with Worst Case Constant Access Time},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {229--248},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1195-x},
doi = {10.1007/S00224-004-1195-X},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FotakisPSS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GottliebSY05,
author = {Lee{-}Ad Gottlieb and
John E. Savage and
Arkady Yerukhimovich},
title = {Efficient Data Storage in Large Nanoarrays},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {503--536},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1196-9},
doi = {10.1007/S00224-004-1196-9},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GottliebSY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GrammGHN05,
author = {Jens Gramm and
Jiong Guo and
Falk H{\"{u}}ffner and
Rolf Niedermeier},
title = {Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {373--392},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1178-y},
doi = {10.1007/S00224-004-1178-Y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/GrammGHN05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hitchcock05,
author = {John M. Hitchcock},
title = {Correspondence Principles for Effective Dimensions},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {559--571},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1122-1},
doi = {10.1007/S00224-004-1122-1},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hitchcock05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JurdzinskiS05,
author = {Tomasz Jurdzinski and
Grzegorz Stachowiak},
title = {Probabilistic Algorithms for the Wake-Up Problem in Single-Hop Radio
Networks},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {347--367},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1144-3},
doi = {10.1007/S00224-005-1144-3},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JurdzinskiS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KalyanasundaramVW05,
author = {Bala Kalyanasundaram and
Mahendran Velauthapillai and
John G. Waclawsky},
title = {Unlocking the Advantages of Dynamic Service Selection and Pricing},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {393--410},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1179-x},
doi = {10.1007/S00224-004-1179-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KalyanasundaramVW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KarhumakiLP05,
author = {Juhani Karhum{\"{a}}ki and
Michel Latteux and
Ion Petre},
title = {Commutation with Ternary Sets of Words},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {161--169},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1191-1},
doi = {10.1007/S00224-004-1191-1},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KarhumakiLP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kosub05,
author = {Sven Kosub},
title = {NP-Partitions over Posets with an Application to Reducing the Set
of Solutions of {NP} Problems},
journal = {Theory Comput. Syst.},
volume = {38},
number = {1},
pages = {83--113},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1114-1},
doi = {10.1007/S00224-004-1114-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Kosub05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KoukopoulosMNS05,
author = {Dimitrios Koukopoulos and
Marios Mavronicolas and
Sotiris E. Nikoletseas and
Paul G. Spirakis},
title = {The Impact of Network Structure on the Stability of Greedy Protocols},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {425--460},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1181-3},
doi = {10.1007/S00224-004-1181-3},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KoukopoulosMNS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KuskeL05,
author = {Dietrich Kuske and
Markus Lohrey},
title = {Decidable First-Order Theories of One-Step Rewriting in Trace Monoids},
journal = {Theory Comput. Syst.},
volume = {38},
number = {1},
pages = {39--81},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1099-9},
doi = {10.1007/S00224-004-1099-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KuskeL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Magniez05,
author = {Fr{\'{e}}d{\'{e}}ric Magniez},
title = {Multi-Linearity Self-Testing with Relative Error},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {573--591},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1125-y},
doi = {10.1007/S00224-004-1125-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Magniez05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PontelliR05,
author = {Enrico Pontelli and
Desh Ranjan},
title = {A Simple Optimal Solution for the Temporal Precedence Problem on Pure
Pointer Machines},
journal = {Theory Comput. Syst.},
volume = {38},
number = {1},
pages = {115--130},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1118-x},
doi = {10.1007/S00224-004-1118-X},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/PontelliR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Prencipe05,
author = {Giuseppe Prencipe},
title = {The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {539--558},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-1101-1},
doi = {10.1007/S00224-005-1101-1},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Prencipe05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/StearnsH05,
author = {Richard Edwin Stearns and
Harry B. Hunt III},
title = {Resource Bounds and Subproblem Independence},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {731--761},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1160-8},
doi = {10.1007/S00224-004-1160-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/StearnsH05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Subramani05,
author = {K. Subramani},
title = {Tractable Fragments of Presburger Arithmetic},
journal = {Theory Comput. Syst.},
volume = {38},
number = {5},
pages = {647--668},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1220-0},
doi = {10.1007/S00224-004-1220-0},
timestamp = {Fri, 09 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Subramani05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Szeider05,
author = {Stefan Szeider},
title = {The Complexity of Resolution with Generalized Symmetry Rules},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {171--188},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1192-0},
doi = {10.1007/S00224-004-1192-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Szeider05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TessonT05,
author = {Pascal Tesson and
Denis Th{\'{e}}rien},
title = {Complete Classifications for the Communication Complexity of Regular
Languages},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {135--159},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1190-2},
doi = {10.1007/S00224-004-1190-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TessonT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/X05,
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {38},
number = {3},
pages = {251},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-3900-9},
doi = {10.1007/S00224-005-3900-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/X05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/X05a,
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {38},
number = {4},
pages = {371--372},
year = {2005},
url = {https://doi.org/10.1007/s00224-005-3803-9},
doi = {10.1007/S00224-005-3803-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/X05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ZhengR05,
author = {Xizhong Zheng and
Robert Rettinger},
title = {Effective Jordan Decomposition},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {189--209},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1193-z},
doi = {10.1007/S00224-004-1193-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ZhengR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ZhengRG05,
author = {Xizhong Zheng and
Robert Rettinger and
Romain Gengler},
title = {Closure Properties of Real Number Classes under {CBV} Functions},
journal = {Theory Comput. Syst.},
volume = {38},
number = {6},
pages = {701--729},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1159-1},
doi = {10.1007/S00224-004-1159-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ZhengRG05.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-29 22:50 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:
