Остановите войну!
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
- 1996
- Andris Ambainis:
Upper Bounds on Multiparty Communication Complexity of Shifts. STACS 1996: 631-642 - Andris Ambainis, Rusins Freivalds, Carl H. Smith:
General Inductive Inference Types Based on Linearly-Ordered Sets. STACS 1996: 243-253 - Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng:
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. STACS 1996: 63-74 - Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim:
Optimal Bounds on the Approximation of Boolean Functions with Consequences on the Concept of Hardware. STACS 1996: 319-330 - Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110 - Evripidis Bampis, Charles Delorme, Jean-Claude König:
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). STACS 1996: 655-666 - Janis Barzdins, Rusins Freivalds, Carl H. Smith:
Learning with Confidence. STACS 1996: 207-218 - Frédérique Bassino:
Star-Height of an N-Rational Series. STACS 1996: 125-135 - Marie-Pierre Béal, Olivier Carton, Christophe Reutenauer:
Cyclic Languages and Strongly Cyclic Languages. STACS 1996: 49-59 - Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo:
Minimal Forbidden Words and Symbolic Dynamics. STACS 1996: 555-566 - Martin Beaudry:
Languages Recognized by Finite Aperiodic Groupoids. STACS 1996: 113-124 - Béatrice Bérard, Paul Gastin, Antoine Petit:
On the Power of Non-Observable Actions in Timed Automata. STACS 1996: 257-268 - Petra Berenbrink, Friedhelm Meyer auf der Heide, Volker Stemann:
Fault-Tolerant Shared Memory Simulations. STACS 1996: 181-192 - Michael Bertol, Volker Diekert:
Trace Rewriting: Computing Normal Forms in Time O(n log n). STACS 1996: 269-280 - Daniel Bleichenbacher, Ueli M. Maurer:
Optimal Tree-Based One-Time Digital Signature Schemes. STACS 1996: 363-374 - Beate Bollig, Ingo Wegener:
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams. STACS 1996: 491-502 - Julian C. Bradfield:
On the Expressivity of the Modal Mu-Calculus. STACS 1996: 479-490 - Gilles Brassard:
New Trends in Quantum Computing. STACS 1996: 3-10 - Dany Breslauer:
On Competitive On-Line Paging with Lookahead. STACS 1996: 593-603 - Harry Buhrman, Luc Longpré:
Compressibility and Resource Bounded Measure. STACS 1996: 13-24 - Harry Buhrman, Thomas Thierauf:
The Complexity of Generating and Checking Proffs of Membership. STACS 1996: 75-86 - Jin-yi Cai, Ashish V. Naik, D. Sivakumar:
On the Existence of Hard Sparse Sets under Weak Reductions. STACS 1996: 307-318 - Jin-yi Cai, Alan L. Selman:
Fine Separation of Average Time Complexity Classes. STACS 1996: 331-343 - Karel Culík II, Jarkko Kari:
An Aperiodic Set of Wang Cubes. STACS 1996: 137-146 - Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. STACS 1996: 643-654 - François Denis, Cyrille D'Halluin, Rémi Gilleron:
PAC Learning with Simple Examples. STACS 1996: 231-242 - Martin Dietzfelbinger:
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes. STACS 1996: 569-580 - Christoph Dürr, Huong Lê Thanh, Miklos Santha:
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata. STACS 1996: 281-292 - Joel Friedman, Antoine Joux, Yuval Roichman, Jacques Stern, Jean-Pierre Tillich:
The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography. STACS 1996: 375-386 - Christiane Frougny:
On the Successor Function in Non-Classical Numeration Systems. STACS 1996: 543-553
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-06 18:17 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