Остановите войну!
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
- 2016
- Sourav Chakraborty, Akshay Kamath, Rameshwar Pratap:
Testing whether the uniform distribution is a stationary distribution. Inf. Process. Lett. 116(7): 475-480 (2016) - Faisal N. Abu-Khzam, Pinar Heggernes:
Enumerating minimal dominating sets in chordal graphs. Inf. Process. Lett. 116(12): 739-743 (2016) - Divesh Aggarwal, Chandan K. Dubey:
Improved hardness results for unique shortest vector problem. Inf. Process. Lett. 116(10): 631-637 (2016) - Mansour J. Algefari, Khalid A. Alsatami, Hong-Jian Lai, Juan Liu:
Supereulerian digraphs with given local structures. Inf. Process. Lett. 116(5): 321-326 (2016) - Mahdi Amani, Kevin A. Lai, Robert E. Tarjan:
Amortized rotation cost in AVL trees. Inf. Process. Lett. 116(5): 327-330 (2016) - Ali Reza Ashrafi, Jernej Azarija, Azam Babai, Khadijeh Fathalikhani, Sandi Klavzar:
The (non-)existence of perfect codes in Fibonacci cubes. Inf. Process. Lett. 116(5): 387-390 (2016) - Florian Barbero, Gregory Z. Gutin, Mark Jones, Bin Sheng, Anders Yeo:
Linear-vertex kernel for the problem of packing r-stars into a graph without long induced paths. Inf. Process. Lett. 116(6): 433-436 (2016) - Jethro G. Beekman:
A Denial of Service attack against fair computations using Bitcoin deposits. Inf. Process. Lett. 116(2): 144-146 (2016) - Oualid Benamara, Fatiha Merazka, Kamel Betina:
An improvement of a cryptanalysis algorithm. Inf. Process. Lett. 116(2): 192-196 (2016) - Cinzia Bernardeschi, Andrea Domenici:
Verifying safety properties of a nonlinear control by interactive theorem proving with the Prototype Verification System. Inf. Process. Lett. 116(6): 409-415 (2016) - Eike Best, Javier Esparza:
Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6): 423-427 (2016) - Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan:
MMH⁎ with arbitrary modulus is always almost-universal. Inf. Process. Lett. 116(7): 481-483 (2016) - Ilario Bonacina, Navid Talebanfard:
Improving resolution width lower bounds for k-CNFs with applications to the Strong Exponential Time Hypothesis. Inf. Process. Lett. 116(2): 120-124 (2016) - Michele Borassi:
A note on the complexity of computing the number of reachable vertices in a digraph. Inf. Process. Lett. 116(10): 628-630 (2016) - Patricia Bouyer, Patrick Gardy, Nicolas Markey:
On the semantics of Strategy Logic. Inf. Process. Lett. 116(2): 75-79 (2016) - Zohir Bouzid, Damien Imbs, Michel Raynal:
A necessary condition for Byzantine k-set agreement. Inf. Process. Lett. 116(12): 757-759 (2016) - Robert Bredereck, Nimrod Talmon:
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting. Inf. Process. Lett. 116(2): 147-152 (2016) - Junqing Cai, Yuzhong Zhang:
Fan-type implicit-heavy subgraphs for hamiltonicity of implicit claw-heavy graphs. Inf. Process. Lett. 116(11): 668-673 (2016) - Alberto Caprara, Fabio Furini, Enrico Malaguti, Emiliano Traversi:
Solving the Temporal Knapsack Problem via Recursive Dantzig-Wolfe Reformulation. Inf. Process. Lett. 116(5): 379-386 (2016) - Arnaud Carayol, Olivier Serre:
Marking shortest paths on pushdown graphs does not preserve MSO decidability. Inf. Process. Lett. 116(10): 638-643 (2016) - Jou-Ming Chang, Xiang-Rui Chen, Jinn-Shyong Yang, Ro-Yu Wu:
Locally exchanged twisted cubes: Connectivity and super connectivity. Inf. Process. Lett. 116(7): 460-466 (2016) - Xie-Bin Chen:
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges. Inf. Process. Lett. 116(2): 107-110 (2016) - Xie-Bin Chen:
Hamiltonicity of hypercubes with faulty vertices. Inf. Process. Lett. 116(5): 343-346 (2016) - Ke Chen:
Improved neural dynamics for online Sylvester equations solving. Inf. Process. Lett. 116(7): 455-459 (2016) - Shiteng Chen, Periklis A. Papakonstantinou:
Correlation lower bounds from correlation upper bounds. Inf. Process. Lett. 116(8): 537-540 (2016) - Chien Chin Chen, Yu-Chun Sun:
Exploring acquaintances of social network site users for effective social event recommendations. Inf. Process. Lett. 116(3): 227-236 (2016) - Yao Chen, Kang G. Shin, Huagang Xiong:
Generalizing fixed-priority scheduling for better schedulability in mixed-criticality systems. Inf. Process. Lett. 116(8): 508-512 (2016) - Y-Chuang Chen, Tsung-Han Tsai:
Hamiltonian decomposition of generalized recursive circulant graphs. Inf. Process. Lett. 116(9): 585-589 (2016) - Yonah Cherniavsky, Avraham Goldstein, Vadim E. Levit, Robert Shwartz:
Enumeration of balanced finite group valued functions on directed graphs. Inf. Process. Lett. 116(7): 484-488 (2016) - Tamanna Chhabra, Jorma Tarhio:
A filtration method for order-preserving matching. Inf. Process. Lett. 116(2): 71-74 (2016)
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-06-04 01:13 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