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 27 matches
- 2002
- Artiom Alhazov, Manfred Kudlek, Iurie Rogojin:
Nine Universal Circular Post Machines. Comput. Sci. J. Moldova 10(3): 247-262 (2002) - Isabelle Attali, Constantin Ciubotaru, N. Meergus:
Experimental functional realization of attribute grammar system. Comput. Sci. J. Moldova 10(2): 190-215 (2002) - Ion Bolun, Anatol Ciumac:
Configuration of local area network set of servers. Comput. Sci. J. Moldova 10(2): 99-124 (2002) - Svetlana Cojocaru, Alexandru Colesnicov, Ludmila Malahova:
Network version of the computer algebra system bergman. Comput. Sci. J. Moldova 10(2): 216-222 (2002) - Mihaela Costin, Marius-Dan Zbancioc:
Hints About Some Baseful but Indispensable Elements in Speech Recognition and Reconstruction. Comput. Sci. J. Moldova 10(2): 169-189 (2002) - Vladimir A. Emelichev, Vitaly N. Krichko, Yury Nikulin:
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem. Comput. Sci. J. Moldova 10(2): 136-142 (2002) - Vladimir A. Emelichev, Vitaly N. Krichko, Yury Nikulin:
Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem. Comput. Sci. J. Moldova 10(3): 320-328 (2002) - Constantin Gaindric:
The digital technologies as the chance for sustainable development of Moldova. Comput. Sci. J. Moldova 10(1): 53-58 (2002) - Mario Gionfriddo, Lorenzo Milazzo, Vitaly I. Voloshin:
On the upper chromatic index of a multigraph. Comput. Sci. J. Moldova 10(1): 81-91 (2002) - A. Iusiumbeli, Dmitrii Lozovanu:
Algorithms for solving discrete control problems on networks. Comput. Sci. J. Moldova 10(3): 333-340 (2002) - V. I. Korjik, A. Mukherjii, Michael A. Eremeev, Nikolay A. Moldovyan:
Fault-based analysis of flexible ciphers. Comput. Sci. J. Moldova 10(2): 223-236 (2002) - Dmitrii Lozovanu:
Discrete Control Processes, Dynamic Games and Multicriterion Control. Comput. Sci. J. Moldova 10(2): 125-135 (2002) - Dumitru Lozovanu, Tatiana Pasha:
An algorithm for solving the transport problem on network with concave cost functions of flow on edges. Comput. Sci. J. Moldova 10(3): 341-347 (2002) - Dmitrii Lozovanu, Vitaly I. Voloshin, Alex Zelikovsky:
A note on the colorability of mixed hypergraph using k colors. Comput. Sci. J. Moldova 10(1): 92-95 (2002) - Maurice Margenstern:
The splitting method and Poincare's theorem: (I) - the geometric part. Comput. Sci. J. Moldova 10(3): 297-319 (2002) - Walenty Ostasiewicz:
Perceived Fuzzy Subsets of Finite Sets. Comput. Sci. J. Moldova 10(1): 46-52 (2002) - Jaroslav E. Poliscuk:
The Analysis of Experimental Results of Reinforcement Learning Systems. Comput. Sci. J. Moldova 10(2): 143-168 (2002) - Aurelia Profir:
Biocomputing system of living cells. Comput. Sci. J. Moldova 10(3): 280-296 (2002) - R. Puya:
One class of simply periodic motions of a heavy solid with a fixed point. Comput. Sci. J. Moldova 10(2): 237-241 (2002) - Alexandr Savinov:
Analytical space for data representation and interactive analysis. Comput. Sci. J. Moldova 10(1): 59-80 (2002) - Adrian Stoica, Ricardo Salem Zebulum:
Evolutionary Design of Very Compact Analog Circuit Implementations of Fuzzy Systems. Comput. Sci. J. Moldova 10(1): 28-45 (2002) - Alecsandru Puiu Tacu:
Personal Reflections on a Joyful Occasion. Comput. Sci. J. Moldova 10(1): 3-8 (2002) - José L. Verdegay, Edmundo R. Vergara:
Fuzzy Sets-based Control Rules for Terminating Algorithms. Comput. Sci. J. Moldova 10(1): 10-27 (2002) - Serghei Verlan:
On enhanced time-varying distributed H systems. Comput. Sci. J. Moldova 10(3): 263-279 (2002) - Post-graduate Studies in Mathematics and Computer Science Proposed by the Institute of Mathematics and Computer Science of the Academy of Sciences of the Republic of Moldova. Comput. Sci. J. Moldova 10(2): 243-244 (2002)
- Abstracts of Dr.hab. Theses. Comput. Sci. J. Moldova 10(3): 348 (2002)
- The CSJM's 10th anniversary. Comput. Sci. J. Moldova 10(3): 349-350 (2002)
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-15 08:19 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