| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stasys Jukna |
Clique Problem, Cutting Plane Proofs, and Communication Complexity.  |
Electronic Colloquium on Computational Complexity (ECCC)  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Limitations of Incremental Dynamic Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Independent set problem for individual graphs has small communication complexity |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Yet harder knapsack problems. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-rank conjecture for log-depth circuits. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák |
On convex complexity measures. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Representing (0, 1)-matrices by boolean circuits. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Circuits with arbitrary gates for random operators |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-Rank Conjecture for Log-Depth Circuits |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
A nondeterministic space-time tradeoff for linear codes. |
Inf. Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák |
On convex complexity measures. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Min-Rank Conjecture for Log-Depth Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Alexander S. Kulikov |
On covering graphs by complete bipartite subgraphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
On set intersection representations of graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Entropy of operators or why matrix multiplication is hard for small depth circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Expanders and time-restricted branching programs. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander E. Andreev, Stasys Jukna |
Very large cliques are easy to detect. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
On Graph Complexity. |
Combinatorics, Probability & Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Disproving the Single Level Conjecture. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander E. Andreev, Stasys Jukna |
Very Large Cliques are Easy to Detect. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Graphs and Circuits: Some Further Remarks. |
Complexity of Boolean Functions |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
On the P versus NP intersected with co-NP question in communication complexity. |
Inf. Process. Lett. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Disproving the single level conjecture |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Expanders and time-restricted branching programs |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
On the minimum number of negations leading to super-polynomial savings. |
Inf. Process. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
On Graph Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
A note on the P versus NP intersected with co-NP question in communication complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On multi-partition communication complexity. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Stanislav Zák |
On uncertainty versus size in branching programs. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
Triangle-Freeness Is Hard To Detect. |
Combinatorics, Probability & Computing |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
A Note on the Minimum Number of Negations Leading to Superpolynomial Savings |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Stanislav Zák |
On Uncertainty versus Size in Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Georg Schnitger |
On Multi-Partition Communication Complexity of Triangle-Freeness |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Extremal combinatorics - with applications in computer science. |
|
2001 |
RDF |
|
| 1 | Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger |
On Multipartition Communication Complexity. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Stanislav Zák |
Some Notes on the Information Flow in Read-Once Branching Programs. |
SOFSEM |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Combinatorics of Monotone Computations. |
Combinatorica |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 03D15, 05D15, 68R05, 05C65, 05B30 |
| 1 | Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener |
On P versus NP cap co-NP for decision trees and read-once branching programs. |
Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Stanislav Zák |
On Branching Programs With Bounded Uncertainty |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Combinatorics of Monotone Computations |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Alexander A. Razborov |
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much. |
Discrete Applied Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna, Stanislav Zák |
On Branching Programs With Bounded Uncertainty (Extended Abstract). |
ICALP |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Exponential Lower Bounds for Semantic Resolution |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener |
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener |
On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. |
MFCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Finite Limits and Monotone Computations: The Lower Bounds Criterion. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
real gates, lower bounds, threshold gates, monotone circuits |
| 1 | Stasys Jukna |
Finite Limits and Monotone Computations |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna, Alexander A. Razborov |
Neither Reading Few Bits Twice nor Reading Illegally Helps Much |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
On Communication Games with More than Two Players |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Carsten Damm, Stasys Jukna |
On Multiparity Games for Pointer Jumping |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Stasys Jukna |
The Graph of Integer Multiplication is Hard for Read-k-Times Networks |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1995 |
RDF |
|
| 1 | Stasys Jukna |
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Carsten Damm, Stasys Jukna, Jiri Sgall |
Some Bounds on Multiparty Communication Complexity of Pointer Jumping |
Electronic Colloquium on Computational Complexity (ECCC) |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
A Note on Read-k Times Branching Programs. |
ITA |
1995 |
DBLP BibTeX RDF |
|
| 1 | Johan Håstad, Stasys Jukna, Pavel Pudlák |
Top-Down Lower Bounds for Depth-Three Circuits. |
Computational Complexity |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Finite Limits and Lower Bounds for Circuits Size |
Universität Trier, Mathematik/Informatik, Forschungsbericht |
1994 |
RDF |
|
| 1 | Stasys Jukna |
A Note on Read-k Times Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1994 |
DBLP BibTeX RDF |
|
| 1 | Johan Håstad, Stasys Jukna, Pavel Pudlák |
Top-Down Lower Bounds for Depth 3 Circuits |
FOCS |
1993 |
DBLP DOI BibTeX RDF |
nonmonotone circuits, top-down lower bounds, depth 3 circuits, depth 3 AND-OR-NOT circuits, strong lower bound, top-down argument |
| 1 | Stasys Jukna |
Optimal versus Stable in Boolean Formulae. |
FCT |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
The Effect of Null-Chains on the Complexity of Contact Schemes. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Stasys Jukna |
Entropy of Contact Circuits and Lower Bounds on Their Complexity. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Two Lower Bounds for Circuits over the Basis (&, V, -). |
MFCS |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Information Flow and Width of Branching Programs (Extended Abstract). |
FCT |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Stasys Jukna |
Lower Bounds on the Complexity of Local Circuits (Preliminary Report). |
MFCS |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")