Works Published in 1990

search works

Displaying works 1 - 20 of 23 in total

Sorted by most recent date added to the index first, which may not be the same as publication date order.

1990 chapter

Polynomial factorization 1982-1986

In D. V. Chudnovsky & R. D. Jenks (Eds.), Computers in Mathematics, Lecture Notes in Pure and Applied Mathematics (Vol. 125, pp. 285–309). New York, NY: Marcel Dekker, Inc.

Ed(s): D. Chudnovsky & R. Jenks

Source: NC State University Libraries
Added: March 26, 2022

1990 conference paper

Computer mathematics systems and a trilateral approach to human resource development in technical occupations

In N. Estes, J. Heene, & D. Leclercq (Eds.), Proceedings of the 7th International Conference on Technology and Education (Vol. 1, pp. 251–253). Edinburgh, United Kingdom: CEP Consultants Ltd.

By: D. Rebne & E. Kaltofen

Ed(s): N. Estes, J. Heene & D. Leclercq

Source: NC State University Libraries
Added: March 26, 2022

1990 journal article

Algebraic Computational Complexity

Journal of Symbolic Computation, 9(3).

Erich Kaltofen

Ed(s): E. Kaltofen

Source: NC State University Libraries
Added: March 26, 2022

1990 chapter

Knowledge communication

In T. Okamoto & R. Mizoguchi (Eds.), Artificial Intelligence and Tutoring Systems (pp. 447–456). Tokyo, Japan: Ohmu Inc.

By: N. Matsuda & K. Hatano

Ed(s): T. Okamoto & R. Mizoguchi

Source: NC State University Libraries
Added: December 26, 2021

1990 chapter

What is CAI?

In T. Okamoto (Ed.), Introduction to C Programming (pp. 201–236). Tokyo, Japan: Personal Media.

By: N. Matsuda

Ed(s): T. Okamoto

Source: NC State University Libraries
Added: December 26, 2021

1990 journal article

An automatic generation of knowledge-base for an intelligent CAI on geometry theorem proving and a GUI to draw geometric figures

Transactions of the Institution of Electronics, Information, and Communication Engineering, J73-D-II(1), 88–99.

By: N. Matsuda & T. Okamoto

Source: NC State University Libraries
Added: December 26, 2021

1990 journal article

Parallel algorithms for matrix normal forms

Linear Algebra and Its Applications, 136, 189–208.

By: E. Kaltofen*, M. Krishnamoorthy* & B. Saunders*

TL;DR: A new randomized parallel algorithm that determines the Smith normal form of a matrix with entries being univariate polynomials with coefficients in an arbitrary field that is probabilistic of Las Vegas type and reduces the problem of Smith form computation to two Hermite form computations. (via Semantic Scholar)
Source: Crossref
Added: June 15, 2021

1990 conference paper

Group Intentions

Proceedings of the 10th Workshop on Distributed Artificial Intelligence, 1–26. Bandera, Texas.

By: M. Singh

Source: NC State University Libraries
Added: February 6, 2021

1990 conference paper

Towards a Theory of Situated Know-how

Proceedings of the 9th European Conference on Artificial Intelligence (ECAI), 604–609. Stockholm.

By: M. Singh

Source: NC State University Libraries
Added: February 6, 2021

1990 chapter

Group Ability and Structure

In Y. Demazeau & J.-P. Müller (Eds.), Decentralized Artificial Intelligence (Vol. 2, pp. 127–145). Amsterdam: Elsevier/North-Holland.

By: M. Singh

Ed(s): Y. Demazeau & J. Müller

Source: NC State University Libraries
Added: February 6, 2021

1990 journal article

Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators

Journal of Symbolic Computation, 9(3), 301–320.

By: E. Kaltofen* & B. Trager*

Source: Crossref
Added: January 24, 2021

1990 conference paper

Modular rational sparse multivariate polynomial interpolation

Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '90. Presented at the the international symposium.

By: E. Kaltofen*, Y. Lakshman* & J. Wiley*

Event: the international symposium

TL;DR: The computing times for the speeded Ben-Or and Tiwari and the modular algorithm are compared, and it is shown that the modular algorithms is markedly superior. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

1990 journal article

Computing the irreducible real factors and components of an algebraic curve

Applicable Algebra in Engineering, Communication and Computing, 1(2), 135–148.

TL;DR: These algorithms are of polynomial bit complexity in the degree of the equation and the size of its coefficients and are based on computing the irreducible complex factors and then investigating high precision complex floating point coefficients of these factors and the complex norms. (via Semantic Scholar)
Source: Crossref
Added: August 28, 2020

1990 conference paper

Hot-Spot Performance of Single-Stage and Multistage Interconnection Networks

Proceedings of the Fifth Distributed Memory Computing Conference. Presented at the DMCC-5: Fifth Distributed Memory Computing Conference, Charleston, SC.

By: K. Gunter* & E. Gehringer*

Event: DMCC-5: Fifth Distributed Memory Computing Conference at Charleston, SC

Sources: Crossref, NC State University Libraries
Added: January 5, 2020

1990 chapter

Dimensions of Addressing Schemes

In J. Rosenberg & J. L. Keedy (Eds.), Security and Persistence (pp. 31–47).

By: M. Sarkar n & E. Gehringer n

Ed(s): J. Rosenberg & J. Keedy

Event: International Workshop on Computer Architectures to Support Security and Persistency of Information at Bremen, Germany on May 8-11, 1990

TL;DR: This paper attempts to bring some order to the apparent disorder of numerous addressing schemes by discussing the functionality that can be achieved by the various options along the four dimensions: sharing, protection and persistence. (via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: January 5, 2020

1990 journal article

Unconstrained via minimization for topological multilayer routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(9), 970–980.

By: M. Stallmann, T. Hughes & W. Liu

Source: ORCID
Added: December 6, 2019

1990 journal article

Solving some combinatorial problems on arrays with one-way dataflow

Algorithmica, 5(1-4), 179–199.

By: C. Savage, M. Stallmann & J. Perry

Source: ORCID
Added: December 6, 2019

1990 conference paper

Local search variants for hypercube embedding

Proceedings of the Fifth Distributed Memory Computing Conference, 1990., 2, 1375–1383.

By: W. Chen & M. Stallmann

Event: IEEE

Source: ORCID
Added: December 6, 2019

1990 journal article

Book review: Philosophical Logic and Artificial Intelligence. Edited by Richmond H. Thomason (Kluwer Academic Publishers, 1989)

SIGART Bull., 2(1), 77–78.

By: J. Doyle*

TL;DR: This book represents a welcome departure from the past, as many readers in AI avoid looking at books on philosophy and artificial intelligence, at least after seeing one or two of the genre. (via Semantic Scholar)
Source: ORCID
Added: December 5, 2019

1990 journal article

Perceptive questions about computation and cognition

Behav Brain Sci, 13(04), 661.

By: J. Doyle*

UN Sustainable Development Goal Categories
4. Quality Education (OpenAlex)
Source: ORCID
Added: December 5, 2019

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.