The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Vince Grolmusz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Vince Grolmusz
    Co-orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:144-152 [Conf]
  2. Vince Grolmusz
    Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:142-151 [Conf]
  3. Vince Grolmusz
    On Set Systems with Restricted Intersections Modulo a Composite Number. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:82-90 [Conf]
  4. Vince Grolmusz
    Separating the Communication Complexities of MOD m and MOD p Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:278-287 [Conf]
  5. Vince Grolmusz, Prabhakar Ragde
    Incomparability in Parallel Computation [Citation Graph (0, 0)][DBLP]
    FOCS, 1987, pp:89-98 [Conf]
  6. Vince Grolmusz, Gábor Tardos
    Lower Bounds for (MOD p - MOD m) Circuits. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:279-289 [Conf]
  7. Vince Grolmusz
    A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. [Citation Graph (0, 0)][DBLP]
    ICALP, 1998, pp:215-222 [Conf]
  8. Vince Grolmusz, Zoltán Király
    Generalized Secure Routerless Routing. [Citation Graph (0, 0)][DBLP]
    ICN (2), 2005, pp:454-462 [Conf]
  9. Vince Grolmusz
    A weight-size trade-off for circuits with MOD m gates. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:68-74 [Conf]
  10. Vince Grolmusz
    Large Parallel Machines Can Be Extremely Slow for Small Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:4, pp:479-489 [Journal]
  11. Vince Grolmusz
    Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:4, pp:341-353 [Journal]
  12. Vince Grolmusz
    Circuits and Multi-Party Protocols. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:1, pp:1-18 [Journal]
  13. Vince Grolmusz
    On the Weak mod m Representation of Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1995, v:1995, n:, pp:- [Journal]
  14. Vince Grolmusz
    Superpolynomial Size Set-systems with Restricted Intersections mod 6 and Explicit Ramsey Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:1, pp:71-86 [Journal]
  15. Vince Grolmusz
    Low Rank Co-Diagonal Matrices and Ramsey Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2000, v:7, n:, pp:- [Journal]
  16. Vince Grolmusz
    Set-Systems with Restricted Multiple Intersections. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  17. Vince Grolmusz
    Computing Elementary Symmetric Polynomials with a Sublinear Number of Multiplications [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  18. Vince Grolmusz
    Near Quadratic Matrix Multiplication Modulo Composites [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  19. Vince Grolmusz
    Hyperdense Coding Modulo 6 with Filter-Machines [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  20. Vince Grolmusz
    Defying Dimensions Mod 6 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  21. Vince Grolmusz
    High-density and Secure Data Transmission via Linear Combinations [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  22. Vince Grolmusz
    A Note on Explicit Ramsey Graphs and Modular Sieves. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:565-569 [Journal]
  23. Vince Grolmusz
    Co-Orthogonal Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:3, pp:363-372 [Journal]
  24. Vince Grolmusz
    Pairs of codes with prescribed Hamming distances and coincidences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:41, n:1, pp:87-99 [Journal]
  25. Vince Grolmusz
    A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:247-254 [Journal]
  26. Vince Grolmusz
    A Note on Set Systems with no Union of Cardinality 0 Modulo m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2003, v:6, n:1, pp:41-44 [Journal]
  27. Vince Grolmusz
    Computing Elementary Symmetric Polynomials with a Sub-Polynomial Number of Multiplications [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:052, pp:- [Journal]
  28. Vince Grolmusz
    Near Quadratic Matrix Multiplication Modulo Composites [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:001, pp:- [Journal]
  29. Vince Grolmusz
    Defying Dimensions Modulo 6 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:058, pp:- [Journal]
  30. Vince Grolmusz
    Sixtors and Mod 6 Computations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:074, pp:- [Journal]
  31. Vince Grolmusz
    On the Power of Circuits with Gates of Low L1 Norms [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:46, pp:- [Journal]
  32. Vince Grolmusz, Gábor Tardos
    Lower Bounds for (MOD p -- MOD m) Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:36, pp:- [Journal]
  33. Vince Grolmusz
    The BNS Lower Bound for Multi-Party Protocols in Nearly Optimal [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:1, pp:51-54 [Journal]
  34. Vince Grolmusz
    A Lower Bound for Depth-3 Circuits with MOD m Gates. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:87-90 [Journal]
  35. Vince Grolmusz
    Constructing set systems with prescribed intersection sizes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:2, pp:321-337 [Journal]
  36. Vince Grolmusz
    On a Ramsey-Theoretic Property of Orders. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:61, n:2, pp:243-251 [Journal]
  37. Vince Grolmusz, Benny Sudakov
    On k-wise set-intersections and k-wise Hamming-distances. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:1, pp:180-190 [Journal]
  38. Vince Grolmusz, Gábor Tardos
    A Note on Non-Deterministic Communication Complexity with Few Witnesses. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:4, pp:387-391 [Journal]
  39. Vince Grolmusz
    Computing Elementary Symmetric Polynomials with a Subpolynomial Number of Multiplications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:6, pp:1475-1487 [Journal]
  40. Vince Grolmusz, Gábor Tardos
    Lower Bounds for (MODp-MODm) Circuits. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1209-1222 [Journal]
  41. Vince Grolmusz
    On the Power of Circuits with Gates of Low L1 Norms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:188, n:1-2, pp:117-128 [Journal]

  42. On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures. [Citation Graph (, )][DBLP]


  43. Evaluating Genetic Algorithms in Protein-Ligand Docking. [Citation Graph (, )][DBLP]


  44. Analyzing the simplicial decomposition of spatial protein structures. [Citation Graph (, )][DBLP]


  45. Incomparability in parallel computation. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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