default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheory of Computing Systems, Volume 48
Volume 48, Number 1, January 2011
- Antonio Fernández Anta
, José Luis López-Presa, M. Araceli Lorenzo, Pilar Manzano, Juan Martínez-Romo, Alberto Mozo, Christopher Thraves:
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks. 1-22 - Manfred Droste, Heiko Vogler:
Weighted Logics for Unranked Tree Automata. 23-47 - Ina Fichtner:
Weighted Picture Automata and Weighted Logics. 48-78 - Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem. 79-92 - Stefan Göller, Markus Lohrey:
Fixpoint Logics over Hierarchical Structures. 93-131 - Shlomi Dolev, Marina Kopeetsky, Adi Shamir:
RFID Authentication Efficient Proactive Information Security within Computational Security. 132-149 - Ryan Williams:
Parallelizing Time with Polynomial Circuits. 150-169 - Beate Bollig, Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication. 170-188 - Yoshifumi Sakai:
An Almost Quadratic Time Algorithm for Sparse Spliced Alignment. 189-210 - Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. 211-245
Volume 48, Number 2, February 2011
- Bruno Bauwens, Sebastiaan A. Terwijn:
Notes on Sum-Tests and Independence Tests. 247-268 - Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. 269-296 - Jakob Grue Simonsen:
Beta-Shifts, Their Languages, and Computability. 297-318 - Artur Jez, Alexander Okhotin:
Complexity of Equations over Sets of Natural Numbers. 319-342 - Hartmut Messerschmidt, Friedrich Otto:
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata. 343-373 - Tamir Levi, Ami Litman:
The Strongest Model of Computation Obeying 0-1 Principles. 374-388 - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Spreading of Messages in Random Graphs. 389-401 - Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. 402-410 - Markus Lohrey, Benjamin Steinberg:
Tilings and Submonoids of Metabelian Groups. 411-427 - Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
Sublinear Time Algorithms for Earth Mover's Distance. 428-442
Volume 48, Number 3, April 2011
- Susanne Albers, Jean-Yves Marion:
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). 443 - Dániel Marx:
Tractable Structures for Constraint Satisfaction with Truth Tables. 444-464 - Péter Gács, Mathieu Hoyrup, Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View. 465-485 - Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. 486-516 - Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. 517-534 - Joël Alwen, Chris Peikert:
Generating Shorter Bases for Hard Random Lattices. 535-553 - Mikolaj Bojanczyk:
Weak MSO with the Unbounding Quantifier. 554-576 - Tomás Ebenlendr, Jirí Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. 577-613 - Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2008. 614-616 - James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. 617-647 - Lakshmi Manasa, Shankara Narayanan Krishna, Chinmay Jain:
Model Checking Weighted Integer Reset Timed Automata. 648-679 - Michael Soltys, Craig Wilson:
On the Complexity of Computing Winning Strategies for Finite Poset Games. 680-692 - Mathieu Sablik, Guillaume Theyssier:
Topological Dynamics of Cellular Automata: Dimension Matters. 693-714 - Gabriel Ciobanu, Shankara Narayanan Krishna:
Enhanced Mobile Membranes: Computability Results. 715-729
Volume 48, Number 4, May 2011
- Elvira Mayordomo, Philippe Moser, Sylvain Perifel:
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable. 731-766 - Wen-Chiao Cheng:
Conditional Fuzzy Entropy of Maps in Fuzzy Systems. 767-780 - Tobias Harks:
Stackelberg Strategies and Collusion in Network Games with Splittable Flow. 781-802 - Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. 803-839 - Jan A. Bergstra, Inge Bethke:
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. 840-864 - Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. 865-887
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.
last updated on 2025-12-13 20:33 CET 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:
