The Computer Science Journal of Moldova, Volume 8 (original) (raw)
default search action
- combined dblp search
- author search
- venue search
- publication search
Authors:
- no matches
Venues:
- no matches
Publications:
- no matches
SPARQL queries 
⚠
Please note that none of the items listed on this page have a DOI stored with their dblp record. Therefore, DOI-based queries won't return any results.
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Volume 8, Number 1, 2000
Artificial intelligence
Arkadij Zakrevskij:
Reduction algorithms for solving large systems of logical equations. 3-15
Symbolic computation and algebraic computation
Anna Torstensson:
On the existence of orthogonal decompositions of the simple Lie algebra of type C3. 16-41
Jonas Månsson:
On the computation of Hilbert series and Poincare series for algebras with infinite Grobner bases. 42-63
Discrete mathematics
Dmitrii Lozovanu, Vitaly I. Voloshin:
Integer programming models for colorings of mixed hypergraphs. 64-74
Numerical analysis
Tudor Cibotaru:
On approximate solution of non-elliptic singular integral equation systems in Lebesgue spaces. 75-83
Chronicle
Abstracts of Dr. Theses. 84-85
International Conference. 86-91
Volume 8, Number 2, 2000
Theory of computing
Maurice Margenstern:
A package of algorithms to devise cellular automata in the hyperbolic plane and related questions. 95-115
Mathematical linguistics
Neculai Curteanu, Paul-Gabriel Holban:
A set-theoretic approach to linguistic feature structures and unification algorithms (I). 116-149
Numerical analysis
Boris Rîbachin:
Computer Modelling of Dynamic Processes. 150-180
Constantin Popa, A. Sharaniuk:
The numerical identification of the mechanical systems with respect to natural frequences. 181-189
Discrete mathematics
Vladimir A. Emelichev, A. V. Pashkevich:
On scalarization of vector discrete problems of majority choice. 190-208
Vasile Moraru:
Primal-Dual Method of Solving Convex Quadratic Programming Problems. 209-220
Volume 8, Number 3, 2000
Mathematical linguistics
Neculai Curteanu, Paul-Gabriel Holban:
A set-theoretic approach to linguistic feature structures and unification algorithms (II). 223-246
Descrete mathematics
Enzo Maria Li Marzi, Maria Corinna Marino:
On Planar Mixed Hypergraphs. 247-259
Vladimir A. Emelichev, A. V. Pashkevich:
Vector discrete problems: parametrization of an optimality principle and conditions of solvability in the class of algorithms involving linear convolution of criteria. 260-269
Theory of data
Alexander A. Moldovyan:
Fast block ciphers based on controlled permutations. 270-278
Parallel algorithms
Aleksander Tsaryov:
The Parallel Algorithms for a Correlation Function Computing. 284-292
Mathematical economics
Alexandra Tkachenko, Yurii Caraush:
Technical efficiency in Moldavian industry. 293-311
Chronicle
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. 312-314
Abstracts of Dr. Theses. 315-316
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).
load links from unpaywall.org
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).
load content from archive.org
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 
.
load data from openalex.org
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.
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
