Thesis - Master (4)

121.
Thesis - Master
Becker, J.: Effiziente Subsumption in Deduktionssystemen. Master, Universität des Saarlandes, Saarbrücken (1994)
122.
Thesis - Master
Piskorski, J.: Parallele Graphenalgorithmen für den Hypercube. Master, Universität des Saarlandes, Saarbrücken (1994)

Report (62)

123.
Report
Progress Report: 1991 - 1994. Max-Planck-Institut für Informatik, Saarbrücken (1994), 154 pp.
124.
Report
Aït-Kaci, H.; Hanus, M.; Navarro, J. J. M.: Integration of declarative paradigms: Proceedings of the ICLP'94 Post-Conference Workshop, Santa Margherita Ligure, Italy. Max-Planck-Institut für Informatik, Saarbrücken (1994), 149 pp.
125.
Report
Albers, S.; Hagerup, T.: Improved parallel integer sorting without concurrent writing. Max-Planck-Institut für Informatik, Saarbrücken (1994)
126.
Report
Albers, S.; Koga, J.: New on-line algorithms for the page replication problem. Max-Planck-Institut für Informatik, Saarbrücken (1994), 18 pp.
127.
Report
Arikati, S.: On the parallel complexity of degree sequence problems. Max-Planck-Institut für Informatik, Saarbrücken (1994), 12 pp.
128.
Report
Arikati, S.; Maheshwari, A.: Realizing degree sequences in parallel. Max-Planck-Institut für Informatik, Saarbrücken (1994), 27 pp.
129.
Report
Arikati, S. R.; Maheshwari, A.; Zaroliagis, C.: Efficient computation of compact representations of sparse graphs. Max-Planck-Institut für Informatik, Saarbrücken (1994), 10 pp.
130.
Report
Arya, S.; Mount, D.; Narayan, O.: Accounting for Boundary Effects in Nearest Neighbor Searching. Max-Planck-Institut für Informatik, Saarbrücken (1994), 15 pp.
131.
Report
Arya, S.; Mount, D.; Smid, M.: Dynamic algorithms for geometric spanners of small diameter: randomized solutions. Max-Planck-Institut für Informatik, Saarbrücken (1994)
132.
Report
Arya, S.; Smid, M.: Efficient construction of a bounded degree spanner with low weight. Max-Planck-Institut für Informatik, Saarbrücken (1994), 25 pp.
133.
Report
Barnes, G.: A method for implementing lock-free shared data structures. Max-Planck-Institut für Informatik, Saarbrücken (1994), 15 pp.
134.
Report
Barnes, G.; Edmonds, J. A.: Time-space lower bounds for directed s-t connectivity on JAG models. Max-Planck-Institut für Informatik, Saarbrücken (1994)
135.
Report
Barnes, G.; Feige, U.: Short random walks on graphs. Max-Planck-Institut für Informatik, Saarbrücken (1994), 14 pp.
136.
Report
Barth, P.: Linear 0-1 inequalities and extended clauses. Max-Planck-Institut für Informatik, Saarbrücken (1994), 53 pp.
137.
Report
Barth, P.; Bockmayr, A.: Finite domain and cutting plane techniques in CLP (PB). Max-Planck-Institut für Informatik, Saarbrücken (1994), 16 pp.
138.
Report
Basin, D. A.: Logic frameworks for logic programs. Max-Planck-Institut für Informatik, Saarbrücken (1994), 13 pp.
139.
Report
Basin, D. A.; Walsh, T.: Termination orderings for rippling. Max-Planck-Institut für Informatik, Saarbrücken (1994), 15 pp.
140.
Report
Bockmayr, A.: Cutting planes in constraint logic programming. Max-Planck-Institut für Informatik, Saarbrücken (1994), 23 pp.
Go to Editor View