498 search results - page 78 / 100 » New Constructions for IPP Codes |
141
click to vote
GG
2008
Springer
15 years 2 months ago
2008
Springer
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
121
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
107
Voted
OOPSLA
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we describe Ginger, a new language with first class support for literate programming. Literate programming refers to a philosophy that argues computer programs shou...
115
click to vote
CODES
2006
IEEE
15 years 5 months ago
2006
IEEE
Simulating chip-multiprocessor systems (CMP) can take a long time. For single-threaded workloads, earlier work has shown the utility of phase analysis, that is identification of r...
135
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...