On isomorphisms of finite Cayley graphs: a survey
Discrete Mathematics
Zero-patterns of polynomials and Newton polytopes
Journal of Combinatorial Theory Series A
Zero-sum problems and coverings by proper cosets
European Journal of Combinatorics
Schütte's Tournament Problem and Intersecting Families of Sets
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Extractors with weak random seeds
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ordinal embeddings of minimum relaxation: general properties, trees, and ultrametrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The cover time of two classes of random graphs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Extractors for Affine Sources over Large Fields
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Random Lifts of Graphs: Edge Expansion
Combinatorics, Probability and Computing
The maximum edit distance from hereditary graph properties
Journal of Combinatorial Theory Series B
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
ACM Transactions on Algorithms (TALG)
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
Highly acyclic groups, hypergraph covers, and the guarded fragment
Journal of the ACM (JACM)
Optimal social choice functions: a utilitarian view
Proceedings of the 13th ACM Conference on Electronic Commerce
Space lower bounds for low-stretch greedy embeddings
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry
Groupoids, Hypergraphs, and Symmetries in Finite Models
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Hi-index | 0.00 |