Остановите войну!
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 64 matches
- 2003
- Cyril Allauzen, Mehryar Mohri:
Finitely Subsequential Transducers. Int. J. Found. Comput. Sci. 14(6): 983-994 (2003) - Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 287-303 (2003) - Shivi Shekhar Bansal, S. Sreekanth, Phalguni Gupta:
M-Heap: A Modified Heap Data Structure. Int. J. Found. Comput. Sci. 14(3): 491-502 (2003) - Constantinos Bartzis, Tevfik Bultan:
Efficient Symbolic Representations for Arithmetic Constraints in Verification. Int. J. Found. Comput. Sci. 14(4): 605-624 (2003) - Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough:
Block Sorting is Hard. Int. J. Found. Comput. Sci. 14(3): 425-437 (2003) - Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Golomb Rulers And Difference Sets For Succinct Quantum Automata. Int. J. Found. Comput. Sci. 14(5): 871-888 (2003) - Jacir Luiz Bordim, Koji Nakano, Hong Shen:
Sorting on Single-Channel Wireless Sensor Networks. Int. J. Found. Comput. Sci. 14(3): 391-403 (2003) - Ahmed Bouajjani, Javier Esparza, Tayssir Touili:
A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. Int. J. Found. Comput. Sci. 14(4): 551- (2003) - Jan Bouda, Vladimír R. Buzek:
Encryption Of Quantum Information. Int. J. Found. Comput. Sci. 14(5): 741-756 (2003) - Cezar Câmpeanu, Andrei Paun:
Counting The Number Of Minimal Dfca Obtained By Merging States. Int. J. Found. Comput. Sci. 14(6): 995-1006 (2003) - Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) - Julien Cartigny, François Ingelrest, David Simplot:
RNG Relay Subset Flooding Protocols in Mobile Ad-Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 253-265 (2003) - Yuanzhu Peter Chen, Arthur L. Liestman:
A Zonal Algorithm for Clustering An Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 305-322 (2003) - Edmund M. Clarke, Ansgar Fehnker, Zhi Han, Bruce H. Krogh, Joël Ouaknine, Olaf Stursberg, Michael Theobald:
Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems. Int. J. Found. Comput. Sci. 14(4): 583-604 (2003) - Jurek Czyzowicz, Wojciech Fraczak, Andrzej Pelc, Wojciech Rytter:
Linear-Time Prime Decomposition Of Regular Prefix Codes. Int. J. Found. Comput. Sci. 14(6): 1019-1032 (2003) - Evgeny Dantsin, Alexander Wolpert:
A Robust Dna Computation Model That Captures Pspace. Int. J. Found. Comput. Sci. 14(5): 933- (2003) - Axel Dold, Friedrich W. von Henke, Wolfgang Goerigk:
A Completely Verified Realistic Bootstrap Compiler. Int. J. Found. Comput. Sci. 14(4): 659- (2003) - Deepak D'Souza:
A Logical Characterisation of Event Clock Automata. Int. J. Found. Comput. Sci. 14(4): 625-640 (2003) - E. Allen Emerson, Kedar S. Namjoshi:
On Reasoning About Rings. Int. J. Found. Comput. Sci. 14(4): 527-550 (2003) - Guangbin Fan, Jingyuan Zhang:
Optimal Cellular Network Deployment Reusing Existing Base Stations. Int. J. Found. Comput. Sci. 14(2): 169-181 (2003) - Carlo Fantozzi, Andrea Pietracaprina, Geppino Pucci:
A General Pram Simulation Scheme For Clustered Machines. Int. J. Found. Comput. Sci. 14(6): 1147-1164 (2003) - Alfredo Ferro, Giuseppe Pigola, Alfredo Pulvirenti, Dennis E. Shasha:
Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks. Int. J. Found. Comput. Sci. 14(2): 223-236 (2003) - Mihaela Gheorghiu, Janusz A. Brzozowski:
Simulation Of Feedback-Free Circuits In The Algebra Of Transients. Int. J. Found. Comput. Sci. 14(6): 1033-1054 (2003) - Sasthi C. Ghosh, Bhabani P. Sinha, Nabanita Das:
A New Approach to Efficient Channel Assignment for Hexagonal Cellular Networks. Int. J. Found. Comput. Sci. 14(3): 439-463 (2003) - Vassilis Giakoumakis, Jean-Marie Vanherpe:
Linear Time Recognition and Optimizations for Weak-Bisplit Graphs, Bi-Cographs and Bipartite P6-Free Graphs. Int. J. Found. Comput. Sci. 14(1): 107-136 (2003) - Markus Grassl, Martin Rötteler, Thomas Beth:
Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes. Int. J. Found. Comput. Sci. 14(5): 757-776 (2003) - William C. Grimmell, Nageswara S. V. Rao:
On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints. Int. J. Found. Comput. Sci. 14(3): 503-523 (2003) - Lov K. Grover:
An Improved Quantum Scheduling Algorithm. Int. J. Found. Comput. Sci. 14(5): 715-722 (2003) - Franck Guingne, Florent Nicart, Jean-Marc Champarnaud, Lauri Karttunen, Tamás Gaál, André Kempe:
Virtual Operations On Virtual Networks: The Priority Union . Int. J. Found. Comput. Sci. 14(6): 1055-1071 (2003) - Markus Holzer, Martin Kutrib:
Nondeterministic Descriptional Complexity Of Regular Languages. Int. J. Found. Comput. Sci. 14(6): 1087-1102 (2003)
skipping 34 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-09-07 01:04 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