Остановите войну!
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
- 1998
- Amihood Amir, Gad M. Landau, Moshe Lewenstein, Noa Lewenstein:
Efficient Special Cases of Pattern Matching with Swaps. Inf. Process. Lett. 68(3): 125-132 (1998) - Anne Bottreau, Yves Métivier:
Some Remarks on the Kronecker Product of Graphs. Inf. Process. Lett. 68(2): 55-61 (1998) - Bette Bultena, Frank Ruskey:
An Eades-McKay Algorithm for Well-Formed Parentheses Strings. Inf. Process. Lett. 68(5): 255-259 (1998) - Jorge Calera-Rubio, Rafael C. Carrasco:
Computing the Relative Entropy Between Regular Tree Languages. Inf. Process. Lett. 68(6): 283-289 (1998) - Alberto Caprara, Romeo Rizzi:
Improving a Family of Approximation Algorithms to Edge Color Multigraphs. Inf. Process. Lett. 68(1): 11-15 (1998) - Witold Charatonik:
An Undecidable Fragment of the Theory of Set Constraints. Inf. Process. Lett. 68(3): 147-151 (1998) - Yi-Chang Cheng, Erl-Huei Lu, Shaw Woei Wu:
A Modified Version of the Rao-Nam Algebraic-Code Encryption Scheme. Inf. Process. Lett. 68(4): 215-217 (1998) - Michael J. Collins, Bernard M. E. Moret:
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids. Inf. Process. Lett. 68(6): 317-319 (1998) - Nadia Creignou:
Complexity Versus Stability for Classes of Propositional Formulas. Inf. Process. Lett. 68(4): 161-165 (1998) - Colin J. Fidge:
A Limitation of Vector Timestamps for Reconstructing Distributed Computations. Inf. Process. Lett. 68(2): 87-91 (1998) - Wojciech Fraczak, Marek B. Zaremba:
A Non-SOS Operational Semantics for a Process Algebra. Inf. Process. Lett. 68(1): 47-54 (1998) - Pierre Fraigniaud:
Hierarchical Broadcast Networks. Inf. Process. Lett. 68(6): 303-305 (1998) - Joaquim Gabarró, Xavier Messeguer:
Parallel Dictionaries with Local Rules on AVL and Brother Trees. Inf. Process. Lett. 68(2): 79-85 (1998) - Alfredo García Olaverri, Pedro Jodrá, Javier Tejel:
An Efficient Algorithm for On-Line Searching of Minima in Monge Path-Decomposable Tridimensional Arrays. Inf. Process. Lett. 68(1): 3-9 (1998) - Bernd Gärtner, Sven Schönherr:
Exact Primitives for Smallest Enclosing Ellipses. Inf. Process. Lett. 68(1): 33-38 (1998) - Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater:
Attacks on Shamir's 'RSA for Paranoids'. Inf. Process. Lett. 68(4): 197-199 (1998) - Valery S. Gordon, Wieslaw Kubiak:
Single Machine Scheduling with Release and Due Date Assignment to Minimize the Weighted Number of Late Jobs. Inf. Process. Lett. 68(3): 153-159 (1998) - Rajeev Govindan, Michael A. Langston, Xudong Yan:
Approximation the Pathwidth of Outerplanar Graphs. Inf. Process. Lett. 68(1): 17-23 (1998) - Venkatesan Guruswami, C. Pandu Rangan:
A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds. Inf. Process. Lett. 68(5): 241-248 (1998) - Janelle J. Harms:
A Simple Optimal Algorithm for Scheduling Variable-Sized Requests. Inf. Process. Lett. 68(6): 291-293 (1998) - Wim H. Hesselink:
Invariants for the Construction of a Handshake Register. Inf. Process. Lett. 68(4): 173-177 (1998) - Peter Jonsson:
Near-Optimal Nonapproximability Results for Some NPO PB-Complete Problems. Inf. Process. Lett. 68(5): 249-253 (1998) - Marcin Jurdzinski:
Deciding the Winner in Parity Games is in UP \cap co-Up. Inf. Process. Lett. 68(3): 119-124 (1998) - Kothuri Venkata Ravi Kanth, Ambuj K. Singh:
Efficient Dynamic Range Searching Using Data Replication. Inf. Process. Lett. 68(2): 97-105 (1998) - Ton Kloks, Dieter Kratsch, Haiko Müller:
Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6): 313-315 (1998) - Ton Kloks, Haiko Müller, C. K. Wong:
Vertex Ranking of Asteroidal Triple-Free Graphs. Inf. Process. Lett. 68(4): 201-206 (1998) - Ulrich Kühn:
Local Calculation of Voronoi Diagrams. Inf. Process. Lett. 68(6): 307-312 (1998) - Ding-Ming Kwai, Behrooz Parhami:
Pruned Three-Dimensional Toroidal Networks. Inf. Process. Lett. 68(4): 179-183 (1998) - KyungOh Lee, Heon Young Yeom:
A Dynamic Scheduling Algorithm for Large Scale Multimedia Servers. Inf. Process. Lett. 68(5): 235-240 (1998) - Chor Ping Low:
A Polynomial Time Solvable Instance of the Feasible Minimum Cover Problem. Inf. Process. Lett. 68(3): 141-146 (1998)
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-01 18:20 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