default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames B. Saxe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j17]Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, Raymie Stata:
PLDI 2002: Extended static checking for Java. ACM SIGPLAN Notices 48(4S): 22-33 (2013)- 2005
- [j16]David Detlefs, Greg Nelson, James B. Saxe:
Simplify: a theorem prover for program checking. J. ACM 52(3): 365-473 (2005) - [j15]K. Rustan M. Leino, Todd D. Millstein, James B. Saxe:
Generating error traces from verification-condition counterexamples. Sci. Comput. Program. 55(1-3): 209-226 (2005) - 1993
- [j14]Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James B. Saxe:
Finding Extrema with Unary Predicates. Algorithmica 9(6): 591-600 (1993) - [j13]James B. Saxe, James J. Horning, John V. Guttag, Stephen J. Garland:
Using Transformations and Verification in Circuit Design. Formal Methods Syst. Des. 3(3): 181-209 (1993) - [j12]Thomas E. Anderson, Susan S. Owicki, James B. Saxe, Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks. ACM Trans. Comput. Syst. 11(4): 319-352 (1993) - 1991
- [j11]Charles E. Leiserson, James B. Saxe:
Retiming Synchronous Circuitry. Algorithmica 6(1): 5-35 (1991) - 1989
- [j10]Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear-Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. Discret. Comput. Geom. 4: 591-604 (1989) - 1988
- [j9]Charles E. Leiserson, James B. Saxe:
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable. J. Algorithms 9(1): 114-128 (1988) - 1984
- [j8]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. Math. Syst. Theory 17(1): 13-27 (1984) - 1983
- [j7]Ivor Durham, David Alex Lamb, James B. Saxe:
Spelling Correction in User Interfaces. Commun. ACM 26(10): 764-773 (1983) - 1980
- [j6]Jon Louis Bentley, James B. Saxe:
Decomposable Searching Problems I: Static-to-Dynamic Transformation. J. Algorithms 1(4): 301-358 (1980) - [j5]James B. Saxe:
Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time. SIAM J. Algebraic Discret. Methods 1(4): 363-369 (1980) - [j4]Jon Louis Bentley, Dorothea Haken, James B. Saxe:
A general method for solving divide-and-conquer recurrences. SIGACT News 12(3): 36-44 (1980) - [j3]Jon Louis Bentley, James B. Saxe:
Generating Sorted Lists of Random Numbers. ACM Trans. Math. Softw. 6(3): 359-364 (1980) - 1979
- [j2]James B. Saxe:
On the number of range queries in k-space. Discret. Appl. Math. 1(3): 217-225 (1979) - [j1]Jon Louis Bentley, James B. Saxe:
Algorithms on vector sets. SIGACT News 11(2): 36-39 (1979)
Conference and Workshop Papers
- 2003
- [c12]Cormac Flanagan, Rajeev Joshi, Xinming Ou, James B. Saxe:
Theorem Proving Using Lazy Proof Explication. CAV 2003: 355-367 - 2002
- [c11]Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, Raymie Stata:
Extended Static Checking for Java. PLDI 2002: 234-245 - 2001
- [c10]Cormac Flanagan, James B. Saxe:
Avoiding exponential explosion: generating compact verification conditions. POPL 2001: 193-205 - 2000
- [c9]Kenneth L. McMillan, Shaz Qadeer, James B. Saxe:
Induction in Compositional Model Checking. CAV 2000: 312-327 - 1999
- [c8]K. Rustan M. Leino, James B. Saxe, Raymie Stata:
Checking Java Programs via Guarded Commands. ECOOP Workshops 1999: 110-111 - 1992
- [c7]Thomas E. Anderson, Susan S. Owicki, James B. Saxe, Charles P. Thacker:
High Speed Switch Scheduling for Local Area Networks. ASPLOS 1992: 98-110 - [c6]James B. Saxe, Stephen J. Garland, John V. Guttag, James J. Horning:
Using Transformations and Verification in Ciruit Design. Designing Correct Circuits 1992: 1-25 - [c5]James B. Saxe, John V. Guttag, James J. Horning, Stephen J. Garland:
Using Transformations and Verification in Circuit Design. Larch 1992: 201-226 - 1987
- [c4]Alok Aggarwal, Leonidas J. Guibas, James B. Saxe, Peter W. Shor:
A Linear Time Algorithm for Computing the Voronoi Diagram of a Convex Polygon. STOC 1987: 39-45 - 1981
- [c3]Charles E. Leiserson, James B. Saxe:
Optimizing Synchronous Systems. FOCS 1981: 23-36 - [c2]Merrick L. Furst, James B. Saxe, Michael Sipser:
Parity, Circuits, and the Polynomial-Time Hierarchy. FOCS 1981: 260-270 - 1979
- [c1]James B. Saxe, Jon Louis Bentley:
Transforming Static Data Structures to Dynamic Structures (Abridged Version). FOCS 1979: 148-168
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:59 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:
