
The Library
Browse by Funded research at the University of Warwick
![]() | Up a level |
Number of items: 5.
Czerwiลski, Wojciech, Daviaud, Laure, Fijalkow, Nathanael, Jurdzinski, Marcin, Lazic, Ranko and Parys, Pawel (2019) Universal trees grow inside separating automata : quasi-polynomial lower bounds for parity games. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), California, 6-9 Jan 2019. Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms pp. 2333-2349. ISBN 9781611975482. doi:10.1137/1.9781611975482.142
Alili, Larbi, Chaumont, Loรฏc, Graczyk, Piotr and ลปak, Tomasz (2017) Inversion, duality and Doob h-transforms for self-similar Markov processes. Electronic Journal of Probability, 22 . 20. doi:10.1214/17-EJP33 ISSN 1083-6489.
Chen, Bo, Coffman, Ed , Dereniowski, Dariusz and Kubiak, Wiesลaw (2016) Normal-form preemption sequences for an open problem in scheduling theory. Journal of Scheduling, 19 (6). pp. 701-728. doi:10.1007/s10951-015-0446-9 ISSN 1094-6136.
Wheatley, Peter J. (2016) The LOFT mission concept : a status update. In: Space Telescopes and Instrumentation 2016: Ultraviolet to Gamma Ray, Edinburgh, United Kingdom, 26 June 2016. Published in: Proceedings of SPIE - International Society for Optical Engineering, 9905 99051R. doi:10.1117/12.2233161 ISSN 0277-786X.
Cygan, Marek, Pilipczuk, Marcin, Pilipczuk, Michaล, van Leeuwen, Erik Jan and Wrochna, Marcin (2015) Polynomial kernelization for removing induced claws and diamonds. In: 41st International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Munich, Germany, 17-19 Jun 2015. Published in: Graph-Theoretic Concepts in Computer Science : 41st International Workshop, WG 2015, Garching, Germany, June 17-19, 2015, Revised Papers, 9224 pp. 450-455. ISBN 9783662531730.