Остановите войну!
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 44 matches
- 2007
- Abdullah N. Arslan:
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings. FCT 2007: 40-51 - Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis:
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. FCT 2007: 52-63 - Eric Bach, Jin-yi Cai:
A Novel Information Transmission Problem and Its Optimal Solution. FCT 2007: 64-75 - Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. Narayan Kumar:
Local Testing of Message Sequence Charts Is Difficult. FCT 2007: 76-87 - Henrik Björklund, Thomas Schwentick:
On Notions of Regularity for Data Languages. FCT 2007: 88-99 - Viviana Bono, Jaroslaw D. M. Kusmierek:
FJMIP: A Calculus for a Modular Object Initialization. FCT 2007: 100-112 - Henning Bordihn, György Vaszil:
Top-Down Deterministic Parsing of Languages Generated by CD Grammar Systems. FCT 2007: 113-124 - Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu:
Rewriting Systems with Data. FCT 2007: 1-22 - Hans-Georg Breunig:
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers. FCT 2007: 125-136 - Gaëlle Brevier, Romeo Rizzi, Stéphane Vialette:
Pattern Matching in Protein-Protein Interaction Graphs. FCT 2007: 137-148 - Robert Brijder, Hendrik Jan Hoogeboom, Grzegorz Rozenberg:
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates. FCT 2007: 149-160 - Robert Brijder, Miika Langille, Ion Petre:
A String-Based Model for Simple Gene Assembly. FCT 2007: 161-172 - Nadia Busi, Claudio Zandron:
On the Computational Power of Genetic Gates with Interleaving Semantics: The Power of Inhibition and Degradation. FCT 2007: 173-186 - Jin-yi Cai, Pinyan Lu:
On Block-Wise Symmetric Signatures for Matchgates. FCT 2007: 187-198 - Didier Caucal, Dinh Trong Hieu:
Path Algorithms on Regular Graphs. FCT 2007: 199-212 - Miroslav Ciric, Aleksandar Stamenkovic, Jelena Ignjatovic, Tatjana Petkovic:
Factorization of Fuzzy Automata. FCT 2007: 213-225 - Thomas Colcombet:
Factorisation Forests for Infinite Words. FCT 2007: 226-237 - Sebastian Dörn, Thomas Thierauf:
The Quantum Query Complexity of Algebraic Properties. FCT 2007: 250-260 - Jacques Duparc, Filip Murlak:
On the Topological Complexity of Weakly Recognizable Tree Languages. FCT 2007: 261-273 - Jörg Endrullis, Clemens Grabmayer, Dimitri Hendriks, Ariya Isihara, Jan Willem Klop:
Productivity of Stream Definitions. FCT 2007: 274-287 - Leah Epstein, Asaf Levin, Rob van Stee:
Multi-dimensional Packing with Conflicts. FCT 2007: 288-299 - Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski:
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. FCT 2007: 300-311 - Clelia de Felice, Gabriele Fici, Rosalba Zizza:
Marked Systems and Circular Splicing. FCT 2007: 238-249 - Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Peter Shaw:
Efficient Parameterized Preprocessing for Cluster Editing. FCT 2007: 312-321 - Gyula Györ:
Representing the Boolean OR Function by Quadratic Polynomials Modulo 6. FCT 2007: 322-327 - Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tantau, Osamu Watanabe:
On the Complexity of Kings. FCT 2007: 328-340 - Michael Hoffmann, Richard M. Thomas:
Notions of Hyperbolicity in Monoids. FCT 2007: 341-352 - Oscar H. Ibarra, Sara Woodworth:
Spiking Neural P Systems: Some Characterizations. FCT 2007: 23-37 - Mihai Ionescu, Dragos Sburlan:
P Systems with Adjoining Controlled Communication Rules. FCT 2007: 353-364 - Michal Kunc:
The Simplest Language Where Equivalence of Finite Substitutions Is Undecidable. FCT 2007: 365-375
skipping 14 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-29 22:08 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