Search the dblp DataBase

Publications of Author

1. Jaco Geldenhuys, Antti Valmari
   Techniques for Smaller Intermediary BDDs. [Citation Graph (0, 0)][DBLP]
   CONCUR, 2001, pp:233-247 [Conf]
   
2. Andries Petrus Engelbrecht, Ian Cloete, Jaco Geldenhuys, Jacek M. Zurada
   Automatic Scaling using Gamma Learning for Feedforward Neural Networks. [Citation Graph (0, 0)][DBLP]
   IWANN, 1995, pp:374-381 [Conf]
   
3. Jaco Geldenhuys
   State Caching Reconsidered. [Citation Graph (0, 0)][DBLP]
   SPIN, 2004, pp:23-38 [Conf]
   
4. Jaco Geldenhuys, Henri Hansen
   Larger Automata and Less Work for LTL Model Checking. [Citation Graph (0, 0)][DBLP]
   SPIN, 2006, pp:53-70 [Conf]
   
5. Jaco Geldenhuys, Antti Valmari
   A Nearly Memory-Optimal Data Structure for Sets and Mappings. [Citation Graph (0, 0)][DBLP]
   SPIN, 2003, pp:136-150 [Conf]
   
6. Jaco Geldenhuys, P. J. A. de Villiers
   Runtime Efficient State Compaction in SPIN. [Citation Graph (0, 0)][DBLP]
   SPIN, 1999, pp:12-21 [Conf]
   
7. Jaco Geldenhuys, Antti Valmari
   Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. [Citation Graph (0, 0)][DBLP]
   TACAS, 2004, pp:205-219 [Conf]
   
8. Jaco Geldenhuys, Antti Valmari
   More efficient on-the-fly LTL verification with Tarjan's algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:345, n:1, pp:60-82 [Journal]
   
9. 
   Exploring the Scope for Partial Order Reduction. [Citation Graph (, )][DBLP]
   
   
10. 
    Impendulo: debugging the programmer. [Citation Graph (, )][DBLP]
    
    
11. 
    Cheap and Small Counterexamples. [Citation Graph (, )][DBLP]
    
    
12. 
    Reducing Nondeterministic Finite Automata with SAT Solvers. [Citation Graph (, )][DBLP]
    
    
13. 
    Update Propagation Practices in Highly Reusable Open Source Components. [Citation Graph (, )][DBLP]