Travelled to:1 × Canada
1 × Spain
1 × The Netherlands
16 × USA
2 × Italy
Collaborated with:R.A.DeMillo J.F.Naughton R.Sedgewick A.K.Chandra ∅ D.P.Dobkin S.Fortune J.Valdes L.F.Landweber N.E.Young A.S.LaPaugh J.D.Nash R.Kannan R.M.Karp L.J.Stockmeyer A.K.Jones D.A.Schneider M.L.Furst A.J.Perlis E.Cardoza A.R.Meyer S.C.Eisenstat A.Orso D.Liang M.J.Harrold T.A.Budd F.G.Sayward D.Nanongkai A.D.Sarma A.Lall J.(.Xu P.Gemmell R.Rubinfeld M.Sudan A.Wigderson S.C.North G.Vijayan
Talks about:complex (5) program (4) problem (4) polynomi (3) function (3) circuit (3) theori (3) estim (3) vlsi (3) test (3)
Person: Richard J. Lipton
DBLP: Lipton:Richard_J=
Facilitated 4 volumes:
EdEd
EdEdContributed to:
2010
2002
199719941991
1990
19901989
198319831983198219821981198019801979197719761975
197519751974Wrote 30 papers:
- VLDB-2010-NanongkaiSLLX #database
- Regret-Minimizing Representative Databases (DN, ADS, AL, RJL, J(X), pp. 1114–1124.
- ISSTA-2002-OrsoLHL #deployment #evolution
- Gamma system: continuous evolution of software after deployment (AO, DL, MJH, RJL), pp. 65–69.
- ICALP-1997-LandweberL #question
- DNA²DNA Computations: A Potential “Killer App”? (LFL, RJL), pp. 56–64.
- STOC-1994-LiptonY #complexity #game studies #scalability
- Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.
- STOC-1991-GemmellLRSW #approximate #self
- Self-Testing/Correcting for Polynomials and for Approximate Functions (PG, RJL, RR, MS, AW), pp. 32–42.
- PODS-1990-LiptonN #adaptation #estimation #query
- Query Size Estimation by Adaptive Sampling (RJL, JFN), pp. 40–46.
- SIGMOD-1990-LiptonNS #adaptation #estimation
- Practical Selectivity Estimation through Adaptive Sampling (RJL, JFN, DAS), pp. 1–11.
- VLDB-1989-LiptonN #transitive
- Estimating the Size of Generalized Transitive Closures (RJL, JFN), pp. 165–171.
- DAC-1983-LaPaughL #testing
- Total stuct-at-fault testing by circuit transformation (ASL, RJL), pp. 713–716.
- ICALP-1983-ChandraFL #bound #constant #problem
- Lower Bounds for Constant Depth Circuits for Prefix Problems (AKC, SF, RJL), pp. 109–117.
- STOC-1983-ChandraFL83a #bound
- Unbounded Fan-in Circuits and Associative Functions (AKC, SF, RJL), pp. 52–60.
- STOC-1983-ChandraFL83b #multi #protocol
- Multi-Party Protocols (AKC, MLF, RJL), pp. 94–99.
- DAC-1982-LiptonN #algorithm #automation #design #research
- Design automation algorithms: Research and applications (RJL, JDN), p. 410.
- DAC-1982-LiptonNSVV #named
- ALI: A procedural language to describe VLSI layouts (RJL, SCN, RS, JV, GV), pp. 467–474.
- POPL-1982-LiptonSV #aspect-oriented #programming
- Programming Aspects of VLSI (RJL, RS, JV), pp. 57–65.
- STOC-1981-LiptonS #bound
- Lower Bounds for VLSI (RJL, RS), pp. 300–307.
- POPL-1980-BuddDLS #correctness #functional #source code #using
- Theoretical and Emperical Studies on Using Program Mutation to Test the Functional Correctness of Programs (TAB, RAD, RJL, FGS), pp. 220–233.
- STOC-1980-DeMilloL #consistency #problem
- The Consistency of “P = NP” and Related Problems with Fragments of Number Theory (RAD, RJL), pp. 45–57.
- STOC-1980-KannanL #decidability #problem
- The Orbit Problem is Decidable (RK, RJL), pp. 252–261.
- STOC-1980-KarpL #complexity
- Some Connections between Nonuniform and Uniform Complexity Classes (RMK, RJL), pp. 302–309.
- STOC-1979-DeMilloL #complexity #logic
- Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.
- POPL-1977-DeMilloLP #process #proving #social #source code #theorem
- Social Processes and Proofs of Theorems and Programs (RAD, RJL, AJP), pp. 206–214.
- STOC-1976-CardozaLM #commutative #exponential #petri net #problem
- Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report (EC, RJL, ARM), pp. 50–54.
- STOC-1976-LiptonS #evaluation
- Evaluation of Polynomials with Super-Preconditioning (RJL, LJS), pp. 174–180.
- POPL-1975-Lipton #named #process #proving #reduction
- Reduction: A New Method of Proving Properties of Systems of Processes (RJL), pp. 78–86.
- SOSP-1975-JonesL #policy #security
- The Enforcement of Security Policies for Computation (AKJ, RJL), pp. 197–206.
- STOC-1975-LiptonD #complexity #evaluation #integer #metric
- Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms (RJL, DPD), pp. 1–5.
- STOC-1975-LiptonED #complexity #data type
- The Complexity of Control Structures and Data Structures (RJL, SCE, RAD), pp. 186–193.
- STOC-1974-DobkinL #on the
- On Some Generalizations of Binary Search (DPD, RJL), pp. 310–316.
- STOC-1974-Lipton #branch
- Limitations of Synchronization Primitives with Conditional Branching and Global Variables (RJL), pp. 230–241.