Остановите войну!
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 22 matches
- 1989
- Ian F. Akyildiz, Horst von Brand:
Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking. Theor. Comput. Sci. 64(2): 203-219 (1989) - Noga Alon, Uri Zwick:
On Neciporuk's Theorem for Branching Programs. Theor. Comput. Sci. 64(3): 331-342 (1989) - Jean-Claude Bermond, Jean-Michel Fourneau:
Independent Connections: An Easy Characterization of Baseline-Equivalent Multistage Interconnection Networks. Theor. Comput. Sci. 64(2): 191-201 (1989) - Hans Kleine Büning, Theodor Lettmann, Ernst W. Mayr:
Projections of Vector Addition System Reachability Sets are Semilinear. Theor. Comput. Sci. 64(3): 343-350 (1989) - Zvi Galil, Raffaele Giancarlo:
Speeding up Dynamic Programming with Applications to Molecular Biology. Theor. Comput. Sci. 64(1): 107-118 (1989) - J. Roger Hindley:
BCK-Combinators and Linear lambda-Terms have Types. Theor. Comput. Sci. 64(1): 97-105 (1989) - Rodney R. Howell, Louis E. Rosier:
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets. Theor. Comput. Sci. 64(3): 305-329 (1989) - Dang Van Hung, Elöd Knuth:
Semi-Commutations and Petri Nets. Theor. Comput. Sci. 64(1): 67-81 (1989) - K. Jojczyk, J. Konieczny, T. Kuzak:
On Interleaving Behaviour of PT-Nets. Theor. Comput. Sci. 64(1): 25-38 (1989) - Ephraim Korach, Shlomo Moran, Shmuel Zaks:
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors. Theor. Comput. Sci. 64(1): 125-132 (1989) - Clyde P. Kruskal, Larry Rudolph, Marc Snir:
Techniques for Parallel Manipulation of Sparse Matrices. Theor. Comput. Sci. 64(2): 135-157 (1989) - Gordon Lyon:
Design Factors for Parallel Processing Benchmarks. Theor. Comput. Sci. 64(2): 175-189 (1989) - Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek:
Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989) - Marco Protasi, Maurizio Talamo:
On the Number of Arithmetical Operations for Finding Fibonacci Numbers. Theor. Comput. Sci. 64(1): 119-124 (1989) - Yves Robert, Denis Trystram:
Optimal Scheduling Algorithms for Parallel Gaussian Elimination. Theor. Comput. Sci. 64(2): 159-173 (1989) - Hiroyuki Sato:
E-CCC: Between CCC and Topos. Theor. Comput. Sci. 64(1): 55-66 (1989) - Eli Shamir, Assaf Schuster:
Communication Aspects of Networks Based on Geometric Incidence Relations. Theor. Comput. Sci. 64(1): 83-96 (1989) - Eugene W. Stark:
Concurrent Transition Systems. Theor. Comput. Sci. 64(3): 221-269 (1989) - Hans-Jörg Stoß:
On the Representation of Rational Functions of Bounded Complexity. Theor. Comput. Sci. 64(1): 1-13 (1989) - Hans-Jörg Stoß:
Lower Bounds for the Complexity of Polynomials. Theor. Comput. Sci. 64(1): 15-23 (1989) - Denis Thérien:
Programs over Aperiodic Monoids. Theor. Comput. Sci. 64(3): 271-280 (1989) - Etsuji Tomita, Kazushi Seino:
A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict. Theor. Comput. Sci. 64(1): 39-53 (1989)
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-06 17:10 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