Publications

Found 595 results
Author Title Type [ Year(Desc)]
Filters: First Letter Of Last Name is A  [Clear All Filters]
1979
Aleliunas, R., Karp R. M., Lipton R. J., & Lovász L. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface. 174-176.
Aleliunas, R., Karp R. M., Lipton R. J., Lovász L., & Rackoff C. (1979).  Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science. 218-223.
1986
Adler, I., Karp R. M., & Shamir R. (1986).  A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only. Mathematics of Operations Research. 11(4), 570-590.
1987
Adler, I., Karp R. M., & Shamir R. (1987).  A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps. Journal of Complexity. 3(4), 372-387.
1989
Angluin, D., Hellerstein L., & Karpinski M. (1989).  Learning Read-Once Formulas with Queries.
Beck, J., Morgan N., Allman A.., & Beer J. (1989).  A Multi-DSP Ring Array for Connectionist Simulations. Proceedings of 23rd Asilomar Conference on Signals, Systems & Computers.
Jähnichen, S., Gabriel R., Weber M., & Anlauff M. (1989).  Supporting Formal Program Developments: the DEVA Environment.
1990
Morgan, N., Asanović K., Kingsbury B., & Wawrzynek J. (1990).  Developments in Digital VLSI Design for Artificial Neural Networks.
Ahmad, S., & Omohundro S. (1990).  A Network for Extracting the Locations of Point Clusters Using Selective Attention.
Anderson, D. P., Herrtwich R. Guido, & Schaefer C. (1990).  SRP: A Resource Reservation Protocol for Guaranteed-Performance Communication in the Internet.
Anderson, D. P., Delgrossi L., & Herrtwich R. Guido (1990).  Structure and Scheduling in Real-Time Protocol Implementations.
Ladkin, P., Anger F. D., & Rodriguez R. V. (1990).  Temporal Resoning with Intervals in Branching Time.
1991
Ausiello, G., Protasi M., & Angelaccio M. (1991).  A Characterization of Space Complexity Cases and Subexponential Time Classesas Limiting Polynomially Decidable Sets.
Ausiello, G., Protasi M., & Angelaccio M. (1991).  A Characterization of Space Complexity Cases and Subexponential Time Classesas Limiting Polynomially Decidable Sets.
Aberer, K. (1991).  Combinatory Differential Fields: An Algebraic Approach to Approximate Computation and Constructive Analysis.
Ahmad, S., & Omohundro S. (1991).  Efficient Visual Search: A Connectionist Solution.
Asanović, K., & Morgan N. (1991).  Experimental Determination of Precision Requirements for Back-Propagation Training of Artificial Neural Networks.
Alpaydin, E. (1991).  GAL: Networks That Grow When They Learn and Shrink When They Forget.
Alon, N., Karp R. M., Peleg D., & West D. (1991).  A Graph-Theoretic Game and its Application to the k-Server Problem.
Asanović, K., Kingsbury B., Morgan N., & Wawrzynek J. (1991).  HiPNeT-1: A Highly Pipelined Architecture for Neural Network Training.
Alt, H., Guibas L. J., Mehlhorn K., Karp R. M., & Wigderson A. (1991).  A Method for Obtaining Randomized Algorithms with Small Tail Probabilities.
Kingsbury, B., Irissou B., Asanović K., Wawrzynek J., & Morgan N. (1991).  Recent Work in VLSI Elements for Digital Implementations of Artificial Neural Networks.
Ajjanagadde, V., & Shastri L. (1991).  Rules and variables in neural nets. 3,
Asanović, K., Beck J., Kingsbury B., Kohn P., Morgan N., & Wawrzynek J. (1991).  SPERT: A VLIW/SIMD Microprocessor for Artificial Neural Network Computations.
Ahmad, S. (1991).  VISIT: An Efficient Computational Model Of Human Visual Attention.

Pages