Publications

Found 4214 results
Author Title [ Type(Desc)] Year
Technical Report
Gathen, J. von zur, Schlink S., & M. Shokrollahi A. (1997).  Normal Bases via General Gauss Periods.
Wundsam, A., & Yu M. (2012).  NOSIX: A Portable Switch Interface for the Network Operating System.
Goldreich, O. (1989).  A Note on Computational Indistinguishability.
M. Shokrollahi, A., & Stemann V. (1996).  A Note on Matrix Rigidity.
Cleve, R., & Luby M. (1990).  A Note on Self-Testing/Correcting Methods for Trigonometric Functions.
Floyd, S. (1996).  Ns Simulator Tests for Random Early Detection (RED) Gateways.
Adamo, J-M., & Anguita D. (1994).  Object Oriented Design of a BP Neural Network Simulator and Implementation on the Connection Machine (CM-5).
Paterno, F. (1992).  An Object-Oriented Approach to the Design of Graphical User Interface Systems.
Adamo, J-M. (1994).  Object-Oriented Parallel Programming: Design and Development of an Object-Oriented Library for SPMD Programming.
Herrtwich, R. Guido, & Delgrossi L. (1990).  ODA-Based Data Modeling in Multimedia Systems.
Allman, M., Caldwell A.., & Ostermann S. (1997).  ONE: The Ohio Network Emulator.
Impagliazzo, R., & Luby M. (1989).  One-Way Functions Are Essential for Complexity Based Cryptography (Extended.
Ostrovsky, R., & Wigderson A. (1993).  One-Way Functions Are Essential for Non-Trivial Zero-Knowledge.
Karp, R. M. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
Hidber, C. (1998).  Online Association Rule Mining.
Marchetti-Spaccamela, A., Nanni U., & Rohnert H. (1992).  On-Line Graph Algorithms for Incremental Compilation.
Maass, W. (1991).  On-Line Learning with an Oblivious Environment and the Power of Randomization.
Berman, P., Charikar M., & Karpinski M. (1997).  On-Line Load Balancing for Related Machines.
Buller, A. (1995).  Operations on Multimodal Records: Towards a Computational Cognitive Linguistics.
Chinrungrueng, C., & Séquin C. H. (1991).  Optimal Adaptive K-means Algorithm with Dynamic Adjustment of Learning Rate.
Heun, V., & Mayr E. W. (1998).  Optimal Dynamic Embeddings of Complete Binary Trees Into Hypercubes.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Luby, M., & Ertel W. (1993).  Optimal Parallelization of Las Vegas Algorithms.
Novak, E. (1993).  Optimal Recovery and n-Widths For Convex Classes of Functions.
Luby, M., Sinclair A., & Zuckerman D. (1993).  Optimal Speedup of Las Vegas Algorithms.

Pages