Fast numerical improvement of factors of polynomials and of partial fractions
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Least adaptive optimal search with unreliable tests
Theoretical Computer Science
Binary search with delayed and missing answers
Information Processing Letters
Least Adaptive Optimal Search with Unreliable Tests
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
coping with Delays and Time-Outs in Binary Search Procedures
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On the Power of Additive Combinatorial Search Model
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Searching dynamically bundled goods with pairwise relations
Proceedings of the 4th ACM conference on Electronic commerce
Optimal detection of two counterfeit coins with two-arms balance
Discrete Applied Mathematics
Discrete Applied Mathematics
Improved Results for Competitive Group Testing
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
On searching strategies, parallel questions, and delayed answers
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
The plurality problem with three colors and more
Theoretical Computer Science
Searching for two counterfeit coins with two-arms balance
Discrete Applied Mathematics
Minimal average cost of searching for a counterfeit coin: restricted model
Discrete Applied Mathematics
Searching for a counterfeit coin with b-balance
Discrete Applied Mathematics
Searching for a counterfeit coin with two unreliable weighings
Discrete Applied Mathematics - Special issue: Max-algebra
Note: A competitive algorithm in searching for many edges in a hypergraph
Discrete Applied Mathematics
Q-ary search with one lie and bi-interval queries
Information Processing Letters
Optimal query complexity bounds for finding graphs
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Protocol completion incentive problems in cryptographic Vickrey auctions
Electronic Commerce Research
Nonadaptive algorithms for threshold group testing
Discrete Applied Mathematics
Binary trees with choosable edge lengths
Information Processing Letters
Searching for two counterfeit coins with two-arms balance
Discrete Applied Mathematics
Searching for a counterfeit coin with two unreliable weighings
Discrete Applied Mathematics
Finding an unknown acyclic orientation of a given graph
Combinatorics, Probability and Computing
Counting linear extension majority cycles in partially ordered sets on up to 13 elements
Computers & Mathematics with Applications
Generalized framework for selectors with applications in optimal group testing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Optimal query complexity bounds for finding graphs
Artificial Intelligence
Reconstructing weighted graphs with minimal query complexity
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
An empirical analysis of terminological representation systems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Toward a deterministic polynomial time algorithm with optimal additive query complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
ALGOSENSORS'10 Proceedings of the 6th international conference on Algorithms for sensor systems, wireless adhoc networks, and autonomous mobile entities
Computing majority with triple queries
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Reconstruction of hidden graphs and threshold group testing
Journal of Combinatorial Optimization
Minimum average-case queries of q+1-ary search game with small sets
Discrete Applied Mathematics
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Theoretical Computer Science
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
General Theory of Information Transfer and Combinatorics
The rigidity of hamming spaces
General Theory of Information Transfer and Combinatorics
Minimax trees in linear time with applications
European Journal of Combinatorics
Computing majority with triple queries
Theoretical Computer Science
Random Structures & Algorithms
Search when the lie depends on the target
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.01 |