Petteri Kaski

Algorithms & Complexity · 2005–2010

A researcher in the Science corpus: 4 papers; trusts 8 researchers and is trusted by 15 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 12 citations into it
• Computational Theory and Mathematics — 10 citations into it; #2,660 of 12,182 by trust here, #5,046 by citations
• Artificial Intelligence — 5 citations into it

Whom Petteri Kaski trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Ryan Williams
2. Takunari Miyazaki
3. László Babai
4. Jin-Yi Cai
5. Eugene M. Luks
6. Martin Fürer

Who trusts Petteri Kaski overall

1. Ferenc SzollHosi
2. Hadi Kharaghani
3. Eric D. Schoen
4. Paul Tonelli
5. Behruz Tayfeh-Rezaie
6. Patric R. J. Östergård
7. Christoph Berkholz
8. Pieter T. Eendebak
9. Tommi A. Junttila
10. Man Nguyen

Papers from Petteri Kaski's perspective

Ordered by how strongly the researchers Petteri Kaski trusts endorse each paper. Same corpus, a different order for every researcher.

1. Canonical labeling of graphs
2. Isomorphism of graphs of bounded valence can be tested in polynomial time
3. On construction and identification of graphs
4. The graph isomorphism disease
5. A Note on the Graph Isomorphism counting Problem
6. On the Foundations of Combinatorial Theory
7. Faster integer multiplication (Symposium on the Theory of Computing)
8. A new algorithm for optimal 2-constraint satisfaction and its implications
9. An optimal lower bound on the number of variables for graph identification
10. Chaff: engineering an efficient SAT solver (Proceedings - Design Automation Conference)

Their papers

• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (2007) — 323 citations
• Classification Algorithms for Codes and Designs (2005) — 266 citations
• Fourier meets möbius: fast subset convolution (2006) — 354 citations
• Exact exponential algorithms (2010) — 543 citations