Stasys Jukna

发表

On set intersection representations of graphs

Stasys Jukna, 2009, J. Graph Theory.

On Communication Games with More than Two Players

Stasys Jukna, 1995, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Crashkurs Mathematik für Informatiker

Stasys Jukna, 2008, Leitfäden der Informatik.

Some Bounds on Multiparty Communication Complexity of Pointer Jumping

Jirí Sgall, Carsten Damm, Stasys Jukna, 1996, STACS.

Finite Limits and Monotone Computations

Stasys Jukna, 1996, Electron. Colloquium Comput. Complex..

Representing (0, 1)-matrices by boolean circuits

Stasys Jukna, 2010, Discret. Math..

On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs

Alexander A. Razborov, Ingo Wegener, Stasys Jukna, 1997, computational complexity.

Complexity of Linear Boolean Operators

Stasys Jukna, Igor S. Sergeev, S. Jukna, 2013, Found. Trends Theor. Comput. Sci..

Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits

Stasys Jukna, 2008, Theory of Computing Systems.

Neither Reading Few Bits Twice Nor Reading Illegally Helps Much

Alexander A. Razborov, Stasys Jukna, A. Razborov, 1998, Discret. Appl. Math..

Two Lower Bounds for Circuits over the Basis (&, V, -)

Stasys Jukna, 1988, MFCS.

On multi-partition communication complexity

Juraj Hromkovic, Georg Schnitger, Martin Sauerhoff, 2004, Inf. Comput..

Extremal Combinatorics

Stasys Jukna, Dr. Stasys Jukna, 2001, Texts in Theoretical Computer Science. An EATCS Series.

Exponential lower bounds for semantic resolution

Stasys Jukna, 1996, Proof Complexity and Feasible Arithmetics.

Finite limits and monotone computations: the lower bounds criterion

Stasys Jukna, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Yet harder knapsack problems

Georg Schnitger, Stasys Jukna, 2011, Theor. Comput. Sci..

Incremental versus Non-Incremental Dynamic Programming

Stasys Jukna, 2018, Electron. Colloquium Comput. Complex..

Min-rank conjecture for log-depth circuits

Georg Schnitger, Stasys Jukna, 2011, J. Comput. Syst. Sci..

Limitations of Incremental Dynamic Programming

Stasys Jukna, 2013, Algorithmica.

Entropy of operators or why matrix multiplication is hard for small depth circuits

Stasys Jukna, 2008, Electron. Colloquium Comput. Complex..

The Graph of Integer Multiplication is Hard for Read-k-Times Networks

Stasys Jukna, 1995, Universität Trier, Mathematik/Informatik, Forschungsbericht.

On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs

Alexander A. Razborov, Ingo Wegener, Stasys Jukna, 1997, MFCS.

Independent set problem for individual graphs has small communication complexity pdf

Stasys Jukna, 2012, ArXiv.

Disproving the Single Level Conjecture

Stasys Jukna, S. Jukna, 2006, SIAM J. Comput..

On Branching Programs With Bounded Uncertainty

Stasys Jukna, Stanislav Zák, 1998, Electron. Colloquium Comput. Complex..

A Note on Read-k Times Branching Programs

Stasys Jukna, S. Jukna, 1994, RAIRO Theor. Informatics Appl..

On Graph Complexity

Stasys Jukna, S. Jukna, 2006, Combinatorics, Probability and Computing.

Top-down lower bounds for depth 3 circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Lower Bounds for Circuits of Bounded Negation Width

Andrzej Lingas, Stasys Jukna, 2018, Electron. Colloquium Comput. Complex..

Lower Bounds for Tropical Circuits and Dynamic Programs

Stasys Jukna, 2014, Theory of Computing Systems.

Graphs and Circuits: Some Further Remarks

Stasys Jukna, 2006, Complexity of Boolean Functions.

Approximation Limitations of Pure Dynamic Programming pdf

Stasys Jukna, Hannes Seiwert, S. Jukna, 2020, SIAM J. Comput..

Lower Bounds on the Complexity of Local Circuits (Preliminary Report)

Stasys Jukna, S. Jukna, 1986, MFCS.

A Criterion for Monotone Circuit Complexity

Stasys Jukna, 1991 .

Triangle-Freeness Is Hard To Detect

Georg Schnitger, Stasys Jukna, 2002, Comb. Probab. Comput..

Lower Bounds for DeMorgan Circuits of Bounded Negation Width

Andrzej Lingas, Stasys Jukna, 2019, STACS.

Information Flow and Width of Branching Programs (Extended Abstract)

Stasys Jukna, 1987, FCT.

Printed Copies: Finite Limits and Lower Bounds for Circuits Size Finite Limits and Lower Bounds for Circuits Size

Stasys Jukna, S. Jukna, Trierer Forschungsberichte, 2022 .

Derandomizing Dynamic Programming and Beyond

Stasys Jukna, S. Jukna, 2018, Electron. Colloquium Comput. Complex..

Cutting planes cannot approximate some integer programs

Georg Schnitger, Stasys Jukna, G. Schnitger, 2012, Oper. Res. Lett..

Approximation Limitations of Tropical Circuits

Stasys Jukna, Hannes Seiwert, 2018, Electron. Colloquium Comput. Complex..

Coin Flipping Cannot Shorten Arithmetic Computations

Stasys Jukna, 2019, Am. Math. Mon..

On uncertainty versus size in branching programs

