Остановите войну!
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
- 1986
- Karl R. Abrahamson:
Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs. FOCS 1986: 402-409 - Alfred V. Aho, David Lee:
Storing a Dynamic Sparse Table. FOCS 1986: 55-60 - William Aiello, Shafi Goldwasser, Johan Håstad:
On the Power of Interaction. FOCS 1986: 368-379 - Noga Alon, Yossi Azar, Uzi Vishkin:
Tight Complexity Bounds for Parallel Comparison Sorting. FOCS 1986: 502-510 - Noga Alon, Wolfgang Maass:
Meanders, Ramsey Theory and Lower Bounds for Branching Programs. FOCS 1986: 410-417 - Baruch Awerbuch, Silvio Micali:
Dynamic deadlock resolution protocols (Extended Abstract). FOCS 1986: 196-207 - László Babai:
A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. FOCS 1986: 303-312 - László Babai, Peter Frankl, Janos Simon:
Complexity classes in communication complexity theory (preliminary version). FOCS 1986: 337-347 - Bernd Becker, Hans Ulrich Simon:
How Robust Is the n-Cube? (Extended Abstract). FOCS 1986: 283-291 - Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg:
Optimal Simulations of Tree Machines (Preliminary Version). FOCS 1986: 274-282 - Gilles Brassard, Claude Crépeau:
Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond. FOCS 1986: 188-195 - Gilles Brassard, Claude Crépeau, Jean-Marc Robert:
Information Theoretic Reductions among Disclosure Problems. FOCS 1986: 168-173 - Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis:
On the Power of One-Way Communication. FOCS 1986: 455-464 - Bernard Chazelle:
Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract). FOCS 1986: 87-96 - Marek Chrobak, Ming Li:
k+1 Heads Are Better than k for PDA's. FOCS 1986: 361-367 - Richard Cole:
Parallel Merge Sort. FOCS 1986: 511-516 - Richard Cole, Uzi Vishkin:
Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. FOCS 1986: 478-491 - Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer:
Flipping Persuasively in Constant Expected Time (Preliminary Version). FOCS 1986: 222-232 - Martin E. Dyer, Alan M. Frieze:
Fast Solution of Some Random NP-Hard Problems. FOCS 1986: 331-336 - Sally Floyd, Richard M. Karp:
FFD Bin Packing for Item Sizes with Distributions on [0,1/2]. FOCS 1986: 322-330 - Greg N. Frederickson, Ravi Janardan:
Separator-Based Strategies for Efficient Message Routing (Preliminary Version). FOCS 1986: 428-437 - Joel Friedman:
On Newton's Method for Polynomials. FOCS 1986: 153-161 - Zvi Galil, Éva Tardos:
An O(n2 (m + n log n) log n) Min-Cost Flow Algorithm. FOCS 1986: 1-9 - Max H. Garzon, Yechezkel Zalcstein:
The Complexity of Isomorphism Testing. FOCS 1986: 313-321 - Joachim von zur Gathen:
Permanent and Determinant. FOCS 1986: 398-401 - Hillel Gazit:
An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. FOCS 1986: 492-501 - Oded Goldreich, Silvio Micali, Avi Wigderson:
Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract). FOCS 1986: 174-187 - Judy Goldsmith, Deborah Joseph:
Three Results on the Polynomial Isomorphism of Complete Sets. FOCS 1986: 390-397 - Daniel H. Greene, F. Frances Yao:
Finite-Resolution Computational Geometry. FOCS 1986: 143-152 - Jiawei Hong:
Proving by Example and Gap Theorems. FOCS 1986: 107-116
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-06-15 23:13 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