Konstantin Kutzkov Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
c6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On parallelizing matrix multiplication by the column-row method. ALENEX 2013: 122-132
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: Deterministic algorithms for skewed matrix products. STACS 2013: 466-477
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov, Rasmus Pagh: On the streaming complexity of computing local clustering coefficients. WSDM 2013: 677-686
2012
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: An exact exponential time algorithm for counting bipartite cliques. Inf. Process. Lett. 112(13): 535-539 (2012)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: Improved Counter Based Algorithms for Frequent Pairs Mining in Transactional Data Streams. ECML/PKDD (1) 2012: 843-858
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: Deterministic algorithms for skewed matrix products. CoRR abs/1209.4508 (2012)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: On Parallelizing Matrix Multiplication by the Column-Row Method. CoRR abs/1210.0461 (2012)
2011
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrea Campagna, Konstantin Kutzkov, Rasmus Pagh: Frequent Pairs in Data Streams: Exploiting Parallelism and Skew. ICDM Workshops 2011: 145-150
2010
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov, Dominik Scheder: Using CSP To Improve Deterministic 3-SAT. CoRR abs/1007.1166 (2010)
2007
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: New upper bound for the #3-SAT problem. Inf. Process. Lett. 105(1): 1-5 (2007)
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Alexander S. Kulikov, Konstantin Kutzkov: New Bounds for MAX-SAT by Clause Learning. CSR 2007: 194-204
2006
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Konstantin Kutzkov: A Note on the Use of Independent Sets for the k-SAT Problem. JSAT 1(2): 143-145 (2006)

Coauthor Index

1Andrea Campagna
[c6] [i2] [c2]
2Alexander S. Kulikov
[c1]
3Rasmus Pagh
[c6] [c4] [i2] [c2]
4Dominik Scheder
[i1]
Last update Tue May 21 22:46:35 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page