Extremal combinatorics: with applications in computer science S Jukna
Springer, 2001
743 2001 Boolean function complexity: advances and frontiers S Jukna
Springer, 2012
552 2012 Top-down lower bounds for depth-three circuits J Håstad, S Jukna, P Pudlák
Computational Complexity 5 (2), 99-112, 1995
82 * 1995 A note on read-times branching programs S Jukna
RAIRO-Theoretical Informatics and Applications 29 (1), 75-83, 1995
71 1995 On graph complexity S Jukna
Combinatorics, Probability and Computing 15 (6), 855-876, 2006
69 2006 Extremal combinatorics. Texts in Theoretical Computer Science. An EATCS Series S Jukna
Springer-Verlag, Berlin, 2001
58 2001 Entropy of contact circuits and lower bounds on their complexity SP Jukna
Theoretical Computer Science 57 (1), 113-129, 1988
56 1988 On covering graphs by complete bipartite subgraphs S Jukna, AS Kulikov
Discrete Mathematics 309 (10), 3399-3403, 2009
50 2009 The effect of null-chains on the complexity of contact schemes SP Jukna
International Conference on Fundamentals of Computation Theory, 246-256, 1989
42 1989 On P versus NP S Jukna, A Razborov, P Savicky, I Wegener
Computational Complexity 8 (4), 357-370, 1999
41 1999 Neither reading few bits twice nor reading illegally helps much S Jukna, A Razborov
Discrete Applied Mathematics 85 (3), 223-238, 1998
41 1998 Complexity of linear boolean operators S Jukna, I Sergeev
Foundations and Trends® in Theoretical Computer Science 9 (1), 1-123, 2013
36 2013 Some bounds on multiparty communication complexity of pointer jumping C Damm, S Jukna, J Sgall
Computational Complexity 7 (2), 109-127, 1998
36 1998 On multi-partition communication complexity P Ďuriš, J Hromkovič, S Jukna, M Sauerhoff, G Schnitger
Information and computation 194 (1), 49-75, 2004
31 2004 On the optimality of Bellman–Ford–Moore shortest path algorithm S Jukna, G Schnitger
Theoretical Computer Science 628, 101-109, 2016
30 2016 Combinatorics of monotone computations S Jukna
Combinatorica 19 (1), 65-85, 1999
29 1999 On P versus NP∩ co-NP for decision trees and read-once branching programs S Jukna, A Razborov, P Savický, I Wegener
Mathematical Foundations of Computer Science 1997: 22nd International …, 1997
28 1997 Lower bounds for tropical circuits and dynamic programs S Jukna
Theory of Computing Systems 57 (1), 160-194, 2015
26 2015 Boolean function complexity, volume 27 of Algorithms and Combinatorics S Jukna
Springer, Heidelberg, 2012
20 2012 The graph of integer multiplication is hard for read-k-times networks S Jukna
Univ., Mathematik/Informatik, 1995
18 1995 
Alexander RazborovUniversity of ChicagoEmail yang diverifikasi di math.uchicago.edu