• DocumentCode
    2267293
  • Title

    On The Secrecy-complexity Of Distributed Computation Of A Binary Function Of Non-uniformly Distributed Variables

  • Author

    Modiano, Eytan ; Ephremides, Anthony

  • Author_Institution
    University of Maryland
  • fYear
    1991
  • fDate
    24-28 Jun 1991
  • Firstpage
    213
  • Lastpage
    213
  • Keywords
    Boolean functions; Complexity theory; Distributed computing; Educational institutions; Probability density function; Protocols; Security;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1991 (papers in summary form only received), Proceedings. 1991 IEEE International Symposium on (Cat. No.91CH3003-1)
  • Print_ISBN
    0-7803-0056-4
  • Type

    conf

  • DOI
    10.1109/ISIT.1991.695269
  • Filename
    695269