Остановите войну!
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 37 matches
- 1996
- Jean-Marc Andreoli, Uwe M. Borghoff, Remo Pareschi:
The Constraint-Based Knowledge Broker Model: Semantics, Implementation and Analysis. J. Symb. Comput. 21(4): 635-667 (1996) - Giuseppe Attardi, Tito Flagella:
Memory Management in the PoSSo Solver. J. Symb. Comput. 21(3): 293-311 (1996) - Giuseppe Attardi, Carlo Traverso:
Strategy-Accurate Parallel Buchberger Algorithms. J. Symb. Comput. 21(4): 411-425 (1996) - Franz Baader, Klaus U. Schulz:
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. J. Symb. Comput. 21(2): 211-243 (1996) - Maria Paola Bonacina:
On the Reconstruction of Proofs in Distributed Theorem Proving: a Modified Clause-Diffusion Method. J. Symb. Comput. 21(4): 507-522 (1996) - Koenraad De Bosschere, Jean-Marie Jacquet:
Extending the µLog Framework with Local and Conditional Blackboard Operations. J. Symb. Comput. 21(4): 669-697 (1996) - Reinhard Bündgen, Manfred Göbel, Wolfgang Küchlin:
Strategy Compliant Multi-Threaded Term Completion. J. Symb. Comput. 21(4): 475-505 (1996) - David Casperson, David Ford, John McKay:
Ideal Decompositions and Subfields. J. Symb. Comput. 21(2): 133-137 (1996) - Giovanni Cesari, Roman Maeder:
Performance Analysis of the Parallel Karatsuba Multiplication Algorithm for Distributed Memory Architectures. J. Symb. Comput. 21(4): 467-473 (1996) - George E. Collins, Mark J. Encarnación:
Improved Techniques for Factoring Univariate Polynomials. J. Symb. Comput. 21(3): 313-327 (1996) - Stéphane Dalmas, Marc Gaëtano, Alain Sausse:
A Distributed and Cooperative Environment for Computer Algebra. J. Symb. Comput. 21(4): 427-439 (1996) - Jörg Denzinger, Stephan Schulz:
Recording and Analysing Knowledge-Based Distributed Deduction Processes. J. Symb. Comput. 21(4): 523-541 (1996) - George J. Fix, Chih-Ping Hsu, Tie Luo:
Implicitization of Rational Parametric Surfaces. J. Symb. Comput. 21(3): 329-336 (1996) - Vladimir P. Gerdt, Vladimir V. Kornyak:
Construction of Finitely Presented Lie Algebras and Superalgebras. J. Symb. Comput. 21(3): 337-349 (1996) - Katia Gladitz, Herbert Kuchen:
Shared Memory Implementation of the Gamma-Operation. J. Symb. Comput. 21(4): 577-591 (1996) - Aloysius G. Helminck:
Computing B-Orbits on G/H. J. Symb. Comput. 21(2): 169-209 (1996) - Jonathan M. D. Hill, Keith M. Clarke, Richard Bornat:
Parallelizing Imperative Functional Programs: the Vectorization Monad. J. Symb. Comput. 21(4): 561-576 (1996) - Chung-Jen Ho, Chee-Keng Yap:
The Habicht Approch to Subresultants. J. Symb. Comput. 21(1): 1-14 (1996) - Benedetto Intrigila, Marisa Venturini Zilli:
A Remark on Infinite Matching vs Infinite Unification. J. Symb. Comput. 21(3): 289-292 (1996) - Gregor Kemper:
Calculating Invariant Rings of Finite Groups over Arbitrary Fields. J. Symb. Comput. 21(3): 351-366 (1996) - Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries:
Comparing Curried and Uncurried Rewriting. J. Symb. Comput. 21(1): 15-39 (1996) - Werner Krandick, Tudor Jebelean:
Bidirectional Exact Integer Division. J. Symb. Comput. 21(4): 441-455 (1996) - Ho-fung Leung, Keith L. Clark:
Constraint Satisfaction in Distributed Concurrent Logic Programming. J. Symb. Comput. 21(4): 699-714 (1996) - Pedro López-García, Manuel V. Hermenegildo, Saumya K. Debray:
A Methodology for Granularity-Based Control of Parallelism in Logic Programs. J. Symb. Comput. 21(4): 715-734 (1996) - Claude Marché:
Normalized Rewriting: An Alternative to Rewriting Modulo a Set of Equations. J. Symb. Comput. 21(3): 253-288 (1996) - Lyn J. Miller:
Analogs of Gröbner Bases in Polynomial Rings over a Ring. J. Symb. Comput. 21(2): 139-153 (1996) - Hirokazu Murao, Tetsuro Fujise:
Modular Algorithm for Sparse Multivariate Polynomial Interpolation and its Parallel Implementation. J. Symb. Comput. 21(4): 377-396 (1996) - Peter Padawitz:
Inductive Theorem Proving for Design Specification. J. Symb. Comput. 21(1): 41-99 (1996) - Franz Pauer, Sandro Zampieri:
Gröbner Bases with Respect to Generalized Term Orders and their Application to the Modelling Problem. J. Symb. Comput. 21(2): 155-168 (1996) - Nestor E. Sanchez:
The Method of Multiple Scales: Asymptotic Solutions and Normal Forms for Nonlinear Oscillatory Problems. J. Symb. Comput. 21(2): 245-252 (1996)
skipping 7 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-05 05:43 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