Non-Deterministic Algorithms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Non-Deterministic Algorithms

Full text

Pdf (1.23 MB)

Source

ACM Computing Surveys (CSUR) archive
Volume 11 , Issue 2 (June 1979) table of contents

Pages: 79 - 94

Year of Publication: 1979

ISSN:0360-0300

Author

Jacques Cohen

Physics Department, Brandeis University, Waltham, Massachusetts

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 9, Downloads (12 Months): 75, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/356770.356773 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AHO76	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	BITN75	James R. Bitner , Edward M. Reingold, Backtrack programming techniques, Communications of the ACM, v.18 n.11, p.651-656, Nov. 1975 [doi>10.1145/361219.361224]
	BOBR73	Daniel G. Bobrow , Ben Wegbreit, A model and stack implementation of multiple environments, Communications of the ACM, v.16 n.10, p.591-603, Oct. 1973 [doi>10.1145/362375.362379]
	BOBR74	Daniel G. Bobrow , Bertram Raphael, New Programming Languages for Artificial Intelligence Research, ACM Computing Surveys (CSUR), v.6 n.3, p.153-174, Sept. 1974 [doi>10.1145/356631.356632]
	COHE74	COHEN, J, AND CARTON, E "Non-deterministlc Fortran," Comput. J. 17, 1 (Feb. 1974), 44-51.
	COHE75	COHEN, J. "Interpretation of non-deterministic algorithms in higher-level languages," Inf. Process. Lett. 3, 4 (March 1975), 104-109.
	COOK71	Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States [doi>10.1145/800157.805047]
	DERO77	Willem P. de Roever, On Backtracking and Greatest Fixpoints, Proceedings of the Fourth Colloquium on Automata, Languages and Programming, p.412-429, July 18-22, 1977
	DIJK72	DIJKSTRA, E W. "Notes on structured programming," in Structured programmmg, O. J. Dahl (Ed.), Academw Press, New York, 1972, 1-72.
	FLOY67	Robert W. Floyd, Nondeterministic Algorithms, Journal of the ACM (JACM), v.14 n.4, p.636-644, Oct. 1967 [doi>10.1145/321420.321422]
	GOLO65	Solomon W. Golomb , Leonard D. Baumert, Backtrack Programming, Journal of the ACM (JACM), v.12 n.4, p.516-524, Oct. 1965 [doi>10.1145/321296.321300]
	GRIS77	Ralph E. Griswold , David R. Hanson, Language facilities for programmable backtracking, Proceedings of the 1977 symposium on Artificial intelligence and programming languages, p.94-99, August 15-17, 1977
	HOPC69	John E. Hopcroft , Jeffrey D. Ullman, Formal languages and their relation to automata, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1969
	JOHA67	JOHANSEN, P. "Non-deterministic programming," BIT 7 (1967), 289-304
	KNUT75	KNUTH, D. E. "Estimating the efficiency of backtrack programs," Math. Comput. 29, 129 (Jan 1975), 121-136.
	LEWI78	LEWIS, H R., AND PAPADIMITRIOU, C. H. "The efficiency of algorithms," Sc~. Am (Jan. 1978), 96-109.
	MANN76	Zohar Manna, Mathematical Theory of Computation, Dover Publications, Incorporated, 2003
	MCDE74	MCDERMOTT, D. V., AND SUSSMAN, G. J. The Connwer reference manual, AI Memo 259, MIT Project MAC, Cambridge, Mass., Jan 1974.
	MONT77	C. Montangero , G. Pacini , F. Turini, Two-level control structure for nondeterministic programming, Communications of the ACM, v.20 n.10, p.725-730, Oct. 1977 [doi>10.1145/359842.359850]
	MOOR75	Robert C Moore, Reasoning from Incomplete Knowledge in a Procedural Deduction System, Massachusetts Institute of Technology, Cambridge, MA, 1975
	PREN72	Charles J. Prenner , Jay M. Spitzen , Ben Wegbreit, An implementation of backtracking for programming languages, Proceedings of the ACM annual conference, p.763-771, August 01-01, 1972, Boston, Massachusetts, United States [doi>10.1145/800194.805856]
	SELF75	SELF, J A. "Embedding nondetermin- 1sin," Softw. Pract Exper. 5 (1975), 221- 227.
	SINT76	SINTZOFF, M. "Eliminating blind alleys from backtrack programs," Thwd Int. Colloquium on Automata, Languages and Programming, Lecture Notes m Computer Science, Springer-Verlag, 1976, New York
	SMIT73	SMITH, D. C., AND EN~A, H. J. "Backtracking in MLISP2," in Proc Thwd Int. Conf. Art~fictal Intelligence, 1973, 671- 685.
	WALK60	WALKER, R. J. "An enumerative technique for a class of combinatorial problems," m Combmatortal analysts; Proc. Symp. Apphed Mathemattcs, Vol X, American Mathematical Socmty, Providence, R.I, 1960
	WIRT76	Niklaus Wirth, Algorithms & data structures, Prentice-Hall, Inc., Upper Saddle River, NJ, 1985

CITED BY 7

	Franco Turini, Magma2: a language oriented toward experiments in control, ACM Transactions on Programming Languages and Systems (TOPLAS), v.6 n.4, p.468-486, Oct. 1984
	Krzysztof R. Apt , Jacob Brunekreef , Vincent Partington , Andrea Schaerf, Alma-O: an imperative language that supports declarative programming, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.5, p.1014-1066, Sept. 1998
	Krzysztof R. Apt , Andrea Schaerf, Search and imperative programming, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.67-79, January 15-17, 1997, Paris, France
	Cengiz Erbas , Seyed Sarkeshik , Murat M. Tanik, Different perspectives of the N-Queens problem, Proceedings of the 1992 ACM annual conference on Communications, p.99-108, March 03-05, 1992, Kansas City, Missouri, United States
	Jacques Cohen, Describing Prolog by its interpretation and compilation, Communications of the ACM, v.28 n.12, p.1311-1324, Dec. 1985
	B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin
	Nicolas Beldiceanu , Mats Carlsson , Romuald Debruyne , Thierry Petit, Reformulation of Global Constraints Based on Constraints Checkers, Constraints, v.10 n.4, p.339-362, October 2005