Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 40 matches
- 2011
- Susanne Albers, Jean-Yves Marion:
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS). Theory Comput. Syst. 48(3): 443 (2011) - Joël Alwen, Chris Peikert:
Generating Shorter Bases for Hard Random Lattices. Theory Comput. Syst. 48(3): 535-553 (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. Theory Comput. Syst. 48(1): 1-22 (2011) - Khanh Do Ba, Huy L. Nguyen, Huy N. Nguyen, Ronitt Rubinfeld:
Sublinear Time Algorithms for Earth Mover's Distance. Theory Comput. Syst. 48(2): 428-442 (2011) - Bruno Bauwens, Sebastiaan A. Terwijn:
Notes on Sum-Tests and Independence Tests. Theory Comput. Syst. 48(2): 247-268 (2011) - Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2008. Theory Comput. Syst. 48(3): 614-616 (2011) - Michael A. Bender, Bradley C. Kuszmaul, Shang-Hua Teng, Kebin Wang:
Optimal Cache-Oblivious Mesh Layouts. Theory Comput. Syst. 48(2): 269-296 (2011) - Jan A. Bergstra, Inge Bethke:
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows. Theory Comput. Syst. 48(4): 840-864 (2011) - Markus Bläser, Andreas Jakoby, Maciej Liskiewicz, Bodo Manthey:
Privacy in Non-private Environments. Theory Comput. Syst. 48(1): 211-245 (2011) - Mikolaj Bojanczyk:
Weak MSO with the Unbounding Quantifier. Theory Comput. Syst. 48(3): 554-576 (2011) - Beate Bollig, Jochen Klump:
New Results on the Most Significant Bit of Integer Multiplication. Theory Comput. Syst. 48(1): 170-188 (2011) - Ching-Lueh Chang, Yuh-Dauh Lyuu:
Spreading of Messages in Random Graphs. Theory Comput. Syst. 48(2): 389-401 (2011) - Yijia Chen, Jörg Flum, Moritz Müller:
Lower Bounds for Kernelizations and Other Preprocessing Procedures. Theory Comput. Syst. 48(4): 803-839 (2011) - Wen-Chiao Cheng:
Conditional Fuzzy Entropy of Maps in Fuzzy Systems. Theory Comput. Syst. 48(4): 767-780 (2011) - Gabriel Ciobanu, Shankara Narayanan Krishna:
Enhanced Mobile Membranes: Computability Results. Theory Comput. Syst. 48(3): 715-729 (2011) - Volker Diekert, Manfred Kufleitner:
Fragments of First-Order Logic over Infinite Words. Theory Comput. Syst. 48(3): 486-516 (2011) - Shlomi Dolev, Marina Kopeetsky, Adi Shamir:
RFID Authentication Efficient Proactive Information Security within Computational Security. Theory Comput. Syst. 48(1): 132-149 (2011) - Manfred Droste, Heiko Vogler:
Weighted Logics for Unranked Tree Automata. Theory Comput. Syst. 48(1): 23-47 (2011) - Tomás Ebenlendr, Jirí Sgall:
Semi-Online Preemptive Scheduling: One Algorithm for All Variants. Theory Comput. Syst. 48(3): 577-613 (2011) - Leah Epstein, Rob van Stee:
Improved Results for a Memory Allocation Problem. Theory Comput. Syst. 48(1): 79-92 (2011) - Ina Fichtner:
Weighted Picture Automata and Weighted Logics. Theory Comput. Syst. 48(1): 48-78 (2011) - Péter Gács, Mathieu Hoyrup, Cristobal Rojas:
Randomness on Computable Probability Spaces - A Dynamical Point of View. Theory Comput. Syst. 48(3): 465-485 (2011) - Stefan Göller, Markus Lohrey:
Fixpoint Logics over Hierarchical Structures. Theory Comput. Syst. 48(1): 93-131 (2011) - Gregory Z. Gutin, Eun Jung Kim, Michael Lampis, Valia Mitsou:
Vertex Cover Problem Parameterized Above and Below Tight Bounds. Theory Comput. Syst. 48(2): 402-410 (2011) - Tobias Harks:
Stackelberg Strategies and Collusion in Network Games with Splittable Flow. Theory Comput. Syst. 48(4): 781-802 (2011) - Juraj Hromkovic, Georg Schnitger:
Ambiguity and Communication. Theory Comput. Syst. 48(3): 517-534 (2011) - Jesper Jansson, Zeshan Peng:
Algorithms for Finding a Most Similar Subforest. Theory Comput. Syst. 48(4): 865-887 (2011) - Artur Jez, Alexander Okhotin:
Complexity of Equations over Sets of Natural Numbers. Theory Comput. Syst. 48(2): 319-342 (2011) - James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers:
Computability and Complexity in Self-assembly. Theory Comput. Syst. 48(3): 617-647 (2011) - Tamir Levi, Ami Litman:
The Strongest Model of Computation Obeying 0-1 Principles. Theory Comput. Syst. 48(2): 374-388 (2011)
skipping 10 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-28 18:23 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