![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
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 4,532 matches
- 2024
- Alen Arslanagic, Jorge A. Pérez, Anda-Amelia Palamariuc:
Minimal session types for the π-calculus. Inf. Comput. 297: 105148 (2024) - Wenjie Bai
, Jeremiah Blocki, Mohammad Hassan Ameri:
Cost-asymmetric memory hard password hashing. Inf. Comput. 297: 105134 (2024) - Girish Balakrishnan, Sankardeep Chakraborty, N. S. Narayanaswamy, Kunihiko Sadakane:
Succinct data structure for path graphs. Inf. Comput. 296: 105124 (2024) - Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
, Marcin Piatkowski:
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 (2024) - George Barmpalias
, Wei Wang:
Pathwise-randomness and models of second-order arithmetic. Inf. Comput. 299: 105181 (2024) - George Barmpalias
, Xiaoyan Zhang:
Growth and irreducibility in path-incompressible trees. Inf. Comput. 297: 105136 (2024) - Paul C. Bell
, Mika Hirvensalo, Igor Potapov
:
The membership problem for subsemigroups of GL2(Z) is NP-complete. Inf. Comput. 296: 105132 (2024) - Massimo Benerecetti, Daniele Dell'Erba
, Fabio Mogavero
:
Solving mean-payoff games via quasi dominions. Inf. Comput. 297: 105151 (2024) - Ashwin Bhaskar
, M. Praveen:
Realizability problem for constraint LTL. Inf. Comput. 296: 105126 (2024) - Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino
:
r-indexing the eBWT. Inf. Comput. 298: 105155 (2024) - Robert Bredereck, Junjie Luo
:
Complexity of manipulation and bribery in premise-based judgment aggregation with simple formulas. Inf. Comput. 296: 105128 (2024) - Florian Bruse, Martin Lange:
Model checking timed recursive CTL. Inf. Comput. 298: 105168 (2024) - Yong Chen, Zhi-Zhong Chen, Curtis Kennedy, Guohui Lin
, Yao Xu, An Zhang:
Approximating the directed path partition problem. Inf. Comput. 297: 105150 (2024) - Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, Barry Van Leeuwen:
Scooby: Improved multi-party homomorphic secret sharing based on FHE. Inf. Comput. 297: 105133 (2024) - Argyrios Deligkas, Michelle Döring, Eduard Eiben, Tiger-Lily Goldsmith, George Skretas
:
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. Inf. Comput. 299: 105171 (2024) - Virgile Dossou-Yovo, Abderrahmane Nitaj, Alain Togbé:
Solving modular cubic equations with Coppersmith's method. Inf. Comput. 298: 105169 (2024) - Clemente Galdi, Stanislaw Jarecki:
Special Issue on 13th International Conference on Security and Cryptography for Networks (SCN 2022). Inf. Comput. 296: 105135 (2024) - Jinjie Gao
, Haibin Kan
, Yuan Li
, Jiahua Xu, Qichun Wang:
Monomial Boolean functions with large high-order nonlinearities. Inf. Comput. 297: 105152 (2024) - Surya Teja Gavva, Karthik C. S.
, Sharath Punna:
Clustering categorical data: Soft rounding k-modes. Inf. Comput. 296: 105115 (2024) - Balázs Gerencsér, Zsombor Várkonyi:
Fast synchronization of inhomogenous random automata. Inf. Comput. 296: 105129 (2024) - Somayyeh Golalizadeh, Nasrin Soltankhah:
On the codewords of generalized Reed-Muller codes reaching the fourth weight. Inf. Comput. 296: 105113 (2024) - Norbert Hegyvári
:
The complexity of subcube partition relates to the additive structure of the support. Inf. Comput. 299: 105170 (2024) - Neil Lutz, Donald M. Stull:
Projection theorems using effective dimension. Inf. Comput. 297: 105137 (2024) - Stian Lybech
:
The reflective higher-order calculus: Encodability, typability and separation. Inf. Comput. 297: 105138 (2024) - Isaac Mackey, Raghubir Chimni, Jianwen Su:
Early detection of temporal constraint violations. Inf. Comput. 296: 105114 (2024) - Sebastian Maneth, Helmut Seidl, Martin Vu
:
Functionality of compositions of top-down tree transducers is decidable. Inf. Comput. 296: 105131 (2024) - Olga Martynova
:
Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs. Inf. Comput. 296: 105127 (2024) - Yuri V. Matiyasevich
:
Towards non-iterative calculation of the zeros of the Riemann zeta function. Inf. Comput. 296: 105130 (2024) - Satyadev Nandakumar, Subin Pulari, Akhil S
:
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem. Inf. Comput. 298: 105156 (2024) - Kirstin Peters
, Nobuko Yoshida
:
Mixed choice in session types. Inf. Comput. 298: 105164 (2024)
skipping 4,502 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/img/cog.dark.24x24.png)
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-07-28 18:26 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