Остановите войну!
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 43 matches
- 2001
- Sergei M. Abramov, Robert Glück:
From Standard to Non-Standard Semantics by Semantics Modifiers. Int. J. Found. Comput. Sci. 12(2): 171-211 (2001) - David Blokh, Eugene Levner:
The Maximum Traveling Salesman Problem on Banded Matrices. Int. J. Found. Comput. Sci. 12(6): 809-819 (2001) - Peter Borovanský, Claude Kirchner, Hélène Kirchner, Christophe Ringeissen:
Rewriting with Strategies in ELAN: A Functional Semantics. Int. J. Found. Comput. Sci. 12(1): 69-95 (2001) - Marc Bui, Sajal K. Das, Ajoy Kumar Datta, Dai Tho Nguyen:
Randomized Mobile Agent Based Routing in Wireless Networks. Int. J. Found. Comput. Sci. 12(3): 365-384 (2001) - Cristian Calude, Hajime Ishihara, Takeshi Yamaguchi:
Coding with Minimal Programs. Int. J. Found. Comput. Sci. 12(4): 479-490 (2001) - Chantana Chantrapornchai, Sissades Tongsima:
Resource Estimation Algorithm Under Impreciseness Using Inclusion Scheduling. Int. J. Found. Comput. Sci. 12(5): 581-598 (2001) - Oliver Diessel, Hossam A. ElGindy:
On Dynamic Task Scheduling for EPGA-Based Systems. Int. J. Found. Comput. Sci. 12(5): 645-669 (2001) - Birgit Elbl:
A Non-Definability Result for a Predicational Language with the Usual Control. Int. J. Found. Comput. Sci. 12(3): 385-396 (2001) - Mary Mehrnoosh Eshaghian:
Mapping Arbitrary Heterogeneous Task Graphs Onto Arbitrary Heterogeneous System Graphs. Int. J. Found. Comput. Sci. 12(5): 599-628 (2001) - Dirk Fimmel, Jan Müller:
Optimal Software Pipelining Under Resource Constraints. Int. J. Found. Comput. Sci. 12(6): 697-718 (2001) - Noriyuki Fujimoto, Tomoki Baba, Takashi Hashimoto, Kenichi Hagihara:
On Message Packaging in Task Scheduling for Distributed Memory Parallel Machines. Int. J. Found. Comput. Sci. 12(3): 285-306 (2001) - Teofilo F. Gonzalez:
On Solving Multimessage Multicasting Problems. Int. J. Found. Comput. Sci. 12(6): 791-808 (2001) - Géza Harváth, Katsushi Inoue, Akira Ito, Yue Wang:
Closure Property of Probabilistic Turing Machines and Alternating Turing Machines with Sublogarithmic Spaces. Int. J. Found. Comput. Sci. 12(3): 397-409 (2001) - Ralf Hinze:
Prolog's Control Constructs in a Functional Setting - Axioms and Implementation. Int. J. Found. Comput. Sci. 12(2): 125-170 (2001) - Harald Meyer auf'm Hofe:
Solving Rostering Tasks by Generic Methods for Constraint Optimization. Int. J. Found. Comput. Sci. 12(5): 671-693 (2001) - Wing-Kai Hon, Tak Wah Lam:
Approximating the Nearest Neighbor Intercharge Distance for Non-Uniform-Degree Evolutionary Trees. Int. J. Found. Comput. Sci. 12(4): 533-550 (2001) - Oscar H. Ibarra, Tevfik Bultan, Jianwen Su:
On Reachability and Safety in Infinite-State Systems. Int. J. Found. Comput. Sci. 12(6): 821-836 (2001) - Lars Jacobsen, Kim S. Larsen:
Variants of (A, B)-Trees with Relaxed Balance. Int. J. Found. Comput. Sci. 12(4): 455-478 (2001) - Edgar F. A. Lederer, Romeo A. Dumitrescu:
Automatic Result Verification by Complete Run-Time Checking of Computations. Int. J. Found. Comput. Sci. 12(1): 97-124 (2001) - Keqin Li:
An Efficient Job Scheduling Algorithm in Partitionable Mesh Connected Systems. Int. J. Found. Comput. Sci. 12(6): 763-773 (2001) - Adam Obtulowicz:
Membrane Computing and One-Way Functions. Int. J. Found. Comput. Sci. 12(4): 551-558 (2001) - Kazumasa Oida, K. Shinjo:
Characteristics of Deterministic Optimal Routing for Two Heterogeneous Parallel Servers. Int. J. Found. Comput. Sci. 12(6): 775-790 (2001) - Michael A. Palis:
Special Issue on Parallel and Distributed Computing. Int. J. Found. Comput. Sci. 12(3): 245-247 (2001) - Gheorghe Paun, Grzegorz Rozenberg, Takashi Yokomori:
Hairpin Languages. Int. J. Found. Comput. Sci. 12(6): 837-847 (2001) - Paolo Priore, David de la Fuente, Alberto Gómez, Javier Puente:
Dynamic Scheduling of Manufacturing Systems with Machine Learning. Int. J. Found. Comput. Sci. 12(6): 751-762 (2001) - David L. Rhodes, Wayne H. Wolf:
Two CoNP-Complete Schedule Analysis Problems. Int. J. Found. Comput. Sci. 12(5): 565-580 (2001) - Alan Roberts, Antonios Symvonis:
On the Routing Number of Complete d-ARY Trees. Int. J. Found. Comput. Sci. 12(4): 411-434 (2001) - Sartaj Sahni:
Models and Algorithms for Optical and Optoelectronic Parallel Computers. Int. J. Found. Comput. Sci. 12(3): 249-264 (2001) - Leïla Azouz Saïdane, Farouk Kamoun:
Modelling and Performance Evaluation of the Circulating Multisequencer, The Multi-Tokens and the Consensus Algorithms in a Real Time Distributed Transactional System. Int. J. Found. Comput. Sci. 12(6): 719-749 (2001) - Takafumi Sakurai:
Categorical Model Construction for Proving Syntactic Properties. Int. J. Found. Comput. Sci. 12(2): 213-244 (2001)
skipping 13 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-03 12:31 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