Остановите войну!
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 50 matches
- 1993
- Nalvo F. de Almeida Jr., Valmir Carneiro Barbosa:
A String-Matching Algorithm for the CREW PRAM. Inf. Process. Lett. 47(5): 257-259 (1993) - Laurent Alonso, Edward M. Reingold, René Schott:
Determining the Majority. Inf. Process. Lett. 47(5): 253-255 (1993) - Esther M. Arkin, Magnús M. Halldórsson, Refael Hassin:
Approximating the Tree and Tour Covers of a Graph. Inf. Process. Lett. 47(6): 275-282 (1993) - Eric T. Bax:
Inclusion and Exclusion Algorithm for the Hamiltonian Path Problem. Inf. Process. Lett. 47(4): 203-207 (1993) - Subir Bhattacharya, Amitava Bagchi:
A Faster Alternative to SSS* with Extension to Variable Memory. Inf. Process. Lett. 47(4): 209-214 (1993) - Dany Breslauer, Livio Colussi, Laura Toniolo:
Tight Comparison Bounds for the String Prefix-Matching Problem. Inf. Process. Lett. 47(1): 51-57 (1993) - Jonathan D. Bright:
Range-Restricted Mergeable Priority Queues. Inf. Process. Lett. 47(3): 159-164 (1993) - Byeong-Mo Chang, Kwang-Moo Choe, Taisook Han:
Efficient Bottom-Up Execution of Logic Programs Using Abstract Interpretation. Inf. Process. Lett. 47(3): 149-157 (1993) - Byeong-Mo Chang, Kwang-Moo Choe, Taisook Han:
Static Filtering on Stratified Programs. Inf. Process. Lett. 47(5): 237-244 (1993) - Danny Z. Chen, Sumanta Guha:
Testing a Simple Polygon for Monotonicity Optimally in Parallel. Inf. Process. Lett. 47(6): 325-331 (1993) - Wen-Huei Chen, Chuan Yi Tang:
A 2.|E|-Bit Distributed Algorithm for the Directed Euler Trail Problem. Inf. Process. Lett. 47(1): 43-49 (1993) - Pierluigi Crescenzi, Riccardo Silvestri:
A Note on the Descriptive Complexity of Maximization. Inf. Process. Lett. 47(1): 11-15 (1993) - Jürgen Dassow, Gheorghe Paun, Arto Salomaa:
On the Union of 0L Languages. Inf. Process. Lett. 47(2): 59-63 (1993) - Irène Durand, Bruno Salinier:
Constructor Equivalent Term Rewriting Systems. Inf. Process. Lett. 47(3): 131-137 (1993) - Peter Eades, Xuemin Lin, W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993) - Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47(2): 71-75 (1993) - K. Gopalakrishnan, Dean G. Hoffman, Douglas R. Stinson:
A Note on a Conjecture Concerning Symmetric Resilient Functions. Inf. Process. Lett. 47(3): 139-143 (1993) - H. Peter Gumm:
Another Glance at the Alpern-Schneider Characterization of Safety and Liveness in Concurrent Executions. Inf. Process. Lett. 47(6): 291-294 (1993) - Himabindu Gurla:
Leftmost one Computation on Meshes with Row Broadcasting. Inf. Process. Lett. 47(5): 261-266 (1993) - Christophe Hancart:
On Simon's String Searching Algorithm. Inf. Process. Lett. 47(2): 95-99 (1993) - Johan Håstad, Steven J. Phillips, Shmuel Safra:
A Well-Characterized Approximation Problem. Inf. Process. Lett. 47(6): 301-305 (1993) - John Hershberger:
A Faster Algorithm for the Two-Center Decision Problem. Inf. Process. Lett. 47(1): 23-29 (1993) - Daniel S. Hirschberg, Steven S. Seiden:
A Bounded-Space Tree Traversal Algorithm. Inf. Process. Lett. 47(4): 215-219 (1993) - Martin Hühne:
Linear Speed-Up Does not Hold on Turing Machines with Tree Storages. Inf. Process. Lett. 47(6): 313-318 (1993) - Sanjay Jain, Arun Sharma:
On the Non-Existence of Maximal Inference Degrees for Language Identification. Inf. Process. Lett. 47(2): 81-88 (1993) - Matthew J. Katz, Micha Sharir:
Optimal Slope Selection via Expanders. Inf. Process. Lett. 47(3): 115-122 (1993) - Myung-Soo Kim, Jae-Woo Ahn:
An Algebraic Algorithm to Compute the Exact General Sweep Boundary of a 2D Curved Object. Inf. Process. Lett. 47(5): 221-229 (1993) - Danny Krizanc:
Integer Sorting on a Mesh-Connected Array of Processors. Inf. Process. Lett. 47(6): 283-289 (1993) - Sang Ho Lee, Lawrence J. Henschen:
Semantics and Properties of Existential Quantifiers in Deductive Databases. Inf. Process. Lett. 47(2): 101-108 (1993) - Andrew Lim, Yeow Meng Chee, Siu-Wing Cheng:
Single Jog Minimum Area Joining of Compacted Cells. Inf. Process. Lett. 47(4): 167-172 (1993)
skipping 20 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-06 03:58 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