Остановите войну!
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 60 matches
- 1988
- Alok Aggarwal, James K. Park:
Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version). FOCS 1988: 497-512 - Miklós Ajtai:
The Complexity of the Pigeonhole Principle. FOCS 1988: 346-355 - Miklós Ajtai, Ronald Fagin:
Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version). FOCS 1988: 358-367 - Noga Alon, Yossi Azar:
Parallel Comparison Algorithms for Approximation Problems. FOCS 1988: 194-203 - Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version). FOCS 1988: 231-245 - Baruch Awerbuch, Michael Sipser:
Dynamic Networks Are as Fast as Static Networks (Preliminary Version). FOCS 1988: 206-220 - László Babai, Eugene M. Luks, Ákos Seress:
Fast Management of Permutation Groups. FOCS 1988: 272-282 - Amir M. Ben-Amram, Zvi Galil:
On Pointers versus Addresses (Extended Abstract). FOCS 1988: 532-538 - Sandeep N. Bhatt, Jin-yi Cai:
Take a Walk, Grow a Tree (Preliminary Version). FOCS 1988: 469-478 - Lenore Blum, Mike Shub, Steve Smale:
On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract). FOCS 1988: 387-397 - Andrei Z. Broder, Anna R. Karlin:
Bounds on the Cover Time (Preliminary Version). FOCS 1988: 479-487 - Nader H. Bshouty:
A Lower Bound for Matrix Multiplication. FOCS 1988: 64-67 - John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier:
On the Complexity of Kinodynamic Planning. FOCS 1988: 306-316 - Bernard Chazelle, Herbert Edelsbrunner:
An Optimal Algorithm for Intersecting Line Segments in the Plane. FOCS 1988: 590-600 - Bernard Chazelle, Joel Friedman:
A Deterministic View of Random Sampling and its Use in Geometry. FOCS 1988: 539-549 - Kenneth L. Clarkson:
A Las Vegas Algorithm for Linear Programming When the Dimension Is Small. FOCS 1988: 452-456 - Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579 - Costas Courcoubetis, Mihalis Yannakakis:
Verifying Temporal Properties of Finite-State Probabilistic Programs. FOCS 1988: 338-345 - Claude Crépeau, Joe Kilian:
Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract). FOCS 1988: 42-52 - Joseph C. Culberson, Robert A. Reckhow:
Covering Polygons Is Hard (Preliminary Abstract). FOCS 1988: 601-611 - Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani:
Polytopes, Permanents and Graphs with Large Factors. FOCS 1988: 412-421 - Elias Dahlhaus, Péter Hajnal, Marek Karpinski:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs. FOCS 1988: 186-193 - Alfredo De Santis, George Markowsky, Mark N. Wegman:
Learning Probabilistic Prediction Functions (Extended Abstract). FOCS 1988: 110-119 - Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan:
Dynamic Perfect Hashing: Upper and Lower Bounds. FOCS 1988: 524-531 - E. Allen Emerson, Charanjit S. Jutla:
The Complexity of Tree Automata and Logics of Programs (Extended Abstract). FOCS 1988: 328-337 - David Eppstein, Zvi Galil, Raffaele Giancarlo:
Speeding up Dynamic Programming. FOCS 1988: 488-496 - Michael L. Fredman, Deborah L. Goldsmith:
Three Stacks. FOCS 1988: 514-523 - William I. Gasarch, Carl H. Smith:
Learning via Queries. FOCS 1988: 130-137 - Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos:
Combinatorial Algorithms for the Generalized Circulation Problem. FOCS 1988: 432-443 - Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. FOCS 1988: 174-185
skipping 30 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-05 22:45 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