Arora, Sanjeev
Overview
Works:  24 works in 84 publications in 3 languages and 988 library holdings 

Genres:  Conference papers and proceedings Academic theses 
Roles:  Author, Editor, Creator 
Publication Timeline
.
Most widely held works by
Sanjeev Arora
Computational complexity : a modern approach by
Sanjeev Arora(
Book
)
31 editions published between 2008 and 2016 in English and Undetermined and held by 552 WorldCat member libraries worldwide
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. The book starts with a broad introduction to the field and progresses to advanced results
31 editions published between 2008 and 2016 in English and Undetermined and held by 552 WorldCat member libraries worldwide
This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. The book starts with a broad introduction to the field and progresses to advanced results
Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation
Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 2426, 2003 : proceedings by
Sanjeev Arora(
Book
)
18 editions published in 2003 in English and held by 367 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
18 editions published in 2003 in English and held by 367 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
Probabilistic checking of proofs and hardness of approximation problems by
Sanjeev Arora(
)
4 editions published in 1994 in English and held by 11 WorldCat member libraries worldwide
This dissertation establishes a surprising new characterization of NP, the class of languages for which membership proofs can be checked in polynomial time deterministically. The class NP is exactly the set of languages for which membership proofs can be checked by a probabilistic polynomial time verifier that examines a constant number of bits in the proof, and uses O(log n) random bits, where n is the size of the input
4 editions published in 1994 in English and held by 11 WorldCat member libraries worldwide
This dissertation establishes a surprising new characterization of NP, the class of languages for which membership proofs can be checked in polynomial time deterministically. The class NP is exactly the set of languages for which membership proofs can be checked by a probabilistic polynomial time verifier that examines a constant number of bits in the proof, and uses O(log n) random bits, where n is the size of the input
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on by
Sanjeev Arora(
)
3 editions published in 2003 in English and held by 8 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
3 editions published in 2003 in English and held by 8 WorldCat member libraries worldwide
This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003. The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, errorcorrecting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications
Approximation, randomization, and combinatorial optimization : algorithms and techniques ; 6th International Workshop on Approximation
Algorithms for Combinatorial Optimization Problems, and 7th International Workshop on Randomization and Approximation Techniques
in Computer Science, Princeton, NJ, USA, August 24  26, 2003 ; proceedings(
)
1 edition published in 2003 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 2003 in English and held by 8 WorldCat member libraries worldwide
Approximation schemes for the kmedians and related problems by
Sanjeev Arora(
Book
)
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that for any c> 0 produces a solution of cost at most 1+1/c times the optimum and runs in time O(n[superscript O(c+1)]). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for TSP, which hitherto seemed inapplicable to problems such as the kmedian problem."
3 editions published in 1998 in English and held by 7 WorldCat member libraries worldwide
Abstract: "In the kmedian problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances from each of the points of S to the nearest median is minimized. This paper gives an approximation scheme for the plane that for any c> 0 produces a solution of cost at most 1+1/c times the optimum and runs in time O(n[superscript O(c+1)]). The approximation scheme also generalizes to some problems related to kmedian. Our methodology is to extend Arora's [1, 2] techniques for TSP, which hitherto seemed inapplicable to problems such as the kmedian problem."
Improved lowdegree testing and its applications by
Sanjeev Arora(
Book
)
3 editions published in 1997 in English and held by 7 WorldCat member libraries worldwide
Abstract: "NP=PCP(log n, 1) and related results crucially depend upon the close connection between the probability with which a function passes a low degree test and the distance of this function to the nearest degree d polynomial. In this paper we study a test proposed by Rubinfeld and Sudan [RS93]. The strongest previously known connection for this test states that a function passes the test with probability [delta] for some [delta]> 7/8 iff the function has agreement [symbol] [delta] with a polynomial of degree d. We present a new, and surprisingly strong, analysis which shows that the preceding statement is true for [delta] <<0.5. The analysis uses a version of Hilbert irreducibility, a tool of algebraic geometry. As a consequence we obtain an alternate construction for the following proof system: A constant prover 1round proof system for NP languages in which the verifier uses O(log n) random bits, receives answers of size O(log n) bits, and has an error probability of at most [formula]. Such a proof system, which implies the NPhardness of approximating Set Cover to within [omega](log n) factors, has already been obtained by Raz and Safra [RazS96]. Our result was completed after we heard of their claim. A second consequence of our analysis is a self tester/corrector for any buggy program that (supposedly) computes a polynomial over a finite field. If the program is correct only on [delta] fraction of inputs where [delta] = 1/[absolute value of F][superscript epsilon] <<0.5, then the tester/corrector determines [delta] and generates O(1/[delta]) values for every input, such that one of them is the correct output. In fact, our techniques yield something stronger: Given the buggy program, we can construct O(1/[delta]) randomized programs such that one of them is correct on every input, with high probability."
3 editions published in 1997 in English and held by 7 WorldCat member libraries worldwide
Abstract: "NP=PCP(log n, 1) and related results crucially depend upon the close connection between the probability with which a function passes a low degree test and the distance of this function to the nearest degree d polynomial. In this paper we study a test proposed by Rubinfeld and Sudan [RS93]. The strongest previously known connection for this test states that a function passes the test with probability [delta] for some [delta]> 7/8 iff the function has agreement [symbol] [delta] with a polynomial of degree d. We present a new, and surprisingly strong, analysis which shows that the preceding statement is true for [delta] <<0.5. The analysis uses a version of Hilbert irreducibility, a tool of algebraic geometry. As a consequence we obtain an alternate construction for the following proof system: A constant prover 1round proof system for NP languages in which the verifier uses O(log n) random bits, receives answers of size O(log n) bits, and has an error probability of at most [formula]. Such a proof system, which implies the NPhardness of approximating Set Cover to within [omega](log n) factors, has already been obtained by Raz and Safra [RazS96]. Our result was completed after we heard of their claim. A second consequence of our analysis is a self tester/corrector for any buggy program that (supposedly) computes a polynomial over a finite field. If the program is correct only on [delta] fraction of inputs where [delta] = 1/[absolute value of F][superscript epsilon] <<0.5, then the tester/corrector determines [delta] and generates O(1/[delta]) values for every input, such that one of them is the correct output. In fact, our techniques yield something stronger: Given the buggy program, we can construct O(1/[delta]) randomized programs such that one of them is correct on every input, with high probability."
Polynomial time approximation schemes for dense instances of NPhard problems by
Sanjeev Arora(
Book
)
4 editions published between 1994 and 1998 in German and English and held by 5 WorldCat member libraries worldwide
4 editions published between 1994 and 1998 in German and English and held by 5 WorldCat member libraries worldwide
Ji suan fu za xing : Xian dai fang fa = Computational complexity by
Sanjeev Arora(
Book
)
1 edition published in 2016 in Chinese and held by 3 WorldCat member libraries worldwide
Ben shu fen wei san bu fen. Di yi bu fen jie shao le fu za xing li lun, Bao kuo fu za xing li lun de jing dian jie guo he yi xie xian dai zhuan ti. Di er bu fen tao lun le ge zhong ju ti ji suan mo xing shang de ji suan fu za xing xia jie. Di san bu fen zhu yao shi 1980 nian yi hou ren men zai fu za xing li lun fang mian huo de de jin zhan, Nei rong bao kuo ji shu fu za xing, Ping jun fu za xing, Nan du fang da, Qu sui ji hua he wei sui ji xing, PCP ding li de zheng ming yi ji zi ran zheng ming
1 edition published in 2016 in Chinese and held by 3 WorldCat member libraries worldwide
Ben shu fen wei san bu fen. Di yi bu fen jie shao le fu za xing li lun, Bao kuo fu za xing li lun de jing dian jie guo he yi xie xian dai zhuan ti. Di er bu fen tao lun le ge zhong ju ti ji suan mo xing shang de ji suan fu za xing xia jie. Di san bu fen zhu yao shi 1980 nian yi hou ren men zai fu za xing li lun fang mian huo de de jin zhan, Nei rong bao kuo ji shu fu za xing, Ping jun fu za xing, Nan du fang da, Qu sui ji hua he wei sui ji xing, PCP ding li de zheng ming yi ji zi ran zheng ming
Online algorithms for path selection in nonblocking networks by
Sanjeev Arora(
Book
)
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 2 WorldCat member libraries worldwide
Proof verification and the hardness of approximation problems(
Book
)
1 edition published in 1993 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The class PCP(r(n), q(n)) consists of all languages L for which there exists a polynomialtime probabilistic oracle machine that uses O(r(n)) random bits, queries O(q(n)) bits of its oracle and behaves as follows: If x [member of] L then there exists an oracle y such that the machine accepts for all random choices but if x [not member of] L then for every oracle y the machine rejects with high probability. Arora and Safra very recently characterized NP as PCP(log n, (log log n)[superscript O(1)]). We improve on their result by showing that NP = PCP(log n, 1). Our result has the following consequences: 1. MAXSNPhard problems (e.g., metric TSP, MAXSAT, MAXCUT) do not have polynomial time approximation schemes unles P=NP. 2. For some [epsilon]> 0 the size of the maximal clique in a graph cannot be approximated within a factor of n[superscript [epsilon]] unless P=NP."
1 edition published in 1993 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The class PCP(r(n), q(n)) consists of all languages L for which there exists a polynomialtime probabilistic oracle machine that uses O(r(n)) random bits, queries O(q(n)) bits of its oracle and behaves as follows: If x [member of] L then there exists an oracle y such that the machine accepts for all random choices but if x [not member of] L then for every oracle y the machine rejects with high probability. Arora and Safra very recently characterized NP as PCP(log n, (log log n)[superscript O(1)]). We improve on their result by showing that NP = PCP(log n, 1). Our result has the following consequences: 1. MAXSNPhard problems (e.g., metric TSP, MAXSAT, MAXCUT) do not have polynomial time approximation schemes unles P=NP. 2. For some [epsilon]> 0 the size of the maximal clique in a graph cannot be approximated within a factor of n[superscript [epsilon]] unless P=NP."
A Study of Privacy and Fairness in Sensitive Data Analysis by Moritz A. W Hardt(
Book
)
1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide
 Multiplicative weights mechanisms are a powerful tool in algorithms, machine learning and optimization. We introduce a privacypreserving multiplicative weights framework suitable for answering a huge number of queries even in the interactive setting. The accuracy of our algorithm in terms of database size and number of queries matches the statistical sampling error that already arises in the absence of any privacy concerns. Our algorithm can also be used to produce a differentially private synthetic data set encoding the curator's answers. For this task the runtime of our algorithmwhich is linear in the universe sizeis essentially optimal due to a prior cryptographic hardness result
