Author of the publication

An Efficient Implicit Data Structure for Relation Testing and Searching in Partially Ordered Sets.

, , and . BIT, 33 (1): 29-45 (1993)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Characterization of Space Complexity Classes and Subexponential Time Classes as Limiting Polynomially Decidable Sets, and . (1991)Suspiciousness of loading problems., , , and . ICNN, page 1240-1245. IEEE, (1997)Lattice theoretic ordering properties for NP-complete optimization problems., , and . Fundam. Informaticae, 4 (1): 83-94 (1981)Reactive Search, a History-Sensitive Heuristic for MAX-SAT., and . ACM J. Exp. Algorithmics, (1997)Preserving Approximation in the Min-Weighted Set Cover Problem., , and . Discret. Appl. Math., 73 (1): 13-22 (1997)Exploring and comparing the best "direct methods" for the efficient training of MLP-networks., , and . IEEE Trans. Neural Networks, 7 (6): 1497-1502 (1996)Probabilistic Models for Database Schemes and Random Hypergraphs., , and . WG, page 5-16. Universitätsverlag Rudolf Trauner, Linz, (1983)Solving Linear Systems by a Neural Network Canonical Form of Efficient Gradient Descent., , , and . ICONIP (1), page 531-534. Springer, (1997)Limiting Characterizations of Low Level Space Complexity Classes., and . RAIRO Theor. Informatics Appl., 27 (3): 175-182 (1993)Learning Under Uniform Distribution., and . FCT, volume 380 of Lecture Notes in Computer Science, page 327-338. Springer, (1989)