Остановите войну!
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 90 matches
- 2023
- Spyros Angelopoulos:
Competitive Search in the Line and the Star with Predictions. MFCS 2023: 12:1-12:15 - Yoshiki Nakamura:
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation. MFCS 2023: 69:1-69:15 - Julien Clément, Antoine Genitrini:
An Iterative Approach for Counting Reduced Ordered Binary Decision Diagrams. MFCS 2023: 36:1-36:15 - Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis, Miltiadis Stouras, Christos Tzamos:
Graph Connectivity with Noisy Queries. MFCS 2023: 47:1-47:14 - Spyros Angelopoulos, Shahin Kamali:
Rényi-Ulam Games and Online Computation with Imperfect Advice. MFCS 2023: 13:1-13:15 - Liron Cohen, Bruno da Rocha Paiva, Vincent Rahli, Ayberk Tosun:
Inductive Continuity via Brouwer Trees. MFCS 2023: 37:1-37:16 - Jonas Schmidt, Thomas Schwentick:
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work. MFCS 2023: 80:1-80:15 - Jonas Schmidt, Thomas Schwentick, Jennifer Todtenhoefer:
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages. MFCS 2023: 81:1-81:15 - Yixin Cao, Hanchun Yuan, Jianxin Wang:
Modification Problems Toward Proper (Helly) Circular-Arc Graphs. MFCS 2023: 31:1-31:14 - Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, Nidhi Purohit, Saket Saurabh:
Fixed-Parameter Algorithms for Fair Hitting Set Problems. MFCS 2023: 55:1-55:14 - Matthew Johnson, Barnaby Martin, Sukanya Pandey, Daniël Paulusma, Siani Smith, Erik Jan van Leeuwen:
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs. MFCS 2023: 57:1-57:15 - Faisal N. Abu-Khzam, Henning Fernau, Kevin Mann:
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes. MFCS 2023: 6:1-6:15 - Antonis Achilleos, Aggeliki Chalki:
Counting Computations with Formulae: Logical Characterisations of Counting Complexity Classes. MFCS 2023: 7:1-7:15 - Veeti Ahvonen, Damian Heiman, Lauri Hella, Antti Kuusisto:
Descriptive Complexity for Distributed Computing with Circuits. MFCS 2023: 9:1-9:15 - Marianne Akian, Stéphane Gaubert, Ulysse Naepels, Basile Terver:
Solving Irreducible Stochastic Mean-Payoff Games and Entropy Games by Relative Krasnoselskii-Mann Iteration. MFCS 2023: 10:1-10:15 - Shaull Almagor, Arka Ghosh, Tim Leys, Guillermo A. Pérez:
The Geometry of Reachability in Continuous Vector Addition Systems with States. MFCS 2023: 11:1-11:13 - Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. MFCS 2023: 14:1-14:15 - Christel Baier, Krishnendu Chatterjee, Tobias Meggendorfer, Jakob Piribauer:
Entropic Risk for Turn-Based Stochastic Games. MFCS 2023: 15:1-15:16 - Jirí Balun, Tomás Masopust, Petr Osicka:
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification. MFCS 2023: 16:1-16:15 - Pablo Barceló, Diego Figueira, Rémi Morvan:
Separating Automatic Relations. MFCS 2023: 17:1-17:15 - Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli:
On the Parameterized Complexity of Computing st-Orientations with Few Transitive Edges. MFCS 2023: 18:1-18:15 - Noy Biton, Reut Levi, Moti Medina:
Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations. MFCS 2023: 19:1-19:14 - Clotilde Bizière, Erich Grädel, Matthias Naaf:
Locality Theorems in Semiring Semantics. MFCS 2023: 20:1-20:15 - Manon Blanc, Olivier Bournez:
A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs. MFCS 2023: 21:1-21:15 - Ivan Bliznets, Vladislav Epifanov:
MaxCut Above Guarantee. MFCS 2023: 22:1-22:14 - Marthe Bonamy:
Exploring the Space of Colourings with Kempe Changes (Invited Talk). MFCS 2023: 1:1-1:2 - Charles Bouillaguet, Florette Martinez, Damien Vergnaud:
Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator. MFCS 2023: 23:1-23:15 - Joan Boyar:
Online Algorithms with Predictions (Invited Talk). MFCS 2023: 2:1-2:2 - Dylan Braithwaite, Jules Hedges, Toby St Clere Smithe:
The Compositional Structure of Bayesian Inference. MFCS 2023: 24:1-24:15 - Cornelius Brand, Viktoriia Korchemna, Michael Skotnica:
Deterministic Constrained Multilinear Detection. MFCS 2023: 25:1-25:14
skipping 60 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-13 00:28 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