default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSteven S. Muchnick
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1997
[b4]Steven S. Muchnick:
Advanced Compiler Design and Implementation. Morgan Kaufmann 1997, ISBN 1-55860-320-4
1980 – 1989
- 1988
- [c15]Robert B. Garner, Anant Agrawal, Faye A. Briggs, Eric W. Brown, David Hough, Bill Joy, Steve R. Kleiman, Steven S. Muchnick, Masood Namjoo, David A. Patterson, Joan M. Pendleton, Richard Tuck:
The Scalable Processor Architecture (SPARC). COMPCON 1988: 278-283 - [c14]Steven S. Muchnick, C. Aoki, V. Ghodsi, M. Helft, M. Lee, Richard Tuck, D. Weaver, A. Wu:
Optimizing Compilers for the SPARC Architecture: An Overview. COMPCON 1988: 284-288 - 1986
- [j6]Evan Adams, Steven S. Muchnick:
Dbxtool: A Window-Based Symbolic Debugger for Sun Workstations. Softw. Pract. Exp. 16(7): 653-669 (1986) - [c13]Evan Adams, Wayne Gramlich, Steven S. Muchnick, Soren Tirfing:
SunPro: Engineering a Pratical Program Development Environment. Advanced Programming Environments 1986: 86-96 - [c12]Steven S. Muchnick, Phillip B. Gibbons:
Efficient instruction scheduling for a pipelined architecture (with retrospective). Best of PLDI 1986: 167-174 - [c11]Phillip B. Gibbons, Steven S. Muchnick:
Efficient instruction scheduling for a pipelined architecture. SIGPLAN Symposium on Compiler Construction 1986: 11-16 - 1982
- [c10]Steven S. Muchnick, Neil D. Jones:
A Fixed-Program Machine for Combinator Expression Evaluation. Symposium on LISP and Functional Programming 1982: 11-20 - [c9]Neil D. Jones, Steven S. Muchnick:
A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures. POPL 1982: 66-74 - 1981
- [b3]Steven S. Muchnick, Neil D. Jones:
Program flow analysis - theory and applications. Prentice Hall software series, Prentice Hall 1981, ISBN 978-0-13-729681-1, pp. I-XVII, 1-418 - 1980
- [c8]Neil D. Jones, Steven S. Muchnick:
Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra. FOCS 1980: 185-190 - [c7]Steven S. Muchnick, Uwe F. Pleban:
A Semantic Comparison of LISP and Scheme. LISP Conference 1980: 56-64
1970 – 1979
- 1979
- [c6]Neil D. Jones, Steven S. Muchnick:
Flow Analysis and Optimization of Lisp-Like Structures. POPL 1979: 244-256 - 1978
- [b2]Neil D. Jones, Steven S. Muchnick:
TEMPO: A Unified Treatment of Binding Time and Parameter Passing Concepts in Programming Languages. Lecture Notes in Computer Science 66, Springer 1978, ISBN 3-540-09085-1 - [j5]Neil D. Jones, Steven S. Muchnick:
The Complexity of Finite Memory Programs with Recursion. J. ACM 25(2): 312-321 (1978) - 1977
- [j4]Neil D. Jones, Steven S. Muchnick:
Even Simple Programs Are Hard To Analyze. J. ACM 24(2): 338-350 (1977) - 1976
- [j3]Steven S. Muchnick:
The Vectorized Grzegorczyk Hierarchy. Math. Log. Q. 22(1): 441-480 (1976) - [j2]Steven S. Muchnick:
Computational Complexity of Multiple Recursive Schemata. SIAM J. Comput. 5(3): 427-451 (1976) - [c5]David R. Cheriton, Steven S. Muchnick, Hasan H. Sayani, Robert Trueman Tomlinson, Ronnie G. Ward, Darrell L. Ward:
Sigops(Paper Session). ACM Annual Conference 1976: 361 - [c4]Steven S. Muchnick:
The command interpreter and command language design of the com-share COMMANDER II system. ACM Annual Conference 1976: 367-372 - [c3]Neil D. Jones, Steven S. Muchnick:
Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language. POPL 1976: 77-94 - 1975
- [c2]Neil D. Jones, Steven S. Muchnick:
Even Simple Programs are Hard to Analyze. POPL 1975: 106-118 - 1974
- [b1]Steven S. Muchnick:
Structure and Complexity in Subrecursive Computation. Cornell University, USA, 1974 - 1972
- [j1]Robert L. Constable, Steven S. Muchnick:
Subrecursive Program Schemata I & II: I. Undecidable Equivalence problems; II. Decidable Equivalence Problems. J. Comput. Syst. Sci. 6(6): 480-537 (1972) - [c1]Robert L. Constable, Steven S. Muchnick:
Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems. STOC 1972: 1-17
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 2024-04-24 22:58 CEST 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:
