Остановите войну!
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 1,088 matches
- 2023
- Samy Abbes:
Convergence of Distributions on Paths. FCT 2023: 1-15 - Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara:
The Rectilinear Convex Hull of Line Segments. FCT 2023: 32-45 - Nathalie Aubrun, Nicolas Bitar:
Domino Snake Problems on Groups. FCT 2023: 46-59 - Martin Berglund, Henrik Björklund, Johanna Björklund:
Parsing Unranked Tree Languages, Folded Once. FCT 2023: 60-73 - Johanna Björklund:
The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited. FCT 2023: 74-87 - Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen:
Computing Subset Vertex Covers in H-Free Graphs. FCT 2023: 88-102 - Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva:
On Computing Optimal Temporal Branchings. FCT 2023: 103-117 - Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen:
Distance-Based Covering Problems for Graphs of Given Cyclomatic Number. FCT 2023: 132-146 - Dipayan Chakraborty, R. B. Sandeep:
Contracting Edges to Destroy a Pattern: A Complexity Study. FCT 2023: 118-131 - Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef:
An Efficient Computation of the Rank Function of a Positroid. FCT 2023: 147-161 - William S. Evans, David G. Kirkpatrick:
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time. FCT 2023: 162-175 - Zack Fitzsimmons, Edith Hemaspaandra:
Complexity of Conformant Election Manipulation. FCT 2023: 176-189 - Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka:
α-β-Factorization and the Binary Case of Simon's Congruence. FCT 2023: 190-204 - Fabian Frei, David Wehner:
Bounds for c-Ideal Hashing. FCT 2023: 205-220 - Ajinkya Gaikwad, Soumen Maity:
Parameterized Complexity of the Th+1-Free Edge Deletion Problem. FCT 2023: 221-233 - Joshua A. Grochow, Michael Levet:
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. FCT 2023: 234-247 - Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski:
The Complexity of (Pk, Pℓ )-Arrowing. FCT 2023: 248-261 - Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu:
On Computing a Center Persistence Diagram. FCT 2023: 262-275 - Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz:
Robust Identification in the Limit from Incomplete Positive Data. FCT 2023: 276-290 - Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams:
Cordial Forests. FCT 2023: 291-303 - Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar:
Vertex Ordering with Precedence Constraints. FCT 2023: 304-317 - Chris Köcher, Dietrich Kuske:
Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems. FCT 2023: 318-332 - Jan Matyás Kristan, Jakub Svoboda:
Shortest Dominating Set Reconfiguration Under Token Sliding. FCT 2023: 333-347 - Van Bang Le, Christian Rosenke:
Computing Optimal Leaf Roots of Chordal Cographs in Linear Time. FCT 2023: 348-362 - Sewon Park:
Verified Exact Real Computation with Nondeterministic Functions and Limits. FCT 2023: 363-377 - Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza:
Exact and Parameterized Algorithms for the Independent Cutset Problem. FCT 2023: 378-391 - Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser:
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves. FCT 2023: 392-405 - Antonio Al Serhali, Joachim Niehren:
Subhedge Projection for Stepwise Hedge Automata. FCT 2023: 16-31 - Kodai Tanaka, Takaaki Mizuki:
Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku. FCT 2023: 406-420 - Tomoyuki Yamakami:
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata. FCT 2023: 421-435
skipping 1,058 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-24 19:32 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