Works Published in 1989
Displaying all 16 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1989 chapter
Factorization of polynomials given by straight-line programs
In S. Micali (Ed.), Randomness and Computation, Advances in Computing Research (Vol. 5, pp. 375–412). Greenwhich, Connecticut: JAI Press Inc.
Ed(s): S. Micali
Source: NC State University Libraries
Added: March 26, 2022
1989 conference paper
Parallel algebraic algorithm design
Kaltofen, E. (1989, July). Presented at the 1989 International Symposium on Symbolic and Algebraic Computation, Portland, Oregon.
Event: 1989 International Symposium on Symbolic and Algebraic Computation at Portland, Oregon
Source: NC State University Libraries
Added: March 26, 2022
1989 journal article
Learning to recognize students’ plan in geometry proof using intelligent CAI
Transactions of Information Processing Society of Japan, 30(8), 1046–1057.
Source: NC State University Libraries
Added: December 26, 2021
1989 chapter
Improved sparse multivariate polynomial interpolation algorithms
In Symbolic and Algebraic Computation (pp. 467–474).
Event: International Symposium ISSAC '88 at Rome, Italy on July 4-8, 1988
TL;DR:
This work considers the problem of interpolating sparse multivariate polynomials from their values and presents efficient algorithms for finding the rank of certain special Toeplitz systems arising in the Ben-Or and Tiwari algorithm and for solving transposed Vandermonde systems of equations.
(via Semantic Scholar)
Source: Crossref
Added: June 15, 2021
1989 book
TL;DR:
This volume contains the contributed papers accepted for presentation, selected from 85 drafts submitted in response to the call for papers.
(via Semantic Scholar)
Source: Crossref
Added: June 15, 2021
1989 conference paper
Computing the irreducible real factors and components of an algebraicf curve
In K. Mehlhorn (Ed.), Proceedings of the fifth annual symposium on Computational geometry - SCG '89 (pp. 79–87).
Ed(s): K. Mehlhorn
Event: Fifth annual symposium on Computational geometry
Source: Crossref
Added: June 15, 2021
1989 conference paper
Solving systems of nonlinear polynomial equations faster
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium.
Event: the ACM-SIGSAM 1989 international symposium
TL;DR:
This paper considers projective problems, that is, the polynomials are homogeneous and the solutions are sought in n-dimensional projective space, and shows that the solutions of an affine system are specializations of the solution rays of its homogenized projective version.
(via Semantic Scholar)
Source: Crossref
Added: January 24, 2021
1989 chapter
Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices
In Lecture Notes in Computer Science (pp. 317–322).
TL;DR:
The method employs randomization as a tool to remove the iterations along the main diagonal in the classical sequential algorithms, and as such might be useful in similar settings, as well as may speed the sequential methods themselves.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1989 journal article
Computing greatest common divisors and factorizations in quadratic number fields
Mathematics of Computation, 53(188), 697–697.
TL;DR:
It is shown that there does not even exist an input in these domains for which the GCD computation becomes possible by allowing nondecreasing norms or remainders whose norms are not as small as possible.
(via Semantic Scholar)
www.ams.org (publisher PDF)
Source: Crossref
Added: August 28, 2020
1989 conference paper
An improved Las Vegas primality test
Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation - ISSAC '89. Presented at the the ACM-SIGSAM 1989 international symposium.
Event: the ACM-SIGSAM 1989 international symposium
TL;DR:
A modification of the Goldwasser-Kilian-Atkin primality test, which, when given an input n, outputs either prime or composite, along with a certificate of correctness which may be verified in polynomial time.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1989 journal article
Course Outline: Course Announcement (Spring 1989) CSE/OR 691 I: Surviving Intractability
SIGACT News, 20(4), 74–77.
Event: at New York, NY, USA
TL;DR:
The objectives of this course are to acquaint the student with the theoretical concept of in tractability and develop an ability to recognize provably intractable problems.
(via Semantic Scholar)
Source: ORCID
Added: December 7, 2019
1989 conference paper
Constrained planar embedding problems
Proceedings 27th Annual Allerton Conference on Communication, Control, and Computing, 58–67.
Source: ORCID
Added: December 7, 2019
1989 journal article
Constructive belief and rational representation
Computational Intell, 5(1), 1–11.
Contributors: J. Doyle*
TL;DR:
It is argued that a more illuminating view is that belief is the result of rational representation, and in this theory, the agent obtains its constructive beliefs by using its manifest beliefs and preferences to rationally choose the most useful conclusions indicated by the manifest beliefs.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
16. Peace, Justice and Strong Institutions
(OpenAlex)
Source: ORCID
Added: December 5, 2019
1989 conference paper
Adaptive routing and deadlock recovery: a simulation study
Proceedings of the Fourth Conference on Hypercube Concurrent Computers and their Applications. Presented at the The Fourth Conference on Hypercube Concurrent Computers and their Applications, Monterey, CA.
Event: The Fourth Conference on Hypercube Concurrent Computers and their Applications at Monterey, CA on March 6, 1989
Sources: NC State University Libraries, ORCID
Added: April 14, 2019
1989 journal article
Hypercube embedding heuristics: An evaluation
International Journal of Parallel Programming, 18(6), 505–549.
TL;DR:
This paper evaluates several hypercube embedding heuristics, including simulated annealing, local search, greedy, and recursive mincut bipartitioning, and proposes a new greedy heuristic, a new Kernighan-Lin style heuristic), and some new features to enhance local search.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
11. Sustainable Cities and Communities
(Web of Science)
Sources: Crossref, NC State University Libraries, ORCID
Added: March 30, 2019
1989 conference paper
Object-oriented design of finite element programs
91–100. http://www.scopus.com/inward/record.url?eid=2-s2.0-0024863017&partnerID=MN8TOARS
Contributors: J. Baugh & D. Rehak
Source: ORCID
Added: December 6, 2018
Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.
Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.
