Author of the publication

Exploring Efficient Strategies for Minesweeper.

, , , , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)

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.

Tzu-Ying Chen University of Stuttgart

Replication Data for: Structural development of a novel punctually supported timber building system for multi-storey construction : Experimental Data: Tension Tests of the Edge Connection, , , , , and . Dataset, (2024)Related to: Anna Krtschil, Luis Orozco, Simon Bechert, Hans Jakob Wagner, Felix Amtsberg, Tzu-Ying Chen, Anand Shah, Achim Menges, Jan Knippers, "Structural development of a novel punctually supported timber building system for multi-storey construction", Journal of Building Engineering, Volume 58, 2022, pages 104972. doi: 10.1016/j.jobe.2022.104972.
 

Other publications of authors with the same name

On the power of dominated players in team competitions., , and . CoRR, (2016)Exploring Efficient Strategies for Minesweeper., , , , and . AAAI Workshops, volume WS-17 of AAAI Technical Report, AAAI Press, (2017)Correlation lower bounds from correlation upper bounds., and . Inf. Process. Lett., 116 (8): 537-540 (2016)Reconstructing Numbers from Pairwise Function Values., , and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 142-152. Springer, (2009)From Independent Sets and Vertex Colorings to Isotropic Spaces and Isotropic Decompositions: Another Bridge Between Graphs and Alternating Matrix Spaces., , , , and . ITCS, volume 151 of LIPIcs, page 8:1-8:48. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Exponential Lower Bounds for the PPSZ k-SAT Algorithm., , , and . SODA, page 1253-1263. SIAM, (2013)Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings, , and . CoRR, (2012)Width-Parametrized SAT: Time--Space Tradeoffs., , , , and . Theory of Computing, (2014)From independent sets and vertex colorings to isotropic spaces and isotropic decompositions., , , , and . CoRR, (2019)Time-space tradeoffs for width-parameterized SAT: Algorithms and lower bounds., , , , and . Electronic Colloquium on Computational Complexity (ECCC), (2012)