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 93 matches
- 1990
- Karl R. Abrahamson:
A Time-Space Tradeoff for Boolean Matrix Multiplication. FOCS 1990: 412-419 - David J. Aldous, Umesh V. Vazirani:
A Markovian Extension of Valiant's Learning Model (Extended Abstract). FOCS 1990: 392-396 - Noga Alon, Oded Goldreich, Johan Håstad, René Peralta:
Simple Constructions of Almost k-Wise Independent Random Variables. FOCS 1990: 544-553 - Noga Alon, Nimrod Megiddo:
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. FOCS 1990: 574-582 - Noga Alon, Moni Naor:
Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract). FOCS 1990: 46-54 - Bowen Alpern, Larry Carter, Ephraim Feig:
Uniform Memory Hierarchies. FOCS 1990: 600-608 - Dana Angluin, Michael Frazier, Leonard Pitt:
Learning Conjunctions of Horn Clauses (Extended Abstract). FOCS 1990: 186-192 - Shay Assaf, Eli Upfal:
Fault Tolerant Sorting Network. FOCS 1990: 275-284 - Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? (Extended Abstract). FOCS 1990: 55-64 - Baruch Awerbuch, Israel Cidon, Shay Kutten:
Communication-Optimal Maintenance of Replicated Information. FOCS 1990: 492-502 - Baruch Awerbuch, David Peleg:
Sparse Partitions (Extended Abstract). FOCS 1990: 503-513 - Baruch Awerbuch, David Peleg:
Network Synchronization with Polylogarithmic Overhead. FOCS 1990: 514-522 - Baruch Awerbuch, Michael E. Saks:
A Dining Philosophers Algorithm with Polynomial Response Time. FOCS 1990: 65-74 - László Babai, Lance Fortnow:
A Characterization of \sharp P Arithmetic Straight Line Programs. FOCS 1990: 26-34 - László Babai, Lance Fortnow, Carsten Lund:
Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols. FOCS 1990: 16-25 - László Babai, Gábor Hetyei, William M. Kantor, Alexander Lubotzky, Ákos Seress:
On the Diameter of Finite Groups. FOCS 1990: 857-865 - Paul Bay, Gianfranco Bilardi:
Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract). FOCS 1990: 297-306 - Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa:
Time-Space Tradeoffs for Undirected Graph Traversal. FOCS 1990: 429-438 - Paul Beame, Martin Tompa, Peiyuan Yan:
Communication-Space Tradeoffs for Unrestricted Protocols. FOCS 1990: 420-428 - Mihir Bellare, Oded Goldreich, Shafi Goldwasser:
Randomness in Interactive Proofs. FOCS 1990: 563-572 - Mark de Berg, Mark H. Overmars:
Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract). FOCS 1990: 252-261 - Omer Berkman, Joseph F. JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin:
Some Triply-Logarithmic Parallel Algorithms (Extended Abstract). FOCS 1990: 871-881 - Marshall W. Bern, David Eppstein, John R. Gilbert:
Provably Good Mesh Generation. FOCS 1990: 231-241 - Avrim Blum:
Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain. FOCS 1990: 211-218 - Avrim Blum:
Some Tools for Approximate 3-Coloring (Extended Abstract). FOCS 1990: 554-562 - Jehoshua Bruck, Roman Smolensky:
Polynomial Threshold Functions, AC0 Functions and Spectral Norms (Extended Abstract). FOCS 1990: 632-641 - Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis:
On the Predictability of Coupled Automata: An Allegory about Chaos. FOCS 1990: 788-793 - Ran Canetti, Oded Goldreich:
Bounds on Tradeoffs between Randomness and Communication Complexity. FOCS 1990: 766-775 - William I. Chang, Eugene L. Lawler:
Approximate String Matching in Sublinear Expected Time. FOCS 1990: 116-124 - Bernard Chazelle:
Triangulating a Simple Polygon in Linear Time. FOCS 1990: 220-230
skipping 63 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-10-08 11:32 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