dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Matei David Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: Computationally Limited Randomness. ICS 2011: 522-536
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Misko Dzamba, Dan Lister, Lucian Ilie, Michael Brudno: SHRiMP2: Sensitive yet Practical Short Read Mapping. Bioinformatics 27(7): 1011-1012 (2011)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: How strong is Nisanʼs pseudo-random generator? Inf. Process. Lett. 111(16): 804-808 (2011)
2010
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Periklis A. Papakonstantinou: Trade-Off Lower Bounds for Stack Machines. IEEE Conference on Computational Complexity 2010: 163-171
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul Beame, Matei David, Toniann Pitassi, Philipp Woelfel: Separating Deterministic from Randomized Multiparty Communication Complexity. Theory of Computing 6(1): 201-225 (2010)
2009
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Periklis A. Papakonstantinou, Anastasios Sidiropoulos: Polynomial Time with Restricted Use of Randomness. Electronic Colloquium on Computational Complexity (ECCC) 16: 39 (2009)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Toniann Pitassi, Emanuele Viola: Improved Separations between Nondeterministic and Randomized Multiparty Communication. TOCT 1(2): (2009)
2008
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Toniann Pitassi, Emanuele Viola: Improved Separations between Nondeterministic and Randomized Multiparty Communication. APPROX-RANDOM 2008: 371-384
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Toniann Pitassi: Separating NOF communication complexity classes RP and NP CoRR abs/0802.3860: (2008)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Toniann Pitassi: Separating NOF communication complexity classes RP and NP. Electronic Colloquium on Computational Complexity (ECCC) 15(014): (2008)
2007
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul Beame, Matei David, Toniann Pitassi, Philipp Woelfel: Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity. ICALP 2007: 134-145
2005
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David, Alex Brodsky, Faith Ellen Fich: Restricted Stack Implementations. DISC 2005: 137-151
2004
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David: A Single-Enqueuer Wait-Free Queue Implementation. DISC 2004: 132-143
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMatei David: Brief announcement: a single enqueuer wait-free queue implementation. PODC 2004: 370

Coauthor Index

1Paul Beame [4] [10]
2Alex Brodsky (Alexander O. Brodsky, Alexander Brodsky) [3]
3Michael Brudno [13]
4Misko Dzamba [13]
5Faith Ellen (Faith Ellen Fich, Faith E. Fich) [3]
6Lucian Ilie [13]
7Dan Lister [13]
8Phuong Nguyen [14]
9Periklis A. Papakonstantinou [9] [11] [12] [14]
10Toniann Pitassi [4] [5] [6] [7] [8] [10]
11Anastasios Sidiropoulos [9] [12] [14]
12Emanuele Viola [7] [8]
13Philipp Woelfel [4] [10]

Colors in the list of coauthors

Last update Tue May 29 20:41:18 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page