Author of the publication

An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm.

, and . KI, volume 12873 of Lecture Notes in Computer Science, page 276-288. Springer, (2021)

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

Separators and adjustment sets in causal graphs: Complete criteria and an algorithmic framework., , and . Artif. Intell., (2019)The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes., , and . Theor. Comput. Sci., 304 (1-3): 129-156 (2003)Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes.. STACS, volume 1200 of Lecture Notes in Computer Science, page 129-140. Springer, (1997)Alternating Real-Time Computations., and . Inf. Process. Lett., 28 (6): 311-316 (1988)Reversal Complexity Classes for Alternating Turing Machines., , and . SIAM J. Comput., 19 (2): 207-221 (1990)Improving the Average Delay of Sorting., , , and . TAMC, volume 4484 of Lecture Notes in Computer Science, page 330-341. Springer, (2007)An Approach to Reduce the Number of Conditional Independence Tests in the PC Algorithm., and . KI, volume 12873 of Lecture Notes in Computer Science, page 276-288. Springer, (2021)Äct natural!": Exchanging Private Messages on Public Blockchains., , , and . EuroS&P, page 292-308. IEEE, (2023)Finding Minimal d-separators in Linear Time and Applications., and . UAI, volume 115 of Proceedings of Machine Learning Research, page 637-647. AUAI Press, (2019)On Reversal Complexity for Alternating Turing Machines (Extended Abstract), and . FOCS, page 618-623. IEEE Computer Society, (1989)