The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Georg Schnitger: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian Parberry, Georg Schnitger
    Parallel Computation with Threshold Functions. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:3, pp:278-302 [Journal]
  2. Wolfgang Maass, Georg Schnitger
    An Optimal Lower Bound for Turing Machines with One Work Tape and a Two- way Input Tape. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:249-264 [Conf]
  3. Ian Parberry, Georg Schnitger
    Parallel Computation with Threshold Functions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:272-290 [Conf]
  4. Matthias Miltrup, Georg Schnitger
    Neural Networks and Efficient Associative Memory. [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:235-246 [Conf]
  5. Juraj Hromkovic, Georg Schnitger
    On the Power of Randomized Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:262-271 [Conf]
  6. Wolfgang Maass, Georg Schnitger, Eduardo D. Sontag
    On the Computational Power of Sigmoid versus Boolean Threshold Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:767-776 [Conf]
  7. Stefan Reisch, Georg Schnitger
    Three Applications of Kolmogorov-Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:45-52 [Conf]
  8. Georg Schnitger
    On Depth-Reduction and Grates [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:323-328 [Conf]
  9. Maik Weinard, Georg Schnitger
    On the Greedy Superstring Conjecture. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2003, pp:387-398 [Conf]
  10. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:199-210 [Conf]
  11. Juraj Hromkovic, Georg Schnitger
    Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:66-80 [Conf]
  12. Juraj Hromkovic, Georg Schnitger
    Nondeterminism versus Determinism for Two-Way Finite Automata: Generalizations of Sipser's Separation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:439-451 [Conf]
  13. Juraj Hromkovic, Georg Schnitger
    NFAs With and Without epsilon-Transitions. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:385-396 [Conf]
  14. Juraj Hromkovic, Georg Schnitger
    On the Power of Las Vegas II. Two-Way Finite Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:433-442 [Conf]
  15. Ian Parberry, Georg Schnitger
    Relating Boltzmann Machines to Conventional Models of Computation. [Citation Graph (0, 0)][DBLP]
    ISMIS, 1987, pp:347-354 [Conf]
  16. Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
    A Comparison of Two Lower Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:326-335 [Conf]
  17. Juraj Hromkovic, Georg Schnitger
    Communication Complexity and Sequential Compuation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:71-84 [Conf]
  18. Bhaskar DasGupta, Georg Schnitger
    The Power of Approximation: A Comparison of Activation Functions. [Citation Graph (0, 0)][DBLP]
    NIPS, 1992, pp:615-622 [Conf]
  19. Jeff I. Chu, Georg Schnitger
    The Communication Complexity of Several Problems in Matrix Computation. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:22-31 [Conf]
  20. Piotr Berman, Georg Schnitger
    On the Complexity of Approximating the Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:256-268 [Conf]
  21. 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]
  22. Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
    Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations. [Citation Graph (0, 0)][DBLP]
    STACS, 1997, pp:117-128 [Conf]
  23. Gregor Gramlich, Georg Schnitger
    Minimizing NFA's and Regular Expressions. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:399-411 [Conf]
  24. Bala Kalyanasundaram, Georg Schnitger
    Rounds versus Time for the Two Person Pebble Game (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:517-529 [Conf]
  25. Georg Schnitger
    Regular Expressions and NFAs Without epsilon-Transitions. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:432-443 [Conf]
  26. Pavol Duris, Zvi Galil, Georg Schnitger
    Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:81-91 [Conf]
  27. Juraj Hromkovic, Georg Schnitger
    Nondeterministic Communication with a Limited Number of Advice Bits. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:551-560 [Conf]
  28. Bala Kalyanasundaram, Georg Schnitger
    On the Power of White Pebbles (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:258-266 [Conf]
  29. Wolfgang Maass, Georg Schnitger, Endre Szemerédi
    Two Tapes Are Better than One for Off-Line Turing Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:94-100 [Conf]
  30. Georg Schnitger
    A Family of Graphs with Expensive Depth-Reduction. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1981, pp:91-97 [Conf]
  31. Wolfgang Maass, Georg Schnitger, Endre Szemerédi, György Turán
    Two Tapes Versus One for Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:392-401 [Journal]
  32. Bala Kalyanasundaram, Georg Schnitger
    On the power of white pebbles. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:157-171 [Journal]
  33. 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]
  34. 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]
  35. Juraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert
    Measures of Nondeterminism in Finite Automata [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:76, pp:- [Journal]
  36. 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]
  37. Pavol Duris, Juraj Hromkovic, José D. P. Rolim, Georg Schnitger
    On the Power of Las Vegas for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:29, pp:- [Journal]
  38. Piotr Berman, Georg Schnitger
    On the Complexity of Approximating the Independent Set Problem [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1992, v:96, n:1, pp:77-94 [Journal]
  39. Pavol Duris, Zvi Galil, Georg Schnitger
    Lower Bounds on Communication Complexity [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:73, n:1, pp:1-22 [Journal]
  40. 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]
  41. Juraj Hromkovic, Georg Schnitger
    On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:169, n:2, pp:284-296 [Journal]
  42. Juraj Hromkovic, Sebastian Seibert, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger
    Communication Complexity Method for Measuring Nondeterminism in Finite Automata. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:172, n:2, pp:202-217 [Journal]
  43. Bala Kalyanasundaram, Georg Schnitger
    Rounds Versus Time for the Two Person Pebble Game [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:88, n:1, pp:1-17 [Journal]
  44. Jeff I. Chu, Georg Schnitger
    The communication complexity of several problems in matrix computation. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1991, v:7, n:4, pp:395-407 [Journal]
  45. Jeff I. Chu, Georg Schnitger
    Communication Complexity of Matrix Computation over Finite Fields. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1995, v:28, n:3, pp:215-228 [Journal]
  46. Bhaskar DasGupta, Georg Schnitger
    Analog versus discrete neural networks. [Citation Graph (0, 0)][DBLP]
    Neural Computation, 1996, v:8, n:4, pp:805-818 [Journal]
  47. Ian Parberry, Georg Schnitger
    Relating Boltzmann machines to conventional models of computation. [Citation Graph (0, 0)][DBLP]
    Neural Networks, 1989, v:2, n:1, pp:59-67 [Journal]
  48. Juraj Hromkovic, Georg Schnitger
    Nondeterministic Communication with a Limited Number of Advice Bits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:33, n:1, pp:43-68 [Journal]
  49. Bala Kalyanasundaram, Georg Schnitger
    The Probabilistic Communication Complexity of Set Intersection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:545-557 [Journal]
  50. Martin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger
    A Comparison of Two Lower-Bound Methods for Communication Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:168, n:1, pp:39-51 [Journal]
  51. Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger
    The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:113-129 [Journal]
  52. Juraj Hromkovic, Georg Schnitger
    On the power of Las Vegas II: Two-way finite automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:1-24 [Journal]
  53. Juraj Hromkovic, Georg Schnitger
    On the power of randomized multicounter machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:1, pp:135-144 [Journal]
  54. Georg Schnitger
    A Family of Graphs with Expensive Depth Reduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:89-93 [Journal]
  55. Gregor Gramlich, Georg Schnitger
    Minimizing nfa's and regular expressions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2007, v:73, n:6, pp:908-923 [Journal]
  56. Juraj Hromkovic, Georg Schnitger
    Comparing the size of NFAs with and without epsilon-transitions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:380, n:1-2, pp:100-114 [Journal]

  57. On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes. [Citation Graph (, )][DBLP]


  58. Ambiguity and Communication. [Citation Graph (, )][DBLP]


  59. Ambiguity and Communication [Citation Graph (, )][DBLP]


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


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


Search in 0.025secs, Finished in 0.028secs
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