1 edition published in 2011 in English and held by 2 WorldCat member libraries worldwide
 Multiplicative weights mechanisms are a powerful tool in algorithms, machine learning and optimization. We introduce a privacypreserving multiplicative weights framework suitable for answering a huge number of queries even in the interactive setting. The accuracy of our algorithm in terms of database size and number of queries matches the statistical sampling error that already arises in the absence of any privacy concerns. Our algorithm can also be used to produce a differentially private synthetic data set encoding the curator's answers. For this task the runtime of our algorithmwhich is linear in the universe sizeis essentially optimal due to a prior cryptographic hardness result
An investigation of a possible molecular effect in ion atom collisions using a gaseous argon target by
Sanjeev Arora(
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
Hardness of approximations by
Sanjeev Arora(
)
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1997 in English and held by 2 WorldCat member libraries worldwide
A (2 + ...)approximation algorithm for the kMST problem by
Sanjeev Arora(
)
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Approximation algorithms for combinatorial optimization : 6th International Workshop on Approximation Algorithms for Combinatorial
Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer
Science, RANDOM 2003, Princeton, NJ, USA, August 2426, 2003 : proceedings by APPROX 2003 (Conference)(
Book
)
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
Contingent engagement: What we learn from patients with complex health problems and low socioeconomic status(
)
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
Highlights: Complex patients often have excess hospitalizations and do not engage in outpatient care. Engagement requires intensive efforts by primary care teams, and change is incremental. Teams that are available, nonjudgmental, and supportive engage complex patients. Addressing material needs is also important for fostering engagement. Abstract: Objective: Elicit patients' perceptions of factors that facilitate their engagement in care Methods: Indepth interviews with 20 adult Medicaid patients who had complex health problems, frequent hospitalizations/emergency department use, and who were enrolled in an intensive, teambased care program designed to address medical, behavioral, and social needs. Results: Prior to engaging in the program, participants described weak relationships with primary care providers, frequent hospitalizations and emergency visits, poor adherence to medications and severe social barriers to care. After participating in the program, participants identified key factors that enabled them to develop trust and engage with care including: availability for extended intensive interactions, a nonjudgmental approach, addressing patients' material needs, and providing social contact for isolated patients. After developing relationships with their care team, participants described changes such as sustained interactions with their primary care team and incremental improvements in health behaviors. Conclusion: These findings illuminate factors promoting "contingent engagement" for low socioeconomic status patients with complex health problems, which allow them to become proactive in ways commensurate with their circumstances, and offers insights for designing interventions to improve patient outcomes. Practice implications: For these patients, engagement is contingent on healthcare providers' efforts to develop trust and address patients' material needs
1 edition published in 2018 in English and held by 1 WorldCat member library worldwide
Highlights: Complex patients often have excess hospitalizations and do not engage in outpatient care. Engagement requires intensive efforts by primary care teams, and change is incremental. Teams that are available, nonjudgmental, and supportive engage complex patients. Addressing material needs is also important for fostering engagement. Abstract: Objective: Elicit patients' perceptions of factors that facilitate their engagement in care Methods: Indepth interviews with 20 adult Medicaid patients who had complex health problems, frequent hospitalizations/emergency department use, and who were enrolled in an intensive, teambased care program designed to address medical, behavioral, and social needs. Results: Prior to engaging in the program, participants described weak relationships with primary care providers, frequent hospitalizations and emergency visits, poor adherence to medications and severe social barriers to care. After participating in the program, participants identified key factors that enabled them to develop trust and engage with care including: availability for extended intensive interactions, a nonjudgmental approach, addressing patients' material needs, and providing social contact for isolated patients. After developing relationships with their care team, participants described changes such as sustained interactions with their primary care team and incremental improvements in health behaviors. Conclusion: These findings illuminate factors promoting "contingent engagement" for low socioeconomic status patients with complex health problems, which allow them to become proactive in ways commensurate with their circumstances, and offers insights for designing interventions to improve patient outcomes. Practice implications: For these patients, engagement is contingent on healthcare providers' efforts to develop trust and address patients' material needs
Page replacement for general caching problems by
Susanne Albers(
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
A polynomialtime approximation scheme for weighted planar graph TSP(
)
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
1 edition published in 1998 in English and held by 1 WorldCat member library worldwide
Building virtual communities of practice for health(
)
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
1 edition published in 2017 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Barak, Boaz
 Jansen, Klaus
 Rolim, José D. P.
 Sahai, Amit
 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems 2003 Princeton, NJ
 International Workshop on Randomization and Approximation Techniques in Computer Science 2003 Princeton, NJ
 Rao, Satish
 Sudan, Madhu
 Raghavan, Prabhakar
 Karger, David
Useful Links
Associated Subjects
Algorithms Combinatorial analysis Combinatorial optimization Computational complexity Computer algorithms Computer science Computer scienceMathematics Computer scienceStatistical methods Computer software Electronic data processing Geometry, Algebraic Irreducible polynomials Programming (Mathematics) Traveling salesman problem University of California, Berkeley.Computer Science Division
Covers
Alternative Names
Arora, S. 1968
Sanjeev Arora.
Sanjeev Arora Amerikaans informaticus
Sanjeev Arora chercheur en informatique
Sanjeev Arora Theoretical computer scientist
Sanjeev Arora USamerikanischer theoretischer Informatiker
সঞ্জীব আরোরা
സഞ്ജീവ് അറോറ
Languages