Panagiotis Voulgaris
Artificial Intelligence · 2010
A researcher in the Science corpus: 2 papers; trusts 12 researchers and is trusted by 11 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 14 citations into it; #7,972 of 35,345 by trust here, #19,873 by citations
- Computational Theory and Mathematics — 11 citations into it; #1,954 of 12,182 by trust here, #4,696 by citations
Whom Panagiotis Voulgaris trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Oded Regev
- Daniele Micciancio
- Chris Peikert
- Erik Agrell
- Craig Gentry
- Phong Q. Nguyen
- Ravi Kumar
- Brent Waters
- Thomas Eriksson
- D. Sivakumar
Who trusts Panagiotis Voulgaris overall
- Richard Lindner
- Yuanmi Chen
- Phong Q. Nguyen
- Daniele Micciancio
- Nicolas Gama
- Zvika Brakerski
- Chris Peikert
- Damien Stehlé
- Oded Regev
- Ron Steinfeld
Papers from Panagiotis Voulgaris's perspective
Ordered by how strongly the researchers Panagiotis Voulgaris trusts endorse each paper. Same corpus, a different order for every researcher.
- Trapdoors for hard lattices and new cryptographic constructions
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- New lattice based cryptographic constructions
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- Generating hard instances of lattice problems (extended abstract)
- On lattices, learning with errors, random linear codes, and cryptography
- Faster exponential time algorithms for the shortest vector problem
- Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions (The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.)
- The Two Faces of Lattices in Cryptology (ACM Symposium on Applied Computing)
- Closest point search in lattices (IEEE Transactions on Information Theory)
Their papers
- A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (2010) — 356 citations
- Faster exponential time algorithms for the shortest vector problem (2010) — 275 citations