Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Jukna, S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On convex complexity measures
P. Hrubes̑
,
S. Jukna
,
A. Kulikov
,
P. Pudlák
Theoretical Computer Science
411
(16-18), 2010, pp. 1842-1854
A nondeterministic space-time tradeoff for linear codes
S. Jukna
Information Processing Letters
109
(5), 2009, pp. 286-289
On uncertainty versus size in branching programs
S. Jukna
,
S. Z̑ák
Theoretical Computer Science
290
(3), 2003, pp. 1851-1867
Neither reading few bits twice nor reading illegally helps much
S. Jukna
,
A. Razborov
Discrete Applied Mathematics
85
(3), 1998, pp. 223-238
On
P
versus
NP\cap
co-
NP
for decision trees and read-once branching programs
S. Jukna
,
A. Razborov
,
P. Savický
,
Ingo Wegener
Lecture Notes in Computer Science
1295
, 1997, pp. 319-326
Top-down lower bounds for depth 3 circuits
J. Håstad
,
S. Jukna
,
P. Pudlák
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 124-129
The effect of null-chains on the complexity of contact schemes
S.P. Jukna
Lecture Notes in Computer Science
380
, 1989, pp. 246-256
Two lower bounds for circuits over the basis (
&,\vee,-
)
S.P. Jukna
Lecture Notes in Computer Science
324
, 1988, pp. 371-380
Information flow and width of branching programs (extended abstract)
S.P. Jukna
Lecture Notes in Computer Science
278
, 1987, pp. 228-230