Stasys Jukna, Stanislav Zák, 2003, Theor. Comput. Sci..

Coin Flipping in Dynamic Programming Is Almost Useless

Stasys Jukna, S. Jukna, 2020, ACM Trans. Comput. Theory.

Some Notes on the Information Flow in Read-Once Branching Programs

Stasys Jukna, Stanislav Zák, 2000, SOFSEM.

Sorting Can Exponentially Speed Up Pure Dynamic Programming pdf

Stasys Jukna, Hannes Seiwert, 2019, Electron. Colloquium Comput. Complex..

On Multipartition Communication Complexity

Juraj Hromkovic, Georg Schnitger, Martin Sauerhoff, 2001, STACS.

Very large cliques are easy to detect

Stasys Jukna, Alexander E. Andreev, A. E. Andreev, 2008, Discret. Math..

Circuits with arbitrary gates for random operators pdf

Georg Schnitger, Stasys Jukna, 2010, ArXiv.

Greedy can also beat pure dynamic programming

Stasys Jukna, Hannes Seiwert, 2018, Electron. Colloquium Comput. Complex..

Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates

Stasys Jukna, S. Jukna, 1995, Inf. Process. Lett..

Optimal versus Stable in Boolean Formulae

Stasys Jukna, 1991, FCT.

Expanders and time-restricted branching programs

Stasys Jukna, 2005, Theor. Comput. Sci..

On covering graphs by complete bipartite subgraphs

Stasys Jukna, Alexander S. Kulikov, S. Jukna, 2009, Discret. Math..

On Multi-Partition Communication Complexity of Triangle-Freeness

Georg Schnitger, Stasys Jukna, G. Schnitger, 2001, Electron. Colloquium Comput. Complex..

On Branching Programs With Bounded Uncertainty (Extended Abstract)

Stasys Jukna, Stanislav Zák, 1998, ICALP.

Entropy of Contact Circuits and Lower Bounds on Their Complexity

Stasys Jukna, S. Jukna, 1988, Theor. Comput. Sci..

On the optimality of Bellman-Ford-Moore shortest path algorithm

Georg Schnitger, Stasys Jukna, G. Schnitger, 2016, Theor. Comput. Sci..

Top-down lower bounds for depth-three circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1995, computational complexity.

A nondeterministic space-time tradeoff for linear codes

Stasys Jukna, 2009, Inf. Process. Lett..

Tropical Complexity, Sidon Sets, and Dynamic Programming

Stasys Jukna, S. Jukna, 2016, SIAM J. Discret. Math..

A Note on the Minimum Number of Negations Leading to Superpolynomial Savings

Stasys Jukna, 2001, Electron. Colloquium Comput. Complex..

Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs

Stasys Jukna, 1999, Inf. Process. Lett..

Lower bounds for monotone counting circuits

Stasys Jukna, 2014, Discret. Appl. Math..

Prolog: What This Book Is About

Stasys Jukna, 2001 .

On the P versus NP intersected with co-NP question in communication complexity

Stasys Jukna, 2004, Inf. Process. Lett..

Extremal Combinatorics - With Applications in Computer Science

Stasys Jukna, S. Jukna, 2001, Texts in Theoretical Computer Science. An EATCS Series.

The Effect of Null-Chains on the Complexity of Contact Schemes

Stasys Jukna, 1989, FCT.

Reciprocal Inputs in Arithmetic and Tropical Circuits

Stasys Jukna, Igor Sergeev, Hannes Seiwert, 2020, Electron. Colloquium Comput. Complex..

Boolean Function Complexity Advances and Frontiers

Stasys Jukna, S. Jukna, 2012, Bull. EATCS.

Tropical Kirchhoff's Formula and Postoptimality in Matroid Optimization

Stasys Jukna, Hannes Seiwert, 2021, Discret. Appl. Math..

Limitations of Incremental Dynamic Programs

Stasys Jukna, 2012, Electron. Colloquium Comput. Complex..

On the minimum number of negations leading to super-polynomial savings

Stasys Jukna, 2004, Inf. Process. Lett..

Notes on Hazard-Free Circuits pdf

Stasys Jukna, S. Jukna, 2020, Electron. Colloquium Comput. Complex..

Some bounds on multiparty communication complexity of pointer jumping

Jirí Sgall, Carsten Damm, Stasys Jukna, 1998, computational complexity.

On convex complexity measures

Pavel Pudlák, Stasys Jukna, Pavel Hrubes, 2009, Theor. Comput. Sci..

On Multiparity Games for Pointer Jumping

Carsten Damm, Stasys Jukna, S. Jukna, 1995, Universität Trier, Mathematik/Informatik, Forschungsbericht.

Clique problem, cutting plane proofs and communication complexity

Stasys Jukna, 2012, Inf. Process. Lett..

On set intersection representations of graphs

Stasys Jukna, 2009 .

Combinatorics of Monotone Computations

Stasys Jukna, 1998, Comb..

Extremal Combinatorics: with Applications in Computer Science by Stasys Jukna, Springer, 2001, xvii + 375 pp. 32.50; $49.95, ISBN 3540663134

Stasys Jukna, 2003 .

Lower Bounds on Communication Complexity

Stasys Jukna, S. Jukna, 1987 .

Exponential Lower Bounds on the Size of Clause Based Semantic Derivations

Stasys Jukna, 1996 .

The Pigeonhole Principle

Stasys Jukna, 2011 .