| 2012 | ||
|---|---|---|
| j2 | Nader H. Bshouty, Hanna Mazzawi: Toward a deterministic polynomial time algorithm with optimal additive query complexity. Theor. Comput. Sci. 417: 23-35 (2012) | |
| 2011 | ||
| j1 | Nader H. Bshouty, Hanna Mazzawi: Reconstructing weighted graphs with minimal query complexity. Theor. Comput. Sci. 412(19): 1782-1790 (2011) | |
| c7 | ||
| i3 | Nader H. Bshouty, Hanna Mazzawi: Algorithms for the Coin Weighing Problems with the Presence of Noise. Electronic Colloquium on Computational Complexity (ECCC) 18: 124 (2011) | |
| 2010 | ||
| c6 | Nader H. Bshouty, Hanna Mazzawi: Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity. MFCS 2010: 221-232 | |
| c5 | ||
| c4 | Nader H. Bshouty, Hanna Mazzawi: Optimal Query Complexity for Reconstructing Hypergraphs. STACS 2010: 143-154 | |
| i2 | Nader H. Bshouty, Hanna Mazzawi: Optimal Query Complexity for Reconstructing Hypergraphs. CoRR abs/1001.0405 (2010) | |
| 2009 | ||
| c3 | Nader H. Bshouty, Hanna Mazzawi: Reconstructing Weighted Graphs with Minimal Query Complexity. ALT 2009: 97-109 | |
| i1 | Hanna Mazzawi, Nader H. Bshouty: On Parity Check (0, 1)-Matrix over Zp. Electronic Colloquium on Computational Complexity (ECCC) 16: 67 (2009) | |
| 2006 | ||
| c2 | Laurence Bisht, Nader H. Bshouty, Hanna Mazzawi: On Optimal Learning Algorithms for Multiplicity Automata. COLT 2006: 184-198 | |
| c1 | Nader H. Bshouty, Hanna Mazzawi: Exact Learning Composed Classes with a Small Number of Mistakes. COLT 2006: 199-213 | |
| 1 | Laurence Bisht | |
| 2 | Nader H. Bshouty |
Data released under the ODC-BY 1.0 license — See also our legal information page