- CSB - MetaPress - Google - Bing - Yahoo
 | 2004 | |
|---|---|---|
| c9 |      | Jean-Pierre Prost, Leonard Berman, Rong 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. Winter Simulation Conference 2003: 1305-1312 |
| 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 Inf. 15: 141-145 (1981) |
| c6 | | |
| 1980 | ||
| j4 | | |
| 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 |
Colors in the list of coauthors
Last update Sun May 19 08:36:11 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page