Остановите войну!
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 43 matches
- 1978
- Brenda S. Baker:
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space. SIAM J. Comput. 7(3): 376-391 (1978) - Theodore P. Baker:
A Technique for Extending Rapid Exact-Match String Matching to Arrays of More Than One Dimension. SIAM J. Comput. 7(4): 533-541 (1978) - Joachim Biskup:
The Time Measure of One-Tape Turing Machines Does Not Have the Parallel Computation Property. SIAM J. Comput. 7(1): 115-117 (1978) - Ronald V. Book, Maurice Nivat:
Linear Languages and the Intersection Closures of Classes of Languages. SIAM J. Comput. 7(2): 167-177 (1978) - Kellogg S. Booth:
Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems. SIAM J. Comput. 7(3): 273-279 (1978) - Roger W. Brockett, David P. Dobkin:
Errata: On the Number of Multiplications Required for Matrix Multiplication. SIAM J. Comput. 7(2): 238 (1978) - Mark R. Brown:
Implementation and Analysis of Binomial Queue Algorithms. SIAM J. Comput. 7(3): 298-319 (1978) - John L. Bruno, Peter J. Downey:
Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs. SIAM J. Comput. 7(4): 393-404 (1978) - Edward G. Coffman Jr., M. R. Garey, David S. Johnson:
An Application of Bin-Packing to Multiprocessor Scheduling. SIAM J. Comput. 7(1): 1-17 (1978) - Stephen A. Cook:
Soundness and Completeness of an Axiom System for Program Verification. SIAM J. Comput. 7(1): 70-90 (1978) - Ronald Fagin, Thomas G. Price:
Efficient Calculation of Expected Miss Ratios in the Independent Reference Model. SIAM J. Comput. 7(3): 288-297 (1978) - Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for Some Routing Problems. SIAM J. Comput. 7(2): 178-193 (1978) - Michael L. Fredman:
Observations on the Complexity of Generating Quasi-Gray Codes. SIAM J. Comput. 7(2): 134-146 (1978) - Harold N. Gabow, Eugene W. Myers:
Finding All Spanning Trees of Directed and Undirected Graphs. SIAM J. Comput. 7(3): 280-287 (1978) - E. Mark Gold:
Deadlock Prediction: Easy and Difficult Cases. SIAM J. Comput. 7(3): 320-336 (1978) - Harry B. Hunt III, Daniel J. Rosenkrantz:
Computational Parallels Between the Regular and Context-Free Languages. SIAM J. Comput. 7(1): 99-114 (1978) - Oscar H. Ibarra:
The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications. SIAM J. Comput. 7(4): 524-532 (1978) - Alon Itai, Michael Rodeh:
Finding a Minimum Circuit in a Graph. SIAM J. Comput. 7(4): 413-423 (1978) - Donald B. Johnson, Tetsuo Mizoguchi:
Selecting the Kth element in X + Y and X_1 + X_2 + ... + X_m. SIAM J. Comput. 7(2): 147-153 (1978) - Alan G. Konheim, Martin Reiser:
Finite Capacity Queuing Systems with Applications in Computer Modeling. SIAM J. Comput. 7(2): 210-229 (1978) - Richard J. Lipton:
Polynomials with 0-1 Coefficients that Are Hard to Evaluate. SIAM J. Comput. 7(1): 61-69 (1978) - Nancy A. Lynch, Richard J. Lipton:
On Structure Preserving Reductions. SIAM J. Comput. 7(2): 119-126 (1978) - Michael Machtey, Karl Winklmann, Paul Young:
Simple Gödel Numberings, Isomorphisms, and Programming Properties. SIAM J. Comput. 7(1): 39-60 (1978) - Hermann A. Maurer, Arto Salomaa, Derick Wood:
On Good E0L Forms. SIAM J. Comput. 7(2): 158-166 (1978) - Nimrod Megiddo, Arie Tamir:
An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7(2): 154-157 (1978) - Nicholas Pippenger:
Generalized Connectors. SIAM J. Comput. 7(4): 510-514 (1978) - David A. Plaisted:
Some Polynomial and Integer Divisibility problems are NP-Hard. SIAM J. Comput. 7(4): 458-464 (1978) - Robert L. Probert:
An Extension of Computational Duality to Sequences of Bilinear Computations. SIAM J. Comput. 7(1): 91-98 (1978) - Paul Walton Purdom Jr.:
Tree Size by Partial Backtracking. SIAM J. Comput. 7(4): 481-491 (1978) - Eshrat Reghbati, Derek G. Corneil:
Parallel Computations in Graph Theory. SIAM J. Comput. 7(2): 230-237 (1978)
skipping 13 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-05-11 01:44 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