The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Petr Savický: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hanno Lefmann, Pavel Pudlák, Petr Savický
    On Sparse Parity Chack Matrices (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:41-49 [Conf]
  2. Petr Savický, Ingo Wegener
    Efficient Algorithms for the Transformation Betweeen Different Types of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1994, pp:390-401 [Conf]
  3. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the Variable Ordering Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:493-502 [Conf]
  4. Petr Savický, Johannes Fürnkranz
    Combining Pairwise Classifiers with Stacking. [Citation Graph (0, 0)][DBLP]
    IDA, 2003, pp:219-229 [Conf]
  5. 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]
  6. Hanno Lefmann, Petr Savický
    Some Typical Properties of Large AND/OR Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:237-246 [Conf]
  7. Petr Savický
    Random Boolean Formulas Representing any Boolean Function with Asymptotically Equal Probability (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:512-517 [Conf]
  8. Petr Savický, Detlef Sieling
    A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:650-659 [Conf]
  9. Petr Savický, Stanislav Zák
    A Hierarchy for (1, +k)-Branching Programs with Respect of k. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:478-487 [Conf]
  10. Pavel Pudlák, Vojtech Rödl, Petr Savický
    Graph Complexity. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1988, v:25, n:5, pp:515-535 [Journal]
  11. Petr Savický, Ingo Wegener
    Efficient Algorithms for the Transformation Between Different Types of Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:4, pp:245-256 [Journal]
  12. 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]
  13. Petr Savický
    Complexity and Probability of Some Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:451-463 [Journal]
  14. Hanno Lefmann, Pavel Pudlák, Petr Savický
    On Sparse Parity Check Matrices. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:2, pp:107-130 [Journal]
  15. Petr Savický, Detlef Sieling
    A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:17, pp:- [Journal]
  16. Petr Savický
    On determinism versus unambiquous nondeterminism for decision trees [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:009, pp:- [Journal]
  17. Petr Savický, Stanislav Zák
    A large lower bound for 1-branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:36, pp:- [Journal]
  18. 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]
  19. Petr Savický
    Complexity and Probability of some Boolean Formulas [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:57, pp:- [Journal]
  20. Petr Savický
    A probabilistic nonequivalence test for syntactic (1,+k)-branching programs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:51, pp:- [Journal]
  21. Petr Savický
    On Random Orderings of Variables for Parity OBDDs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:68, pp:- [Journal]
  22. Matthias Krause, Petr Savický, Ingo Wegener
    Approximations by OBDDs and the variable ordering problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:11, pp:- [Journal]
  23. Petr Savický
    On the Bent Boolean Functions That are Symmetric. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:4, pp:407-410 [Journal]
  24. Matthias Krause, Petr Savický, Ingo Wegener
    On the influence of the variable ordering for algorithmic learning using OBDDs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:201, n:2, pp:160-177 [Journal]
  25. Petr Savický, Jaroslava Hlavácová
    Measures of Word Commonness. [Citation Graph (0, 0)][DBLP]
    Journal of Quantitative Linguistics, 2002, v:9, n:3, pp:215-231 [Journal]
  26. Petr Savický, Roberto Cignoli, Francesc Esteva, Lluis Godo, Carles Noguera
    On Product Logic with Truth-constants. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:2, pp:205-225 [Journal]
  27. Vera Kurková, Petr Savický, Katerina Hlavácková-Schindler
    Representations and rates of approximation of real-valued Boolean functions by neural networks. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1998, v:11, n:4, pp:651-659 [Journal]
  28. Beate Bollig, Martin Hühne, Stefan Pölt, Petr Savický
    On the Average Case Circuit Delay of Disjunction. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1995, v:5, n:, pp:275-280 [Journal]
  29. Hanno Lefmann, Petr Savický
    Some typical properties of large AND/OR Boolean formulas. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:3, pp:337-351 [Journal]
  30. Petr Savický
    On random orderings of variables for parity ordered binary decision diagrams. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:3, pp:233-239 [Journal]
  31. Petr Savický
    Improved Boolean Formulas for the Ramsey Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:4, pp:407-416 [Journal]
  32. Petr Savický, Alan R. Woods
    The number of Boolean functions computed by formulas of a given size. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:349-382 [Journal]
  33. Jan Kratochvíl, Petr Savický, Zsolt Tuza
    One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:1, pp:203-210 [Journal]
  34. Petr Savický, Jiri Sgall
    DNF tautologies with a limited number of occurrences of every variable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:495-498 [Journal]
  35. Petr Savický, Detlef Sieling
    A hierarchy result for read-once branching programs with restricted parity nondeterminism. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:340, n:3, pp:594-605 [Journal]
  36. Petr Savický, Stanislav Zák
    A read-once lower bound and a (1, +k)-hierarchy for branching programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:238, n:1-2, pp:347-362 [Journal]
  37. Petr Savický, Stanislav Zák
    A Lower Bound on Branching Programs Reading Some Bits Twice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:293-301 [Journal]
  38. Jakub Dvorák, Petr Savický
    Softening Splits in Decision Trees Using Simulated Annealing. [Citation Graph (0, 0)][DBLP]
    ICANNGA (1), 2007, pp:721-729 [Conf]
  39. Petr Savický
    Random boolean formulas representing any boolean function with asymptotically equal probability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:1, pp:95-103 [Journal]
  40. Petr Savický
    Bent functions and random boolean formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:211-234 [Journal]

  41. Triangulation Heuristics for BN2O Networks. [Citation Graph (, )][DBLP]


  42. Learning Random Numbers: a MATLAB Anomaly. [Citation Graph (, )][DBLP]


Search in 0.144secs, Finished in 0.147secs
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