Publication Search Results

Title	Author	Bibliographic	Date	Group	Links
Adiabatic Effective Lagrangian	J. Moody, A. Shapere, and F. Wilczek	Geometric Phases in Physics, edited by A. Shapere and F. Wilczek, World Scientific Publishing Co.	1989	Algorithms
Fast Learning in Multi-Resolution Hierarchies	J. Moody	Advances in Neural Information Processing Systems, D. Touretzky, editor, Morgan Kauffmann	1989	Algorithms
Fast Learning in Networks of Locally-Tuned Processing Units	J. Moody and C. Darken	Neural Computation, Vol. 1, pp. 289-303	1989	Algorithms
Deferred Data Structuring	R. M. Karp, R. Motwani, and P. Raghaven	SIAM Journal on Computing, Vol. 17, No. 5, pp. 883-902	October 1988	Algorithms
Subtree isomorphism is in random NC	P.B. Gibbons, R. M. Karp, G.L. Miller, and D. Soroker. Edited by J.H. Reif	Proceedings of the Third Aegean Workshop on Computing, VLSI Algorithms and Architectures (AWOC 88), Corfu, Greece, pp. 43-52	July 1988	Algorithms
A randomized parallel branch-and-bound procedure	R. M. Karp and Y. Zhang	Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, pp. 290-300	May 1988	Algorithms
The complexity of parallel search	R.M. Karp, E. Upfal, and A. Wigderson	Journal of Computer and System Sciences, Vol. 36, No. 2. Also in the proceedings of the 17th Annual ACM Symposium on the Theory of Computing, Providence, Rhode Island, May 1985, pp. 225-53	April 1988	Algorithms
Learning with Localized Receptive Fields	J. Moody and C. Darken	Proceedings of the 1988 Connectionist Models Summer School, Hinton, Sejnowski, and Touretzsky, eds. Morgan Kaufmann, pp. 133-143	1988	Algorithms
Internal Representations for Associative Memory	E.B. Baum, J. Moody, and F. Wilczek	Biological Cybernetics, Vol. 59, pp. 217-228	1988	Algorithms
Associative Memories	J. Moody	Chapter II 5, DARPA Neural Network Study Final Report, Richard Lippmann, ed.	1988	Algorithms
A Simplex variant solving an m*d linear program in O(min(m2, d2)) expected number of pivot steps	I. Adler, R. M. Karp, and R. Shamir	Journal of Complexity, Vol. 3, No. 4, pp. 372-87	December 1987	Algorithms
Efficient randomized pattern-matching algorithms	R. M. Karp and M.O. Rabin	IBM Journal of Research and Development, Vol. 31, No. 2, pp. 249-60	March 1987	Algorithms
Perspectives on Associative Memories	J. Moody	Proceedings of the IEEE First International Conference on Neural Networks, pp. III-59	1987	Algorithms
Computable Functions and Complexity in Neural Networks	O. Egecioglu, T.R. Smith, and J. Moody	Real Brains, Artificial Minds, J. L. Casti and A. Karlqvist, eds., Elsevier Science Publishing Co	1987	Algorithms
Global wire routing in two-dimensional arrays	R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani	Algorithmica, Vol. 2, No.1, pp. 113-29	1987	Algorithms
A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only	I. Adler, R. M. Karp, and R. Shamir	Mathematics of Operations Research, Vol. 11, No. 4, pp. 570-90	November 1986	Algorithms
Circuit placements and costs bounds by eigenvector decomposition	J. Frankle and R. M. Karp	Proceedings of the IEEE International Conference on Computer-Aided Design (ICCAD-86), A Conference for the EE CAD Professional. Digest of Technical Papers (Cat. No.86CH2353-1), Santa Clara, California, pp. 414-17	November 1986	Algorithms
FED bin packing for item sizes with distributions on (0,1/2)	S. Floyd and R. M. Karp	Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No. 86CH2354-9), Toronto, Ontario, Canada, pp. 322-30	October 1986	Algorithms
On a search problem related to branch-and-bound procedures	R. M. Karp, M. Saks, and A. Wigderson	Proceedings of the 27th Annual Symposium on Foundations of Computer Science (Cat. No.86CH2354-9), Toronto, Ontario, Canada. Also in IEEE Computer Society Press, Washington D.C., pp.19-28	October 1986	Algorithms
Combinatorics, Complexity and Stochastic Algorithms	R. M. Karp	Informatie, Vol. 28, No. 9, pp. 722-33	September 1986	Algorithms
The complexity of parallel computation	R. M. Karp, Edited by: C.E. Leiserson	Proceedings of the Fourth MIT Conference on Advanced Resarch in VLSI, Cambridge, Massachusetts, pp.197	April 1986	Algorithms
Combinatorics, Complexity, and Randomness	R. M. Karp	Communications of the ACM, Vol. 29, No. 2, pp. 98-109	February 1986	Algorithms
Macroscopic T Nonconservation: Prospects for a New Experiment	W. Bialek, J. Moody, and F. Wilczek	Physical Review Letters, Vol. 56, pp. 1623	1986	Algorithms
Realizations of Magnetic Monopole Gauge Fields: Diatoms and Spin-Precession	J. Moody, A. Shapere, and F. Wilczek	Physical Review Letters, Vol. 56, pp. 893	1986	Algorithms
Monte-Carlo algorithms for the planar multiterminal network reliability problem	R. M. Karp and M. Luby	Journal of Complexity, Vol. 1, No. 1. Also in the Proceedings of the Symposium on the Complexity of Approximately Solved Problems, New York, New York, pp. 45-64, April 1985	October 1985	Algorithms
A fast parallel algorithm for the maximal independent set problem	R. M. Karp and A. Wigderson	Journal of the Association for Computing Machinery, Vol. 32, No. 4, pp. 762-73	October 1985	Algorithms
The complexity of parallel computation	R. M. Karp	Proceedings of the 23rd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, p. 1	October 1985	Algorithms
Prospects for Axion Detection	J. Moody	Dark Matter in the Universe: Proceedings of IAU Symposium 117, Princeton, New Jersey	June 1985	Algorithms
Calculations for Cosmic Axion Detection	L. Krauss, J. Moody, F. Wilczek, and D. Morris	Physical Review Letters, Vol. 55, Issue 17, pp. 1797-1800	1985	Algorithms
A Stellar Energy Loss Mechanism Involving Axions	L.M. Krauss, J. Moody, and F. Wilczek	Physics Letters, Vol. 144B, pp. 391	1984	Algorithms
R. M. Karp and M. Luby	Monte-Carlo algorithms for enumeration and reliability problems	Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp. 56-64	November 1983	Algorithms
Global wire routing in two-dimensional arrays	R. M. Karp, F.T. Leighton, R.L. Rivest, C.D. Thompson, U.V. Vazirani, and V.V. Vazirani	Proceedings of the 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona. Also in IEEE Computer Society Press, Silver Spring, Maryland, pp.453-9	November 1983	Algorithms
Filamentary Galaxy Clustering: A Mapping Algorithm	J. Moody, E.L. Turner, and J.R. Gott III	Astrophysical Journal, Vol. 273, pp. 16-23	October 1983	Algorithms
Searching for an optimal path in a tree with random costs	R. M. Karp and J. Pearl	Artificial Intelligence, Vol. 21, No.1-2, pp. 99-116	March 1983	Algorithms
An efficient approximation scheme for the one-dimensional bin-packing problem	N. Karmarkar and R.M. Karp	Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, pp. 312-20	November 1982	Algorithms
On linear characterizations of combinatorial optimization problems	R. M. Karp, C.H. Papadimitriou	SIAM Journal on Computing, Vol. 11, No. 4, pp. 620-32	November 1982	Algorithms
On the security of ping-pong protocols	D. Dolev, S. Even, and R. M. Karp. Edited by: D. Chaum, R.L. Rivest, and A.T. Sherman	Advances in Cryptology: Proceedings of Crypto 82, Santa Barbara, California, pp. 177-86	August 1982	Algorithms
Dynamic programming meets the principle of inclusion and exclusion	R. M. Karp	Operations Research Letters, Vol. 1, No. 2, pp. 49-51	April 1982	Algorithms
Temperature Profiles Induced by a Scanning CW Laser Beam	J. Moody and R.H. Hendel	Journal of Applied Physics, Vol. 53, Issue 6, pp. 4364-4371	1982	Algorithms
On the security of ping-pong protocols	D. Dolev, S. Even, and R. M. Karp	Information and Control, Vol. 55, No.1-3, pp. 57-68	1982	Algorithms
Maximum matchings in sparse random graphs	R. M. Karp and M. Sipser	Proceedings of the 22nd IEEE Annual Symposium on Foundations of Computer Science, Nashville, Tennessee, pp. 364-75	October 1981	Algorithms
Parametric Shortest Path Algorithms with an Application to Cyclic Staffing	R. M. Karp and J.B. Orlin	Discrete Applied Mathematics (Netherlands), Vol. 3, No. 1, pp. 37-45	February 1981	Algorithms
The Complexity of Testing Whether a Graph is a Superconcentrator	M. Blum, R. M. Karp, O.Vornberger, C.H. Papadimitriou, and M. Yannakakis	Information Processing Letters, Vol. 13, No. 4-5, pp. 164-7	1981	Algorithms
On Linear Characterizations of Combinatorial Optimization Problems	R. M. Karp and C.H. Papadimitriou	Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, Syracuse, New York, pp. 1-9	October 1980	Algorithms
An Algorithm to Solve the mn Assignment Problem in Expected Time O(mn log n)	R. M. Karp	Networks, Vol. 10, No. 2, pp. 143-52	1980	Algorithms
A Patching Algorithm for the Nonsymmetric Traveling-salesman Problem	R. M. Karp	SIAM Journal on Computing, Vol. 8, No. 4, pp. 561-73	November 1979	Algorithms
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems	R. Aleliunas, R. M. Karp, R.J. Lipton, L. Lovasz, and C. Rackoff	Proceedings of the 20th Annual IEEE Symposium of Foundations of Computer Science, San Juan, Puerto Rico, pp. 218-23	October 1979	Algorithms
Recent Advances in the Probabilistic Analysis of Graph-theoretic Algorithms	R. M. Karp, Edited by: Maurer, H.A.	Automata, Languages and Programming, Graz, Austria, Springer-Verlag, pp. 338-9	July 1979	Algorithms
Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems	R. Aleliunas, R. M. Karp, R.J. Lipton, and L. Lovasz	Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, Canada, pp. 174-6	May 1979	Algorithms
Probabilistic Analysis of Graph-theoretic Algorithms	R. M. Karp	Proceedings of the Computer Science and Statistics 12th Annual Symposium on the Interface, Waterloo, Ontario, pp. 173	May 1979	Algorithms

Pages