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/mst46.bht:"
download as .bib file
@article{DBLP:journals/mst/AndreevM10,
author = {Valentin V. Andreev and
Timothy H. McNicholl},
title = {Computing Interpolating Sequences},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {340--350},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9140-z},
doi = {10.1007/S00224-008-9140-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AndreevM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ArtemovDG10,
author = {Sergei N. Art{\"{e}}mov and
Volker Diekert and
Dima Grigoriev},
title = {Preface},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {1},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9162-6},
doi = {10.1007/S00224-008-9162-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ArtemovDG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ArtemovDR10,
author = {Sergei N. Art{\"{e}}mov and
Volker Diekert and
Alexander A. Razborov},
title = {Preface},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {619},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9244-0},
doi = {10.1007/S00224-009-9244-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ArtemovDR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AsanoBS10,
author = {Tetsuo Asano and
Peter Brass and
Shinji Sasahara},
title = {Disc Covering Problem with Application to Digital Halftoning},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {157--173},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9123-0},
doi = {10.1007/S00224-008-9123-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AsanoBS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Babenko10,
author = {Maxim A. Babenko},
title = {A Fast Algorithm for the Path 2-Packing Problem},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {59--79},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9141-y},
doi = {10.1007/S00224-008-9141-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Babenko10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BedonBCR10,
author = {Nicolas Bedon and
Alexis B{\`{e}}s and
Olivier Carton and
Chloe Rispal},
title = {Logic and Rational Languages of Words Indexed by Linear Orderings},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {737--760},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9222-6},
doi = {10.1007/S00224-009-9222-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BedonBCR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BerstelBCF10,
author = {Jean Berstel and
Luc Boasson and
Olivier Carton and
Isabelle Fagnot},
title = {Sturmian Trees},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {443--478},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9228-0},
doi = {10.1007/S00224-009-9228-0},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BerstelBCF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bienvenu10,
author = {Laurent Bienvenu},
title = {Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {598--617},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9232-4},
doi = {10.1007/S00224-009-9232-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bienvenu10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BlaserDM10,
author = {Markus Bl{\"{a}}ser and
Holger Dell and
Johann A. Makowsky},
title = {Complexity of the Bollob{\'{a}}s-Riordan Polynomial. Exceptional
Points and Uniform Reductions},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {690--706},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9213-7},
doi = {10.1007/S00224-009-9213-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BlaserDM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderD10,
author = {Hans L. Bodlaender and
Thomas C. van Dijk},
title = {A Cubic Kernel for Feedback Vertex Set and Loop Cutset},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {566--597},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9234-2},
doi = {10.1007/S00224-009-9234-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFKRV10,
author = {Harry Buhrman and
Lance Fortnow and
Michal Kouck{\'{y}} and
John D. Rogers and
Nikolai K. Vereshchagin},
title = {Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {143--156},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9160-8},
doi = {10.1007/S00224-008-9160-8},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanFKRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaiL10,
author = {Jin{-}yi Cai and
Pinyan Lu},
title = {On Symmetric Signatures in Holographic Algorithms},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {398--415},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9229-z},
doi = {10.1007/S00224-009-9229-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaiL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaminitiFP10,
author = {Saverio Caminiti and
Emanuele G. Fusco and
Rossella Petreschi},
title = {Bijective Linear Time Coding and Decoding for \emph{k}-Trees},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {284--300},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9131-0},
doi = {10.1007/S00224-008-9131-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaminitiFP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChengTV10,
author = {Qi Cheng and
Sergey P. Tarasov and
Mikhail N. Vyalyi},
title = {Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {120--142},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9158-2},
doi = {10.1007/S00224-008-9158-2},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChengTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChoffrutDV10,
author = {Christian Choffrut and
Flavio D'Alessandro and
Stefano Varricchio},
title = {On Bounded Rational Trace Languages},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {351--369},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9143-9},
doi = {10.1007/S00224-008-9143-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChoffrutDV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Coja-OghlanKV10,
author = {Amin Coja{-}Oghlan and
Michael Krivelevich and
Dan Vilenchik},
title = {Why Almost All \emph{k}-Colorable Graphs Are Easy to Color},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {523--565},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9231-5},
doi = {10.1007/S00224-009-9231-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Coja-OghlanKV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CzumajS10,
author = {Artur Czumaj and
Christian Sohler},
title = {Small Space Representations for Metric Min-sum \emph{k}-Clustering
and Their Applications},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {416--442},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9235-1},
doi = {10.1007/S00224-009-9235-1},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CzumajS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Damaschke10,
author = {Peter Damaschke},
title = {Fixed-Parameter Enumerability of Cluster Editing and Related Problems},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {261--283},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9130-1},
doi = {10.1007/S00224-008-9130-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Damaschke10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EpsteinIL10,
author = {Leah Epstein and
Csan{\'{a}}d Imreh and
Asaf Levin},
title = {Class Constrained Bin Covering},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {246--260},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9129-7},
doi = {10.1007/S00224-008-9129-7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EpsteinIL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FaliszewskiO10,
author = {Piotr Faliszewski and
Mitsunori Ogihara},
title = {On the Autoreducibility of Functions},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {222--245},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9127-9},
doi = {10.1007/S00224-008-9127-9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FaliszewskiO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FellowsFHMR10,
author = {Michael R. Fellows and
J{\"{o}}rg Flum and
Danny Hermelin and
Moritz M{\"{u}}ller and
Frances A. Rosamond},
title = {W-Hierarchies Defined by Symmetric Gates},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {311--339},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9138-6},
doi = {10.1007/S00224-008-9138-6},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FellowsFHMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FialaP10,
author = {Jir{\'{\i}} Fiala and
Dani{\"{e}}l Paulusma},
title = {Comparing Universal Covers in Polynomial Time},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {620--635},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9200-z},
doi = {10.1007/S00224-009-9200-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FialaP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FlarupL10,
author = {Uffe Flarup and
Laurent Lyaudet},
title = {On the Expressive Power of Permanents and Perfect Matchings of Matrices
of Bounded Pathwidth/Cliquewidth},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {761--791},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9241-3},
doi = {10.1007/S00224-009-9241-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FlarupL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FormentiKZ10,
author = {Enrico Formenti and
Petr Kurka and
Ondrej Zahradn{\'{\i}}k},
title = {A Search Algorithm for Subshift Attractors of Cellular Automata},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {479--498},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9230-6},
doi = {10.1007/S00224-009-9230-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FormentiKZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GlasserHRTW10,
author = {Christian Gla{\ss}er and
Katrin Herr and
Christian Reitwie{\ss}ner and
Stephen D. Travers and
Matthias Waldherr},
title = {Equivalence Problems for Circuits over Sets of Natural Numbers},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {80--103},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9144-8},
doi = {10.1007/S00224-008-9144-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GlasserHRTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HoffmannLLN10,
author = {Benjamin Hoffmann and
Mikhail Lifshits and
Yury Lifshits and
Dirk Nowotka},
title = {Maximal Intersection Queries in Randomized Input Models},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {104--119},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9154-6},
doi = {10.1007/S00224-008-9154-6},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HoffmannLLN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JezO10,
author = {Artur Jez and
Alexander Okhotin},
title = {Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded
Growth},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {27--58},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9139-5},
doi = {10.1007/S00224-008-9139-5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JezO10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JonssonN10,
author = {Peter Jonsson and
Gustav Nordh},
title = {Approximability of Clausal Constraints},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {370--395},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9145-7},
doi = {10.1007/S00224-008-9145-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JonssonN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Jukna10,
author = {Stasys Jukna},
title = {Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two
Circuits},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {301--310},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9133-y},
doi = {10.1007/S00224-008-9133-Y},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Jukna10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Kuznets10,
author = {Roman Kuznets},
title = {Self-Referential Justifications in Epistemic Logic},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {636--661},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9209-3},
doi = {10.1007/S00224-009-9209-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Kuznets10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LagoH10,
author = {Ugo Dal Lago and
Martin Hofmann},
title = {A Semantic Proof of Polytime Soundness of Light Affine Logic},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {673--689},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9210-x},
doi = {10.1007/S00224-009-9210-X},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/LagoH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LimayeMR10,
author = {Nutan Limaye and
Meena Mahajan and
B. V. Raghavendra Rao},
title = {Arithmetizing Classes Around NC{\textbackslash}textsf\{NC\}\({}^{\mbox{1}}\)
and L{\textbackslash}textsf\{L\}},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {499--522},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9233-3},
doi = {10.1007/S00224-009-9233-3},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LimayeMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MahajanS10,
author = {Meena Mahajan and
Jayalal Sarma},
title = {On the Complexity of Matrix Rank and Rigidity},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {9--26},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9136-8},
doi = {10.1007/S00224-008-9136-8},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MahajanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ManeaMMP10,
author = {Florin Manea and
Maurice Margenstern and
Victor Mitrana and
Mario J. P{\'{e}}rez{-}Jim{\'{e}}nez},
title = {A New Characterization of NP, P, and {PSPACE} with Accepting Hybrid
Networks of Evolutionary Processors},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {174--192},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9124-z},
doi = {10.1007/S00224-008-9124-Z},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ManeaMMP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Rybalov10,
author = {Alexander N. Rybalov},
title = {Generic Complexity of Presburger Arithmetic},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {2--8},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9120-3},
doi = {10.1007/S00224-008-9120-3},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Rybalov10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Savateev10,
author = {Yury Savateev},
title = {Unidirectional Lambek Grammars in Polynomial Time},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {662--672},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9208-4},
doi = {10.1007/S00224-009-9208-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Savateev10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ThomasW10,
author = {Wolfgang Thomas and
Pascal Weil},
title = {Preface of {STACS} 2007 Special Issue},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {397},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9220-8},
doi = {10.1007/S00224-009-9220-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ThomasW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Tripathi10,
author = {Rahul Tripathi},
title = {The 1-Versus-2 Queries Problem Revisited},
journal = {Theory Comput. Syst.},
volume = {46},
number = {2},
pages = {193--221},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9126-x},
doi = {10.1007/S00224-008-9126-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Tripathi10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Xiao10,
author = {Mingyu Xiao},
title = {Simple and Improved Parameterized Algorithms for Multiterminal Cuts},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {723--736},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9215-5},
doi = {10.1007/S00224-009-9215-5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Xiao10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Zimand10,
author = {Marius Zimand},
title = {Two Sources Are Better than One for Increasing the Kolmogorov Complexity
of Infinite Sequences},
journal = {Theory Comput. Syst.},
volume = {46},
number = {4},
pages = {707--722},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9214-6},
doi = {10.1007/S00224-009-9214-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Zimand10.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-28 20:16 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:
