| Publication | Date of Publication | Type |
|---|
| Designated-verifier SNARGs with one group element | 2026-02-06 | Paper |
| A unified framework for succinct garbling from homomorphic secret sharing | 2026-02-04 | Paper |
| Fully anonymous secret sharing | 2026-02-04 | Paper |
| Information-theoretic single-server PIR in the shuffle model | 2026-02-03 | Paper |
| Peeking into the future: MPC resilient to super-rushing adversaries | 2025-12-02 | Paper |
| Zero-knowledge RAM: doubly efficient and black-box | 2025-12-02 | Paper |
| Query-reusable proof systems | 2025-12-02 | Paper |
| Correlated pseudorandom functions from variable-density LPN | 2025-08-12 | Paper |
| Proximity gaps for Reed-Solomon codes | 2025-08-12 | Paper |
| Bounded-communication leakage resilience via parity-resilient circuits | 2025-08-06 | Paper |
| Bounded simultaneous messages | 2025-07-28 | Paper |
Proximity gaps for Reed-Solomon codes
Journal of the ACM | 2025-02-05 | Paper |
| Compressing unit-vector correlations via sparse pseudorandom generators | 2024-12-13 | Paper |
| PIR with client-side preprocessing: information-theoretic constructions and lower bounds | 2024-12-13 | Paper |
| Leakage-tolerant circuits | 2024-11-13 | Paper |
| Constant-round simulation-secure coin tossing extension with guaranteed output | 2024-11-13 | Paper |
| On low-end obfuscation and learning | 2024-09-25 | Paper |
| Combinatorially homomorphic encryption | 2024-08-02 | Paper |
| Cryptography from planted graphs: security with logarithmic-size messages | 2024-08-01 | Paper |
Limits of preprocessing
Computational Complexity | 2024-08-01 | Paper |
| Refuting the dream XOR lemma via ideal obfuscation and resettable MPC | 2024-06-25 | Paper |
| Information-theoretic distributed point functions | 2024-06-25 | Paper |
| Hard languages in NP \(\cap\) coNP and NIZK proofs from unstructured hardness | 2024-05-08 | Paper |
| Succinct computational secret sharing | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829258 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829259 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829303 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Computational wiretap coding from indistinguishability obfuscation
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Succinct arguments for RAM programs via projection codes
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Arithmetic sketching
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Additive randomized encodings and their applications
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Perfect MPC over layered graphs
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Round-optimal black-box MPC in the plain model
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
One-message secure reductions: on the cost of converting correlations
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Black-box reusable NISC with random oracles
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
Journal of Cryptology | 2023-11-21 | Paper |
Ligero: lightweight sublinear arguments without a trusted setup
Designs, Codes and Cryptography | 2023-11-07 | Paper |
Round-optimal black-box secure computation from two-round malicious OT
Theory of Cryptography | 2023-08-14 | Paper |
Fully-secure MPC with minimal trust
Theory of Cryptography | 2023-08-14 | Paper |
Actively secure garbled circuits with constant communication overhead in the plain model
Journal of Cryptology | 2023-07-26 | Paper |
Streaming and unbalanced PSI from function secret sharing
Lecture Notes in Computer Science | 2023-07-25 | Paper |
Tight bounds on the randomness complexity of secure multiparty computation
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Authenticated garbling from simple correlations
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Programmable distributed point functions
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
Quadratic multiparty randomized encodings beyond honest majority and their applications
Advances in Cryptology – CRYPTO 2022 | 2023-07-07 | Paper |
| scientific article; zbMATH DE number 7706037 (Why is no real title available?) | 2023-07-03 | Paper |
Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation | 2023-04-13 | Paper |
| Efficient fully secure computation via distributed zero-knowledge proofs | 2023-03-29 | Paper |
| Cryptography from one-way communication: on completeness of finite channels | 2023-03-29 | Paper |
| scientific article; zbMATH DE number 7650430 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650419 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650434 (Why is no real title available?) | 2023-02-03 | Paper |
| Efficient pseudorandom correlation generators from ring-LPN | 2022-11-09 | Paper |
| On succinct arguments and witness encryption from groups | 2022-11-09 | Paper |
| Round-optimal black-box protocol compilers | 2022-08-30 | Paper |
| Secure multiparty computation with sublinear preprocessing | 2022-08-30 | Paper |
| Asymptotically quasi-optimal cryptography | 2022-08-30 | Paper |
| Private circuits with quasilinear randomness | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7561745 (Why is no real title available?) | 2022-07-21 | Paper |
| Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) | 2022-05-18 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Journal of Cryptology | 2022-05-10 | Paper |
| On the round complexity of black-box secure MPC | 2022-04-22 | Paper |
| Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration | 2022-04-22 | Paper |
| Sublinear GMW-style compiler for MPC with preprocessing | 2022-04-22 | Paper |
| On pseudorandom encodings | 2022-03-23 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage''
Journal of Cryptology | 2022-03-03 | Paper |
| A geometric approach to homomorphic secret sharing | 2021-12-21 | Paper |
| Function secret sharing for mixed-mode and fixed-point secure computation | 2021-12-08 | Paper |
| On computational shortcuts for information-theoretic PIR | 2021-12-01 | Paper |
Correction to: ``Unconditionally secure computation against low-complexity leakage''
Journal of Cryptology | 2021-11-24 | Paper |
Unconditionally secure computation against low-complexity leakage
Journal of Cryptology | 2021-09-10 | Paper |
On the local leakage resilience of linear secret sharing schemes
Journal of Cryptology | 2021-06-28 | Paper |
| Foundations of homomorphic secret sharing | 2021-06-15 | Paper |
| Limits of practical sublinear secure computation | 2020-06-30 | Paper |
| Private circuits: a modular approach | 2020-06-30 | Paper |
| On fully secure MPC with solitary output | 2020-04-30 | Paper |
| Secure computation with preprocessing via function secret sharing | 2020-04-30 | Paper |
Unconditionally secure computation against low-complexity leakage
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
| Reusable non-interactive secure computation | 2020-03-09 | Paper |
| Trapdoor hash functions and their applications | 2020-03-09 | Paper |
| Zero-knowledge proofs on secret-shared data via fully linear PCPs | 2020-03-09 | Paper |
| Efficient pseudorandom correlation generators: silent OT extension and more | 2020-03-09 | Paper |
| Cryptographic sensing | 2020-03-09 | Paper |
| Two-round MPC: information-theoretic and black-box | 2018-12-11 | Paper |
| Best possible information-theoretic MPC | 2018-12-06 | Paper |
| Exploring crypto dark matter: new simple PRF candidates and their applications | 2018-12-06 | Paper |
On the local leakage resilience of linear secret sharing schemes
Lecture Notes in Computer Science | 2018-09-12 | Paper |
| Quasi-optimal SNARGs via linear multi-prover interactive proofs | 2018-07-17 | Paper |
| On the message complexity of secure multiparty computation | 2018-05-16 | Paper |
| Low-complexity cryptographic hash functions | 2018-05-03 | Paper |
Minimizing locality of one-way functions via semi-private randomized encodings
Journal of Cryptology | 2018-04-26 | Paper |
| Non-interactive multiparty computation without correlated randomness | 2018-02-23 | Paper |
| Two-message witness indistinguishability and secure computation in the plain model from new assumptions | 2018-02-23 | Paper |
| Actively secure garbled circuits with constant communication overhead in the plain model | 2018-01-19 | Paper |
| How to construct a leakage-resilient (stateless) trusted party | 2018-01-19 | Paper |
| Near-optimal secret sharing and error correcting codes in \(\mathsf{AC}^0\) | 2018-01-19 | Paper |
| Can we access a database both locally and privately? | 2018-01-19 | Paper |
| The price of low communication in secure multi-party computation | 2017-11-03 | Paper |
Lattice-based SNARGs and their application to more efficient obfuscation
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Ad hoc PSM protocols: secure computation without coordination
Lecture Notes in Computer Science | 2017-06-23 | Paper |
Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Lossy chains and fractional secret sharing | 2017-01-30 | Paper |
Encoding functions with constant online rate, or how to compress garbled circuit keys
SIAM Journal on Computing | 2017-01-13 | Paper |
Binary AMD circuits from secure multiparty computation
Theory of Cryptography | 2016-12-21 | Paper |
Breaking the circuit size barrier for secure computation under DDH
Advances in Cryptology – CRYPTO 2016 | 2016-11-30 | Paper |
Bounded indistinguishability and the complexity of recovering secrets
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Secure protocol transformations
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
From randomizing polynomials to parallel algorithms
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Improved upper bounds on information-theoretic private information retrieval (extended abstract)
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
One-way functions are essential for single-server private information retrieval
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Secure multiparty computation with general interaction patterns
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Distribution design
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
On public key encryption from noisy codewords
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Private large-scale databases with distributed searchable symmetric encryption
Topics in Cryptology - CT-RSA 2016 | 2016-04-08 | Paper |
Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
Theory of Cryptography | 2016-04-08 | Paper |
Selective private function evaluation with applications to private statistics
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
Universal service-providers for database private information retrieval (extended abstract)
Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
Secure computation with minimal interaction, revisited
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Secure computation from leaky correlated randomness
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Efficient multi-party computation: from passive to active security via secure SIMD circuits
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Cryptography with One-Way Communication
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Parallel Hashing via List Recoverability
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Statistical randomized encodings: a complexity theoretic view
Automata, Languages, and Programming | 2015-10-27 | Paper |
Function secret sharing
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Secure multiparty computation of approximations
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Public-coin differing-inputs obfuscation and its applications
Theory of Cryptography | 2015-07-06 | Paper |
Circuits resilient to additive attacks with applications to secure computation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
The round complexity of verifiable secret sharing and secure multicast
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Black-box constructions for secure computation
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
On linear-size pseudorandom generators and hardcore functions
Theoretical Computer Science | 2014-10-06 | Paper |
Non-interactive secure multiparty computation
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Secure multi-party computation with identifiable abort
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
How to Garble Arithmetic Circuits
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
How to garble arithmetic circuits
SIAM Journal on Computing | 2014-07-30 | Paper |
Extracting correlations
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Partial garbling schemes and their applications
Automata, Languages, and Programming | 2014-07-01 | Paper |
Distributed Point Functions and Their Applications
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
On the complexity of UC commitments
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
On the Cryptographic Complexity of the Worst Functions
Theory of Cryptography | 2014-02-18 | Paper |
Probabilistically checkable proofs of proximity with zero-knowledge
Theory of Cryptography | 2014-02-18 | Paper |
Zero knowledge LTCs and their applications
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
Encoding functions with constant online rate or how to compress garbled circuits keys
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Robust pseudorandom generators
Automata, Languages, and Programming | 2013-08-06 | Paper |
On linear-size pseudorandom generators and hardcore functions
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Theory of Cryptography | 2013-03-18 | Paper |
On the power of correlated randomness in secure computation
Theory of Cryptography | 2013-03-18 | Paper |
Identifying cheaters without an honest majority
Theory of Cryptography | 2012-06-15 | Paper |
On Efficient Zero-Knowledge PCPs
Theory of Cryptography | 2012-06-15 | Paper |
Constant-rate oblivious transfer from noisy channels
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Black-box constructions of protocols for secure computation
SIAM Journal on Computing | 2011-07-29 | Paper |
Efficient non-interactive secure computation
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Correlation Extractors and Their Applications
Lecture Notes in Computer Science | 2011-05-19 | Paper |
On achieving the ``best of both worlds'' in secure multiparty computation
SIAM Journal on Computing | 2011-05-17 | Paper |
On Invertible Sampling and Adaptive Security
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
On \(d\)-multiplicative secret sharing
Journal of Cryptology | 2010-11-12 | Paper |
On locally decodable codes, self-correctable codes, and \(t\)-private PIR
Algorithmica | 2010-11-08 | Paper |
From secrecy to soundness: efficient verification via secure computation (extended abstract)
Automata, Languages and Programming | 2010-09-07 | Paper |
Secure multiparty computation with minimal interaction
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Interactive locking, zero-knowledge PCPs, and unconditional cryptography
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Batch codes and their applications
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Zero-knowledge proofs from secure multiparty computation
SIAM Journal on Computing | 2010-07-07 | Paper |
Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Bounded key-dependent message security
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Founding Cryptography on Tamper-Proof Hardware Tokens
Theory of Cryptography | 2010-02-24 | Paper |
On complete primitives for fairness
Theory of Cryptography | 2010-02-24 | Paper |
Cryptography with constant input locality
Journal of Cryptology | 2009-11-13 | Paper |
Private multiparty sampling and approximation of vector combinations
Theoretical Computer Science | 2009-04-29 | Paper |
Cryptography with Constant Input Locality
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Secure Arithmetic Computation with No Honest Majority
Theory of Cryptography | 2009-03-03 | Paper |
On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Founding Cryptography on Oblivious Transfer – Efficiently
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| Cryptography with constant computational overhead | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485433 (Why is no real title available?) | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485580 (Why is no real title available?) | 2009-01-05 | Paper |
On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
Computational Complexity | 2008-08-20 | Paper |
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
Advances in Cryptology – CRYPTO 2005 | 2008-03-17 | Paper |
OT-Combiners via Secure Computation
Theory of Cryptography | 2008-03-05 | Paper |
Basing Weak Public-Key Cryptography on Strong One-Way Functions
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Private Multiparty Sampling and Approximation of Vector Combinations
Automata, Languages and Programming | 2007-11-28 | Paper |
Computationally private randomizing polynomials and their applications
Computational Complexity | 2007-11-05 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Private Circuits II: Keeping Secrets in Tamperable Circuits
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
Cryptography in $NC^0$
SIAM Journal on Computing | 2007-09-07 | Paper |
Scalable Secure Multiparty Computation
Lecture Notes in Computer Science | 2007-09-04 | Paper |
On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Evaluating Branching Programs on Encrypted Data
Theory of Cryptography | 2007-08-30 | Paper |
On Pseudorandom Generators with Linear Stretch in NC0
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
On the Power of Nonlinear Secret-Sharing
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
General constructions for information-theoretic private information retrieval
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Adaptive versus non-adaptive security of multi-party protocols
Journal of Cryptology | 2004-10-01 | Paper |
Reducing the servers' computation in private information retrieval: PIR with preprocessing
Journal of Cryptology | 2004-09-27 | Paper |
| scientific article; zbMATH DE number 2086626 (Why is no real title available?) | 2004-08-11 | Paper |
Private computation using a PEZ dispenser.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2009982 (Why is no real title available?) | 2003-11-26 | Paper |
| scientific article; zbMATH DE number 1942420 (Why is no real title available?) | 2003-06-30 | Paper |
On privacy and partition arguments
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1775399 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1775398 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1759771 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1754645 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1754644 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1722674 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1722683 (Why is no real title available?) | 2002-03-21 | Paper |
Universal service-providers for private information retrieval
Journal of Cryptology | 2001-05-13 | Paper |
Protecting data privacy in private information retrieval schemes
Journal of Computer and System Sciences | 2000-08-27 | Paper |
| scientific article; zbMATH DE number 1418319 (Why is no real title available?) | 2000-07-19 | Paper |
Valid Generalisation from Approximate Interpolation
Combinatorics, Probability and Computing | 1997-07-07 | Paper |
