Остановите войну!
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 55 matches
- 1999
- Timm Ahrendt:
Fast Computations of the Exponential Function. STACS 1999: 302-312 - William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou:
Supporting Increment and Decrement Operations in Balancing Networks. STACS 1999: 393-403 - Gunnar Andersson:
An Approximation Algorithm for Max p-Section. STACS 1999: 237-247 - Alexander E. Andreev, Andrea E. F. Clementi, Paolo Penna, José D. P. Rolim:
Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines. STACS 1999: 68-77 - Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP. STACS 1999: 281-290 - Rana Barua, Suman Roy, Zhou Chaochen:
Completeness of Neighbourhood Logic. STACS 1999: 521-530 - Clifford Bergman, Giora Slutzki:
Complexity of Some Problems in Universal Algebra. STACS 1999: 163-172 - Anna Bernasconi, Igor E. Shparlinski:
Circuit Complexity of Testing Square-Free Numbers. STACS 1999: 47-56 - Ahmed Bouajjani, Richard Mayr:
Model Checking Lossy Vector Addition Systems. STACS 1999: 323-333 - Vincent Bouchitté, Ioan Todinca:
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs. STACS 1999: 197-206 - Harry Buhrman, Lance Fortnow:
One-sided Versus Two-sided Error in Probabilistic Computation. STACS 1999: 100-109 - Jin-yi Cai, Aduri Pavan, D. Sivakumar:
On the Hardness of Permanent. STACS 1999: 90-99 - John Case, Keh-Jiann Chen, Sanjay Jain:
Costs of General Purpose Learning. STACS 1999: 424-433 - Giovanni Di Crescenzo, Niels Ferguson, Russell Impagliazzo, Markus Jakobsson:
How to Forget a Secret. STACS 1999: 500-509 - Bruno Durand, Alexander Shen, Nikolai K. Vereshchagin:
Descriptive Complexity of Computable Sequences. STACS 1999: 153-162 - Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino:
On the Difference of Horn Theories. STACS 1999: 467-477 - Lars Engebretsen:
An Explicit Lower Bound for TSP with Distances One and Two. STACS 1999: 373-382 - Juan Luis Esteban, Jacobo Torán:
Space Bounds for Resolution. STACS 1999: 551-560 - Mark Ettinger, Peter Høyer:
On Quantum Algorithms for Noncommutative Hidden Subgroups. STACS 1999: 478-487 - Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen:
Lower Bounds for Dynamic Algebraic Problems. STACS 1999: 362-372 - Mikael Hammar, Bengt J. Nilsson, Sven Schuierer:
Parallel Searching on m Rays. STACS 1999: 132-142 - Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel:
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries. STACS 1999: 269-280 - Vesa Halava, Mika Hirvensalo, Ronald de Wolf:
Decidability and Undecidability of Marked PCP. STACS 1999: 207-216 - Christian Icking, Rolf Klein, Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets. STACS 1999: 110-120 - Andreas Jakoby:
The Average Time Complexity to Compute Prefix Functions in Processor Networks. STACS 1999: 78-89 - Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
Scheduling Dynamic Graphs. STACS 1999: 383-392 - Ming-Yang Kao, Andrzej Lingas, Anna Östlin:
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions. STACS 1999: 184-196 - Daniel Kirsten:
Some Undecidability Results Related to the Star Problem in Trace Monoids. STACS 1999: 227-236 - Ton Kloks, Jan Kratochvíl, Haiko Müller:
New Branchwidth Territories. STACS 1999: 173-183 - Maciej Koutny, Giuseppe Pappalardo:
A Model of Behaviour Abstraction for Communicating Processes. STACS 1999: 313-322
skipping 25 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-29 16:10 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