default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonard Berman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2004
[c9]Jean-Pierre Prost, Leonard Berman, Rong N. Chang
, Murthy V. Devarakonda, Matt Haynos, Wen-Syan Li, Ying Li, Inderpal Narang, Jay Unger, Dinesh C. Verma:
Developing innovative technologies for commercial grids. High Performance Computing Workshop 2004: 377-401- 2003
- [c8]Haifeng Xi, Heng Cao, Leonard Berman, David L. Jensen:
Supply chain simulation: distributed supply chain simulation using a generic job running framework. WSC 2003: 1305-1312
1980 – 1989
- 1988
- [c7]Steven Rudich, Leonard Berman:
Optimal Circuits and Transitive Automorphism Groups. ICALP 1988: 516-524 - 1987
- [j6]Jik H. Chang, Oscar H. Ibarra, Bala Ravikumar, Leonard Berman:
Some Observations Concerning Alternating Turing Machines Using Small Space. Inf. Process. Lett. 25(1): 1-9 (1987) - 1981
- [j5]Lawrence T. Kou, George Markowsky, Leonard Berman:
A Fast Algorithm for Steiner Trees. Acta Informatica 15: 141-145 (1981) - [c6]Leonard Berman:
On logic comparison. DAC 1981: 854-861 - 1980
- [j4]Leonard Berman:
The Complexity of Logical Theories. Theor. Comput. Sci. 11: 71-77 (1980)
1970 – 1979
- 1978
- [j3]Juris Hartmanis, Leonard Berman:
On Polynomial Time Isomorphisms of Some New Complete Sets. J. Comput. Syst. Sci. 16(3): 418-422 (1978) - 1977
- [j2]Leonard Berman, Juris Hartmanis:
On Isomorphisms and Density of NP and Other Complete Sets. SIAM J. Comput. 6(2): 305-322 (1977) - [c5]Leonard Berman:
Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report. FOCS 1977: 95-99 - [c4]Leonard Berman, Juris Hartmanis:
On polynomial time isomorphisms of complete sets. Theoretical Computer Science 1977: 1-16 - 1976
- [j1]Juris Hartmanis, Leonard Berman:
On Tape Bounds for Single Letter Alphabet Language Processing. Theor. Comput. Sci. 3(2): 213-224 (1976) - [c3]Leonard Berman:
On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup. FOCS 1976: 76-80 - [c2]Juris Hartmanis, Leonard Berman:
On Isomorphisms and Density of NP and Other Complete Sets. STOC 1976: 30-40 - 1975
- [c1]Juris Hartmanis, Leonard Berman:
A Note on Tape Bounds for SLA Language Processing. FOCS 1975: 65-70
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 23:04 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:
