Остановите войну!
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 68 matches
- 2008
- Fabio Alessi, Paula Severi:
Recursive Domain Equations of Filter Models. SOFSEM 2008: 124-135 - Khadija Abied Ali, Jaroslav Pokorný:
3D_XML: A Three-Dimensional XML-Based Model. SOFSEM 2008: 659-671 - Andris Ambainis:
Quantum Random Walks - New Method for Designing Quantum Algorithms. SOFSEM 2008: 1-4 - Andris Ambainis, Alexander Rivosh:
Quantum Walks with Multiple or Moving Marked Locations. SOFSEM 2008: 485-496 - Vikraman Arvind, Pushkar S. Joglekar:
Algorithmic Problems for Metrics on Permutation Groups. SOFSEM 2008: 136-147 - Paul Bell, Igor Potapov:
Periodic and Infinite Traces in Matrix Semigroups. SOFSEM 2008: 148-161 - Dusan Bernát:
Domain Name System as a Memory and Communication Medium. SOFSEM 2008: 560-571 - Julien Bernet, David Janin:
From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. SOFSEM 2008: 162-173 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer:
On the Hardness of Reoptimization. SOFSEM 2008: 50-65 - Beate Bollig, Niko Range, Ingo Wegener:
Exact OBDD Bounds for Some Fundamental Functions. SOFSEM 2008: 174-185 - Nieves R. Brisaboa, Oscar Pedreira, Diego Seco, Roberto Solar, Roberto Uribe:
Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers. SOFSEM 2008: 186-197 - Peter Brusilovsky:
Social Information Access: The Other Side of the Social Web. SOFSEM 2008: 5-22 - Michael J. Burrell, James H. Andrews, Mark Daley:
A Useful Bounded Resource Functional Language. SOFSEM 2008: 198-210 - Mariano Ceccato, Yoram Ofek, Paolo Tonella:
Remote Entrusting by Run-Time Software Authentication. SOFSEM 2008: 83-97 - Feng Cheng, Christoph Meinel:
Strong Authentication over Lock-Keeper. SOFSEM 2008: 572-584 - Jacek Cichon, Miroslaw Kutylowski, Bogdan Weglorz:
Short Ballot Assumption and Threeballot Voting Protocol. SOFSEM 2008: 585-598 - Julien Cristau, Florian Horn:
On Reachability Games of Ordinal Length. SOFSEM 2008: 211-221 - Boguslaw Cyganek:
An Algorithm for Computation of the Scene Geometry by the Log-Polar Area Matching Around Salient Points. SOFSEM 2008: 222-233 - Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis, Danny Krizanc:
The Power of Tokens: Rendezvous and Symmetry Detection for Two Mobile Agents in a Ring. SOFSEM 2008: 234-246 - Jacek Dabrowski:
Parallel Immune System for Graph Coloring. SOFSEM 2008: 497-505 - Stefan Dobrev, Rastislav Kralovic, Dana Pardubská:
How Much Information about the Future Is Needed? SOFSEM 2008: 247-258 - Jirí Dokulil, Jana Katreniaková:
Visual Exploration of RDF Data. SOFSEM 2008: 672-683 - Peter Dolog:
Designing Adaptive Web Applications. SOFSEM 2008: 23-33 - Sebastian Dörn, Thomas Thierauf:
The Quantum Complexity of Group Testing. SOFSEM 2008: 506-518 - Cezara Dragoi, Gheorghe Stefanescu:
On Compiling Structured Interactive Programs with Registers and Voices. SOFSEM 2008: 259-270 - Lech Duraj, Grzegorz Gutowski:
Optimal Orientation On-Line. SOFSEM 2008: 271-279 - Martin Dzbor:
Best of Both: Using Semantic Web Technologies to Enrich User Interaction with the Web and Vice Versa. SOFSEM 2008: 34-49 - Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard:
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. SOFSEM 2008: 280-291 - Diego de Falco, Dario Tamascelli:
Quantum Walks: A Markovian Perspective. SOFSEM 2008: 519-530 - György Frivolt, Ján Suchal, Richard Vesely, Peter Vojtek, Oto Vozár, Mária Bieliková:
Creation, Population and Preprocessing of Experimental Data Sets for Evaluation of Applications for the Semantic Web. SOFSEM 2008: 684-695
skipping 38 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-06-21 04:56 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