Остановите войну!
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 100 matches
- 1989
- Martín Abadi, Joseph Y. Halpern:
Decidability and Expressiveness for First-Order Logics of Probability (Extended Abstract). FOCS 1989: 148-153 - Karl R. Abrahamson, John A. Ellis, Michael R. Fellows, Manuel E. Mata:
On the Complexity of Fixed Parameter Problems (Extended Abstract). FOCS 1989: 210-215 - Yehuda Afek, Eli Gafni, Moty Ricklin:
Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract). FOCS 1989: 370-375 - Miklós Ajtai, Yuri Gurevich:
Datalog vs. First-Order Logic. FOCS 1989: 142-147 - Eric Allender:
A Note on the Power of Threshold Circuits. FOCS 1989: 580-584 - Rajeev Alur, Thomas A. Henzinger:
A Really Temporal Logic. FOCS 1989: 164-169 - Cecilia R. Aragon, Raimund Seidel:
Randomized Search Trees. FOCS 1989: 540-545 - Baruch Awerbuch, Andrew V. Goldberg, Michael Luby, Serge A. Plotkin:
Network Decomposition and Locality in Distributed Computation. FOCS 1989: 364-369 - Baruch Awerbuch, Yishay Mansour, Nir Shavit:
Polynomial End-To-End Communication (Extended Abstract). FOCS 1989: 358-363 - László Babai, Lajos Rónyai:
Computing Irreducible Representations of Finite Groups. FOCS 1989: 93-98 - Giuseppe Di Battista, Roberto Tamassia:
Incremental Planarity Testing (Extended Abstract). FOCS 1989: 436-441 - Donald Beaver, Shafi Goldwasser:
Multiparty Computation with Faulty Majority (Extended Announcement). FOCS 1989: 468-473 - Bonnie Berger, John Rompel:
Simulating (log c n)-wise Independence in NC. FOCS 1989: 2-7 - Bonnie Berger, John Rompel, Peter W. Shor:
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry. FOCS 1989: 54-59 - Omer Berkman, Uzi Vishkin:
Recursive *-Tree Parallel Data-Structure (Extended Abstract). FOCS 1989: 196-202 - Piotr Berman, Juan A. Garay, Kenneth J. Perry:
Towards Optimal Distributed Consensus (Extended Abstract). FOCS 1989: 410-415 - Andrei Z. Broder:
Generating Random Spanning Trees. FOCS 1989: 442-447 - Jin-yi Cai:
Lower Bounds for Constant Depth Circuits in the Presence of Help Bits. FOCS 1989: 532-537 - Jin-yi Cai, Martin Fürer, Neil Immerman:
An Optimal Lower Bound on the Number of Variables for Graph Identification. FOCS 1989: 612-617 - Jin-yi Cai, Richard J. Lipton:
Subquadratic Simulations of Circuits by Branching Programs. FOCS 1989: 568-573 - Bernard Chazelle:
An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra (Detailed Abstract). FOCS 1989: 586-591 - Joseph Cheriyan, Torben Hagerup:
A Randomized Maximum-Flow Algorithm. FOCS 1989: 118-123 - Benny Chor, Lior Moscovici:
Solvability in Asynchronous Environments (Extended Abstract). FOCS 1989: 422-427 - Aviad Cohen, Avi Wigderson:
Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract). FOCS 1989: 14-19 - Anne Condon, Richard J. Lipton:
On the Complexity of Space Bounded Interactive Proofs (Extended Abstract). FOCS 1989: 462-467 - Stephen A. Cook, Bruce M. Kapron:
Characterizations of the Basic Feasible Functionals of Finite Type (Extended Abstract). FOCS 1989: 154-159 - Elias Dahlhaus, Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract). FOCS 1989: 454-459 - Matthew Dickerson:
The Inverse of an Automorphism in Polynomial Time. FOCS 1989: 82-87 - David P. Dobkin, Subhash Suri:
Dynamically Computing the Maxima of Decomposable Functions, with Applications. FOCS 1989: 488-493 - Danny Dolev, Tomás Feder:
Multiparty Communication Complexity. FOCS 1989: 428-433
skipping 70 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-06-04 05:03 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