Restrict to: Header Title Order by: Expected citations Hubs Usage Date Try: Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
127 documents found.
Order: number of citations.
Probabilistic Checking of Proofs: A New Characterization of NP - Arora, Safra (1992)
(Correct) (178 citations)
Feige, Goldwasser, Lov'asz, Safra, and Szegedy [FGL 91] recently provided a breakthrough, by
approximation "almost" NP-hard.At the core of the [FGL 91] result is a new technique for doing
instead of NP-hard)suggests that the [FGL 91] result, though impressive, is not the end
ftp.cs.princeton.edu/pub/people/arora/as.ps
Property Testing and its Connection to Learning and.. - Goldreich, Goldwasser, Ron (1998)
(Correct) (116 citations)
defined by low-degree polynomials [BFL91, BFLS91, FGL 91, AS92, ALM 92] to testing Hadamard
x i mod 2. Work on linearity testing [BLR93, BFL91, FGL 91, BGLR93, BS94]culminating in the result
ACM Symposium on the Theory of Computing, 1998. FGL 91] U. Feige, S. Goldwasser, L. Lov'asz, S.
theory.lcs.mit.edu/pub/people/danar/test1.ps.gz
Polynomial Time Approximation Schemes for Dense.. - Arora, Karger, Karpinski (1995)
(Correct) (111 citations)
That Unless P Np, Problems Such As Clique [fgl 91, As92, Alm 92] And Chromatic Number
Theoretical Computer Science, pages 182-189, 1995. FGL 91] U. Feige, S. Goldwasser, L. Lovasz, S.
ftp.cs.princeton.edu/pub/people/arora/dense.ps
Hardness Of Approximations - Arora, Lund (1996)
(Correct) (104 citations)
This new technique, which originated in the work of [FGL 91]relies upon new probabilistic
On Inapproximability Is The Paper Of Feige Et Al. fgl 91] On Clique. 10.1 How To Prove
result for the clique problem, due to [FGL 91]showed that achieving an approximation
ftp.cs.princeton.edu/pub/people/arora/chapter.ps
Linearity and the Pi-Calculus - Kobayashi, Pierce, Turner (1998)
(Correct) (85 citations)
languages in their own right [PT95, PT97, FG96, FGL 96]The small set of message-passing
Principles of Programming Languages, January 1996. FGL 96] C'edric Fournet, Georges Gonthier,
para.inria.fr/~lefessan/biblio/papers/00001-KPT96.ps.gz
A Sub-Constant Error-Probability Low-Degree-Test and a.. - Raz, Safra (1997)
(Correct) (82 citations)
NP-hard. This avenue of research was initiated by [FGL 91]which introduced a new methodology for
a few hardness results for approximation problems [FGL 91, AS92, ALM 92, PY91, LY94, BGLR93,
Symp. on Theory of Computing, pages 151-158, 1971. FGL 91] U. Feige, S. Goldwasser, L. Lov'asz, S.
www.math.tau.ac.il/~safra/PapersAndTalks/RS-STOC.ps
Multilevel Atomicity - A New Correctness Criterion for Database.. - Lynch (1981)
(Correct) (56 citations)
there are many other reasonable possibilities. In [FGL]we assume an application database allowing any
type of transaction, an audit transaction" FGL]which reads all of the account balances and
Vol. 19, Number 11, pp. 624-633, November 1976. FGL] Fischer, M.J.Griffeth, N.D.and Lynch, N.A.
theory.lcs.mit.edu/tds/papers/Lynch/GIT-ICS-81-05.pdf
Nomadic Pict: Language and Infrastructure Design for Mobile.. - Wojciechowski, Sewell (1999)
(Correct) (42 citations)
of the infrastructures. The Join Language [FGL 96] provides location-independent messages
Internet. LNCS 1222, pages 25-48, 1997. FGL 96] Cedric Fournet, Georges Gonthier,
www.cl.cam.ac.uk/users/pes20/nomads-draft.ps
Property Testing in Bounded Degree Graphs - Oded Goldreich Dept (1997)
(Correct) (34 citations)
polynomials [BLR93, RS96, GLR 91, BFL91, BFLS91, FGL 96, ALM 98] and codes [BFLS91, ALM 98,
probabilistically checkable proofs [BFL91, BFLS91, FGL 96, AS98, ALM 98] is well known. In
Graph Algorithms. Computer Science Press, 1979. FGL 96] U. Feige, S. Goldwasser, L. Lovasz, S.
www.eng.tau.ac.il/~danar/Public/bound-long.ps
Approximation Algorithms for Constraint Satisfaction Problems.. - Zwick (1997)
(Correct) (34 citations)
end, an impressive series of works, that includes [FGL 96]AS92]ALM 92]BGLR93]BGS95]
Systems, Tel Aviv, Israel, pages 182-189, 1995. FGL 96] U. Feige, S. Goldwasser, L. Lov'asz, S.
www.cs.tau.ac.il/%7Ezwick/papers/max3csp-extended.ps.gz
Efficient Checking of Polynomials and Proofs and the Hardness of.. - Sudan (1992)
(Correct) (34 citations)
guarantees from the verifier [BFL91, BFLS91, FGL 91, AS92]We improve upon the efficiency of
explored in several recent papers [BFL91, BFLS91, FGL 91, AS92]These papers show that even
to some optimization problem. Feige et al. FGL 91] were the first to bring out such a
www.uni-paderborn.de/fachbereich/AG/agmadh/Scripts/GENERAL/Interactive/Sudan-PhD.ps.gz
Approximation Algorithms for Constraint Satisfaction Problems.. - Zwick (1998)
(Correct) (34 citations)
end, an impressive series of works, that includes [FGL 96, AS92, ALM 92, BGLR93, BGS95, Has97]
Systems, Tel Aviv, Israel, pages 182-189, 1995. FGL 96] U. Feige, S. Goldwasser, L. Lov'asz, S.
www.math.tau.ac.il/~zwick/max3csp-soda.ps.gz
Local Optimization of Global Objectives: Competitive.. - Awerbuch, Azar (1994)
(Correct) (32 citations)
problem appear to be hard to approximate, BGLR93, FGL 91, AS92, ALM 92]the versions, that
of such type, is provably un-approximable [BGLR93, FGL 91, AS92, ALM 92]unless P =NP. Indeed,
of Distributed Computing, pages 157-164, 1983. FGL 91] U. Feige, S. Goldwasser, L. Lovasz, S.
www.math.tau.ac.il/~azar/conc.ps.gz
A PCP Characterization of NP with Optimal Amortized Query.. - Samorodnitsky, Trevisan (1999)
(Correct) (25 citations)
www.cs.berkeley.edu/~luca/pubs/st-full.ps
Global/Local Subtyping and Capability Inference for a Distributed .. - Sewell (1998)
(Correct) (25 citations)
Calculus and a related programming language [FG96, FGL 96]To model migrating agents one needs at
\GammaGg `l io T :Type GE T :Type G" io 2 fGL LGg l io T :Type \GammaE T :Type fl" io
23rd POPL, pages 372-385. ACM press, January 1996. FGL 96] C'edric Fournet, Georges Gonthier,
www.cl.cam.ac.uk/users/pes20/globallocal-medium-cmr.ps
The Importance of Being Biased - Dinur, Safra (2002)
(Correct) (23 citations)
progress since the discovery of the PCP theorem [FGL 91, AS92, ALM 92] in the early 1990's.
much like the one resulting by the reduction of [FGL 91]namely, a graph made of several cliques
A satisfies at most a small fraction of #The FGLSS [FGL 91, Kar72] reduction, applied to the PCP
www.cs.berkeley.edu/~iritd/mypapers/vc.pdf
First 20 documents Next 20
Try your query at:
Google (CiteSeer) Google (Web) Yahoo! MSN CSB DBLP
CiteSeer.IST - Copyright Penn State and NEC