Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/mst/mst48.bht:"
@article{DBLP:journals/mst/AlbersM11, author = {Susanne Albers and Jean{-}Yves Marion}, title = {Preface: Special Issue on Theoretical Aspects of Computer Science {(STACS)}}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {443}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9291-6}, doi = {10.1007/S00224-010-9291-6}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/AlbersM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/AlwenP11, author = {Jo{\"{e}}l Alwen and Chris Peikert}, title = {Generating Shorter Bases for Hard Random Lattices}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {535--553}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9278-3}, doi = {10.1007/S00224-010-9278-3}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/AlwenP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/AntaLLMMMT11, author = {Antonio Fern{\'{a}}ndez Anta and Jos{\'{e}} Luis L{\'{o}}pez{-}Presa and M. Araceli Lorenzo and Pilar Manzano and Juan Mart{\'{\i}}nez{-}Romo and Alberto Mozo and Christopher Thraves}, title = {Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {1--22}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9223-5}, doi = {10.1007/S00224-009-9223-5}, timestamp = {Fri, 27 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/AntaLLMMMT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BaNNR11, author = {Khanh Do Ba and Huy L. Nguyen and Huy N. Nguyen and Ronitt Rubinfeld}, title = {Sublinear Time Algorithms for Earth Mover's Distance}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {428--442}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9265-8}, doi = {10.1007/S00224-010-9265-8}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BaNNR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BauwensT11, author = {Bruno Bauwens and Sebastiaan A. Terwijn}, title = {Notes on Sum-Tests and Independence Tests}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {247--268}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9240-4}, doi = {10.1007/S00224-009-9240-4}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BauwensT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BeckmannL11, author = {Arnold Beckmann and Benedikt L{\"{o}}we}, title = {Computability in Europe 2008}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {614--616}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9251-1}, doi = {10.1007/S00224-010-9251-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BeckmannL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BenderKTW11, author = {Michael A. Bender and Bradley C. Kuszmaul and Shang{-}Hua Teng and Kebin Wang}, title = {Optimal Cache-Oblivious Mesh Layouts}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {269--296}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9242-2}, doi = {10.1007/S00224-009-9242-2}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BenderKTW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BergstraB11, author = {Jan A. Bergstra and Inge Bethke}, title = {Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {840--864}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9272-9}, doi = {10.1007/S00224-010-9272-9}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BergstraB11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BlaserJLM11, author = {Markus Bl{\"{a}}ser and Andreas Jakoby and Maciej Liskiewicz and Bodo Manthey}, title = {Privacy in Non-private Environments}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {211--245}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9243-1}, doi = {10.1007/S00224-009-9243-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BlaserJLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Bojanczyk11, author = {Mikolaj Bojanczyk}, title = {Weak {MSO} with the Unbounding Quantifier}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {554--576}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9279-2}, doi = {10.1007/S00224-010-9279-2}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Bojanczyk11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BolligK11, author = {Beate Bollig and Jochen Klump}, title = {New Results on the Most Significant Bit of Integer Multiplication}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {170--188}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9238-y}, doi = {10.1007/S00224-009-9238-Y}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BolligK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ChangL11, author = {Ching{-}Lueh Chang and Yuh{-}Dauh Lyuu}, title = {Spreading of Messages in Random Graphs}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {389--401}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9258-7}, doi = {10.1007/S00224-010-9258-7}, timestamp = {Thu, 08 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ChangL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ChenFM11, author = {Yijia Chen and J{\"{o}}rg Flum and Moritz M{\"{u}}ller}, title = {Lower Bounds for Kernelizations and Other Preprocessing Procedures}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {803--839}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9270-y}, doi = {10.1007/S00224-010-9270-Y}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ChenFM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Cheng11, author = {Wen{-}Chiao Cheng}, title = {Conditional Fuzzy Entropy of Maps in Fuzzy Systems}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {767--780}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9268-5}, doi = {10.1007/S00224-010-9268-5}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Cheng11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/CiobanuK11, author = {Gabriel Ciobanu and Shankara Narayanan Krishna}, title = {Enhanced Mobile Membranes: Computability Results}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {715--729}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9256-9}, doi = {10.1007/S00224-010-9256-9}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/CiobanuK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/DiekertK11, author = {Volker Diekert and Manfred Kufleitner}, title = {Fragments of First-Order Logic over Infinite Words}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {486--516}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9266-7}, doi = {10.1007/S00224-010-9266-7}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/DiekertK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/DolevKS11, author = {Shlomi Dolev and Marina Kopeetsky and Adi Shamir}, title = {{RFID} Authentication Efficient Proactive Information Security within Computational Security}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {132--149}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9236-0}, doi = {10.1007/S00224-009-9236-0}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/DolevKS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/DrosteV11, author = {Manfred Droste and Heiko Vogler}, title = {Weighted Logics for Unranked Tree Automata}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {23--47}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9224-4}, doi = {10.1007/S00224-009-9224-4}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/DrosteV11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/EbenlendrS11, author = {Tom{\'{a}}s Ebenlendr and Jir{\'{\i}} Sgall}, title = {Semi-Online Preemptive Scheduling: One Algorithm for All Variants}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {577--613}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9287-2}, doi = {10.1007/S00224-010-9287-2}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/EbenlendrS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/EpsteinS11, author = {Leah Epstein and Rob van Stee}, title = {Improved Results for a Memory Allocation Problem}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {79--92}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9226-2}, doi = {10.1007/S00224-009-9226-2}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/EpsteinS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Fichtner11, author = {Ina Fichtner}, title = {Weighted Picture Automata and Weighted Logics}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {48--78}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9225-3}, doi = {10.1007/S00224-009-9225-3}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Fichtner11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GacsHR11, author = {P{\'{e}}ter G{\'{a}}cs and Mathieu Hoyrup and Cristobal Rojas}, title = {Randomness on Computable Probability Spaces - {A} Dynamical Point of View}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {465--485}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9263-x}, doi = {10.1007/S00224-010-9263-X}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/GacsHR11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GollerL11, author = {Stefan G{\"{o}}ller and Markus Lohrey}, title = {Fixpoint Logics over Hierarchical Structures}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {93--131}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9227-1}, doi = {10.1007/S00224-009-9227-1}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/GollerL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/GutinKLM11, author = {Gregory Z. Gutin and Eun Jung Kim and Michael Lampis and Valia Mitsou}, title = {Vertex Cover Problem Parameterized Above and Below Tight Bounds}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {402--410}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9262-y}, doi = {10.1007/S00224-010-9262-Y}, timestamp = {Thu, 22 Feb 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/GutinKLM11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Harks11, author = {Tobias Harks}, title = {Stackelberg Strategies and Collusion in Network Games with Splittable Flow}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {781--802}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9269-4}, doi = {10.1007/S00224-010-9269-4}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Harks11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/HromkovicS11, author = {Juraj Hromkovic and Georg Schnitger}, title = {Ambiguity and Communication}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {517--534}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9277-4}, doi = {10.1007/S00224-010-9277-4}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/HromkovicS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/JanssonP11, author = {Jesper Jansson and Zeshan Peng}, title = {Algorithms for Finding a Most Similar Subforest}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {865--887}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9274-7}, doi = {10.1007/S00224-010-9274-7}, timestamp = {Tue, 17 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/JanssonP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/JezO11, author = {Artur Jez and Alexander Okhotin}, title = {Complexity of Equations over Sets of Natural Numbers}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {319--342}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9246-y}, doi = {10.1007/S00224-009-9246-Y}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/JezO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/LathropLPS11, author = {James I. Lathrop and Jack H. Lutz and Matthew J. Patitz and Scott M. Summers}, title = {Computability and Complexity in Self-assembly}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {617--647}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9252-0}, doi = {10.1007/S00224-010-9252-0}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/LathropLPS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/LeviL11, author = {Tamir Levi and Ami Litman}, title = {The Strongest Model of Computation Obeying 0-1 Principles}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {374--388}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9257-8}, doi = {10.1007/S00224-010-9257-8}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/LeviL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/LohreyS11, author = {Markus Lohrey and Benjamin Steinberg}, title = {Tilings and Submonoids of Metabelian Groups}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {411--427}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9264-9}, doi = {10.1007/S00224-010-9264-9}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/LohreyS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/ManasaKJ11, author = {Lakshmi Manasa and Shankara Narayanan Krishna and Chinmay Jain}, title = {Model Checking Weighted Integer Reset Timed Automata}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {648--679}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9253-z}, doi = {10.1007/S00224-010-9253-Z}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/ManasaKJ11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Marx11, author = {D{\'{a}}niel Marx}, title = {Tractable Structures for Constraint Satisfaction with Truth Tables}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {444--464}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9248-9}, doi = {10.1007/S00224-009-9248-9}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Marx11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/MayordomoMP11, author = {Elvira Mayordomo and Philippe Moser and Sylvain Perifel}, title = {Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable}, journal = {Theory Comput. Syst.}, volume = {48}, number = {4}, pages = {731--766}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9267-6}, doi = {10.1007/S00224-010-9267-6}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/MayordomoMP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/MesserschmidtO11, author = {Hartmut Messerschmidt and Friedrich Otto}, title = {A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {343--373}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9247-x}, doi = {10.1007/S00224-009-9247-X}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/MesserschmidtO11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/SablikT11, author = {Mathieu Sablik and Guillaume Theyssier}, title = {Topological Dynamics of Cellular Automata: Dimension Matters}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {693--714}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9255-x}, doi = {10.1007/S00224-010-9255-X}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/SablikT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Sakai11, author = {Yoshifumi Sakai}, title = {An Almost Quadratic Time Algorithm for Sparse Spliced Alignment}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {189--210}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9239-x}, doi = {10.1007/S00224-009-9239-X}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Sakai11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Simonsen11, author = {Jakob Grue Simonsen}, title = {Beta-Shifts, Their Languages, and Computability}, journal = {Theory Comput. Syst.}, volume = {48}, number = {2}, pages = {297--318}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9245-z}, doi = {10.1007/S00224-009-9245-Z}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/Simonsen11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/SoltysW11, author = {Michael Soltys and Craig Wilson}, title = {On the Complexity of Computing Winning Strategies for Finite Poset Games}, journal = {Theory Comput. Syst.}, volume = {48}, number = {3}, pages = {680--692}, year = {2011}, url = {https://doi.org/10.1007/s00224-010-9254-y}, doi = {10.1007/S00224-010-9254-Y}, timestamp = {Wed, 14 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/SoltysW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/Williams11, author = {Ryan Williams}, title = {Parallelizing Time with Polynomial Circuits}, journal = {Theory Comput. Syst.}, volume = {48}, number = {1}, pages = {150--169}, year = {2011}, url = {https://doi.org/10.1007/s00224-009-9237-z}, doi = {10.1007/S00224-009-9237-Z}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/Williams11.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.