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 84 matches
- 1986
- Klaus Ambos-Spies:
An Inhomogeneity in the Structure of Karp Degrees. SIAM J. Comput. 15(4): 958-963 (1986) - Alberto Apostolico, Raffaele Giancarlo:
The Boyer-Moore-Galil String Searching Strategies Revisited. SIAM J. Comput. 15(1): 98-105 (1986) - Benjamin Arazi:
A Binary Search with a Parallel Recovery of the Bits. SIAM J. Comput. 15(3): 851-855 (1986) - Giorgio Ausiello, Alessandro D'Atri, Domenico Saccà:
Minimal Representation of Directed Hypergraphs. SIAM J. Comput. 15(2): 418-431 (1986) - Eric Bach, Gary L. Miller, Jeffrey O. Shallit:
Sums of Divisors, Perfect Numbers and Factoring. SIAM J. Comput. 15(4): 1143-1154 (1986) - Brenda S. Baker:
A Provably Good Algorithm for the Two Module Routing Problem. SIAM J. Comput. 15(1): 162-188 (1986) - Egon Balas, Chang Sung Yu:
Finding a Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15(4): 1054-1068 (1986) - José L. Balcázar, Ronald V. Book, Uwe Schöning:
Sparse Sets, Lowness and Highness. SIAM J. Comput. 15(3): 739-747 (1986) - Paul Beame, Stephen A. Cook, H. James Hoover:
Log Depth Circuits for Division and Related Problems. SIAM J. Comput. 15(4): 994-1003 (1986) - Francine Berman, Mary Ellen Bock, Eric Dittert, Michael J. O'Donnell, Darrell Plank:
Collections of Functions for Perfect Hashing. SIAM J. Comput. 15(2): 604-618 (1986) - Norbert Blum:
On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem. SIAM J. Comput. 15(4): 1021-1024 (1986) - Lenore Blum, Manuel Blum, Mike Shub:
A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986) - Lenore Blum, Mike Shub:
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average. SIAM J. Comput. 15(2): 384-398 (1986) - Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul:
Bounds for Width Two Branching Programs. SIAM J. Comput. 15(2): 549-560 (1986) - John L. Bruno, Peter J. Downey:
Probabilistic Bounds on the Performance of List Scheduling. SIAM J. Comput. 15(2): 409-417 (1986) - Stanley Cabay, Dong-Koo Choi:
Algebraic Computations of Scaled Padé Fractions. SIAM J. Comput. 15(1): 243-270 (1986) - Ming-Te Chao, John V. Franco:
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem. SIAM J. Comput. 15(4): 1106-1118 (1986) - Bernard Chazelle:
Filtering Search: A New Approach to Query-Answering. SIAM J. Comput. 15(3): 703-724 (1986) - Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
Computing the Largest Empty Rectangle. SIAM J. Comput. 15(1): 300-315 (1986) - Guy W. Cherry:
Integration in Finite Terms with Special Functions: The Logarithmic Integral. SIAM J. Comput. 15(1): 1-21 (1986) - Francis Y. L. Chin, K. V. S. Ramarao:
Optimal Termination Protocols for Network Partitioning. SIAM J. Comput. 15(1): 131-144 (1986) - Claudio Citrini, Stefano Crespi-Reghizzi, Dino Mandrioli:
On Deterministic Multi-Pass Analysis. SIAM J. Comput. 15(3): 668-693 (1986) - Stephen A. Cook, Cynthia Dwork, Rüdiger Reischuk:
Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes. SIAM J. Comput. 15(1): 87-97 (1986) - Don Coppersmith, Maria M. Klawe, Nicholas Pippenger:
Alphabetic Minimax Trees of Degree at Most t. SIAM J. Comput. 15(1): 189-192 (1986) - William H. Cunningham:
Improved Bounds for Matroid Partition and Intersection Algorithms. SIAM J. Comput. 15(4): 948-957 (1986) - James H. Davenport:
The Risch Differential Equation Problem. SIAM J. Comput. 15(4): 903-918 (1986) - Martin E. Dyer:
On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem. SIAM J. Comput. 15(3): 725-738 (1986) - Herbert Edelsbrunner, Leonidas J. Guibas, Jorge Stolfi:
Optimal Point Location in a Monotone Subdivision. SIAM J. Comput. 15(2): 317-340 (1986) - Herbert Edelsbrunner, Joseph O'Rourke, Raimund Seidel:
Constructing Arrangements of Lines and Hyperplanes with Applications. SIAM J. Comput. 15(2): 341-363 (1986) - Herbert Edelsbrunner, Emo Welzl:
Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. 15(1): 271-284 (1986)
skipping 54 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-09-21 13:02 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