TY - CHAP
TI - Polynomial factorization 1982-1986
AU - Kaltofen, E.
T2 - Computers in Mathematics, Lecture Notes in Pure and Applied Mathematics
A2 - Chudnovsky, D.V.
A2 - Jenks, R.D.
PY - 1990///
VL - 125
SP - 285–309
PB - Marcel Dekker, Inc
ER -
TY - CONF
TI - Computer mathematics systems and a trilateral approach to human resource development in technical occupations
AU - Rebne, D.
AU - Kaltofen, E.
A2 - Estes, N.
A2 - Heene, J.
A2 - Leclercq, D.
C2 - 1990///
C3 - Proceedings of the 7th International Conference on Technology and Education
DA - 1990///
VL - 1
SP - 251–253
PB - CEP Consultants Ltd
ER -
TY - JOUR
TI - Algebraic Computational Complexity
T2 - Journal of Symbolic Computation
DA - 1990///
PY - 1990///
VL - 9
IS - 3
ER -
TY - CHAP
TI - Knowledge communication
AU - Matsuda, N.
AU - Hatano, Kazuhiko
T2 - Artificial Intelligence and Tutoring Systems
A2 - Okamoto, T.
A2 - Mizoguchi, Riichiro
PY - 1990///
SP - 447–456
PB - Ohmu Inc
ER -
TY - CHAP
TI - What is CAI?
AU - Matsuda, N.
T2 - Introduction to C Programming
A2 - Okamoto, T.
PY - 1990///
SP - 201–236
PB - Personal Media
ER -
TY - JOUR
TI - An automatic generation of knowledge-base for an intelligent CAI on geometry theorem proving and a GUI to draw geometric figures
AU - Matsuda, N.
AU - Okamoto, T.
T2 - Transactions of the Institution of Electronics, Information, and Communication Engineering
DA - 1990///
PY - 1990///
VL - J73-D-II
IS - 1
SP - 88–99
ER -
TY - JOUR
TI - Parallel algorithms for matrix normal forms
AU - Kaltofen, Erich
AU - Krishnamoorthy, M.S.
AU - Saunders, B. David
T2 - Linear Algebra and its Applications
AB - Here we offer 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. The algorithm has two important advantages over our previous one: the multipliers relating the Smith form to the input matrix are computed, and the algorithm is probabilistic of Las Vegas type, i.e., always finds the correct answer. The Smith form algorithm is also a good sequential algorithm. Our algorithm reduces the problem of Smith form computation to two Hermite form computations. Thus the Smith form problem has complexity asymptotically that of the Hermite form problem. We also construct fast parallel algorithms for Jordan normal form and testing similarity of matrices. Both the similarity and non-similarity problems are in the complexity class RNC for the usual coefficient fields, i.e., they can be probabilistically decided in polylogarithmic time using polynomially many processors.
DA - 1990/7/15/
PY - 1990/7/15/
DO - 10.1016/0024-3795(90)90028-b
VL - 136
SP - 189–208
SN - 0024-3795
UR - http://dx.doi.org/10.1016/0024-3795(90)90028-b
ER -
TY - CONF
TI - Group Intentions
AU - Singh, Munindar P.
C2 - 1990/10//
C3 - Proceedings of the 10th Workshop on Distributed Artificial Intelligence
DA - 1990/10//
SP - 1–26
ER -
TY - CONF
TI - Towards a Theory of Situated Know-how
AU - Singh, Munindar P.
C2 - 1990/8//
C3 - Proceedings of the 9th European Conference on Artificial Intelligence (ECAI)
DA - 1990/8//
SP - 604–609
ER -
TY - CHAP
TI - Group Ability and Structure
AU - Singh, Munindar P.
T2 - Decentralized Artificial Intelligence
A2 - Demazeau, Yves
A2 - Müller, Jean-Pierre
PY - 1990/8//
VL - 2
SP - 127–145
PB - Elsevier/North-Holland
ER -
TY - JOUR
TI - Computing with polynomials given byblack boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators
AU - Kaltofen, Erich
AU - Trager, Barry M.
T2 - Journal of Symbolic Computation
AB - Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with rational coefficients, that of black boxes for their evaluation. We show that within this representation the polynomial greatest common divisor and factorization problems, as well as the problem of extracting the numerator and denominator of a rational function, can all be solved in random polynomial-time. Since we can convert black boxes efficiently to sparse format, problems with sparse solutions, e.g., sparse polynomial factorization and sparse multivariate rational function interpolation, are also in random polynomial time. Moreover, the black box representation is one of the most space efficient implicit representations that we know. Therefore, the output programs can be easily distributed over a network of processors for further manipulation, such as sparse interpolation.
DA - 1990/3//
PY - 1990/3//
DO - 10.1016/s0747-7171(08)80015-6
VL - 9
IS - 3
SP - 301-320
J2 - Journal of Symbolic Computation
LA - en
OP -
SN - 0747-7171
UR - http://dx.doi.org/10.1016/s0747-7171(08)80015-6
DB - Crossref
ER -
TY - CONF
TI - Modular rational sparse multivariate polynomial interpolation
AU - Kaltofen, E.
AU - Lakshman, Y. N.
AU - Wiley, J.-M.
T2 - the international symposium
AB - The problem of interpolating multivariate polynomials whose coefficient domain is the rational numbers is considered. The effect of intermediate number growth on a speeded Ben-Or and Tiwari algorithm is studied.Then the newly developed modular algorithm is presented. The computing times for the speeded Ben-Or and Tiwari and the modular algorithm are compared, and it is shown that the modular algorithm is markedly superior.
C2 - 1990///
C3 - Proceedings of the international symposium on Symbolic and algebraic computation - ISSAC '90
DA - 1990///
DO - 10.1145/96877.96912
PB - ACM Press
SN - 0201548925
UR - http://dx.doi.org/10.1145/96877.96912
DB - Crossref
ER -
TY - JOUR
TI - Computing the irreducible real factors and components of an algebraic curve
AU - Kaltofen, Erich
T2 - Applicable Algebra in Engineering, Communication and Computing
DA - 1990/9//
PY - 1990/9//
DO - 10.1007/bf01810297
VL - 1
IS - 2
SP - 135-148
J2 - AAECC
LA - en
OP -
SN - 0938-1279 1432-0622
UR - http://dx.doi.org/10.1007/bf01810297
DB - Crossref
ER -
TY - CONF
TI - Hot-Spot Performance of Single-Stage and Multistage Interconnection Networks
AU - Gunter, K.G.
AU - Gehringer, E.F.
T2 - DMCC-5: Fifth Distributed Memory Computing Conference
C2 - 1990///
C3 - Proceedings of the Fifth Distributed Memory Computing Conference
CY - Charleston, SC
DA - 1990///
PY - 1990/4//
DO - 10.1109/dmcc.1990.556269
PB - IEEE
SN - 0818621133
UR - http://dx.doi.org/10.1109/dmcc.1990.556269
ER -
TY - CHAP
TI - Dimensions of Addressing Schemes
AU - Sarkar, Manojit
AU - Gehringer, Edward F.
T2 - Security and Persistence
A2 - Rosenberg, J.
A2 - Keedy, J.L.
T3 - Workshops in Computing
AB - This paper attempts to bring some order to the apparent disorder of numerous addressing schemes. Various addressing strategies are examined, and four orthogonal dimensions identified. These are: (i) number of address spaces per system, (ii) number of address-mapping tiers, (iii) when and how often mapping functions are performed and (iv) implementation of the access matrix (via capabilities or access-control lists). The number of address-mapping tiers in a system is directly related to the number of different forms of addresses present in the system. We discuss the functionality that can be achieved by the various options along the four dimensions. We focus on three important functionalities: sharing, protection and persistence. The functionality of dynamic linking is also discussed briefly. Twelve commercial and research computer systems have been selected and classified into three categories: (i) ordinary virtual-memory systems, (ii) non-persistent object systems and (iii) persistent object systems. The success of these systems in providing the above functionalities is traced back to their addressing schemes.KeywordsAddress SpaceDynamic LinkVirtual MemoryAddress MappingPhysical AddressThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
PY - 1990///
DO - 10.1007/978-1-4471-3178-6_3
SP - 31-47
PB - Springer London
SN - 9783540196464 9781447131786
UR - http://dx.doi.org/10.1007/978-1-4471-3178-6_3
ER -
TY - JOUR
TI - Unconstrained via minimization for topological multilayer routing
AU - Stallmann, Matthias
AU - Hughes, Thomas
AU - Liu, Wentai
T2 - IEEE transactions on computer-aided design of integrated circuits and systems
DA - 1990///
PY - 1990///
VL - 9
IS - 9
SP - 970-980
ER -
TY - JOUR
TI - Solving some combinatorial problems on arrays with one-way dataflow
AU - Savage, Carla D
AU - Stallmann, Matthias
AU - Perry, Jo Ellen
T2 - Algorithmica
DA - 1990///
PY - 1990///
VL - 5
IS - 1-4
SP - 179-199
ER -
TY - CONF
TI - Local search variants for hypercube embedding
AU - Chen, Woei-Kae
AU - Stallmann, Matthias FM
T2 - IEEE
C2 - 1990///
C3 - Proceedings of the Fifth Distributed Memory Computing Conference, 1990.
DA - 1990///
VL - 2
SP - 1375-1383
ER -
TY - JOUR
TI - Book review: Philosophical Logic and Artificial Intelligence. Edited by Richmond H. Thomason (Kluwer Academic Publishers, 1989)
AU - Doyle, Jon
T2 - SIGART Bull.
AB - This book represents a welcome departure from the past. Many readers in AI avoid looking at books on philosophy and artificial intelligence, at least after seeing one or two of the genre. The reason for this disinterest is aptly captured by Thomason in his introduction to the present volume, which expands on a special issue of the Journal of Philosophical Logic published in 1988.
DA - 1990/11/1/
PY - 1990/11/1/
DO - 10.1145/122388.1062340
VL - 2
IS - 1
SP - 77-78
ER -
TY - JOUR
TI - Perceptive questions about computation and cognition
AU - Doyle, Jon
T2 - Behav Brain Sci
DA - 1990///
PY - 1990///
DO - 10.1017/s0140525x00080754
VL - 13
IS - 04
SP - 661
ER -
TY - CONF
TI - B-HIVE: hardware and software for an experimental multiprocessor
AU - Agrawal, D.P.
AU - Alexander, W.E.
AU - Gehringer, E.F.
AU - Mauney, J.
AU - Miller, T.K.
T2 - Twenty-Third Annual Hawaii International Conference on System Sciences
AB - B-HIVE, a 24-node experimental multiprocessor computer, is based on a generalized hypercube interconnection structure and features two processors at each node: one to perform application processing and the other to handle communication. The design of the B-HIVE hardware and software is intended to keep run-time overhead to a minimum, and thus provide high performance on a variety of problems, especially signal and image processing. Topics addressed include the B-HIVE multicomputer architecture and node structure, interprocessor communication, software support, and project status. >
C2 - 1990///
C3 - Twenty-Third Annual Hawaii International Conference on System Sciences
DA - 1990///
PY - 1990/1//
DO - 10.1109/hicss.1990.205097
PB - IEEE Computer Society Press
UR - http://dx.doi.org/10.1109/hicss.1990.205097
ER -
TY - CHAP
TI - Name-Based Mapping: Addressing Support for Persistent Objects
AU - Gehringer, Edward F.
T2 - Persistent Object Systems
PY - 1990///
DO - 10.1007/978-1-4471-3173-1_14
SP - 218-232
OP -
PB - Springer London
SN - 9783540196266 9781447131731
UR - http://dx.doi.org/10.1007/978-1-4471-3173-1_14
DB - Crossref
ER -
TY - CONF
TI - The role of FARAD in food contamination mitigation and prevention
AU - Craigmill, A. L.
AU - Sundlof, S. F.
AU - Riviere, J. E.
C2 - 1990///
C3 - Veterinary Pharmacology, Toxicology and Therapy in Food Producing Animals. Proceed. 4th Congress European Assoc. Vet. Pharmacol. Toxicol.
DA - 1990///
VL - 4
SP - 255-258
SN - 9637149120
ER -