Constructing nonresidues in finite fields and the extended Riemann hypothesis
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient and exact data dependence analysis
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On polynomial approximation to the shortest lattice vector length
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Sparse polynomial approximation in finite fields
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGACT News
Designs, Codes and Cryptography
Fast 2-Variable Integer Programming
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the Generalised Hidden Number Problem and Bit Security of XTR
AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Exact Solutions for CLOSEST STRING and Related Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Lattice Reduction by Random Sampling and Birthday Methods
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Hidden Number Problem with the Trace and Bit Security of XTR and LUC
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Segment LLL-Reduction of Lattice Bases
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
An Overview of the Sieve Algorithm for the Shortest Lattice Vector Problem
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Non-standard approaches to integer programming
Discrete Applied Mathematics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Lattice problems and norm embeddings
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Fast LLL-type lattice reduction
Information and Computation
Hardness of approximating the Shortest Vector Problem in high ℓp norms
Journal of Computer and System Sciences - Special issue on FOCS 2003
Reconstructing noisy polynomial evaluation in residue rings
Journal of Algorithms
Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal routing in double loop networks
Theoretical Computer Science
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Quantum algorithm for a generalized hidden shift problem
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Designs, Codes and Cryptography
Efficient reductions among lattice problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Cryptography Based on Quadratic Forms: Complexity Considerations
Research in Cryptology
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Broadcast Attacks against Lattice-Based Cryptosystems
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Fast LLL-type lattice reduction
Information and Computation
Factoring integers and computing discrete logarithms via diophantine approximation
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Attacking the Chor-Rivest cryptosystem by improved lattice reduction
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Proceedings of the forty-second ACM symposium on Theory of computing
Augmented lattice reduction for MIMO decoding
IEEE Transactions on Wireless Communications
Basis reduction and the complexity of branch-and-bound
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithms and theory of computation handbook
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Linear-time nearest point algorithms for coxeter lattices
IEEE Transactions on Information Theory
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
SIAM Journal on Computing
SIAM Journal on Discrete Mathematics
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption
Information Processing Letters
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Covering cubes and the closest vector problem
Proceedings of the twenty-seventh annual symposium on Computational geometry
Algorithms for the shortest and closest lattice vector problems
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Approximating the closest vector problem using an approximate shortest vector oracle
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Parameterized complexity results for 1-safe Petri nets
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Mathematics of Operations Research
Adapting density attacks to low-weight knapsacks
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
On finding a shortest path in circulant graphs with two jumps
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Cryptanalysis of the quadratic generator
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Bin packing with fixed number of bins revisited
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
An OPT+1 algorithm for the cutting stock problem with constant number of object lengths
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Scheduling jobs on identical and uniform processors revisited
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
A O(1/ε2)n-time sieving algorithm for approximate integer programming
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Column basis reduction and decomposable knapsack problems
Discrete Optimization
A(3/2+ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A complexity analysis of a Jacobi method for lattice basis reduction
Proceedings of the Fifth International C* Conference on Computer Science and Software Engineering
Sampling methods for shortest vectors, closest vectors and successive minima
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Bin packing with fixed number of bins revisited
Journal of Computer and System Sciences
European Journal of Combinatorics
Exact algorithms for weighted and unweighted borda manipulation problems
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
On explaining integer vectors by few homogenous segments
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Integer feasibility of random polytopes: random integer programs
Proceedings of the 5th conference on Innovations in theoretical computer science
A note on BDD problems with λ2 -gap
Information Processing Letters
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
Improvements in closest point search based on dual HKZ-bases
Theoretical Computer Science
Recovering a sum of two squares decomposition
Journal of Symbolic Computation
| Hi-index | 0.07 |