default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/mst/mst56.bht:"
download as .bib file
@article{DBLP:journals/mst/BaloghBDEKT15,
author = {J{\'{a}}nos Balogh and
J{\'{o}}zsef B{\'{e}}k{\'{e}}si and
Gy{\"{o}}rgy D{\'{o}}sa and
Leah Epstein and
Hans Kellerer and
Zsolt Tuza},
title = {Online Results for Black and White Bin Packing},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {137--155},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9538-8},
doi = {10.1007/S00224-014-9538-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BaloghBDEKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BiloFMM15,
author = {Vittorio Bil{\`{o}} and
Michele Flammini and
Gianpiero Monaco and
Luca Moscardelli},
title = {Some Anomalies of Farsighted Strategic Behavior},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {156--180},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9529-1},
doi = {10.1007/S00224-013-9529-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BiloFMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BrodalMN15,
author = {Gerth St{\o}lting Brodal and
Gabriel Moruz and
Andrei Negoescu},
title = {OnlineMin: {A} Fast Strongly Competitive Randomized Paging Algorithm},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {22--40},
year = {2015},
url = {https://doi.org/10.1007/s00224-012-9427-y},
doi = {10.1007/S00224-012-9427-Y},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BrodalMN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanLT15,
author = {Harry Buhrman and
Bruno Loff and
Leen Torenvliet},
title = {Hardness of Approximation for Knapsack Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {372--393},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9550-z},
doi = {10.1007/S00224-014-9550-Z},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanLT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChimaniS15,
author = {Markus Chimani and
Joachim Spoerhase},
title = {Approximating Spanning Trees with Few Branches},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {181--196},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9556-6},
doi = {10.1007/S00224-014-9556-6},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ChimaniS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CyganPPW15,
author = {Marek Cygan and
Marcin Pilipczuk and
Michal Pilipczuk and
Jakub Onufry Wojtaszczyk},
title = {Sitting Closer to Friends than Enemies, Revisited},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {394--405},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9558-4},
doi = {10.1007/S00224-014-9558-4},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CyganPPW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DemenkovKMM15,
author = {Evgeny Demenkov and
Alexander S. Kulikov and
Olga Melanich and
Ivan Mihajlin},
title = {New Lower Bounds on Circuit Size of Multi-output Functions},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {630--642},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9590-4},
doi = {10.1007/S00224-014-9590-4},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DemenkovKMM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DiekertK15,
author = {Volker Diekert and
Manfred Kufleitner},
title = {Omega-Rational Expressions with Bounded Synchronization Delay},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {686--696},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9526-4},
doi = {10.1007/S00224-013-9526-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/DiekertK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DietzfelbingerR15,
author = {Martin Dietzfelbinger and
Michael Rink},
title = {Towards Optimal Degree Distributions for Left-Perfect Matchings in
Random Bipartite Graphs},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {593--611},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9577-1},
doi = {10.1007/S00224-014-9577-1},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DietzfelbingerR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DobrevKK15,
author = {Stefan Dobrev and
Rastislav Kr{\'{a}}lovic and
Richard Kr{\'{a}}lovic},
title = {Advice Complexity of Maximum Independent set in Sparse and Bipartite
Graphs},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {197--219},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9592-2},
doi = {10.1007/S00224-014-9592-2},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/DobrevKK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DorrigivFHKKLS15,
author = {Reza Dorrigiv and
Robert Fraser and
Meng He and
Shahin Kamali and
Akitoshi Kawamura and
Alejandro L{\'{o}}pez{-}Ortiz and
Diego Seco},
title = {On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {220--250},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9591-3},
doi = {10.1007/S00224-014-9591-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/DorrigivFHKKLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EbenlendrS15,
author = {Tom{\'{a}}s Ebenlendr and
Jir{\'{\i}} Sgall},
title = {A Lower Bound on Deterministic Online Algorithms for Scheduling on
Related Machines Without Preemption},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {73--81},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9451-6},
doi = {10.1007/S00224-013-9451-6},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EbenlendrS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EpsteinZ15,
author = {Leah Epstein and
Hanan Zebedat{-}Haider},
title = {Rent or Buy Problems with a Fixed Time Horizon},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {309--329},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9552-x},
doi = {10.1007/S00224-014-9552-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/EpsteinZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ErlebachP15,
author = {Thomas Erlebach and
Giuseppe Persiano},
title = {Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {135--136},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9589-x},
doi = {10.1007/S00224-014-9589-X},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ErlebachP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/EscoffierMPX15,
author = {Bruno Escoffier and
J{\'{e}}r{\^{o}}me Monnot and
Vangelis Th. Paschos and
Mingyu Xiao},
title = {New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability
of Edge Dominating Set},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {330--346},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9549-5},
doi = {10.1007/S00224-014-9549-5},
timestamp = {Mon, 08 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/EscoffierMPX15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FigueiraN15,
author = {Santiago Figueira and
Andr{\'{e}} Nies},
title = {Feasible Analysis, Randomness, and Base Invariance},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {439--464},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9507-7},
doi = {10.1007/S00224-013-9507-7},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FigueiraN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HarrenK15,
author = {Rolf Harren and
Walter Kern},
title = {Improved Lower Bound for Online Strip Packing},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {41--72},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9494-8},
doi = {10.1007/S00224-013-9494-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HarrenK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ItoLY15,
author = {Hiro Ito and
Stefan Langerman and
Yuichi Yoshida},
title = {Generalized River Crossing Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {418--435},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9562-8},
doi = {10.1007/S00224-014-9562-8},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ItoLY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KapoutsisP15,
author = {Christos A. Kapoutsis and
Giovanni Pighizzini},
title = {Two-Way Automata Characterizations of L/poly Versus {NL}},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {662--685},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9560-x},
doi = {10.1007/S00224-014-9560-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KapoutsisP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KarandikarS15,
author = {Prateek Karandikar and
Philippe Schnoebelen},
title = {Generalized Post Embedding Problems},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {697--716},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9561-9},
doi = {10.1007/S00224-014-9561-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KarandikarS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KarhumakiH15,
author = {Juhani Karhum{\"{a}}ki and
Edward A. Hirsch},
title = {Preface},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {591--592},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9618-4},
doi = {10.1007/S00224-015-9618-4},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KarhumakiH15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Lammersen0S15,
author = {Christiane Lammersen and
Melanie Schmidt and
Christian Sohler},
title = {Probabilistic k-Median Clustering in Data Streams},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {251--290},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9539-7},
doi = {10.1007/S00224-014-9539-7},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Lammersen0S15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Mareay15,
author = {R. Mareay},
title = {Topological Approach to Multivalued Information System},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {406--417},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9551-y},
doi = {10.1007/S00224-014-9551-Y},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Mareay15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/MayordomoM15,
author = {Elvira Mayordomo and
Wolfgang Merkle},
title = {Editorial},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {437--438},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9620-x},
doi = {10.1007/S00224-015-9620-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/MayordomoM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Miyabe15,
author = {Kenshi Miyabe},
title = {Schnorr Triviality and Its Equivalent Notions},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {465--486},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9506-8},
doi = {10.1007/S00224-013-9506-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Miyabe15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Musatov15,
author = {Daniil Musatov},
title = {On Extracting Space-bounded Kolmogorov Complexity},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {643--661},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9563-7},
doi = {10.1007/S00224-014-9563-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Musatov15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Porter15,
author = {Christopher P. Porter},
title = {Trivial Measures are not so Trivial},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {487--512},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9614-8},
doi = {10.1007/S00224-015-9614-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Porter15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PourabdollahB15,
author = {Amir Pourabdollah and
Tim J. Brailsford},
title = {On the Turing Completeness of the Semantic Web},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {291--308},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9536-x},
doi = {10.1007/S00224-014-9536-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PourabdollahB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RenaultR15,
author = {Marc P. Renault and
Adi Ros{\'{e}}n},
title = {On Online Algorithms with Advice for the k-Server Problem},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {3--21},
year = {2015},
url = {https://doi.org/10.1007/s00224-012-9434-z},
doi = {10.1007/S00224-012-9434-Z},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RenaultR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RizziS15,
author = {Romeo Rizzi and
Florian Sikora},
title = {Some Results on More Flexible Versions of Graph Motif},
journal = {Theory Comput. Syst.},
volume = {56},
number = {4},
pages = {612--629},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9564-6},
doi = {10.1007/S00224-014-9564-6},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RizziS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RomashchenkoS15,
author = {Andrei E. Romashchenko and
Alexander Shen},
title = {Topological Arguments for Kolmogorov Complexity},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {513--526},
year = {2015},
url = {https://doi.org/10.1007/s00224-015-9606-8},
doi = {10.1007/S00224-015-9606-8},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RomashchenkoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ShmoysS15,
author = {David B. Shmoys and
Gwen Spencer},
title = {Approximation Algorithms for Fragmenting a Graph Against a Stochastically-Located
Threat},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {96--134},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9548-6},
doi = {10.1007/S00224-014-9548-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ShmoysS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Simpson15,
author = {Stephen G. Simpson},
title = {Symbolic Dynamics: Entropy = Dimension = Complexity},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {527--543},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9546-8},
doi = {10.1007/S00224-014-9546-8},
timestamp = {Sun, 06 Oct 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Simpson15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Solis-ObaP15,
author = {Roberto Solis{-}Oba and
Giuseppe Persiano},
title = {Special Issue on Approximation and Online Algorithms},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {1--2},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9555-7},
doi = {10.1007/S00224-014-9555-7},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Solis-ObaP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/TadakiD15,
author = {Kohtaro Tadaki and
Norihisa Doi},
title = {Cryptography and Algorithmic Randomness},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {544--580},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9545-9},
doi = {10.1007/S00224-014-9545-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/TadakiD15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/VinodchandranZ15,
author = {N. V. Vinodchandran and
Marius Zimand},
title = {On Optimal Language Compression for Sets in PSPACE/poly},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {581--590},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9535-y},
doi = {10.1007/S00224-014-9535-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/VinodchandranZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ZhouHSHCG15,
author = {Min Zhou and
Fei He and
Xiaoyu Song and
Shi He and
Gangyi Chen and
Ming Gu},
title = {Estimating the Volume of Solution Space for Satisfiability Modulo
Linear Real Arithmetic},
journal = {Theory Comput. Syst.},
volume = {56},
number = {2},
pages = {347--371},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9553-9},
doi = {10.1007/S00224-014-9553-9},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ZhouHSHCG15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ZhuCL15,
author = {Jianqiao Zhu and
Ho{-}Leung Chan and
Tak Wah Lam},
title = {Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor
Models},
journal = {Theory Comput. Syst.},
volume = {56},
number = {1},
pages = {82--95},
year = {2015},
url = {https://doi.org/10.1007/s00224-013-9475-y},
doi = {10.1007/S00224-013-9475-Y},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ZhuCL15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-11-30 13:27 CET 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:
