@inproceedings{10.1145/3373718.3394753,
Address = {New York, NY, USA},
Author = {Balasubramanian, A. R.},
BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
ISBN = {9781450371049},
Keywords = {well-quasi orders, controlled bad sequences, majoring and minoring ordering},
Location = {Saarbr\"{u}cken, Germany},
Pages = {130--140},
Publisher = {Association for Computing Machinery},
Series = {LICS '20},
Title = {Complexity of Controlled Bad Sequences over Finite Sets of Nd},
URL = {https://doi.org/10.1145/3373718.3394753},
Year = {2020},
bdsk-url-1 = {https://doi.org/10.1145/3373718.3394753},
bdsk-url-2 = {https://youtu.be/JmM8Tp5\_1II},
bdsk-url-3 = {https://depend.cs.uni-saarland.de/lics-icalp/papers/A5.E},
date-added = {2020-07-04 09:15:26 +0200},
date-modified = {2020-07-04 09:15:26 +0200},
numpages = {11},
doi = {10.1145/3373718.3394753}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A