Works Published in 1985
Displaying all 20 works
Sorted by most recent date added to the index first, which may not be the same as publication date order.
1985 book
Assessing the advantages of tagged architectures
Computer Studies Program, North Carolina State University.
Source: ORCID
Added: July 13, 2022
1985 report
The integer manipulation techniques can compete with the linear algebra methods for solving sparse linear systems
(Technical Report No. 85-6). State University of New York at Albany, Computer Science Department.
Source: NC State University Libraries
Added: March 26, 2022
1985 conference paper
Granularity of parallel computation
In E. L. Galizzi (Ed.), Proceedings of the 18th Hawaii Conference on Systems Sciences (Vol. 1, pp. 249–256).
Ed(s): E. Galizzi
Event: The 18th Hawaii Conference on Systems Sciences
Sources: NC State University Libraries, ORCID
Added: October 28, 2021
1985 conference paper
Superlinear speedup through randomized algorithms
Proceedings of the 14th International Conference on Parallel Processing, 291–300.
Event: The 14th International Conference on Parallel Processing at St. Charles, IL on August 20-23, 1986
Sources: NC State University Libraries, ORCID
Added: October 28, 2021
1985 journal article
Factorization of multivariate polynomials over finite fields
Mathematics of Computation, 45(171), 251–251.
TL;DR:
A probabilistic algorithm that finds the irreducible factors of a bivariate polynomial with coefficients from a finite field in timePolynomial in the input size, i.e., in the degree of the polynomials and log (cardinality of field).
(via Semantic Scholar)
www.ams.org (publisher PDF)
Source: Crossref
Added: June 15, 2021
1985 journal article
Effective Hilbert irreducibility
Information and Control, 66(3), 123–137.
TL;DR:
A probabilistic irreducibility test for sparse multivariate poly omials over arbitrary perfect fields is constructed using a very effective version of the Hilbert Irreducible-n Theorem.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Fast parallel absolute irreducibility testing
Journal of Symbolic Computation, 1(1), 57–67.
TL;DR:
It is established that the set of absolutely irreducible integral polynomials belongs to the complexity class NC of Boolean circuits of polynomial size and logarithmic depth and also to the class of sequentiallyPolynomial-time problems.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 conference paper
Computing with polynomials given by straight-line programs II sparse factorization
26th Annual Symposium on Foundations of Computer Science (sfcs 1985). Presented at the 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
Event: 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
TL;DR:
An algorithm for the factorization of a multivariate polynomial represented by a straight-line program into its irreducible factors represented as sparse polynomials is developed with controllably high probability the correct factorization.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 conference paper
Computing with polynomials given by straight-line programs I: greatest common divisors
Proceedings of the seventeenth annual ACM symposium on Theory of computing - STOC '85. Presented at the the seventeenth annual ACM symposium.
Event: the seventeenth annual ACM symposium
TL;DR:
This work develops algorithms on multivariate polynomials represented by straight-line programs for the greatest common divisor problem and conversion to sparse representation and in random polynomial-time for the usual coefficient fields and output.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
SIAM Journal on Computing, 14(2), 469–489.
TL;DR:
An algorithm is presented which reduces the problem of finding the irreducible factors of f in polynomial-time in the total degree of f and the coefficient lengths of f to factoring a univariate integral polynomials, which implies the following theorem.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Factoring sparse multivariate polynomials
Journal of Computer and System Sciences, 31(2), 265–287.
TL;DR:
A probabilistic reduction for factoring polynomials from multivariate to the bivariate case, over an arbitrary (effectively computable) field, based on an effective version of Hilbert's irreducibility theorem is presented.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 chapter
Sparse hensel lifting
In EUROCAL '85 (pp. 4–17).
TL;DR:
It is shown how the content of the input polynomial in the main variable as a by-product can be taken advantage of when computing the GCD of multivariate polynomials by sparse Hensel lifting.
(via Semantic Scholar)
Source: Crossref
Added: August 28, 2020
1985 journal article
Expert Systems and the “Myth” of Symbolic Reasoning
IEEE Transactions on Software Engineering, SE-11(11), 1386–1390.
Contributors: J. Doyle*
TL;DR:
Elements of the artificial intelligence approach to expert systems offer great productivity advantages over traditional approaches to application systems development, even though the end result may be a program employing no AI techniques.
(via Semantic Scholar)
UN Sustainable Development Goal Categories
8. Decent Work and Economic Growth
(OpenAlex)
Source: ORCID
Added: December 6, 2019
1985 report
Using PQ-trees for planar embedding problems
North Carolina State University. Dept. of Computer Science.
Source: ORCID
Added: December 6, 2019
1985 conference paper
Efficient algorithms for graphic matroid intersection and parity
International Colloquium on Automata, Languages, and Programming, 210–220.
Event: Springer, Berlin, Heidelberg
Source: ORCID
Added: December 6, 2019
1985 journal article
TL;DR:
This work explores some connections between the technique of circumscription in artificial intelligence and the notion of implicit definition in mathematical logic and suggests some implications for artificial intelligence practice.
(via Semantic Scholar)
Source: ORCID
Added: December 5, 2019
1985 report
Assessing the advantages of tagged architectures
(Technical Report No. TR-85-08). Raleigh, NC: Computer Studies Program, North Carolina State University.
Source: NC State University Libraries
Added: April 14, 2019
1985 journal article
The influence of parallel decomposition strategies on the performance of multiprocessor systems
ACM SIGARCH Computer Architecture News, 13(3), 396–405.
TL;DR:
A model for predicting multiprocessor performance on iterative algorithms, where each iteration consists of some amount of access to global data and some amounts of local processing, and a model which measures the cyclic processing power that a multip rocessor can apply to a worldoad with given characteristics.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1985 journal article
Tagged architecture
ACM SIGARCH Computer Architecture News, 13(3), 162–170.
TL;DR:
For computers that are not specifically oriented toward dynamically typed languages, it is shown that tagging fails to achieve these advantages completely, and that most of ' them can be better achieved by extensions of other mechanisms.
(via Semantic Scholar)
Sources: Crossref, NC State University Libraries
Added: March 30, 2019
1985 conference paper
Food Animal Residue Avoidance Databank
Proceedings of the Food Science Symposium VI: Assuring Meat Wholesomeness, The Residue Avoidance Issue, G1–5.
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.
