| 2013 | ||
|---|---|---|
| c19 | Brink van der Merwe, Mark Farag, Jaco Geldenhuys: Counting Minimal Symmetric Difference NFAs. LATA 2013: 419-430 | |
| 2012 | ||
| c18 | Jaco Geldenhuys, Matthew B. Dwyer, Willem Visser: Probabilistic symbolic execution. ISSTA 2012: 166-176 | |
| c17 | Jean Fourie, Jaco Geldenhuys, Cornelia P. Inggs: Improving communication for distributed model checking. SAICSIT Conf. 2012: 41-50 | |
| c16 | Gideon Redelinghuys, Willem Visser, Jaco Geldenhuys: Symbolic execution of programs with strings. SAICSIT Conf. 2012: 139-148 | |
| c15 | Willem Visser, Jaco Geldenhuys, Matthew B. Dwyer: Green: reducing, reusing and recycling constraints in program analysis. SIGSOFT FSE 2012: 58 | |
| 2011 | ||
| j3 | Lynette van Zijl, Jaco Geldenhuys: Descriptional Complexity of Ambiguity in Symmetric Difference NFAs. J. UCS 17(6): 874-890 (2011) | |
| c14 | Brink van der Merwe, Lynette van Zijl, Jaco Geldenhuys: Ambiguity of Unary Symmetric Difference NFAs. ICTAC 2011: 256-266 | |
| 2010 | ||
| c13 | ||
| c12 | ||
| 2009 | ||
| j2 | Jaco Geldenhuys, Brink van der Merwe: Comparing leaf and root insertion. South African Computer Journal 44: 30-38 (2009) | |
| c11 | Jaco Geldenhuys, Henri Hansen, Antti Valmari: Exploring the Scope for Partial Order Reduction. ATVA 2009: 39-53 | |
| c10 | Jaco Geldenhuys, Brink van der Merwe, Lynette van Zijl: Reducing Nondeterministic Finite Automata with SAT Solvers. FSMNLP 2009: 81-92 | |
| 2008 | ||
| c9 | Heikki Orsila, Jaco Geldenhuys, Anna Ruokonen, Imed Hammouda: Update Propagation Practices in Highly Reusable Open Source Components. OSS 2008: 159-170 | |
| c8 | ||
| 2006 | ||
| c7 | Jaco Geldenhuys, Henri Hansen: Larger Automata and Less Work for LTL Model Checking. SPIN 2006: 53-70 | |
| 2005 | ||
| j1 | Jaco Geldenhuys, Antti Valmari: More efficient on-the-fly LTL verification with Tarjan's algorithm. Theor. Comput. Sci. 345(1): 60-82 (2005) | |
| 2004 | ||
| c6 | ||
| c5 | Jaco Geldenhuys, Antti Valmari: Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. TACAS 2004: 205-219 | |
| 2003 | ||
| c4 | Jaco Geldenhuys, Antti Valmari: A Nearly Memory-Optimal Data Structure for Sets and Mappings. SPIN 2003: 136-150 | |
| 2001 | ||
| c3 | ||
| 1999 | ||
| c2 | ||
| 1995 | ||
| c1 | Andries Petrus Engelbrecht, Ian Cloete, Jaco Geldenhuys, Jacek M. Zurada: Automatic Scaling using Gamma Learning for Feedforward Neural Networks. IWANN 1995: 374-381 | |
Colors in the list of coauthors
Last update Thu May 23 03:02:59 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page