Works Published in 1988
Displaying all 18 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1988 chapter
Drill, Practice, and Machine Learning
In T. Okamoto, K. Akahori, & S. Yokoyama (Eds.), Computer environments for children (pp. 21–40). Tokyo, Japan: Personal Media.
Ed(s): T. Okamoto, K. Akahori & S. Yokoyama
Source: NC State University Libraries
Added: December 26, 2021
1988 journal article
An intelligent CAI for geometry proof
Transactions of Information Processing Society of Japan, 29(3), 311–324.
Source: NC State University Libraries
Added: December 26, 2021
1988 conference paper
Planning and Necessity
Proceedings of the 3rd Rocky Mountain Conference on Artificial Intelligence, 46–55. Denver.
Source: NC State University Libraries
Added: February 6, 2021
1988 conference paper
Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. Presented at the [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
Event: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
TL;DR:
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, and it is shown that within this evaluation-box 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 be solved in random polynometric time.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
4. Quality Education
(OpenAlex)
Source: Crossref
Added: August 28, 2020
1988 journal article
Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits
SIAM Journal on Computing, 17(4), 687–695.
TL;DR:
A new parallel algorithm is given to evaluate a straight line program over a commutative semi-ring R of degree d and size n in time O(log n( log nd)) using M(n) processors, where M( n) is the number of processors required for multiplying n×n matrices over the semi- ring R in O (log n) time.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1988 journal article
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM, 35(1), 231–264.
TL;DR:
It is shown that most algebraic algorithms can be probabilistically applied to data that are given by a straight-line computation, and every degree-bounded rational function can be computed fast in parallel, that is, in polynomial size and polylogarithmic depth.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1988 journal article
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software, 14(3), 218–240.
TL;DR:
This work discusses the design, implementation, and benchmarking of a system that can manipulate symbolic expressions represented by their straight-line computations capable of performing rational arithmetic on, evaluating, differentiating, taking greatest common divisors of, and factoring polynomials instraight-line format.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1988 journal article
Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
ACM SIGSAM Bulletin, 22(2), 41–49.
TL;DR:
Two significant developments can be distinguished in the theory of algebraic algorithm design: that of fast algorithms in terms of counting the arithmetic operations, and the actual bit complexity when such algorithms are performed for concrete fields, in particular the rational numbers.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1988 report
A one-way linear array algorithm for the median filter
North Carolina State University. Center for Communications and Signal Processing.
Source: ORCID
Added: December 6, 2019
1988 conference paper
A fault-tolerant communication system for the B-Hive generalized hypercube multiprocessor
Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -. Presented at the the third conference.
Event: the third conference
TL;DR:
An algorithm is described that routes messages efficiently in a network where large portions are not functioning, and the routing algorithm is adapted to perform a broadcast.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 conference paper
A graph-oriented mapping strategy for a hypercube
Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -. Presented at the the third conference.
Event: the third conference
TL;DR:
This paper presents a greedy mapping algorithm for hypercube interconnection structures, which utilizes the graph-oriented mapping strategy to map a communication graph to a hypercube.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 conference paper
Rapid prototyping of a parallel operating system for a generalized hypercube
Proceedings of the third conference on Hypercube concurrent computers and applications Architecture, software, computer systems, and general issues -. Presented at the the third conference.
Event: the third conference
TL;DR:
B-HIVE is an experimental multiprocessor system under construction at North Carolina State University that is derived from XINU, an operating system designed for teaching purposes that supplied most of the features necessary at the outset of the project.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 journal article
A randomized parallel branch-and-bound algorithm
International Journal of Parallel Programming, 17(3), 277–301.
TL;DR:
It is shown that the performance of randomized algorithms is less affected by factors that prevent most parallel deterministic algorithms from attaining their theoretical speedup bounds and reliability is enhanced because the failure of a single processor leads only to degradation, not failure, of the algorithm.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 journal article
Performance effects of architectural complexity in the Intel 432
ACM Transactions on Computer Systems, 6(3), 296–339.
TL;DR:
The results indicate that the Intel 432 could have been speeded up very significantly if a small number of implementation decisions had been made differently, and if incrementally better technology had been used in its construction.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 journal article
A survey of commercial parallel processors
ACM SIGARCH Computer Architecture News, 16(4), 75–107.
TL;DR:
This paper compares eight commercial parallel processors along several dimensions from the standpoint of interconnection structures, memory configurations, and interprocessor communication.
(via Semantic Scholar)
citeseerx.ist.psu.edu (repository)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 journal article
Performance prediction and calibration for a class of multiprocessors
IEEE Transactions on Computers, 37(11), 1353–1365.
MeSH headings : Chromosome Aberrations; Complement System Proteins / deficiency; Female; Humans; Hypergammaglobulinemia / blood; Hypergammaglobulinemia / complications; Hypergammaglobulinemia / immunology; Immunoglobulin G / blood; Middle Aged; Syndrome; Urticaria / blood; Urticaria / complications; Urticaria / genetics; Urticaria / immunology; Vasculitis / blood; Vasculitis / complications; Vasculitis / genetics; Vasculitis / immunology; Vasculitis, Leukocytoclastic, Cutaneous / blood; Vasculitis, Leukocytoclastic, Cutaneous / complications; Vasculitis, Leukocytoclastic, Cutaneous / genetics; Vasculitis, Leukocytoclastic, Cutaneous / immunology
TL;DR:
A model for predicting multiprocessor performance on iterative algorithms is developed and illustrates the significant impact on performance of decomposing an algorithm into parallel processes.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
9. Industry, Innovation and Infrastructure
(Web of Science)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1988 book
File organization and processing
New York: J Wiley.
Source: NC State University Libraries
Added: August 6, 2018
1988 conference paper
Coping with the information explosion in pharmacology: the Food Animal Residue Avoidance Databank
Proc. 6th Biennial Symp. Am. Acad. Vet. Pharmacol. Ther., 6, 82–82.
Source: NC State University Libraries
Added: August 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.
