#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1986

2018

- This year (4)
- Last 5 years (13)
- Last 10 years (32)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Stasys Jukna
- Algorithms and combinatorics
- 2012

(Disclaimer: I was one of the proofreaders for two chapters of this book.) In 1986 David S. Johnson published a survey in his NP-Completeness Column called Computing with One Hand Tied Behind Yourâ€¦ (More)

- Stasys Jukna
- ITA
- 1994

A syntactic read-k times branching program has the restriction that no variable occurs more than k times on any path (whether or not consistent). We exhibit an explicit Boolean function f; whichâ€¦ (More)

- Stasys Jukna
- Texts in Theoretical Computer Science. An EATCSâ€¦
- 2011

If you get the printed book in on-line book store, you may also find the same problem. So, you must move store to store and search for the available there. But, it will not happen here. The book thatâ€¦ (More)

- Stasys Jukna, A. Razborovy, P. Savick
- 1997

It is known that if a Boolean function f in n variables has a DNF and a CNF of size N then f also has a (deterministic) decision tree of size exp O(log n log 2 N). We show that this simulation cannotâ€¦ (More)

- Stasys Jukna
- Theor. Comput. Sci.
- 1988

A method for obtaining lower bounds on the contact citchlt complexity of explicitly defined Boolean functions is given. It appears as one of possible.concretixations of a more generalâ€¦ (More)

- Stasys Jukna, Alexander A. Razborov
- Discrete Applied Mathematics
- 1996

We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing a characteristicâ€¦ (More)

- Carsten Damm, Stasys Jukna, JirÃ Sgall
- computational complexity
- 1995

We introduce the model of conservative one-way multiparty complexity and prove lower and upper bounds on the complexity of pointer jumping.Â¶ The pointer jumping function takes as its input a directedâ€¦ (More)

- Stasys Jukna, Alexander A. Razborov, Petr SavickÃ½, Ingo Wegener
- computational complexity
- 1997

It is known that if a Boolean function f in n variables has a DNF and a CNF of size $ \le N $ then f also has a (deterministic) decision tree of size exp(O(log n log2 N)). We show that thisâ€¦ (More)

- Stasys Jukna
- UniversitÃ¤t Trier, Mathematik/Informatikâ€¦
- 1995

We prove that the graph of integer multiplication requires non-deterministic read-k-times branching programs of exponential size. On the other hand we show that one can add polynomially many integersâ€¦ (More)

- Stasys Jukna
- Texts in Theoretical Computer Science. An EATCSâ€¦
- 2001