( en | de | ru )

 

Disambiguation of "Lipton, Richard J."

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of intersecting finite state automata and N L versus N P.

, , and . Theor. Comput. Sci., 302 (1-3): 257-274 (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lipton Chan

Richard J Saley

Richard J Brunt

Richard J Fuchs

Richard J Watts

 

Other publications of authors with the same name

Even Data Bases That Lie Can Be Compromised., , and . IEEE Trans. Software Eng., 4 (1): 73-75 (1978)Response from R. A. DeMillo, R. J. Lipton, A. J. Perlis., , and . ACM SIGSOFT Softw. Eng. Notes, 3 (2): 16-17 (1978)On the complexity of intersecting finite state automata and N L versus N P., , and . Theor. Comput. Sci., 302 (1-3): 257-274 (2003)A method for drawing graphs., , and . SCG, page 153-160. ACM, (1985)Practical Selectivity Estimation through Adaptive Sampling., , and . SIGMOD Conference, page 1-11. ACM Press, (1990)SIGMOD Record 19(2), June 1990.A System Architecture to Support a Verifiably Secure Multilevel Security System., , and . S&P, page 137-144. IEEE Computer Society, (1980)Theoretical and Empirical Studies on Using Program Mutation to Test the Functional Correctness of Programs, , , and . Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, page 220--233. Las Vegas, Nevada, ACM SIGACT-SIGPLAN, (January 1980)Lower Bounds for VLSI, and . STOC, page 300-307. ACM, (1981)The Consistency of "P = NP" and Related Problems with Fragments of Number Theory., and . STOC, page 45-57. ACM, (1980)Some Connections between Mathematical Logic and Complexity Theory, and . STOC, page 153-159. ACM, (1979)