Solving low-density subset sum problems
Journal of the ACM (JACM)
Towards implementing robust geometric computations
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Random lattices, threshold phenomena and efficient reduction algorithms
Theoretical Computer Science
A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
A Lattice-Based Public-Key Cryptosystem
SAC '98 Proceedings of the Selected Areas in Cryptography
The Shortest Vector Problem in Lattices with Many Cycles
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The optimal LLL algorithm is still polynomial in fixed dimension
Theoretical Computer Science - Latin American theoretical informatics
Simultaneous diophantine approximation with excluded primes
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
ACM Transactions on Algorithms (TALG)
An improved lower bound for approximating Shortest Integer Relation in l∞ norm (SIR∞)
Information Processing Letters
On exact and approximate interpolation of sparse rational functions
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Splitting the Control Flow with Boolean Flags
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
New Hardness Results for Diophantine Approximation
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness
Formal Methods in System Design
Two variables per linear inequality as an abstract domain
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
A new transference theorem in the geometry of numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
An improved tight closure algorithm for integer octagonal constraints
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
EDF-schedulability of synchronous periodic task systems is coNP-hard
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Vector rational number reconstruction
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
Rounding coefficients and artificially underflowing terms in non-numeric expressions
ACM Communications in Computer Algebra
The complexity of integer bound propagation
Journal of Artificial Intelligence Research
Using the inhomogeneous simultaneous approximation problem for cryptographic design
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Journal of Symbolic Computation
Zap: automated theorem proving for software analysis
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Parametrized greedy heuristics in theory and practice
HM'05 Proceedings of the Second international conference on Hybrid Metaheuristics
An efficient decision procedure for UTVPI constraints
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
An efficient algorithm for a class of constraint satisfaction problems
Operations Research Letters
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters
Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |