Остановите войну!
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 54 matches
- 1994
- Vincenzo Acciaro:
On the Complexity of Computing Gröbner Bases in Characteristic 2. Inf. Process. Lett. 51(6): 321-323 (1994) - Eliezer A. Albacea:
Parallel Algorithm for Finding a Core of a Tree Network. Inf. Process. Lett. 51(5): 223-226 (1994) - Lloyd Allison:
Using Hirschberg's Algorithm to Generate Random Alignments of Strings. Inf. Process. Lett. 51(5): 251-255 (1994) - Bapiraju Vinnakota, V. V. Bapeswara Rao:
Enumeration of Binary Trees. Inf. Process. Lett. 51(3): 125-127 (1994) - Dominique Barth, André Raspaud:
Two Edge-Disjoint Hamiltonian Cycles in the Butterfly Graph. Inf. Process. Lett. 51(4): 175-179 (1994) - David A. Basin:
A Term Equality Problem Equivalent to Graph Isomorphism. Inf. Process. Lett. 51(2): 61-66 (1994) - Gianfranco Bilardi, Shiva Chaudhuri, Devdatt P. Dubhashi, Kurt Mehlhorn:
A Lower Bound for Area-Universal Graphs. Inf. Process. Lett. 51(2): 101-105 (1994) - Simon R. Blackburn:
Increasing the Rate of Output of m-Sequences. Inf. Process. Lett. 51(2): 73-77 (1994) - Norbert Blum, Henning Rochow:
A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals. Inf. Process. Lett. 51(2): 57-60 (1994) - Barun Chandra:
Constructing Sparse Spanners for Most Graphs in Higher Dimensions. Inf. Process. Lett. 51(6): 289-294 (1994) - Ling Chen, Henry Y. H. Chuang:
A Fast Algorithm for Euclidean Distance Maps of a 2-D Binary Image. Inf. Process. Lett. 51(1): 25-29 (1994) - Peng Chen, Shigeru Masuyama:
On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph. Inf. Process. Lett. 51(4): 195-199 (1994) - Wen-Chin Chen, Wen-Chun Ni:
Internal Path Length of the Binary Representation of Heap-Ordered Trees. Inf. Process. Lett. 51(3): 129-132 (1994) - Bo Chen, André van Vliet, Gerhard J. Woeginger:
A Lower Bound for Randomized On-Line Scheduling Algorithms. Inf. Process. Lett. 51(5): 219-222 (1994) - Vladimir G. Deineko, René van Dal, Günter Rote:
The Convex-Hull-and-Line Traveling Salesman Problem: A Solvable Case. Inf. Process. Lett. 51(3): 141-148 (1994) - Tamal K. Dey, Nimish R. Shah:
Many-Face Complexity in Incremental Convex Arrangements. Inf. Process. Lett. 51(5): 227-231 (1994) - Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Bernard Mans, Andrzej Pelc:
Optimal Coteries and Voting Schemes. Inf. Process. Lett. 51(1): 1-6 (1994) - K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston:
A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph. Inf. Process. Lett. 51(3): 121-124 (1994) - David Eppstein:
Arboricity and Bipartite Subgraph Listing Algorithms. Inf. Process. Lett. 51(4): 207-211 (1994) - Paul Fischer, Klaus-Uwe Höffgen:
Computing a Maximum Axis-Aligned Rectangle in a Convex Polygon. Inf. Process. Lett. 51(4): 189-193 (1994) - Michael Frazier, C. David Page Jr.:
Prefix Grammars: An Alternative Characterization of the Regular Languages. Inf. Process. Lett. 51(2): 67-71 (1994) - Jordan Gergov:
Time-Space Tradeoffs for Integer Multiplication on Various Types of Input Oblivious Sequential Machines. Inf. Process. Lett. 51(5): 265-269 (1994) - Joseph Gil, Yossi Matias:
Designing Algorithms by Expectations. Inf. Process. Lett. 51(1): 31-34 (1994) - Dan Gusfield:
Faster Implementation of a Shortest Superstring Approximation. Inf. Process. Lett. 51(5): 271-274 (1994) - Dan Halperin, Micha Sharir:
On Disjoint Concave Chains in Arrangements of (Pseudo) Lines. Inf. Process. Lett. 51(1): 53-56 (1994) - Robert Harper:
A Simplified Account of Polymorphic References. Inf. Process. Lett. 51(4): 201-206 (1994) - Refael Hassin, Shlomi Rubinstein:
Approximations for the Maximum Acyclic Subgraph Problem. Inf. Process. Lett. 51(3): 133-140 (1994) - Edith Hemaspaandra:
Census Techniques Collapse Space Classes. Inf. Process. Lett. 51(2): 79-84 (1994) - Micha Hofri:
On Timeout for Global Deadlock Detection in Decentralized Database Systems. Inf. Process. Lett. 51(6): 295-302 (1994) - Xiao-Dong Hu, P. D. Chen, Frank K. Hwang:
A New Competitive Algorithm for the Counterfeit Coin Problem. Inf. Process. Lett. 51(4): 213-218 (1994)
skipping 24 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-27 01:05 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