Search Results - "Lipton, Richard J."

DNA Solution of Hard Computational Problems by Lipton, Richard J.

“…DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete…”
Get full text

On the importance of eliminating errors in cryptographic computations by BONEH, Dan, DEMILLO, Richard A, LIPTON, Richard J

“…We present a model for attacking various cryptographic schemes by taking advantage of random hardware faults. The model consists of a black-box containing some…”
Get full text

Molecular Computation: RNA Solutions to Chess Problems by Faulhammer, Dirk, Cukras, Anthony R., Lipton, Richard J., Landweber, Laura F.

“…We have expanded the field of "DNA computers" to RNA and present a general approach for the solution of satisfiability problems. As an example, we consider a…”
Get full text

Reply to: Letter to the Editor on the article “Parathyroid surgery can be safely performed in a community hospital by experienced parathyroid surgeons: A retrospective cohort study” by Neychev, Vladimir K., M.D. Ph.D, Ghanem, Maher, M.D, Blackwood, Stuart L., M.D, Aragon Han, Patricia, M.D, Fazeli, Roghayeh, M.D, Schneider, Eric, Ph.D, Najafian, Alireza, M.D, Bloch, Dov C., M.D, Bard, Michael C., M.D, Klarsfeld, Jay H., M.D, Zeiger, Martha A., M.D., F.A.C.S, Lipton, Richard J., M.D

Get full text

Might Turing Have Won a Turing Award? by Lipton, R. J.

“…A provocative tale highlights Alan Turing's special ability to provide clarity to complex computing issues…”
Get full text

Parathyroid surgery can be safely performed in a community hospital by experienced parathyroid surgeons: A retrospective cohort study by Neychev, Vladimir K, Ghanem, Maher, Blackwood, Stuart L, Aragon Han, Patricia, Fazeli, Roghayeh, Schneider, Eric, Najafian, Alireza, Bloch, Dov C, Bard, Michael C, Klarsfeld, Jay H, Zeiger, Martha A, Lipton, Richard J

“…Abstract Background There is ongoing debate about the effectiveness and safety of performing parathyroid surgery in low-volume community hospitals. Study…”
Get full text

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions by Khot, Subhash, Lipton, Richard J., Markakis, Evangelos, Mehta, Aranyak

“…We consider the following allocation problem arising in the setting of combinatorial auctions: a set of goods is to be allocated to a set of players so as to…”
Get full text

Best-order streaming model by Das Sarma, Atish, Lipton, Richard J., Nanongkai, Danupon

“…We study a new model of computation, called best-order stream, for graph problems. Roughly, it is a proof system where a space-limited verifier has to verify a…”
Get full text

Deterministically testing sparse polynomial identities of unbounded degree by Bläser, Markus, Hardt, Moritz, Lipton, Richard J., Vishnoi, Nisheeth K.

“…We present two deterministic algorithms for the arithmetic circuit identity testing problem. The running time of our algorithms is polynomially bounded in s…”
Get full text

Algorithms for Modular Counting of Roots of Multivariate Polynomials by Gopalan, Parikshit, Guruswami, Venkatesan, Lipton, Richard J.

“…Given a multivariate polynomial P ( X 1 ,…, X n ) over a finite field , let N ( P ) denote the number of roots over . The modular root counting problem is…”
Get full text

On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms by Jun Xu, Lipton, R.J.

“…We clarify, extend, and solve a long-standing open problem concerning the computational complexity for packet scheduling algorithms to achieve tight end-to-end…”
Get full text

On the complexity of intersecting finite state automata and NL versus NP by KARAKOSTAS, George, LIPTON, Richard J, VIGLAS, Anastasios

Get full text

Amplifying circuit lower bounds against polynomial time, with applications by Lipton, Richard J., Williams, Ryan

“…We give a self-reduction for the Circuit Evaluation problem ( CircEval ) and prove the following consequences. Amplifying size–depth lower bounds . If CircEval…”
Get full text

Network and service security by Lipton, R.J., Rajagopalan, S.R., Serpanos, D.N.

“…Security is a critical technology in conventional and emerging networks and their applications and services today. Lipton et al discuss current technologies in…”
Get full text

Estimating the maximum by Gum, Ben, Lipton, Richard J., LaPaugh, Andrea, Fich, Faith

“…Estimating the maximum of a sampled dataset is an important and daunting task. We give a sampling algorithm for general datasets which gives estimates strictly…”
Get full text

A Separator Theorem for Planar Graphs by Lipton, Richard J., Tarjan, Robert Endre

“…Let G be any n-vertex planar graph. We prove that the vertices of G can be partitioned into three sets A, B, C such that no edge joins a vertex in A with a…”
Get full text

On the complexity of intersecting finite state automata by Karakostas, G., Lipton, R.J., Viglas, A.

“…We consider the problem of testing whether the intersection of a collection of k automata is empty. The straightforward algorithm for solving this problem runs…”
Get full text

Thyroid carcinoma invading the upper aerodigestive system by McCaffrey, T V, Lipton, R J

“…Well-differentiated thyroid carcinoma infrequently invades the upper aerodigestive tract. However, when invasion occurs it is the source of significant…”
Get more information

Counting DNA: estimating the complexity of a test tube of DNA by Faulhammer, Dirk, Lipton, Richard J, Landweber, Laura F

“…We consider the problem of estimation of the ‘complexity’ of a test tube of DNA. The complexity of a test tube is the number of different kinds of strands of…”
Get full text

Polynomials that sign represent parity and Descartes rule of signs by Basu, S., Bhatnagar, N., Gopalan, P., Lipton, R.J.

“…We study the sparsity of real polynomials that sign represent parity on n variables, each of which takes values from some finite subset A of integers. While…”
Get full text