default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStasys Jukna
Person information
- affiliation: Vilnius University, Lithuania
- affiliation (former): Goethe University of Frankfurt, Germany
- affiliation (former): University of Trier, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j45]Stasys Jukna, Andrzej Lingas:
Lower bounds for Boolean circuits of bounded negation width. J. Comput. Syst. Sci. 129: 90-105 (2022)- [i53]Stasys Jukna:
Notes on Boolean Read-k and Multilinear Circuits. CoRR abs/2207.08701 (2022) - [i52]Stasys Jukna:
Notes on Monotone Read-k Circuits. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j44]Stasys Jukna
, Hannes Seiwert:
Tropical Kirchhoff's formula and postoptimality in matroid optimization. Discret. Appl. Math. 289: 12-21 (2021) - [j43]Stasys Jukna:
Notes on Hazard-Free Circuits. SIAM J. Discret. Math. 35(2): 770-787 (2021) - 2020
- [j42]Stasys Jukna, Hannes Seiwert:
Sorting can exponentially speed up pure dynamic programming. Inf. Process. Lett. 159-160: 105962 (2020) - [j41]Stasys Jukna, Hannes Seiwert:
Approximation Limitations of Pure Dynamic Programming. SIAM J. Comput. 49(1): 170-205 (2020) - [j40]Stasys Jukna:
Coin Flipping in Dynamic Programming Is Almost Useless. ACM Trans. Comput. Theory 12(3): 17:1-17:26 (2020) - [i51]Stasys Jukna, Hannes Seiwert:
Tropical Kirchhoff's Formula and Postoptimality in Matroid Optimization. CoRR abs/2009.07630 (2020) - [i50]Stasys Jukna:
Notes on Hazard-Free Circuits. CoRR abs/2012.10976 (2020) - [i49]Stasys Jukna:
Coin Flipping in Dynamic Programming is Almost Useless. CoRR abs/2012.12798 (2020) - [i48]Stasys Jukna, Hannes Seiwert:
Approximation Limitations of Pure Dynamic Programming. CoRR abs/2012.12831 (2020) - [i47]Stasys Jukna, Hannes Seiwert:
Sorting Can Exponentially Speed Up Pure Dynamic Programming. CoRR abs/2012.12838 (2020) - [i46]Stasys Jukna:
Notes on Hazard-Free Circuits. Electron. Colloquium Comput. Complex. TR20 (2020) - [i45]Stasys Jukna, Hannes Seiwert, Igor Sergeev:
Reciprocal Inputs in Arithmetic and Tropical Circuits. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j39]Stasys Jukna, Hannes Seiwert:
Greedy can beat pure dynamic programming. Inf. Process. Lett. 142: 90-95 (2019) - [j38]Stasys Jukna:
Coin Flipping Cannot Shorten Arithmetic Computations. Am. Math. Mon. 126(4): 364-366 (2019) - [c14]Stasys Jukna, Andrzej Lingas:
Lower Bounds for DeMorgan Circuits of Bounded Negation Width. STACS 2019: 41:1-41:17 - [i44]Stasys Jukna, Hannes Seiwert:
Sorting Can Exponentially Speed Up Pure Dynamic Programming. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j37]Stasys Jukna:
Incremental versus non-incremental dynamic programming. Oper. Res. Lett. 46(3): 278-281 (2018) - [i43]Stasys Jukna, Hannes Seiwert:
Greedy can also beat pure dynamic programming. CoRR abs/1803.05380 (2018) - [i42]Stasys Jukna:
Incremental versus Non-Incremental Dynamic Programming. Electron. Colloquium Comput. Complex. TR18 (2018) - [i41]Stasys Jukna:
Derandomizing Dynamic Programming and Beyond. Electron. Colloquium Comput. Complex. TR18 (2018) - [i40]Stasys Jukna, Andrzej Lingas:
Lower Bounds for Circuits of Bounded Negation Width. Electron. Colloquium Comput. Complex. TR18 (2018) - [i39]Stasys Jukna, Hannes Seiwert:
Greedy can also beat pure dynamic programming. Electron. Colloquium Comput. Complex. TR18 (2018) - [i38]Stasys Jukna, Hannes Seiwert:
Approximation Limitations of Tropical Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j36]Stasys Jukna:
Minkowski Complexity of Sets: An Easy Lower Bound. Am. Math. Mon. 124(8): 749-753 (2017) - 2016
- [j35]Stasys Jukna:
Lower bounds for monotone counting circuits. Discret. Appl. Math. 213: 139-152 (2016) - [j34]Stasys Jukna:
Tropical Complexity, Sidon Sets, and Dynamic Programming. SIAM J. Discret. Math. 30(4): 2064-2085 (2016) - [j33]Stasys Jukna, Georg Schnitger:
On the optimality of Bellman-Ford-Moore shortest path algorithm. Theor. Comput. Sci. 628: 101-109 (2016) - [i37]Stasys Jukna:
Tropical Complexity, Sidon Sets, and Dynamic Programming. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j32]Stasys Jukna:
Lower Bounds for Tropical Circuits and Dynamic Programs. Theory Comput. Syst. 57(1): 160-194 (2015) - [i36]Stasys Jukna:
Lower Bounds for Monotone Counting Circuits. CoRR abs/1502.01865 (2015) - [i35]Stasys Jukna, Georg Schnitger:
On the Optimality of Bellman-Ford-Moore Shortest Path Algorithm. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j31]Stasys Jukna:
Limitations of Incremental Dynamic Programming. Algorithmica 69(2): 461-492 (2014) - [j30]Stasys Jukna:
Boolean Function Complexity Advances and Frontiers. Bull. EATCS 113 (2014) - [i34]Stasys Jukna:
Lower Bounds for Tropical Circuits and Dynamic Programs. CoRR abs/1406.3065 (2014) - [i33]Stasys Jukna:
Lower Bounds for Tropical Circuits and Dynamic Programs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i32]Stasys Jukna:
Lower Bounds for Monotone Counting Circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j29]Stasys Jukna, Igor Sergeev:
Complexity of Linear Boolean Operators. Found. Trends Theor. Comput. Sci. 9(1): 1-123 (2013) - 2012
- [b4]Stasys Jukna:
Boolean Function Complexity - Advances and Frontiers. Algorithms and combinatorics 27, Springer 2012, ISBN 978-3-642-24507-7, pp. I-XV, 1-617 - [j28]Stasys Jukna:
Clique problem, cutting plane proofs and communication complexity. Inf. Process. Lett. 112(20): 772-777 (2012) - [j27]Stasys Jukna, Georg Schnitger:
Cutting planes cannot approximate some integer programs. Oper. Res. Lett. 40(4): 272-275 (2012) - [i31]Stasys Jukna:
Independent set problem for individual graphs has small communication complexity. CoRR abs/1203.5414 (2012) - [i30]Stasys Jukna:
Clique Problem, Cutting Plane Proofs, and Communication Complexity. Electron. Colloquium Comput. Complex. TR12 (2012) - [i29]Stasys Jukna:
Limitations of Incremental Dynamic Programs. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [b3]Stasys Jukna:
Extremal Combinatorics - With Applications in Computer Science. Texts in Theoretical Computer Science. An EATCS Series, Springer 2011, ISBN 978-3-642-17363-9, pp. 1-411 - [j26]Stasys Jukna, Georg Schnitger:
Min-rank conjecture for log-depth circuits. J. Comput. Syst. Sci. 77(6): 1023-1038 (2011) - [j25]Stasys Jukna, Georg Schnitger:
Yet harder knapsack problems. Theor. Comput. Sci. 412(45): 6351-6358 (2011) - 2010
- [j24]Stasys Jukna:
Representing (0, 1)-matrices by boolean circuits. Discret. Math. 310(1): 184-187 (2010) - [j23]Stasys Jukna:
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits. Theory Comput. Syst. 46(2): 301-310 (2010) - [j22]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák:
On convex complexity measures. Theor. Comput. Sci. 411(16-18): 1842-1854 (2010) - [i28]Stasys Jukna, Georg Schnitger:
Circuits with arbitrary gates for random operators. CoRR abs/1004.5236 (2010) - [i27]Stasys Jukna, Georg Schnitger:
Min-Rank Conjecture for Log-Depth Circuits. CoRR abs/1005.1009 (2010)
2000 – 2009
- 2009
- [j21]Stasys Jukna, Alexander S. Kulikov:
On covering graphs by complete bipartite subgraphs. Discret. Math. 309(10): 3399-3403 (2009) - [j20]Stasys Jukna:
A nondeterministic space-time tradeoff for linear codes. Inf. Process. Lett. 109(5): 286-289 (2009) - [j19]Stasys Jukna:
On set intersection representations of graphs. J. Graph Theory 61(1): 55-75 (2009) - [i26]Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák:
On convex complexity measures. Electron. Colloquium Comput. Complex. TR09 (2009) - [i25]Stasys Jukna, Georg Schnitger:
Min-Rank Conjecture for Log-Depth Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [b2]Stasys Jukna:
Crashkurs Mathematik für Informatiker. Leitfäden der Informatik, Teubner 2008, ISBN 978-3-8351-0216-3, pp. I-XII, 1-315 - [j18]Alexander E. Andreev, Stasys Jukna:
Very large cliques are easy to detect. Discret. Math. 308(16): 3717-3721 (2008) - [j17]Stasys Jukna:
Expanders and time-restricted branching programs. Theor. Comput. Sci. 409(3): 471-476 (2008) - [i24]Stasys Jukna:
Entropy of operators or why matrix multiplication is hard for small depth circuits. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [j16]Stasys Jukna:
On Graph Complexity. Comb. Probab. Comput. 15(6): 855-876 (2006) - [j15]Stasys Jukna:
Disproving the Single Level Conjecture. SIAM J. Comput. 36(1): 83-98 (2006) - [i23]Alexander E. Andreev, Stasys Jukna:
Very Large Cliques are Easy to Detect. Complexity of Boolean Functions 2006 - [i22]Stasys Jukna:
Graphs and Circuits: Some Further Remarks. Complexity of Boolean Functions 2006 - 2005
- [j14]Stasys Jukna:
On the P versus NP intersected with co-NP question in communication complexity. Inf. Process. Lett. 96(6): 202-206 (2005) - [i21]Stasys Jukna:
Disproving the single level conjecture. Electron. Colloquium Comput. Complex. TR05 (2005) - [i20]Stasys Jukna:
Expanders and time-restricted branching programs. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j13]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On multi-partition communication complexity. Inf. Comput. 194(1): 49-75 (2004) - [j12]Stasys Jukna:
On the minimum number of negations leading to super-polynomial savings. Inf. Process. Lett. 89(2): 71-74 (2004) - [i19]Stasys Jukna:
On Graph Complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - [i18]Stasys Jukna:
A note on the P versus NP intersected with co-NP question in communication complexity. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j11]Stasys Jukna, Stanislav Zák:
On uncertainty versus size in branching programs. Theor. Comput. Sci. 290(3): 1851-1867 (2003) - 2002
- [j10]Stasys Jukna, Georg Schnitger:
Triangle-Freeness Is Hard To Detect. Comb. Probab. Comput. 11(6): 549-569 (2002) - 2001
- [b1]Stasys Jukna:
Extremal Combinatorics - With Applications in Computer Science. Texts in Theoretical Computer Science. An EATCS Series, Springer 2001, ISBN 978-3-540-66313-3, pp. I-XVII, 1-375 - [c13]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. STACS 2001: 206-217 - [i17]Stasys Jukna, Stanislav Zák:
On Uncertainty versus Size in Branching Programs. Electron. Colloquium Comput. Complex. TR01 (2001) - [i16]Stasys Jukna, Georg Schnitger:
On Multi-Partition Communication Complexity of Triangle-Freeness. Electron. Colloquium Comput. Complex. TR01 (2001) - [i15]Stasys Jukna:
A Note on the Minimum Number of Negations Leading to Superpolynomial Savings. Electron. Colloquium Comput. Complex. TR01 (2001) - [i14]Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger:
On Multipartition Communication Complexity. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c12]Stasys Jukna, Stanislav Zák:
Some Notes on the Information Flow in Read-Once Branching Programs. SOFSEM 2000: 356-364
1990 – 1999
- 1999
- [j9]Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On P versus NP cap co-NP for decision trees and read-once branching programs. Comput. Complex. 8(4): 357-370 (1999) - [j8]Stasys Jukna:
Combinatorics of Monotone Computations. Comb. 19(1): 65-85 (1999) - [j7]Stasys Jukna:
Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. Inf. Process. Lett. 69(6): 267-269 (1999) - 1998
- [j6]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Comput. Complex. 7(2): 109-127 (1998) - [j5]Stasys Jukna, Alexander A. Razborov:
Neither Reading Few Bits Twice Nor Reading Illegally Helps Much. Discret. Appl. Math. 85(3): 223-238 (1998) - [c11]Stasys Jukna, Stanislav Zák:
On Branching Programs With Bounded Uncertainty (Extended Abstract). ICALP 1998: 259-270 - [i13]Stasys Jukna, Stanislav Zák:
On Branching Programs With Bounded Uncertainty. Electron. Colloquium Comput. Complex. TR98 (1998) - [i12]Stasys Jukna:
Combinatorics of Monotone Computations. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [c10]Stasys Jukna:
Finite Limits and Monotone Computations: The Lower Bounds Criterion. CCC 1997: 302-313 - [c9]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: 319-326 - [i11]Stasys Jukna:
Exponential Lower Bounds for Semantic Resolution. Electron. Colloquium Comput. Complex. TR97 (1997) - [i10]Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener:
On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [c8]Stasys Jukna:
Exponential lower bounds for semantic resolution. Proof Complexity and Feasible Arithmetics 1996: 163-172 - [c7]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. STACS 1996: 643-654 - [i9]Stasys Jukna:
Finite Limits and Monotone Computations. Electron. Colloquium Comput. Complex. TR96 (1996) - [i8]Stasys Jukna, Alexander A. Razborov:
Neither Reading Few Bits Twice nor Reading Illegally Helps Much. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j4]Johan Håstad, Stasys Jukna, Pavel Pudlák:
Top-Down Lower Bounds for Depth-Three Circuits. Comput. Complex. 5(2): 99-112 (1995) - [j3]Stasys Jukna:
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates. Inf. Process. Lett. 56(3): 147-150 (1995) - [j2]Stasys Jukna:
A Note on Read-k Times Branching Programs. RAIRO Theor. Informatics Appl. 29(1): 75-83 (1995) - [i7]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Electron. Colloquium Comput. Complex. TR95 (1995) - [i6]Carsten Damm, Stasys Jukna:
On Multiparity Games for Pointer Jumping. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-09 (1995) - [i5]Stasys Jukna:
The Graph of Integer Multiplication is Hard for Read-k-Times Networks. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-10 (1995) - [i4]Stasys Jukna:
On Communication Games with More than Two Players. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-11 (1995) - [i3]Carsten Damm, Stasys Jukna, Jirí Sgall:
Some Bounds on Multiparty Communication Complexity of Pointer Jumping. Universität Trier, Mathematik/Informatik, Forschungsbericht 95-17 (1995) - 1994
- [i2]Stasys Jukna:
A Note on Read-k Times Branching Programs. Electron. Colloquium Comput. Complex. TR94 (1994) - [i1]Stasys Jukna:
Finite Limits and Lower Bounds for Circuits Size. Universität Trier, Mathematik/Informatik, Forschungsbericht 94-06 (1994) - 1993
- [c6]Johan Håstad, Stasys Jukna, Pavel Pudlák:
Top-Down Lower Bounds for Depth 3 Circuits. FOCS 1993: 124-129 - 1991
- [c5]Stasys Jukna:
Optimal versus Stable in Boolean Formulae. FCT 1991: 265-274
1980 – 1989
- 1989
- [c4]Stasys Jukna:
The Effect of Null-Chains on the Complexity of Contact Schemes. FCT 1989: 246-256 - 1988
- [j1]Stasys Jukna:
Entropy of Contact Circuits and Lower Bounds on Their Complexity. Theor. Comput. Sci. 57: 113-129 (1988) - [c3]Stasys Jukna:
Two Lower Bounds for Circuits over the Basis (&, V, -). MFCS 1988: 371-380 - 1987
- [c2]Stasys Jukna:
Information Flow and Width of Branching Programs (Extended Abstract). FCT 1987: 228-230 - 1986
- [c1]Stasys Jukna:
Lower Bounds on the Complexity of Local Circuits (Preliminary Report). MFCS 1986: 440-448
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
