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/mst50.bht:"
download as .bib file
@article{DBLP:journals/mst/AndreevM12,
author = {Valentin V. Andreev and
Timothy H. McNicholl},
title = {Computing Conformal Maps of Finitely Connected Domains onto Canonical
Slit Domains},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {354--369},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9305-4},
doi = {10.1007/S00224-010-9305-4},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AndreevM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Asano12,
author = {Tetsuo Asano},
title = {In-place Algorithm for Erasing a Connected Component in a Binary Image},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {111--123},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9335-6},
doi = {10.1007/S00224-011-9335-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Asano12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BergstraB12,
author = {Jan A. Bergstra and
Inge Bethke},
title = {On the Contribution of Backward Jumps to Instruction Sequence Expressiveness},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {706--720},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9376-x},
doi = {10.1007/S00224-011-9376-X},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BergstraB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BergstraM12,
author = {Jan A. Bergstra and
Cornelis A. Middelburg},
title = {On the Expressiveness of Single-Pass Instruction Sequences},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {313--328},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9301-8},
doi = {10.1007/S00224-010-9301-8},
timestamp = {Mon, 02 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BergstraM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BieleckiHPSTB12,
author = {Michal Bielecki and
Jan Hidders and
Jan Paredaens and
Marc Spielmann and
Jerzy Tyszkiewicz and
Jan Van den Bussche},
title = {The Navigational Power of Web Browsers},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {213--240},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9294-3},
doi = {10.1007/S00224-010-9294-3},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BieleckiHPSTB12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bille12,
author = {Philip Bille},
title = {Faster Approximate String Matching for Short Patterns},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {492--515},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9322-y},
doi = {10.1007/S00224-011-9322-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Bille12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderFKKT12,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Arie M. C. A. Koster and
Dieter Kratsch and
Dimitrios M. Thilikos},
title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {420--432},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9312-0},
doi = {10.1007/S00224-011-9312-0},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderFKKT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BoldiG12,
author = {Paolo Boldi and
Luisa Gargano},
title = {Special Issue on Fun with Algorithms},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {1--2},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9361-4},
doi = {10.1007/S00224-011-9361-4},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BoldiG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BovaCV12,
author = {Simone Bova and
Hubie Chen and
Matthew Valeriote},
title = {On the Expression Complexity of Equivalence and Isomorphism of Primitive
Positive Formulas},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {329--353},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9302-7},
doi = {10.1007/S00224-010-9302-7},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BovaCV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BurcsiCFL12,
author = {Peter Burcsi and
Ferdinando Cicalese and
Gabriele Fici and
Zsuzsanna Lipt{\'{a}}k},
title = {On Approximate Jumbled Pattern Matching in Strings},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {35--51},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9344-5},
doi = {10.1007/S00224-011-9344-5},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BurcsiCFL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BurginG12,
author = {Mark Burgin and
Bidyut Gupta},
title = {Second-Level Algorithms, Superrecursivity, and Recovery Problem in
Distributed Systems},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {694--705},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9369-9},
doi = {10.1007/S00224-011-9369-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BurginG12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaiIW12,
author = {Shukai Cai and
Taisuke Izumi and
Koichi Wada},
title = {How to Prove Impossibility Under Global Fairness: On Space Complexity
of Self-Stabilizing Leader Election on a Population Protocol Model},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {433--445},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9313-z},
doi = {10.1007/S00224-011-9313-Z},
timestamp = {Fri, 19 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CaiIW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaragiannisKKK12,
author = {Ioannis Caragiannis and
Christos Kaklamanis and
Panagiotis Kanellopoulos and
Maria Kyropoulou},
title = {The Efficiency of Fair Division},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {589--610},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9359-y},
doi = {10.1007/S00224-011-9359-Y},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaragiannisKKK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Cerda-UguetSV12,
author = {M. A. Cerd{\`{a}}{-}Uguet and
Michel P. Schellekens and
{\'{O}}scar Valero},
title = {The Baire Partial Quasi-Metric Space: {A} Mathematical Tool for Asymptotic
Complexity Analysis in Computer Science},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {387--399},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9310-7},
doi = {10.1007/S00224-010-9310-7},
timestamp = {Fri, 01 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Cerda-UguetSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CliffordJMS12,
author = {Rapha{\"{e}}l Clifford and
Markus Jalsenius and
Ashley Montanaro and
Benjamin Sach},
title = {The Complexity of Flood Filling Games},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {72--92},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9339-2},
doi = {10.1007/S00224-011-9339-2},
timestamp = {Sat, 24 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CliffordJMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CouchDM12,
author = {P. J. Couch and
Bobby Dale Daniel and
Timothy H. McNicholl},
title = {Computing Space-Filling Curves},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {370--386},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9306-3},
doi = {10.1007/S00224-010-9306-3},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CouchDM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DanielM12,
author = {Dale Daniel and
Timothy H. McNicholl},
title = {Effective Versions of Local Connectivity Properties},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {621--640},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9364-1},
doi = {10.1007/S00224-011-9364-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DanielM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DurandHN12,
author = {Arnaud Durand and
Miki Hermann and
Gustav Nordh},
title = {Trichotomies in the Complexity of Minimal Inference},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {446--491},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9320-0},
doi = {10.1007/S00224-011-9320-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DurandHN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ElmasryJK12,
author = {Amr Elmasry and
Claus Jensen and
Jyrki Katajainen},
title = {Two Skew-Binary Numeral Systems and One Application},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {185--211},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9357-0},
doi = {10.1007/S00224-011-9357-0},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ElmasryJK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FellowsGR12,
author = {Michael R. Fellows and
Serge Gaspers and
Frances A. Rosamond},
title = {Parameterizing by the Number of Numbers},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {675--693},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9367-y},
doi = {10.1007/S00224-011-9367-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FellowsGR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FlocchiniKMS12,
author = {Paola Flocchini and
Matthew Kellett and
Peter C. Mason and
Nicola Santoro},
title = {Searching for Black Holes in Subways},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {158--184},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9341-8},
doi = {10.1007/S00224-011-9341-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FlocchiniKMS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FocardiL12,
author = {Riccardo Focardi and
Flaminia L. Luccio},
title = {Guessing Bank PINs by Winning a Mastermind Game},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {52--71},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9340-9},
doi = {10.1007/S00224-011-9340-9},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FocardiL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FominGL12,
author = {Fedor V. Fomin and
Petr A. Golovach and
Daniel Lokshtanov},
title = {Cops and Robber Game Without Recharging},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {611--620},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9360-5},
doi = {10.1007/S00224-011-9360-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FominGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FotakisGKS12,
author = {Dimitris Fotakis and
Vasilis Gkatzelis and
Alexis C. Kaporis and
Paul G. Spirakis},
title = {The Impact of Social Ignorance on Weighted Congestion Games},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {559--578},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9355-2},
doi = {10.1007/S00224-011-9355-2},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FotakisGKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FulopSV12,
author = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Torsten St{\"{u}}ber and
Heiko Vogler},
title = {A B{\"{u}}chi-Like Theorem for Weighted Tree Automata over Multioperator
Monoids},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {241--278},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9296-1},
doi = {10.1007/S00224-010-9296-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FulopSV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GalT12,
author = {Anna G{\'{a}}l and
Vladimir Trifonov},
title = {On the Correlation Between Parity and Modular Polynomials},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {516--536},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9332-9},
doi = {10.1007/S00224-011-9332-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GalT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GhasemalizadehR12,
author = {Hossein Ghasemalizadeh and
Mohammadreza Razzazi},
title = {An Improved Approximation Algorithm for the Most Points Covering Problem},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {545--558},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9353-4},
doi = {10.1007/S00224-011-9353-4},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GhasemalizadehR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GhoshM12,
author = {Arpita Ghosh and
Mohammad Mahdian},
title = {Christmas Gift Exchange Games},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {3--19},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9342-7},
doi = {10.1007/S00224-011-9342-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GhoshM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Haque12,
author = {Khandoker Mohammed Mominul Haque},
title = {Irregular Total Labellings of Generalized Petersen Graphs},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {537--544},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9350-7},
doi = {10.1007/S00224-011-9350-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Haque12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Hung12,
author = {Ruo{-}Wei Hung},
title = {Linear-Time Algorithm for the Paired-Domination Problem in Convex
Bipartite Graphs},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {721--738},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9378-8},
doi = {10.1007/S00224-011-9378-8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Hung12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KostitsynaP12,
author = {Irina Kostitsyna and
Valentin Polishchuk},
title = {Simple Wriggling is Hard Unless You Are a Fat Hippo},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {93--110},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9337-4},
doi = {10.1007/S00224-011-9337-4},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KostitsynaP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KranakisK12,
author = {Evangelos Kranakis and
Danny Krizanc},
title = {Maintaining Privacy on a Line},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {147--157},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9338-3},
doi = {10.1007/S00224-011-9338-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/KranakisK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/LeeuwenL12,
author = {Erik Jan van Leeuwen and
Jan van Leeuwen},
title = {Structure of Polynomial-Time Approximation},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {641--674},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9366-z},
doi = {10.1007/S00224-011-9366-Z},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/LeeuwenL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mandelbrod12,
author = {Matan Mandelbrod},
title = {Layered Hashing Algorithm for Real-time Systems},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {279--295},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9297-0},
doi = {10.1007/S00224-010-9297-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Mandelbrod12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/McNicholl12,
author = {Timothy H. McNicholl},
title = {An Effective Carath{\'{e}}odory Theorem},
journal = {Theory Comput. Syst.},
volume = {50},
number = {4},
pages = {579--588},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9356-1},
doi = {10.1007/S00224-011-9356-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/McNicholl12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RuskeyW12,
author = {Frank Ruskey and
Aaron Williams},
title = {The Feline Josephus Problem},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {20--34},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9343-6},
doi = {10.1007/S00224-011-9343-6},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RuskeyW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Tamir12,
author = {Tami Tamir},
title = {Scheduling with Bully Selfish Jobs},
journal = {Theory Comput. Syst.},
volume = {50},
number = {1},
pages = {124--146},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9336-5},
doi = {10.1007/S00224-011-9336-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Tamir12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Thomas12,
author = {Michael Thomas},
title = {The Complexity of Circumscriptive Inference in Post's Lattice},
journal = {Theory Comput. Syst.},
volume = {50},
number = {3},
pages = {401--419},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9311-6},
doi = {10.1007/S00224-010-9311-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Thomas12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Vyugin12,
author = {Vladimir V. V'yugin},
title = {On Empirical Meaning of Randomness with Respect to Parametric Families
of Probability Distributions},
journal = {Theory Comput. Syst.},
volume = {50},
number = {2},
pages = {296--312},
year = {2012},
url = {https://doi.org/10.1007/s00224-010-9300-9},
doi = {10.1007/S00224-010-9300-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Vyugin12.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-04 04:54 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:
