Ordering Continuing Functions set in Backtracking Algorithms

1. Tiberiu Socaciu, Invatati Backtracking. Exemple in Pascal si C, Editura InfoData Cluj 2006, ISBN 973-87774- 1-0, 160 pages (Learning Backtracking. Examples in Pascal and C);

2. Tiberiu Socaciu, Splitting Domain Mechanisms for Backtracking like Algororithms in Computer Clusters, in The 12th International Conference. The Knowledge Based Organization. Electrotechnics, Electronics and Communication, Computer Science, Modelling and Simulation, Sibiu 11-14 june 2007, Sibiu-Romania, pp. 232- 236 (ISBN 978-973-7809-71-1, ISBN 978-973-7809-94-0);

3. Tiberiu Socaciu, Bogdan Patrut, Algoritm Backtracking pentru un cluster bazat pe mesaje, in Studia Universitatis Vasile Goldis Arad, Seria Stiinte Exacte, nr. 16 (2006), pp. 43-46, (Backtracking Algorithm for a Message-based Cluster);

4. Tiberiu Socaciu, Demonstrarea corectitudinii variantei recursive a algoritmului Backtracking, in GInfo, nr. 17/5, pp. 24-25, (Proving correctness of recurrent variant of Backtracking Algorithm);

5. Tiberiu Socaciu, Paralelism si Concurenta in Algoritmul Backtracking Recursiv, in GInfo, nr. 17/4, pp. 10-12. (Parallelism and Concurrency of Recurrent Backtracking Algorithm);

6. Tiberiu Socaciu, Algoritm Backtracking pentru un cluster bazat pe mesaje, in GInfo, nr. 16/8, pp. 28-31. (Backtracking Algorithm for a Message-based Cluster);

7. Tiberiu Socaciu, Cea mai buna functie de continuare, in GInfo, nr. 16/7, pp. 20-21. (Best Continuing function);

8. Tiberiu Socaciu, Serializarea ca metoda de determinare a functiei de continuare, in GInfo, nr. 16/6 (2006), pp. 28- 29, (Serialization as Method of Obtaining Continuing Function);

9. Tiberiu Socaciu, Limite ale complexitatii algoritmilor de tip Backtracking, in INF.RO 13/2007, pp. 2-7. (Limits of Backtracking like Algorithm’s Complexity