The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stasys Jukna: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stasys Jukna
    Finite Limits and Monotone Computations: The Lower Bounds Criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:302-313 [Conf]
  2. Stasys Jukna
    Information Flow and Width of Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:228-230 [Conf]
  3. Stasys Jukna
    Optimal versus Stable in Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:265-274 [Conf]
  4. Stasys Jukna
    The Effect of Null-Chains on the Complexity of Contact Schemes. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:246-256 [Conf]
  5. Johan Håstad, Stasys Jukna, Pavel Pudlák
    Top-Down Lower Bounds for Depth 3 Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1993, pp:124-129 [Conf]
  6. Stasys Jukna, Stanislav Zák
    On Branching Programs With Bounded Uncertainty (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:259-270 [Conf]
  7. Stasys Jukna
    Lower Bounds on the Complexity of Local Circuits (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    MFCS, 1986, pp:440-448 [Conf]
  8. Stasys Jukna
    Two Lower Bounds for Circuits over the Basis (&, V, -). [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:371-380 [Conf]
  9. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:319-326 [Conf]
  10. Stasys Jukna, Stanislav Zák
    Some Notes on the Information Flow in Read-Once Branching Programs. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:356-364 [Conf]
  11. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:643-654 [Conf]
  12. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:206-217 [Conf]
  13. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:109-127 [Journal]
  14. Johan Håstad, Stasys Jukna, Pavel Pudlák
    Top-Down Lower Bounds for Depth-Three Circuits. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1995, v:5, n:2, pp:99-112 [Journal]
  15. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On P versus NP cap co-NP for decision trees and read-once branching programs. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:4, pp:357-370 [Journal]
  16. Stasys Jukna
    Combinatorics of Monotone Computations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1999, v:19, n:1, pp:65-85 [Journal]
  17. Stasys Jukna, Georg Schnitger
    Triangle-Freeness Is Hard To Detect. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:6, pp:- [Journal]
  18. Stasys Jukna, Alexander A. Razborov
    Neither Reading Few Bits Twice Nor Reading Illegally Helps Much. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:3, pp:223-238 [Journal]
  19. Stasys Jukna, Stanislav Zák
    On Uncertainty versus Size in Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:39, pp:- [Journal]
  20. Stasys Jukna, Georg Schnitger
    On Multi-Partition Communication Complexity of Triangle-Freeness [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:49, pp:- [Journal]
  21. Stasys Jukna
    A Note on the Minimum Number of Negations Leading to Superpolynomial Savings [Citation Graph (0, 0)][DBLP]
    , 2001, v:8, n:058, pp:- [Journal]
  22. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On Multipartition Communication Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:066, pp:- [Journal]
  23. Stasys Jukna
    On Graph Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:005, pp:- [Journal]
  24. Stasys Jukna
    A note on the P versus NP intersected with co-NP question in communication complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:062, pp:- [Journal]
  25. Stasys Jukna
    Disproving the single level conjecture [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:021, pp:- [Journal]
  26. Stasys Jukna
    Expanders and time-restricted branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:079, pp:- [Journal]
  27. Stasys Jukna
    A Note on Read-k Times Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:27, pp:- [Journal]
  28. Carsten Damm, Stasys Jukna, Jiri Sgall
    Some Bounds on Multiparty Communication Complexity of Pointer Jumping [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:44, pp:- [Journal]
  29. Stasys Jukna
    Finite Limits and Monotone Computations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:26, pp:- [Journal]
  30. Stasys Jukna
    Exponential Lower Bounds for Semantic Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:7, pp:- [Journal]
  31. Stasys Jukna, Alexander A. Razborov, Petr Savický, Ingo Wegener
    On P versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:23, pp:- [Journal]
  32. Stasys Jukna, Stanislav Zák
    On Branching Programs With Bounded Uncertainty [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:30, pp:- [Journal]
  33. Stasys Jukna
    Combinatorics of Monotone Computations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:41, pp:- [Journal]
  34. Pavol Duris, Juraj Hromkovic, Stasys Jukna, Martin Sauerhoff, Georg Schnitger
    On multi-partition communication complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:1, pp:49-75 [Journal]
  35. Stasys Jukna
    On the minimum number of negations leading to super-polynomial savings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:89, n:2, pp:71-74 [Journal]
  36. Stasys Jukna
    On the P versus NP intersected with co-NP question in communication complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:96, n:6, pp:202-206 [Journal]
  37. Stasys Jukna
    Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:3, pp:147-150 [Journal]
  38. Stasys Jukna
    Linear Codes are Hard for Oblivious Read-Once Parity Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:6, pp:267-269 [Journal]
  39. Stasys Jukna
    A Note on Read-k Times Branching Programs. [Citation Graph (0, 0)][DBLP]
    ITA, 1995, v:29, n:1, pp:75-83 [Journal]
  40. Stasys Jukna
    Disproving the Single Level Conjecture. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:1, pp:83-98 [Journal]
  41. Stasys Jukna
    Entropy of Contact Circuits and Lower Bounds on Their Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:57, n:, pp:113-129 [Journal]
  42. Stasys Jukna, Stanislav Zák
    On uncertainty versus size in branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1851-1867 [Journal]

  43. Graphs and Circuits: Some Further Remarks. [Citation Graph (, )][DBLP]


  44. Very Large Cliques are Easy to Detect. [Citation Graph (, )][DBLP]


  45. Circuits with arbitrary gates for random operators [Citation Graph (, )][DBLP]


  46. Min-Rank Conjecture for Log-Depth Circuits [Citation Graph (, )][DBLP]


  47. On Graph Complexity. [Citation Graph (, )][DBLP]


  48. Very large cliques are easy to detect. [Citation Graph (, )][DBLP]


  49. On covering graphs by complete bipartite subgraphs. [Citation Graph (, )][DBLP]


  50. Representing (0, 1)-matrices by boolean circuits. [Citation Graph (, )][DBLP]


  51. Entropy of operators or why matrix multiplication is hard for small depth circuits. [Citation Graph (, )][DBLP]


Search in 0.482secs, Finished in 0.484secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002