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/mst60.bht:"
download as .bib file
@article{DBLP:journals/mst/AndersonD17,
author = {Matthew Anderson and
Anuj Dawar},
title = {On Symmetric Circuits and Fixed-Point Logics},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {521--551},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9692-2},
doi = {10.1007/S00224-016-9692-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AndersonD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AngelopoulosADL17,
author = {Spyros Angelopoulos and
Diogo Ars{\'{e}}nio and
Christoph D{\"{u}}rr and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {Multi-processor Search and Scheduling Problems with Setup Cost},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {637--670},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9691-3},
doi = {10.1007/S00224-016-9691-3},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/AngelopoulosADL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AntunesBST17,
author = {Luis Filipe Coelho Antunes and
Bruno Bauwens and
Andr{\'{e}} Souto and
Andreia Teixeira},
title = {Sophistication vs Logical Depth},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {280--298},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9672-6},
doi = {10.1007/S00224-016-9672-6},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntunesBST17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bauwens17,
author = {Bruno Bauwens},
title = {Conditional Measure and the Violation of Van Lambalgen's Theorem for
Martin-L{\"{o}}f Randomness},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {314--323},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9675-3},
doi = {10.1007/S00224-016-9675-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bauwens17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BazziN17,
author = {Louay Bazzi and
Nagi Nahas},
title = {Small-Bias is Not Enough to Hit Read-Once {CNF}},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {324--345},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9680-6},
doi = {10.1007/S00224-016-9680-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BazziN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BerkholzBG17,
author = {Christoph Berkholz and
Paul S. Bonsma and
Martin Grohe},
title = {Tight Lower and Upper Bounds for the Complexity of Canonical Colour
Refinement},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {581--614},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9686-0},
doi = {10.1007/S00224-016-9686-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BerkholzBG17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bhaskar17,
author = {Siddharth Bhaskar},
title = {A Difference in Complexity Between Recursion and Tail Recursion},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {299--313},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9673-5},
doi = {10.1007/S00224-016-9673-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bhaskar17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Blanchet-SadriB17,
author = {Francine Blanchet{-}Sadri and
Michelle Bodnar and
Benjamin De Winkle},
title = {New Bounds and Extended Relations Between Prefix Arrays, Border Arrays,
Undirected Graphs, and Indeterminate Strings},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {473--497},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9668-2},
doi = {10.1007/S00224-016-9668-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Blanchet-SadriB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BolligKM17,
author = {Benedikt Bollig and
Dietrich Kuske and
Roy Mennicke},
title = {The Complexity of Model Checking Multi-Stack Systems},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {695--736},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9700-6},
doi = {10.1007/S00224-016-9700-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BolligKM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BulteauFFNT17,
author = {Laurent Bulteau and
Stefan Fafianie and
Vincent Froese and
Rolf Niedermeier and
Nimrod Talmon},
title = {The Complexity of Finding Effectors},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {253--279},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9670-8},
doi = {10.1007/S00224-016-9670-8},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BulteauFFNT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CreignouMMSV17,
author = {Nadia Creignou and
Arne Meier and
Julian{-}Steffen M{\"{u}}ller and
Johannes Schmidt and
Heribert Vollmer},
title = {Paradigms for Parameterized Enumeration},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {737--758},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9702-4},
doi = {10.1007/S00224-016-9702-4},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CreignouMMSV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganPPLW17,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Erik Jan van Leeuwen and
Marcin Wrochna},
title = {Polynomial Kernelization for Removing Induced Claws and Diamonds},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {615--636},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9689-x},
doi = {10.1007/S00224-016-9689-X},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganPPLW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EngelfrietFM17,
author = {Joost Engelfriet and
Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Andreas Maletti},
title = {Composition Closure of Linear Extended Top-down Tree Transducers},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {129--171},
year = {2017},
url = {https://doi.org/10.1007/s00224-015-9660-2},
doi = {10.1007/S00224-015-9660-2},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EngelfrietFM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FazlollahiS17,
author = {Niloofar Fazlollahi and
David Starobinski},
title = {Distance Vector-based Advance Reservation with Delay Performance Guarantees},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {194--221},
year = {2017},
url = {https://doi.org/10.1007/s00224-015-9665-x},
doi = {10.1007/S00224-015-9665-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FazlollahiS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GavinskyP17,
author = {Dmitry Gavinsky and
Pavel Pudl{\'{a}}k},
title = {Partition Expanders},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {378--395},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9738-5},
doi = {10.1007/S00224-016-9738-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GavinskyP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Gurski17,
author = {Frank Gurski},
title = {The Behavior of Clique-Width under Graph Operations and Graph Transformations},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {346--376},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9685-1},
doi = {10.1007/S00224-016-9685-1},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Gurski17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hoyrup17,
author = {Mathieu Hoyrup},
title = {Genericity of Weakly Computable Objects},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {396--420},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9737-6},
doi = {10.1007/S00224-016-9737-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hoyrup17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kotzing17,
author = {Timo K{\"{o}}tzing},
title = {A Solution to Wiehagen's Thesis},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {498--520},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9678-0},
doi = {10.1007/S00224-016-9678-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Kotzing17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Luccio17,
author = {Fabrizio Luccio},
title = {Arithmetic for Rooted Trees},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {33--52},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9731-z},
doi = {10.1007/S00224-016-9731-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Luccio17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MansM17,
author = {Bernard Mans and
Luke Mathieson},
title = {Incremental Problems in the Parameterized Complexity Setting},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {3--19},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9729-6},
doi = {10.1007/S00224-016-9729-6},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/MansM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Monin17,
author = {Benoit Monin},
title = {Higher Randomness and Forcing with Closed Sets},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {421--437},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9681-5},
doi = {10.1007/S00224-016-9681-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Monin17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MostefaouiPRJ17,
author = {Achour Most{\'{e}}faoui and
Matoula Petrolia and
Michel Raynal and
Claude Jard},
title = {Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous
Message-Passing Systems},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {677--694},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9699-8},
doi = {10.1007/S00224-016-9699-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MostefaouiPRJ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/NikoletseasRS17,
author = {Sotiris E. Nikoletseas and
Christoforos L. Raptopoulos and
Paul G. Spirakis},
title = {On the Chromatic Number of Non-Sparse Random Intersection Graphs},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {112--127},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9733-x},
doi = {10.1007/S00224-016-9733-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/NikoletseasRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PierrotR17,
author = {Adeline Pierrot and
Dominique Rossin},
title = {2-Stack Sorting is Polynomial},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {552--579},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9743-8},
doi = {10.1007/S00224-016-9743-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PierrotR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PorterDD17,
author = {Michelle Porter and
Adam Day and
Rodney G. Downey},
title = {Notes on Computable Analysis},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {53--111},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9732-y},
doi = {10.1007/S00224-016-9732-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PorterDD17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ReyRM17,
author = {Anja Rey and
J{\"{o}}rg Rothe and
Adrian Marple},
title = {Path-Disruption Games: Bribery and a Probabilistic Model},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {222--252},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9669-1},
doi = {10.1007/S00224-016-9669-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ReyRM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Rybalov17,
author = {Alexander N. Rybalov},
title = {On the Generic Undecidability of the Halting Problem for Normalized
Turing Machines},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {671--676},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9698-9},
doi = {10.1007/S00224-016-9698-9},
timestamp = {Sun, 01 Oct 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Rybalov17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SchaeferS17,
author = {Marcus Schaefer and
Daniel Stefankovic},
title = {Fixed Points, Nash Equilibria, and the Existential Theory of the Reals},
journal = {Theory Comput. Syst.},
volume = {60},
number = {2},
pages = {172--193},
year = {2017},
url = {https://doi.org/10.1007/s00224-015-9662-0},
doi = {10.1007/S00224-015-9662-0},
timestamp = {Thu, 17 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SchaeferS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SelmanR17,
author = {Alan L. Selman and
Arnold L. Rosenberg},
title = {50 Years of {TOCS}},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {1--2},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9734-9},
doi = {10.1007/S00224-016-9734-9},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SelmanR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TamakiW17,
author = {Suguru Tamaki and
Osamu Watanabe},
title = {Local Restrictions from the Furst-Saxe-Sipser Paper},
journal = {Theory Comput. Syst.},
volume = {60},
number = {1},
pages = {20--32},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9730-0},
doi = {10.1007/S00224-016-9730-0},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TamakiW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/X17,
title = {Editor's Note},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {377},
year = {2017},
url = {https://doi.org/10.1007/s00224-017-9750-4},
doi = {10.1007/S00224-017-9750-4},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/X17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/YoshinoH17,
author = {Takuya Yoshino and
Kouichi Hirata},
title = {Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest},
journal = {Theory Comput. Syst.},
volume = {60},
number = {4},
pages = {759--783},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9705-1},
doi = {10.1007/S00224-016-9705-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/YoshinoH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ZetzscheKL17,
author = {Georg Zetzsche and
Dietrich Kuske and
Markus Lohrey},
title = {On Boolean Closed Full Trios and Rational Kripke Frames},
journal = {Theory Comput. Syst.},
volume = {60},
number = {3},
pages = {438--472},
year = {2017},
url = {https://doi.org/10.1007/s00224-016-9694-0},
doi = {10.1007/S00224-016-9694-0},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ZetzscheKL17.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-04-23 08:05 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:
