Publications

Found 4101 results
Author Title Type [ Year(Asc)]
1989
Feldman, J. (1989).  Neural Representations of Conceptual Knowledge.
Frederickson, G. N., & Guan D.. J. (1989).  Nonpreemptive Ensemble Motion Planning on a Tree.
Goldreich, O. (1989).  A Note on Computational Indistinguishability.
Impagliazzo, R., & Luby M. (1989).  One-Way Functions Are Essential for Complexity Based Cryptography (Extended.
Shenker, S., & Weinrib A. (1989).  The Optimal Control of Heterogeneous Queuing Systems: A Paradigm for Load-Sharing and Routing. IEEE Transactions of Computers. 38(12), 1724-1735.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Hambrusch, S. E., & Luby M. (1989).  Parallel Asynchronous Connected Components in a Mesh.
Karp, R. M., & Zhang Y. (1989).  On Parallel Evaluation of Game Trees.
Karp, R. M., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Hambrusch, S. E., & TeWinkel L. (1989).  Parallel Heuristics for the Steiner Tree Problem in Images without Sorting or Routing.
Ladkin, P., & Maddux R. D. (1989).  Parallel Path-Consistency Algorithms for Constraint Satisfaction.
Beame, P., & Luby M. (1989).  Parallel Search for Maximal Independence Given Minimal Dependence.
Frederickson, G. N. (1989).  Planar Graph Decomposition and All Pairs Shortest Paths.
Ladkin, P. (1989).  The Possibility of an Executable Specification Language.
Frederickson, G. N., & Guan D.. J. (1989).  Preemptive Ensemble Motion Planning on a Tree.
Kannan, S. (1989).  Program Checkers for Algebraic Problems.
Kannan, S. (1989).  Program Checkers for Algebraic Problems (Thesis).
Feldman, J., Lim C-C., & Mazzanti F. (1989).  pSather monitors: Design, Tutorial, Rationale and Implementation.
Impagliazzo, R., & Luby M. (1989).  Pseudo-Random Number Generator From ANY One-Way Function.
Ferrari, D. (1989).  Real-Time Communication in Packet-Switching Wide-Area Networks.
Luby, M. (1989).  Removing Randomness in Parallel Computation Without a Processor Penalty.
Ferrari, D., & Verma D. C. (1989).  A Scheme for Real-Time Channel Establishment in Wide-Area Networks.
Cáceres, R. (1989).  Separating Abstraction from Implementation in Communication Network Design.
S. McCormick, T., Pinedo M. L., Shenker S., & Wolf B. (1989).  Sequencing in an Assembly Line with Blocking to Minimize Cycle Time. Operations Research. 37(6), 925-935.

Pages