Found 4113 results
Author Title [ Type(Asc)] Year
Technical Report
Luby, M., & Wigderson A. (1995).  Pairwise Independence and Derandomization.
Keshav, S. (1991).  The Packet Pair Flow Control Protocol.
Ibarretxe-Antuñano, I. (2001).  An Overview of Basque Locational Cases: Old Descriptions, New Approaches.
John, R. Saint (1994).  Output Sets, Halting Sets and an Arithmetical Hierarchy for Ordered Subrings of the Real Number Under Blum/Shub/Smale Computation.
Codenotti, B., Leoncini M., & Resta G. (1991).  Oracle Computations in Parallel Numerical Linear Algebra.
Pan, V. (1993).  Optimum Parallel Computations with Band Matrices.
Mańdziuk, J. (1997).  Optimization with the Hopfield network based on correlated noises: an empirical approach.
Behrendt, T., Compton K., & Grdel E. (1993).  Optimization Problems: Expressibility, Approximation Properties and Expected Asymptotic Growth of Optimal Solutions.
Ausiello, G., Italiano G. F., & Nanni U. (1992).  Optimal Traversal of Directed Hypergraphs.
der Heide, F. Meyer auf, Storch M., & Wanka R. (1996).  Optimal Trade-Offs Between Size and Slowdown for Universal Parallel Networks.
Novak, E., & Petras K. (1993).  Optimal Stochastic Quadrature Formulas For Convex Functions.
Luby, M., Sinclair A., & Zuckerman D. (1993).  Optimal Speedup of Las Vegas Algorithms.
Novak, E. (1993).  Optimal Recovery and n-Widths For Convex Classes of Functions.
Luby, M., & Ertel W. (1993).  Optimal Parallelization of Las Vegas Algorithms.
Dahlhaus, E., Hajnal P., & Karpinski M. (1989).  Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs.
Heun, V., & Mayr E. W. (1998).  Optimal Dynamic Embeddings of Complete Binary Trees Into Hypercubes.
Chinrungrueng, C., & Séquin C. H. (1991).  Optimal Adaptive K-means Algorithm with Dynamic Adjustment of Learning Rate.
Buller, A. (1995).  Operations on Multimodal Records: Towards a Computational Cognitive Linguistics.
Berman, P., Charikar M., & Karpinski M. (1997).  On-Line Load Balancing for Related Machines.
Maass, W. (1991).  On-Line Learning with an Oblivious Environment and the Power of Randomization.
Marchetti-Spaccamela, A., Nanni U., & Rohnert H. (1992).  On-Line Graph Algorithms for Incremental Compilation.
Hidber, C. (1998).  Online Association Rule Mining.
Karp, R. M. (1992).  On-Line Algorithms Versus Off-Line Algorithms: How Much Is It Worth to Know the Future?.
Ostrovsky, R., & Wigderson A. (1993).  One-Way Functions Are Essential for Non-Trivial Zero-Knowledge.
Impagliazzo, R., & Luby M. (1989).  One-Way Functions Are Essential for Complexity Based Cryptography (Extended.