Остановите войну!
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 188 matches
- 2015
- Luca Aceto, Eugen-Ioan Goriac, Anna Ingólfsdóttir:
A ground-complete axiomatization of stateless bisimilarity over Linda. Inf. Process. Lett. 115(2): 212-220 (2015) - Divesh Aggarwal:
Affine-evasive sets modulo a prime. Inf. Process. Lett. 115(2): 382-385 (2015) - Giovanni Agosta, Alessandro Barenghi, Gerardo Pelosi, Michele Scandale:
Trace-based schedulability analysis to enhance passive side-channel attack resilience of embedded software. Inf. Process. Lett. 115(2): 292-297 (2015) - Wolfgang Aigner, Franz Aurenhammer, Bert Jüttler:
On triangulation axes of polygons. Inf. Process. Lett. 115(1): 45-51 (2015) - S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell:
Reachability problems for Markov chains. Inf. Process. Lett. 115(2): 155-158 (2015) - Sharareh Alipour, Mohammad Ghodsi, Alireza Zarei, Maryam Pourreza:
Visibility testing and counting. Inf. Process. Lett. 115(9): 649-654 (2015) - Sandra Alves, Sabine Broda:
A short note on type-inhabitation: Formula-trees vs. game semantics. Inf. Process. Lett. 115(11): 908-911 (2015) - Péricles Rafael Oliveira Alves, Raphael Ernani Rodrigues, Rafael Martins de Souza, Fernando Magno Quintão Pereira:
A case for a fast trip count predictor. Inf. Process. Lett. 115(2): 146-150 (2015) - Gabriela R. Argiroffo, Valeria A. Leoni, Pablo Daniel Torres:
On the complexity of {k}-domination and k-tuple domination in graphs. Inf. Process. Lett. 115(6-8): 556-561 (2015) - Pradeesha Ashok, Sathish Govindarajan:
On strong centerpoints. Inf. Process. Lett. 115(3): 431-434 (2015) - David Avis, Hans Raj Tiwary:
A generalization of extension complexity that captures P. Inf. Process. Lett. 115(6-8): 588-593 (2015) - Golnaz Badkobeh, Maxime Crochemore:
Infinite binary words containing repetitions of odd period. Inf. Process. Lett. 115(5): 543-547 (2015) - Jørgen Bang-Jensen, Magnús M. Halldórsson:
Vertex coloring edge-weighted digraphs. Inf. Process. Lett. 115(10): 791-796 (2015) - Joao M. M. Barguil, Paulo S. L. M. Barreto:
Security issues in Sarkar's e-cash protocol. Inf. Process. Lett. 115(11): 801-803 (2015) - David A. Basin, Felix Klaedtke, Eugen Zalinescu:
Greedily computing associative aggregations on sliding windows. Inf. Process. Lett. 115(2): 186-192 (2015) - Marco Bender, Clemens Thielen, Stephan Westphal:
Packing items into several bins facilitates approximating the separable assignment problem. Inf. Process. Lett. 115(6-8): 570-575 (2015) - Béatrice Bérard, Krishnendu Chatterjee, Nathalie Sznajder:
Probabilistic opacity for Markov decision processes. Inf. Process. Lett. 115(1): 52-59 (2015) - René van Bevern, Jiehua Chen, Falk Hüffner, Stefan Kratsch, Nimrod Talmon, Gerhard J. Woeginger:
Approximability and parameterized complexity of multicover by c-intervals. Inf. Process. Lett. 115(10): 744-749 (2015) - Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, Peter Palfrader:
A simple algorithm for computing positively weighted straight skeletons of monotone polygons. Inf. Process. Lett. 115(2): 243-247 (2015) - Ivan Bliznets, Marek Cygan, Pawel Komosa, Lukás Mach:
Kernelization lower bound for Permutation Pattern Matching. Inf. Process. Lett. 115(5): 527-531 (2015) - Céline Blondeau:
Impossible differential attack on 13-round Camellia-192. Inf. Process. Lett. 115(9): 660-666 (2015) - Hans L. Bodlaender, Marc J. van Kreveld:
Google Scholar makes it hard - the complexity of organizing one's publications. Inf. Process. Lett. 115(12): 965-968 (2015) - Flavia Bonomo, Guillermo Durán, Amedeo Napoli, Mario Valencia-Pabon:
A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to {k}-sparse graphs. Inf. Process. Lett. 115(6-8): 600-603 (2015) - Andrei Braga, Cid C. de Souza, Orlando Lee:
The Eternal Dominating Set problem for proper interval graphs. Inf. Process. Lett. 115(6-8): 582-587 (2015) - Michael Brand:
Arbitrary sequence RAMs. Inf. Process. Lett. 115(2): 193-198 (2015) - Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic:
Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs. Inf. Process. Lett. 115(2): 256-262 (2015) - Andreas Brandstädt, Vassilis Giakoumakis:
Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs. Inf. Process. Lett. 115(2): 345-350 (2015) - Simina Brânzei:
A note on envy-free cake cutting with polynomial valuations. Inf. Process. Lett. 115(2): 93-95 (2015) - Vladimir Braverman, Rafail Ostrovsky, Gregory Vorsanger:
Weighted sampling without replacement from data streams. Inf. Process. Lett. 115(12): 923-926 (2015) - Laurent Bulteau, Guillaume Fertin, Romeo Rizzi, Stéphane Vialette:
Some algorithmic results for [2]-sumset covers. Inf. Process. Lett. 115(1): 1-5 (2015)
skipping 158 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-04-25 11:09 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