Остановите войну!
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 135 matches
- 2014
- Lei Zhang, Wenling Wu:
Differential analysis of the Extended Generalized Feistel Networks. Inf. Process. Lett. 114(12): 723-727 (2014) - Nabila Abdessaied, Mathias Soeken, Michael Kirkedal Thomsen, Rolf Drechsler:
Upper bounds for reversible circuits based on Young subgroups. Inf. Process. Lett. 114(6): 282-286 (2014) - Faisal N. Abu-Khzam:
Maximum common induced subgraph parameterized by vertex cover. Inf. Process. Lett. 114(3): 99-103 (2014) - Adi Akavia:
Explicit small sets with ε-discrepancy on Bohr sets. Inf. Process. Lett. 114(10): 564-567 (2014) - Riham AlTawy, Amr M. Youssef:
Integral distinguishers for reduced-round Stribog. Inf. Process. Lett. 114(8): 426-431 (2014) - Matthew Andrews, Lisa Zhang:
Rate-adaptive weighted fair queueing for energy-aware scheduling. Inf. Process. Lett. 114(5): 247-251 (2014) - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Mutual witness proximity graphs. Inf. Process. Lett. 114(10): 519-523 (2014) - Franz Aurenhammer, Günter Paulini:
On shape Delaunay tessellations. Inf. Process. Lett. 114(10): 535-541 (2014) - Chen Avin, Michael Borokhovich, Yoram Haddad, Erez Kantor, Zvi Lotker, Merav Parter, David Peleg:
Testing the irreducibility of nonsquare Perron-Frobenius systems. Inf. Process. Lett. 114(12): 728-733 (2014) - Samed Bajric, Enes Pasalic, Amela Muratovic-Ribic, Sugata Gangopadhyay:
On generalized bent functions with Dillon's exponents. Inf. Process. Lett. 114(4): 222-227 (2014) - Jérémy Barbay, Timothy M. Chan, Gonzalo Navarro, Pablo Pérez-Lantero:
Maximum-weight planar boxes in O(n2) time (and better). Inf. Process. Lett. 114(8): 437-445 (2014) - Jean-Luc Baril, Jean Marcel Pallo:
Motzkin subposets and Motzkin geodesics in Tamari lattices. Inf. Process. Lett. 114(1-2): 31-37 (2014) - David A. Basin, Carlos Cotrini Jiménez, Felix Klaedtke, Eugen Zalinescu:
Deciding safety and liveness in TPTL. Inf. Process. Lett. 114(12): 680-688 (2014) - Sarah Bastkowski, Andreas Spillner, Vincent Moulton:
Fishing for minimum evolution trees with Neighbor-Nets. Inf. Process. Lett. 114(1-2): 13-18 (2014) - Yacine Belhoul, Saïd Yahiaoui, Hamamache Kheddouci:
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs. Inf. Process. Lett. 114(7): 339-343 (2014) - Petra Berenbrink, Bruce Krayenhoff, Frederik Mallmann-Trenn:
Estimating the number of connected components in sublinear time. Inf. Process. Lett. 114(11): 639-642 (2014) - Beate Bollig:
A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm. Inf. Process. Lett. 114(3): 124-129 (2014) - Cosmin Bonchis, Gabriel Istrate:
Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem. Inf. Process. Lett. 114(7): 360-364 (2014) - Christos Boutsidis, Malik Magdon-Ismail:
A note on sparse least-squares regression. Inf. Process. Lett. 114(5): 273-276 (2014) - Andreas Brandstädt, Van Bang Le:
A note on efficient domination in a superclass of P5-free graphs. Inf. Process. Lett. 114(7): 357-359 (2014) - Eduardo A. Canale, Héctor Cancela, Franco Robledo, Pablo Sartor:
The complexity of computing the 2-K-reliability in networks. Inf. Process. Lett. 114(9): 457-461 (2014) - Yixin Cao, Jianer Chen, Jia-Hao Fan:
An O(1.84k) parameterized algorithm for the multiterminal cut problem. Inf. Process. Lett. 114(4): 167-173 (2014) - Patrick Cégielski, Serge Grigorieff, Irène Guessarian:
On lattices of regular sets of natural integers closed under decrementation. Inf. Process. Lett. 114(4): 197-202 (2014) - Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung, Peter Rossmanith, Guan-Han Wu:
Exact algorithms for problems related to the densest k-set problem. Inf. Process. Lett. 114(9): 510-513 (2014) - Jou-Ming Chang, Jhen-Ding Wang, Jinn-Shyong Yang, Kung-Jui Pai:
A comment on "Independent spanning trees in crossed cubes". Inf. Process. Lett. 114(12): 734-739 (2014) - Huibo Chen, Wenge Zhang, Feng Ding:
Data filtering based least squares iterative algorithm for parameter identification of output error autoregressive systems. Inf. Process. Lett. 114(10): 573-578 (2014) - Well Y. Chiu, Chiuyuan Chen, Shih-Yu Tsai:
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon. Inf. Process. Lett. 114(10): 515-518 (2014) - Young In Cho, Nam Su Chang, Seokhie Hong:
Formulas for cube roots in F3m using shifted polynomial basis. Inf. Process. Lett. 114(6): 331-337 (2014) - Kwanghoon Choi, Byeong-Mo Chang:
A type and effect system for activation flow of components in Android programs. Inf. Process. Lett. 114(11): 620-627 (2014) - Bruno Courcelle:
Clique-width and edge contraction. Inf. Process. Lett. 114(1-2): 42-44 (2014)
skipping 105 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 13: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