Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
![]() |
On optimal scheduling of multiple mobile chargers in wireless sensor networksBeigel, Richard ; Wu, Jie ; Zheng, HuanyangProceedings of the first international workshop on Mobile sensing, computing and communication, 2014, p.1-6New York, NY, USA: ACMTexto completo disponível |
2 |
Material Type: Ata de Congresso
|
![]() |
When do extra majority gates help? Polylog(n) majority gates are equivalent to oneBeigel, RichardSTOC 92: Symposium on the Theory of Computing, 1992 [Periódico revisado por pares]Texto completo disponível |
3 |
Material Type: Ata de Congresso
|
![]() |
Finding maximum independent sets in sparse and general graphsBeigel, RichardProceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, 1999, p.856-857Philadelphia, PA, USA: Society for Industrial and Applied MathematicsTexto completo disponível |
4 |
Material Type: Ata de Congresso
|
![]() |
When do extra majority gates help?Beigel, RichardAnnual ACM Symposium on Theory of Computing: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing; 04-06 May 1992, 1992, p.450-454New York, NY, USA: ACMTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Incremental data structures and algorithms for dynamic query interfacesTanin, Egemen ; Beigel, Richard ; Shneiderman, BenSIGMOD record, 1996-12, Vol.25 (4), p.21-24Texto completo disponível |
6 |
Material Type: Ata de Congresso
|
![]() |
PP is closed under intersectionBeigel, Richard ; Reingold, Nick ; Spielman, DanielAnnual ACM Symposium on Theory of Computing: Proceedings of the twenty-third annual ACM symposium on Theory of computing; 05-08 May 1991, 1991, p.1-9 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
7 |
Material Type: Ata de Congresso
|
![]() |
The expressive power of voting polynomialsAspnes, James ; Beigel, Richard ; Furst, Merrick ; Rudich, StevenAnnual ACM Symposium on Theory of Computing: Proceedings of the twenty-third annual ACM symposium on Theory of computing; 05-08 May 1991, 1991, p.402-409 [Periódico revisado por pares]New York, NY, USA: ACMTexto completo disponível |
8 |
Material Type: Ata de Congresso
|
![]() |
One help-bit doesn't helpBeigel, Richard ; Hirst, TirzaAnnual ACM Symposium on Theory of Computing: Proceedings of the thirtieth annual ACM symposium on Theory of computing; 24-26 May 1998, 1998, p.124-130New York, NY, USA: ACMTexto completo disponível |
9 |
Material Type: Ata de Congresso
|
![]() |
An optimal procedure for gap closing in whole genome shotgun sequencingBeigel, Richard ; Alon, Noga ; Kasif, Simon ; Apaydin, Mehmet Serkan ; Fortnow, LanceAnnual Conference on Research in Computational Molecular Biology: Proceedings of the fifth annual international conference on Computational biology; 22-25 Apr. 2001, 2001, p.22-30New York, NY, USA: ACMTexto completo disponível |
10 |
Material Type: Ata de Congresso
|
![]() |
NP might not be as easy as detecting unique solutionsBeigel, Richard ; Buhrman, Harry ; Fortnow, LanceAnnual ACM Symposium on Theory of Computing: Proceedings of the thirtieth annual ACM symposium on Theory of computing; 24-26 May 1998, 1998, p.203-208New York, NY, USA: ACMTexto completo disponível |