| 2013 | ||
|---|---|---|
| c6 | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On parallelizing matrix multiplication by the column-row method. ALENEX 2013: 122-132 | |
| c5 | ||
| c4 | Konstantin Kutzkov, Rasmus Pagh: On the streaming complexity of computing local clustering coefficients. WSDM 2013: 677-686 | |
| 2012 | ||
| j3 | Konstantin Kutzkov: An exact exponential time algorithm for counting bipartite cliques. Inf. Process. Lett. 112(13): 535-539 (2012) | |
| c3 | Konstantin Kutzkov: Improved Counter Based Algorithms for Frequent Pairs Mining in Transactional Data Streams. ECML/PKDD (1) 2012: 843-858 | |
| i3 | ||
| i2 | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On Parallelizing Matrix Multiplication by the Column-Row Method. CoRR abs/1210.0461 (2012) | |
| 2011 | ||
| c2 | Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops 2011: 145-150 | |
| 2010 | ||
| i1 | Konstantin Kutzkov, Dominik Scheder: Using CSP To Improve Deterministic 3-SAT. CoRR abs/1007.1166 (2010) | |
| 2007 | ||
| j2 | ||
| c1 | Alexander S. Kulikov, Konstantin Kutzkov: New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204 | |
| 2006 | ||
| j1 | Konstantin Kutzkov: A Note on the Use of Independent Sets for the k-SAT Problem. JSAT 1(2): 143-145 (2006) | |
| 1 | Andrea Campagna | |
| 2 | Alexander S. Kulikov | |
| 3 | Rasmus Pagh | |
| 4 | Dominik Scheder |
Data released under the ODC-BY 1.0 license — See also our legal information page