Остановите войну!
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 55 matches
- 2012
- Luca Aceto, David de Frutos-Escrig, Carlos Gregorio-Rodríguez, Anna Ingólfsdóttir:
The Equational Theory of Weak Complete Simulation Semantics over BCCSP. SOFSEM 2012: 141-152 - Roman Barták, Con Sheahan, Ann Sheahan:
MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. SOFSEM 2012: 600-611 - Nikola Benes, Ivana Cerná, Filip Stefanak:
Factorization for Component-Interaction Automata. SOFSEM 2012: 554-565 - Guillaume Blin, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Florian Sikora:
Complexity Insights of the Minimum Duplication Problem. SOFSEM 2012: 153-164 - Peter van Emde Boas:
Turing Machines for Dummies - Why Representations Do Matter. SOFSEM 2012: 14-30 - Lucas Bordeaux, João Marques-Silva:
Knowledge Compilation with Empowerment. SOFSEM 2012: 612-624 - Paul De Bra, David Smits:
A Fully Generic Approach for Realizing the Adaptive Web. SOFSEM 2012: 64-76 - Ilir Çapuni, Péter Gács:
A Turing Machine Resisting Isolated Bursts of Faults. SOFSEM 2012: 165-176 - Ondrej Cepek, Petr Kucera, Václav Vlcek:
Properties of SLUR Formulae. SOFSEM 2012: 177-189 - Tomás Cerný, Petr Praus, Slávka Jaromerská, Lubos Matl, Michael J. Donahoo:
Towards a Smart, Self-scaling Cooperative Web Cache. SOFSEM 2012: 443-455 - Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi:
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs. SOFSEM 2012: 190-201 - Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch:
Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration. SOFSEM 2012: 202-213 - Felipe Cucker:
The Legacy of Turing in Numerical Analysis. SOFSEM 2012: 1-13 - Peter Damaschke, Azam Sheikh Muhammad:
Randomized Group Testing Both Query-Optimal and Minimal Adaptive. SOFSEM 2012: 214-225 - Johannes Ebbing, Peter Lohmann:
Complexity of Model Checking for Modal Dependence Logic. SOFSEM 2012: 226-237 - Ömer Egecioglu, Oscar H. Ibarra, Nicholas Q. Trân:
Multitape NFA: Weak Synchronization of the Input Heads. SOFSEM 2012: 238-250 - Emmanuel Filiot, Frédéric Servais:
Visibly Pushdown Transducers with Look-Ahead. SOFSEM 2012: 251-263 - Anna Gál, Jing-Tang Jang:
A Generalization of Spira's Theorem and Circuits with Small Segregators or Separators. SOFSEM 2012: 264-276 - Maciej Gazda, Tim A. C. Willemse:
Consistent Consequence for Boolean Equation Systems. SOFSEM 2012: 277-288 - Petr A. Golovach, Daniël Paulusma, Jian Song:
4-Coloring H-Free Graphs When H Is Small. SOFSEM 2012: 289-300 - Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda:
Computing q-Gram Non-overlapping Frequencies on SLP Compressed Texts. SOFSEM 2012: 301-312 - Yuri Gurevich:
What Is an Algorithm? SOFSEM 2012: 31-42 - Jirí Isa, Zuzana Reitermanová, Ondrej Sýkora:
Cost-Sensitive Classification with Unconstrained Influence Diagrams. SOFSEM 2012: 625-636 - Giuseppe F. Italiano:
Strong Bridges and Strong Articulation Points of Directed Graphs. SOFSEM 2012: 43 - Martin Jacala, Jozef Tvarozek:
Named Entity Disambiguation Based on Explicit Semantics. SOFSEM 2012: 456-466 - Klaus Jansen:
A Fast Approximation Scheme for the Multiple Knapsack Problem. SOFSEM 2012: 313-324 - Petr Jarusek, Radek Pelánek:
Modeling and Predicting Students Problem Solving Times. SOFSEM 2012: 637-648 - Konstanty Junosza-Szaniawski, Michal Tuczynski:
Counting Maximal Independent Sets in Subcubic Graphs. SOFSEM 2012: 325-336 - Peter Kajsa, Pavol Návrat:
Design Pattern Support Based on the Source Code Annotations and Feature Models. SOFSEM 2012: 467-478 - Prabhu Shankar Kaliappan, Hartmut König:
On the Formalization of UML Activities for Component-Based Protocol Design Specifications. SOFSEM 2012: 479-491
skipping 25 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-08-19 14:59 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