Остановите войну!
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 81 matches
- 2007
- Ruben Agadzanyan, Rusins Freivalds:
Size of Quantum Finite State Transducers. SOFSEM (1) 2007: 155-163 - Yuichi Asahiro, Eiji Miyano, Shuichi Miyazaki, Takuro Yoshimuta:
Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles. SOFSEM (1) 2007: 164-175 - Ricardo A. Baeza-Yates:
Graphs from Search Engine Queries. SOFSEM (1) 2007: 1-8 - Peter Bartalos, Michal Barla, György Frivolt, Michal Tvarozek, Anton Andrejko, Mária Bieliková, Pavol Návrat:
Building an Ontological Base for Experimental Evaluation of Semantic Web Applications. SOFSEM (1) 2007: 682-692 - Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang:
Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187 - Lubos Brim, Mojmír Kretínský:
Model-Checking Large Finite-State Systems and Beyond. SOFSEM (1) 2007: 9-28 - Hajo Broersma, Bert Marchal, Daniël Paulusma, A. N. M. Salman:
Improved Upper Bounds for lambda -Backbone Colorings Along Matchings and Stars. SOFSEM (1) 2007: 188-199 - Manfred Broy:
Interaction and Realizability. SOFSEM (1) 2007: 29-50 - Jérémie Chalopin, Emmanuel Godard, Yves Métivier, Gerard Tel:
About the Termination Detection in the Asynchronous Message Passing Model. SOFSEM (1) 2007: 200-211 - Xin Chen, Zhiming Liu, Vladimir Mencl:
Separation of Concerns and Consistent Integration in Requirements Modelling. SOFSEM (1) 2007: 819-831 - Yann Chevaleyre, Ulle Endriss, Jérôme Lang, Nicolas Maudet:
A Short Introduction to Computational Social Choice. SOFSEM (1) 2007: 51-69 - Yunja Choi:
Checking Interaction Consistency in MARMOT Component Refinements. SOFSEM (1) 2007: 832-843 - Raphaël Clifford, Benjamin Sach:
Fast Approximate Point Set Matching for Information Retrieval. SOFSEM (1) 2007: 212-223 - Philippe Collet, Alain Ozanne, Nicolas Rivierre:
Towards a Versatile Contract Model to Organize Behavioral Specifications. SOFSEM (1) 2007: 844-855 - Claudio Cubillos, Franco Guidi-Polanco, Ricardo Soto:
Performance Analysis of a Multiagent Architecture for Passenger Transportation. SOFSEM (1) 2007: 591-600 - Orhan Dagdeviren, Kayhan Erciyes:
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks. SOFSEM (1) 2007: 224-234 - O'Neil Delpratt, Naila Rahman, Rajeev Raman:
Compressed Prefix Sums. SOFSEM (1) 2007: 235-247 - Yefim Dinitz, Shay Solomon:
On Optimal Solutions for the Bottleneck Tower of Hanoi Problem. SOFSEM (1) 2007: 248-259 - Jaroslav Drazan, Vladimir Mencl:
Improved Processing of Textual Use Cases: Deriving Behavior Specifications. SOFSEM (1) 2007: 856-868 - Miroslaw Dynia, Miroslaw Korzeniowski, Jaroslaw Kutylowski:
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. SOFSEM (1) 2007: 260-271 - Reza Ebrahimpour, Ehsanollah Kabir, Mohammad Reza Yousefi:
Teacher-Directed Learning with Mixture of Experts for View-Independent Face Recognition. SOFSEM (1) 2007: 601-611 - Asaf Efrima, David Peleg:
Distributed Models and Algorithms for Mobile Robot Systems. SOFSEM (1) 2007: 70-87 - Martin Fürer, Shiva Prasad Kasiviswanathan:
Exact Max 2-Sat: Easier and Faster. SOFSEM (1) 2007: 272-283 - Frantisek Galcík, Gabriel Semanisin:
Maximum Finding in the Symmetric Radio Networks with Collision Detection. SOFSEM (1) 2007: 284-294 - Andrew V. Goldberg:
Point-to-Point Shortest Path Algorithms with Preprocessing. SOFSEM (1) 2007: 88-102 - Gregor Gößler, Susanne Graf, Mila E. Majster-Cederbaum, Moritz Martens, Joseph Sifakis:
An Approach to Modelling and Verification of Component Based Systems. SOFSEM (1) 2007: 295-308 - Thomas A. Henzinger:
Games, Time, and Probability: Graph Models for System Design and Analysis. SOFSEM (1) 2007: 103-110 - Mika Hirvensalo:
Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. SOFSEM (1) 2007: 309-319 - David Janin:
On the (High) Undecidability of Distributed Synthesis Problems. SOFSEM (1) 2007: 320-329 - Nicholas R. Jennings:
Agreement Technologies. SOFSEM (1) 2007: 111-113
skipping 51 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 17:05 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