default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Moll
Person information
- affiliation: University of Massachusetts Amherst, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[c14]Hannah Blau, Samantha Kolovson, W. Richards Adrion, Robert Moll:
Automated style feedback for advanced beginner Java programmers. FIE 2016: 1-9
2000 – 2009
- 2005
- [c13]Chun Zhang, Yong Liu, Weibo Gong, James F. Kurose, Robert Moll, Donald F. Towsley
:
On optimal routing with multiple traffic matrices. INFOCOM 2005: 607-618 - 2004
- [c12]Yuandong Yang, Oliver Brock, Robert N. Moll:
Efficient and robust computation of an approximated medial axis. Symposium on Solid Modeling and Applications 2004: 15-24 - 2000
- [c11]Robert Moll, Theodore J. Perkins, Andrew G. Barto:
Machine Learning for Subproblem Selection. ICML 2000: 615-622
1990 – 1999
- 1998
- [c10]Robert Moll, Andrew G. Barto, Theodore J. Perkins, Richard S. Sutton:
Learning Instance-Independent Value Functions to Enhance Local Search. NIPS 1998: 1017-1023 - 1995
- [j4]Ugo A. Buy, Robert Moll:
A Specification-Based Approach to Concurrency Analysis. Autom. Softw. Eng. 2(4): 265-309 (1995) - 1994
- [c9]Mahesh Girkar, Robert Moll:
New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes. CONCUR 1994: 65-80 - 1993
- [c8]Mahesh Girkar, Robert Moll:
Vector Sequence Analysis and Full Weak Safety for Concurrent Systems. FCT 1993: 256-265 - 1992
- [p1]Bruce MacLeod, Robert Moll:
A Principled Approach to Solving Complex Discrete Optimization Problems. Computer Science and Operations Research 1992: 3-21 - 1990
- [c7]Ugo A. Buy, Robert Moll:
A Proof Lattice-Based Technique for Analyzing Liveness of Resource Controllers. CAV 1990: 292-301 - [c6]Ugo A. Buy, Robert Moll:
Liveness Analysis and the Automatic Generation of Concurrent Programs. CAV (DIMACS/AMS volume) 1990: 535-550 - [c5]Bruce MacLeod, Robert Moll:
A Toolkit for Vehicle Routing. ICSI 1990: 426-431
1980 – 1989
- 1988
- [b3]Robert N. Moll, Michael A. Arbib, A. J. Kfoury:
An Introduction to Formal Language Theory. Texts and Monographs in Computer Science, Springer 1988, ISBN 0-387-96698-6, pp. i-x, 1-205 - 1982
- [b2]Assaf J. Kfoury, Robert N. Moll, Michael A. Arbib:
A Programming Approach to Computability. Texts and Monographs in Computer Science, Springer 1982, ISBN 978-1-4612-5751-6, pp. i-viii, 1-253 - 1981
- [b1]Michael A. Arbib, Assaf J. Kfoury, Robert N. Moll:
A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science, Springer 1981, ISBN 978-0-387-90573-0, pp. I-VIII, 1-220 - [c4]Balakrishnan Krishnamurthy, Robert N. Moll:
Examples of Hard Tautologies in the Propositional Calculus. STOC 1981: 28-37
1970 – 1979
- 1979
- [j3]Balakrishnan Krishnamurthy, Robert N. Moll:
On the Number of Affine Families of Boolean Functions. Inf. Control. 43(3): 327-337 (1979) - [c3]Robert Moll, John Wade Ulrich:
The Synthesis of Programs by Analogy. IJCAI 1979: 592-594 - 1977
- [c2]John Wade Ulrich, Robert Moll:
Program synthesis by analogy. Artificial Intelligence and Programming Languages 1977: 22-28 - 1976
- [j2]Robert Moll:
An Operator Embedding Theorem for Complexity Classes of Recursive Functions. Theor. Comput. Sci. 1(3): 193-198 (1976) - 1974
- [j1]Robert Moll, Albert R. Meyer:
Honest Bounds for Complexity Classes of Recursive Functions. J. Symb. Log. 39(1): 127-138 (1974) - 1972
- [c1]Albert R. Meyer, Robert Moll:
Honest Bounds for Complexity Classes of Recursive Functions. SWAT 1972: 61-66
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
