Остановите войну!
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 32 matches
- 2023
- Marco Bernardo, Andrea Esposito:
On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity. ICTCS 2023: 44-58 - Elena Biagi, Davide Cenzato, Zsuzsanna Lipták, Giuseppe Romana:
On the Number of Equal-Letter Runs of the Bijective Burrows-Wheeler Transform. ICTCS 2023: 129-142 - Marcella Anselmo, Manuela Flores, Maria Madonia:
Density of Ham- and Lee- non-isometric k-ary Words. ICTCS 2023: 116-128 - Michela Ascolese, Andrea Frosini:
Setting the Path to the Combinatorial Characterization of Prime Double Square Polyominoes. ICTCS 2023: 157-168 - Michela Ascolese, Andrea Frosini, Elisa Pergola, Simone Rinaldi:
A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences. ICTCS 2023: 77-91 - Davide Barbarossa, Paolo Pistone:
Tropical Mathematics and the Lambda-Calculus (short paper) (text not included). ICTCS 2023 - Adriano Barile, Stefano Berardi, Luca Roversi:
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem. ICTCS 2023: 31-43 - Ruben Becker, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Alberto Policriti, Nicola Prezza:
Testing Wheelerness of Regular Languages (short paper) (text not included). ICTCS 2023 - Davide Bilò, Vittorio Bilò, Michelle Döring, Pascal Lenzner, Louise Molitor, Jonas Schmidt:
Schelling Games with Continuous Types (short paper). ICTCS 2023: 328-333 - Vittorio Bilò, Lucaleonardo Bove, Cosimo Vinci:
Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies. ICTCS 2023: 314-327 - Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges (short paper). ICTCS 2023: 98-103 - Tiziana Calamoneri:
L(3, 2, 1)-Labeling of Certain Planar Graphs. ICTCS 2023: 65-76 - Tiziana Calamoneri, Federico Corò:
(Eternal) Vertex Cover Number of Infinite and Finite Grid Graphs (short paper). ICTCS 2023: 104-109 - Domenico Cantone, Alfio Giarlotta, Pietro Maugeri, Stephen Watson:
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence. ICTCS 2023: 1-14 - Domenico Cantone, Pietro Maugeri:
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator. ICTCS 2023: 283-298 - Valentina Castiglioni, Michele Loreti, Simone Tini:
DisTL: A Temporal Logic for the Analysis of the Expected Behaviour of Cyber-Physical Systems. ICTCS 2023: 15-30 - Claudio Sacerdoti Coen, Riccardo Treglia:
Properties of a Computational Lambda Calculus for Higher-Order Relational Queries. ICTCS 2023: 254-267 - Stefano Crespi-Reghizzi, Antonio Restivo, Pierluigi San Pietro:
Two-Dimensional Dyck Words (short paper) (text not included). ICTCS 2023 - Giovanna D'Agostino, Luca Geatti, Davide Martincigh, Alberto Policriti:
A Linear-size Cascade Decomposition for Wheeler Automata. ICTCS 2023: 181-191 - Chiara Epifanio, Luca Forlizzi, Francesca Marzi, Filippo Mignosi, Giuseppe Placidi, Matteo Spezialetti:
On the k-Hamming and k-Edit Distances. ICTCS 2023: 143-156 - M. Utkan Gezer, A. C. Cem Say:
Finite State Verifiers with Both Private and Public Coins. ICTCS 2023: 241-253 - Massimiliano Goldwurm, Marco Vignati:
Large Deviation Properties for Pattern Statistics in Primitive Rational Models. ICTCS 2023: 192-205 - Daniele Gorla, Louis Jalouzot, Federica Granese, Catuscia Palamidessi, Pablo Piantanida:
On the (Im)Possibility of Estimating Various Notions of Differential Privacy (short paper). ICTCS 2023: 219-224 - Ugo Dal Lago, Gabriele Vanoni:
(Not So) Boring Abstract Machines. ICTCS 2023: 225-240 - Ruggero Lanotte, Desiree Manicardi, Simone Tini:
Step-by-step Robustness for Biochemical Networks. ICTCS 2023: 299-313 - Marino Miculan, Matteo Paier:
Assembling Coherent Network Topologies Using Round-Trip Graphs (short paper). ICTCS 2023: 110-115 - Angelo Monti, Blerina Sinaimeri:
On Graphs that are not Star-k-PCGs (short paper). ICTCS 2023: 92-97 - Arianna Pavone, Caterina Viola:
The Quantum Cyclic Rotation Gate. ICTCS 2023: 206-218 - Adrien Ragot, Thomas Seiller, Lorenzo Tortora de Falco:
Linear Realisability Over Nets and Second Order Quantification (short paper). ICTCS 2023: 59-64 - Giuseppe Romana:
Algorithmic View on Circular String Attractors. ICTCS 2023: 169-180
skipping 2 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-09 09:57 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