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 30 matches
- 2020
- Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom:
Online recognition of dictionary with one gap. Inf. Comput. 275: 104633 (2020) - George Barmpalias, Nan Fang:
Granularity of wagers in games and the possibility of saving. Inf. Comput. 275: 104600 (2020) - Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro:
Learning families of algebraic structures from informant. Inf. Comput. 275: 104590 (2020) - Anna Becchi, Enea Zaffanella:
PPLite: Zero-overhead encoding of NNC polyhedra. Inf. Comput. 275: 104620 (2020) - Sebastian Berndt, Maciej Liskiewicz:
On the universal steganography of optimal rate. Inf. Comput. 275: 104632 (2020) - Zhengbing Bian, Fabián A. Chudak, William G. Macready, Aidan Roy, Roberto Sebastiani, Stefano Varotti:
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results. Inf. Comput. 275: 104609 (2020) - Chiara Bodei, Linda Brodo, Roberto Bruni:
The link-calculus for open multiparty interactions. Inf. Comput. 275: 104587 (2020) - Tara Brough, Alan J. Cain:
A language hierarchy of binary relations. Inf. Comput. 275: 104607 (2020) - Jin-Yi Cai, Zhiguo Fu, Shuai Shao:
Beyond #CSP: A dichotomy for counting weighted Eulerian orientations with ARS. Inf. Comput. 275: 104589 (2020) - Cassio P. de Campos, Georgios Stamoulis, Dennis Weyland:
A structured view on weighted counting with relations to counting, quantum computation and applications. Inf. Comput. 275: 104627 (2020) - Renu Mary Daniel, Elijah Blessing Rajsingh, Salaja Silas:
An efficient eCK secure identity based Two Party Authenticated Key Agreement scheme with security against active adversaries. Inf. Comput. 275: 104630 (2020) - Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer:
Arrow update synthesis. Inf. Comput. 275: 104544 (2020) - Samuel Epstein:
An extended coding theorem with application to quantum complexities. Inf. Comput. 275: 104660 (2020) - Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers, Petr Kuznetsov, Thibault Rieutord:
Perfect failure detection with very few bits. Inf. Comput. 275: 104604 (2020) - Benjamin Fuller, Xianrui Meng, Leonid Reyzin:
Computational fuzzy extractors. Inf. Comput. 275: 104602 (2020) - Roberto Gorrieri:
Team equivalences for finite-state machines with silent moves. Inf. Comput. 275: 104603 (2020) - Haitao Jiang, Hong Liu, Cédric Chauve, Binhai Zhu:
Breakpoint distance and PQ-trees. Inf. Comput. 275: 104584 (2020) - Michal Kunc, Alexander Okhotin:
Reversibility of computations in graph-walking automata. Inf. Comput. 275: 104631 (2020) - James Laird:
Weighted models for higher-order computation. Inf. Comput. 275: 104645 (2020) - Slawomir Lasota, Radoslaw Piórkowski:
WQO dichotomy for 3-graphs. Inf. Comput. 275: 104541 (2020) - Neil Lutz, Donald M. Stull:
Bounding the dimension of points on a line. Inf. Comput. 275: 104601 (2020) - Doriana Medic, Claudio Antares Mezzina, Iain Phillips, Nobuko Yoshida:
A parametric framework for reversible π-calculi. Inf. Comput. 275: 104644 (2020) - Kirstin Peters, Uwe Nestmann:
Distributability of mobile ambients. Inf. Comput. 275: 104608 (2020) - Daowen Qiu, Shenggen Zheng:
Revisiting Deutsch-Jozsa algorithm. Inf. Comput. 275: 104605 (2020) - Christian Rosenke, Maciej Liskiewicz:
The generic combinatorial algorithm for image matching with classes of projective transformations. Inf. Comput. 275: 104550 (2020) - Bosheng Song, Kenli Li, David Orellana-Martín, Luis Valencia-Cabrera, Mario J. Pérez-Jiménez:
Cell-like P systems with evolutional symport/antiport rules and membrane creation. Inf. Comput. 275: 104542 (2020) - Chun Tian, Davide Sangiorgi:
Unique solutions of contractions, CCS, and their HOL formalisation. Inf. Comput. 275: 104606 (2020) - Salvatore La Torre, Margherita Napoli, Gennaro Parlato:
Reachability of scope-bounded multistack pushdown systems. Inf. Comput. 275: 104588 (2020) - Ming Xu, Yuxin Deng:
Time-bounded termination analysis for probabilistic programs with delays. Inf. Comput. 275: 104634 (2020) - Peng Zhang, Linqing Tang:
Minimum Label s-t Cut has large integrality gaps. Inf. Comput. 275: 104543 (2020)
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-11-26 21:52 CET 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