default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRüdiger Loos
Person information
- affiliation: University of Tübingen, Germany
- affiliation (former): University of Kaiserslautern, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[e1]Mehdi Jazayeri, Rüdiger Loos, David R. Musser:
Generic Programming, International Seminar on Generic Programming, Dagstuhl Castle, Germany, April 27 - May 1, 1998, Selected Papers. Lecture Notes in Computer Science 1766, Springer 2000, ISBN 3-540-41090-2 [contents]
1990 – 1999
- 1998
- [c7]David R. Musser, Sibylle Schupp, Rüdiger Loos:
Requirement Oriented Programming. Generic Programming 1998: 12-24 - [c6]Sibylle Schupp, Rüdiger Loos:
SUCHTHAT - Generic Programming Works. Generic Programming 1998: 133-145 - 1993
- [j14]Rüdiger Loos, Volker Weispfenning:
Applying Linear Quantifier Elimination. Comput. J. 36(5): 450-462 (1993)
1980 – 1989
- 1985
- [c5]Rüdiger Loos:
An Analysis of the Krönecker Algorithm for Factorization of Algebraic Polynomials. AAECC 1985: 325 - 1983
- [j13]Rüdiger Loos:
Computing Rational Zeros of Integral Polynomials by p-adic Expansion. SIAM J. Comput. 12(2): 286-293 (1983) - 1982
- [j12]George E. Collins, Rüdiger G. K. Loos:
The Jacobi symbol algorithm. SIGSAM Bull. 16(1): 12-16 (1982) - [j11]Bruno Buchberger, George E. Collins, Rüdiger Loos, R. Albrecht:
Computer algebra symbolic and algebraic computation. SIGSAM Bull. 16(4): 5 (1982) - [c4]Jacques Calmet, Rüdiger Loos:
Deterministic Versus Probabilistic Factorization of Integral Polynomials. EUROCAM 1982: 117-125 - 1981
- [c3]Rüdiger Loos:
Term Reduction Systems and Algebraic Algorithms. GWAI 1981: 214-234 - 1980
- [j10]Jacques Calmet, Rüdiger Loos:
An Improvement of Rabin's Probabilistic Algorithm for Generating Irreducible Polynomials over GF(p). Inf. Process. Lett. 11(2): 94-95 (1980)
1970 – 1979
- 1978
- [j9]Rüdiger Loos:
Abstracts (Amsterdam 78). ACM Commun. Comput. Algebra 11-12(4-1): 3-6 (1978) - [j8]Rüdiger Loos:
Abstracts (REDUCE newsletter 1.1978). ACM Commun. Comput. Algebra 11-12(4-1): 86-88 (1978) - 1977
- [j7]Rüdiger Loos:
Abstracts. SIGSAM Bull. 11(1): 3-7 (1977) - [j6]Rüdiger Loos:
Amthor's solution of Archimedes' cattle problem. SIGSAM Bull. 11(1): 4-7 (1977) - [j5]Rüdiger Loos:
1977 MACSYMA users' conference. SIGSAM Bull. 11(2): 7-13 (1977) - 1976
- [j4]Rüdiger G. K. Loos:
The algorithm description language ALDES (report). SIGSAM Bull. 10(1): 14-38 (1976) - [j3]Rüdiger Loos, Joachim Neubüser:
Group theoretical computations in mathematical crystallography. SIGSAM Bull. 10(4): 11-18 (1976) - [c2]George E. Collins, Rüdiger Loos:
Polynomial real root isolation by differentiation. SYMSACC 1976: 15-25 - 1975
- [j2]Rüdiger Loos:
Problem #10: the cattle problem of Archimedes. SIGSAM Bull. 9(3): 11-12 (1975) - 1974
- [j1]Rüdiger G. K. Loos:
Toward a formal implementation of computer algebra. SIGSAM Bull. 8(3): 9-16 (1974) - 1973
- [c1]Anthony C. Hearn, Rüdiger G. K. Loos:
Extended polynomial algorithms. ACM Annual Conference 1973: 147-152
Coauthor Index
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.
last updated on 2024-04-24 22:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
