Остановите войну!
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 178 matches
- 2013
- Luigi Acerbi, Alberto Dennunzio, Enrico Formenti:
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof. Inf. Process. Lett. 113(5-6): 156-159 (2013) - Arash Ahadi, Ali Dehghan:
The complexity of the proper orientation number. Inf. Process. Lett. 113(19-21): 799-803 (2013) - Zahra Ahmadian, Mahmoud Salmasizadeh, Mohammad Reza Aref:
Desynchronization attack on RAPP ultralightweight authentication protocol. Inf. Process. Lett. 113(7): 205-209 (2013) - Kamal Al-Bawani, Alexander Souza:
Buffer overflow management with class segregation. Inf. Process. Lett. 113(4): 145-150 (2013) - Riham AlTawy, Aleksandar Kircanski, Amr M. Youssef:
Second order collision for the 42-step reduced DHA-256 hash function. Inf. Process. Lett. 113(19-21): 764-770 (2013) - Muhammad Rashed Alam, M. Sohel Rahman:
A divide and conquer approach and a work-optimal parallel algorithm for the LIS problem. Inf. Process. Lett. 113(13): 470-476 (2013) - Panagiotis D. Alevizos:
An optimal algorithm for computing the non-trivial circuits of a union of iso-oriented rectangles. Inf. Process. Lett. 113(3): 55-59 (2013) - Laurent Alonso, Edward M. Reingold:
Analysis of Boyer and Moore's MJRTY algorithm. Inf. Process. Lett. 113(13): 495-497 (2013) - Amihood Amir, Haim Paryenty, Liam Roditty:
On the hardness of the Consensus String problem. Inf. Process. Lett. 113(10-11): 371-374 (2013) - Mikhail J. Atallah, Elena Grigorescu, Yi Wu:
A lower-variance randomized algorithm for approximate string matching. Inf. Process. Lett. 113(18): 690-692 (2013) - Giuseppe Ateniese, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci:
A note on time-bound hierarchical key assignment schemes. Inf. Process. Lett. 113(5-6): 151-155 (2013) - Tess Avitabile, Claire Mathieu, Laura H. Parkinson:
Online constrained optimization with recourse. Inf. Process. Lett. 113(3): 81-86 (2013) - Guy Avni, Orna Kupferman:
When does abstraction help? Inf. Process. Lett. 113(22-24): 901-905 (2013) - Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17): 604-608 (2013) - Yoo-Jin Baek:
Scalar recoding and regular 2w-ary right-to-left EC scalar multiplication algorithm. Inf. Process. Lett. 113(10-11): 357-360 (2013) - Alessandro Barenghi, Stefano Crespi-Reghizzi, Dino Mandrioli, Matteo Pradella:
Parallel parsing of operator precedence grammars. Inf. Process. Lett. 113(7): 245-249 (2013) - Jean-Luc Baril:
Statistics-preserving bijections between classical and cyclic permutations. Inf. Process. Lett. 113(1-2): 17-22 (2013) - George Barmpalias, Rupert Hölzl, Andrew E. M. Lewis, Wolfgang Merkle:
Analogues of Chaitin's Omega in the computably enumerable sets. Inf. Process. Lett. 113(5-6): 171-178 (2013) - Olaf Beyersdorff, Nicola Galesi, Massimo Lauria:
A characterization of tree-like Resolution size. Inf. Process. Lett. 113(18): 666-671 (2013) - Andreas Björklund, Petteri Kaski:
Counting closed trails. Inf. Process. Lett. 113(1-2): 1-3 (2013) - Beate Bollig, Michael Capelle:
Priority functions for the approximation of the metric TSP. Inf. Process. Lett. 113(14-16): 584-591 (2013) - Vincenzo Bonifaci:
Physarum can compute shortest paths: A short proof. Inf. Process. Lett. 113(1-2): 4-7 (2013) - Flavia Bonomo, Monia Giandomenico, Fabrizio Rossi:
A note on the Cornaz-Jost transformation to solve the graph coloring problem. Inf. Process. Lett. 113(18): 649-652 (2013) - Nina Brandstätter, Wilfried Meidl, Arne Winterhof:
Addendum to Sidel'nikov sequences over nonprime fields. Inf. Process. Lett. 113(9): 332-336 (2013) - Tiziana Calamoneri:
Optimal L(δ1, δ2, 1)-labeling of eight-regular grids. Inf. Process. Lett. 113(10-11): 361-364 (2013) - Arnaud Carayol, Zoltán Ésik:
The FC-rank of a context-free language. Inf. Process. Lett. 113(8): 285-287 (2013) - Aleksandr Cariow, Galina Cariowa:
An algorithm for fast multiplication of sedenions. Inf. Process. Lett. 113(9): 324-331 (2013) - Ondrej Cepek, Petr Kucera, Stanislav Kurik:
Boolean functions with long prime implicants. Inf. Process. Lett. 113(19-21): 698-703 (2013) - Marcos Lordello Chaim, Roberto Paulo Andrioli de Araujo:
An efficient bitwise algorithm for intra-procedural data-flow testing coverage. Inf. Process. Lett. 113(8): 293-300 (2013) - Ching-Lueh Chang:
Deterministic sublinear-time approximations for metric 1-median selection. Inf. Process. Lett. 113(8): 288-292 (2013)
skipping 148 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-04 03:49 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