Остановите войну!
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 48 matches
- 1985
- Bowen Alpern, Fred B. Schneider:
Defining Liveness. Inf. Process. Lett. 21(4): 181-185 (1985) - Malcolm D. Atkinson:
On Zigzag Permutations and Comparisons of Adjacent Elements. Inf. Process. Lett. 21(4): 187-189 (1985) - Dario Bini, Victor Y. Pan:
Fast Parallel Polynomial Division via Reduction to Triangular Toeplitz Matrix Inversion and to Polynomial Inversion Modulo a Power. Inf. Process. Lett. 21(2): 79-81 (1985) - Ingrid J. M. Birkhoff:
A Direct Routing Algorithm for the Bit-Reversal Permutation on a Shuffle-Exchange Network. Inf. Process. Lett. 21(5): 259-268 (1985) - Timothy A. Budd:
Creation and Reflexive Rights in Grammatical Protection Systems. Inf. Process. Lett. 21(3): 141-145 (1985) - Bruno Codenotti, Francesco Romani, Grazia Lotti:
VLSI Implementation of Fast Solvers for Band Linear Systems With Constant Coefficient Matrix. Inf. Process. Lett. 21(3): 159-163 (1985) - Ulrich Derigs:
An Efficient Dijkstra-like Labeling Method for Computing Shortest Odd/Even Paths. Inf. Process. Lett. 21(5): 253-258 (1985) - Wlodzimierz Dobosiewicz:
A Note on Natural Selection. Inf. Process. Lett. 21(5): 239-243 (1985) - Pavol Duris, Ondrej Sýkora, Imrich Vrto, Clark D. Thompson:
Tight Chip Area Lower Bounds for Discrete Fourier and Walsh-Hadamard Transformations. Inf. Process. Lett. 21(5): 245-247 (1985) - Herbert Edelsbrunner, Hermann A. Maurer:
Finding Extreme Points in Three Dimensions and Solving the Post-Office Problem in the Plane. Inf. Process. Lett. 21(1): 39-47 (1985) - Gerald Guralnik, Charles Zemach, Tony Warnock:
An Algorithm for Uniform Random Sampling of Points In and On a Hypersphere. Inf. Process. Lett. 21(1): 17-21 (1985) - Ralf Hartmut Güting:
Fast Dynamic Intersection Searching in a Set of Isothetic Line Segments. Inf. Process. Lett. 21(4): 165-171 (1985) - Ted Herman, K. Mani Chandy:
On Distributed Search. Inf. Process. Lett. 21(3): 129-133 (1985) - Juraj Hromkovic:
Alternating Multicounter Machines with Constant Number of Reversals. Inf. Process. Lett. 21(1): 7-9 (1985) - Juraj Hromkovic:
Linear Lower Bounds on Unbounded Fan-In Boolean Circuits. Inf. Process. Lett. 21(2): 71-74 (1985) - Ching C. Hsiao, Nien-Tsu Shen:
k-Fold Bitonic Sort on a Mesh-Connected Parallel Computer. Inf. Process. Lett. 21(4): 207-212 (1985) - Joseph F. JáJá, Jean Takche:
Improved Lower Bounds for Some Matrix Multiplication Problems. Inf. Process. Lett. 21(3): 123-127 (1985) - Ladislav Janiga, Václav Koubek:
A Note on Finding Minimum Cuts in Directed Planar Networks by Parallel Computations. Inf. Process. Lett. 21(2): 75-78 (1985) - Matthias Jantzen:
A Note on a Special One-Rule Semi-Thue System. Inf. Process. Lett. 21(3): 135-140 (1985) - Anne Kaldewaij:
On the Decomposition of Sequences into Ascending Subsequences. Inf. Process. Lett. 21(2): 69 (1985) - Deepak Kapur, Mukkai S. Krishnamoorthy:
Worst-Case Choice for the Stable Marriage Problem. Inf. Process. Lett. 21(1): 27-30 (1985) - James Leslie Keedy, Bernd Freisleben:
On the Efficient Use of Semaphore Primitives. Inf. Process. Lett. 21(4): 199-205 (1985) - A. J. Kfoury:
The Unwind Property for Programs with Bounded Memory. Inf. Process. Lett. 21(5): 233-238 (1985) - Suresh C. Kothari, K. V. S. Ramarao:
General Algorithms for the Address Calculation of Lexicographically Ordered Tuples. Inf. Process. Lett. 21(3): 113-116 (1985) - Jean-Paul Laumond:
Enumeration of Articulation Pairs of a Planar Graph. Inf. Process. Lett. 21(4): 173-179 (1985) - Clemens Lautemann, Friedhelm Meyer auf der Heide:
Lower Time Bounds for Integer Programming with Two Variables. Inf. Process. Lett. 21(2): 101-105 (1985) - D. T. Lee, Y. T. Ching:
The Power of Geometric Duality Revisited. Inf. Process. Lett. 21(3): 117-122 (1985) - Vladimir J. Lumelsky:
On Fast Computation of Distance Between Line Segments. Inf. Process. Lett. 21(2): 55-61 (1985) - Jan Magott:
Performance Evaluation of Dystems of Cyclic Sequential Processes with Mutual Exclusion Using Petri Nets. Inf. Process. Lett. 21(5): 229-232 (1985) - Heikki Mannila, Kurt Mehlhorn:
A Fast Algorithm for Renaming a Set of Clauses as a Horn Set. Inf. Process. Lett. 21(5): 269-272 (1985)
skipping 18 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 16:25 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