The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marius Zimand: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marius Zimand
    Exposure-Resilient Extractors. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:61-72 [Conf]
  2. Marius Zimand
    Weighted NP Optimization Problems: Logical Definability and Approximation Properties. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:12-28 [Conf]
  3. Cristian Calude, Marius Zimand
    Effective Category and Measure in Abstract Complexity Theory (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:156-170 [Conf]
  4. Marius Zimand
    Simple Extractors via Constructions of Cryptographic Pseudo-random Generators. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:115-127 [Conf]
  5. Shiva Azadegan, M. Lavine, Michael O'Leary, A. Wijesinha, Marius Zimand
    A Dedicated Undergraduate Track in Computer Security Education. [Citation Graph (0, 0)][DBLP]
    World Conference on Information Security Education, 2003, pp:319-332 [Conf]
  6. Marius Zimand
    Probabilistically Checkable Proofs the Easy Way. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:337-351 [Conf]
  7. Marius Zimand
    Sharing Random Bits with No Process Coordination. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:455-459 [Conf]
  8. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed Javeed Zaki, Marius Zimand
    The Complexity of Finding Top-Toda-Equivalence-Class Members. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:90-99 [Conf]
  9. Marius Zimand
    A List-Decodable Code with Local Encoding and Decoding. [Citation Graph (0, 0)][DBLP]
    SNPD, 2005, pp:232-237 [Conf]
  10. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
    Almost-Everywhere Superiority for Quantum Computing [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  11. Marius Zimand
    On the Topological Size of p-m-Complete Degrees. [Citation Graph (0, 0)][DBLP]
    Sci. Ann. Cuza Univ., 1994, v:3, n:, pp:107-116 [Journal]
  12. Ioan Tomescu, Marius Zimand
    Minimum Spanning Hypertrees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:1, pp:67-76 [Journal]
  13. Marius Zimand
    Probabilistically Checkable Proofs The Easy Way [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:27, pp:- [Journal]
  14. Marius Zimand
    Simple extractors via constructions of cryptographic pseudo-random generators [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:071, pp:- [Journal]
  15. Edith Hemaspaandra, Lane A. Hemaspaandra, Marius Zimand
    Almost-Everywhere Superiority for Quantum Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:175, n:2, pp:171-181 [Journal]
  16. Marius Zimand
    A High-Low Kolmogorov Complexity Law Equivalent to the 0-1 Law. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:2, pp:59-64 [Journal]
  17. Marius Zimand
    Large Sets in AC0 have Many Strings with Low Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:62, n:3, pp:165-170 [Journal]
  18. Marius Zimand
    Relative to a Random Oracle, P/Poly is not Measurable in EXP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:2, pp:83-86 [Journal]
  19. Lane A. Hemaspaandra, Kulathur S. Rajasethupathy, Prasanna Sethupathy, Marius Zimand
    Power Balance and Apportionment Algorithms for the United States Congress. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:1- [Journal]
  20. Kundi Xue, Marius Zimand
    Extractors for the Real World. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:1, pp:212-225 [Journal]
  21. Lane A. Hemaspaandra, Marius Zimand
    Strong Self-Reducibility Precludes Strong Immunity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:5, pp:535-548 [Journal]
  22. Marius Zimand
    On Relativizations with Restricted Number of Accesses to the Oracle Set. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1987, v:20, n:1, pp:1-11 [Journal]
  23. Marius Zimand
    Weighted NP Optimization Problems: Logical Definability and Approximation Properties. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:28, n:1, pp:36-56 [Journal]
  24. Cristian Calude, Marius Zimand
    Effective Category and Measure in Abstract Complexity Theory. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:307-327 [Journal]
  25. Marius Zimand
    If not Empty, NP - P is Topologically Large. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:2, pp:293-310 [Journal]
  26. Marius Zimand
    On the Topological Size of p-m-Complete Degrees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:137-147 [Journal]
  27. Marius Zimand
    On the Size of Classes with Weak Membership Properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:225-235 [Journal]
  28. Marius Zimand
    On Derandomizing Probabilistic Sublinear-Time Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:1-9 [Conf]
  29. Marius Zimand
    Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. Marius Zimand
    Simple extractors via constructions of cryptographic pseudo-random generators [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  31. Lane A. Hemaspaandra, Mitsunori Ogihara, Mohammed J. Zaki, Marius Zimand
    The Complexity of Finding Top-Toda-Equivalence-Class Members. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:669-684 [Journal]

  32. On Generating Independent Random Strings. [Citation Graph (, )][DBLP]


  33. Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences. [Citation Graph (, )][DBLP]


  34. Algorithmically Independent Sequences. [Citation Graph (, )][DBLP]


  35. Counting Dependent and Independent Strings. [Citation Graph (, )][DBLP]


  36. Impossibility of Independence Amplification in Kolmogorov Complexity Theory. [Citation Graph (, )][DBLP]


  37. Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence. [Citation Graph (, )][DBLP]


  38. An undergraduate track in computer security. [Citation Graph (, )][DBLP]


  39. Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. [Citation Graph (, )][DBLP]


  40. Algorithmically independent sequences [Citation Graph (, )][DBLP]


  41. Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence [Citation Graph (, )][DBLP]


  42. On generating independent random strings [Citation Graph (, )][DBLP]


  43. Impossibility of independence amplification in Kolmogorov complexity theory [Citation Graph (, )][DBLP]


  44. Counting dependent and independent strings [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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