2016年FSTTCS的HTML导出

复制到剪贴板 下载

<h2>LIPIcs，第65卷，FSTTCS 2016</h2><ul><li>Akash Lal、S.Akshay、Saket Saurabh和Sandeep Sen</span>LIPICs，第65卷，FSTTCS&#039；16、完整卷</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016“>10.44230/LIPIcs.FSTTCS.2016</a></li><li>Akash Lal、S.Akshay、Saket Saurabh和Sandeep Sen</span>前文、目录、前言、会议组织、外部审查人</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.0“>10.4230/LIPIcs.FSTTCS.2016.0</a></li><li>Mikkel Thorup</span><span class=“title”>使用制表快速而强大的散列（邀请谈话）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.1“>10.4230/LIPIcs.FSTTCS.2016.1</a></li><li>穆利·萨吉夫</span>证明分布式协议安全性的简单不变量（受邀谈话）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.2（中文）“>10.4230/LIPIcs.FSTTCS.2016.2</a></li><li>霍尔格·赫尔曼</span><span class=“title”>我的O比你的大（邀请谈话）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.3“>10.4230/LIPIcs.FSTTCS.2016.3</a></li><li>亚历山大·马德里</span>连续优化：图形算法的“正确”语言？（受邀演讲）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.4“>10.4230/LIPIcs.FSTTCS.2016.4</a></li><li>费多尔·福明（Fedor V.Fomin）</span>图分解和算法（受邀演讲）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.5“>10.4230/LIPIcs.FSTTCS.2016.5</a></li><li>特夫菲克·布尔坦</span>使用模型计数约束求解器和符号执行进行边信道分析（受邀演讲）</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.6“>10.4230/LIPIcs.FSTTCS.2016.6</a></li><li>Sanjoy Baruah、Arvind Easwaran和Zhishan Guo</span>最小化Makespan的混合临界调度</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.7“>10.4230/LIPIcs.FSTTCS.2016.7</a></li><li>Aounon Kumar</span>具有顶点权重的电容k中心问题</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.8“>10.4230/LIPIcs.FSTTCS.2016.8</a></li><li>Waldo Gálvez、Fabrizio Grandoni、Salvatore Ingala和Arindam Khan</span>条形填料的改进伪多项式时间近似</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.9“>10.4230/LIPIcs.FSTTCS.2016.9</a></li><li>Amit Deshpande、Prahladh Harsha和Rakesh Venkat</span><span class=“title”>将近似低维l_2^2度量嵌入l_1</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.10“>10.4230/LIPIcs.FSTTCS.2016.10</a></li><li>Anindya Banerjee、David A.Naumann和Mohammad Nikouei</span>带框架和假设的关系逻辑</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.11“>10.4230/LIPIcs.FSTTCS.2016.11</a></li><li>Vrunda Dave、Shankara Narayanan Krishna和Ashutosh Trivedi</span>无限字符串的FO-可定义变换</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.12“>10.4230/LIPIcs.FSTTCS.2016.12</a></li><li>Emmanuel Filiot、Olivier Gauwin和Nathan Lhote</span>有理函数的非周期性是PSPACE-Complete</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.13“>10.4230/LIPIcs.FSTTCS.2016.13</a></li><li>Bartek Klin、Slawomir Lasota、Joanna Ochremiak和Szymon Torunczyk</span>一阶可定义结构的同态问题</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.14“>10.4230/LIPIcs.FSTTCS.2016.14</a></li><li>卡提克·C.S.和塞巴斯蒂安·塔维纳斯</span>关于析取范式的灵敏度猜想</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.15“>10.44230/LIPIcs.FSTTCS.2016.15</a></li><li>Jaikumar Radhakrishnan和Swagato Sanyal</span>指针函数的零错误随机查询复杂性</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.16“>10.4230/LIPIcs.FSTTCS.2016.16</a></li><li>Prahladh Harsha和Srikanth Srinivasan</span>基于稳健乘法的Reed-Muller码测试</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.17“>10.4230/LIPIcs.FSTTCS.2016.17</a></li><li>Moses Ganardi、Danny Hucke和Markus Lohrey</span>在滑动窗口上查询正则语言</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.18“>10.4230/LIPIcs.FSTTCS.2016.18</a></li><li>宣巴赫·勒、阿奎那·霍伯和安东尼·林</span>树共享公式的可决定性和复杂性</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.19“>10.4230/LIPIcs.FSTTCS.2016.19</a></li><li>Benedikt Bollig</span>具有反可观测性的单计数器自动机</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.20“>10.4230/LIPIcs.FSTTCS.2016.20</a></li><li>Ashutosh Rai和M.S.Ramanujan</span>强参数化删除：二部图</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.21“>10.4230/LIPIcs.FSTTCS.2016.21</a></li><li>Fahad Panolan和Meirav Zehavi</span>列表K循环的参数化算法</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.22“>10.4230/LIPIcs.FSTTCS.2016.22</a></li><li>R.Krithika、Pranabendu Misra、Ashutosh Rai和Prafullkumar Tale</span>图压缩问题的有损核</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.23“>10.4230/LIPIcs.FSTTCS.2016.23</a></li><li>Mithilesh Kumar和Daniel Lokshtanov</span>二部竞赛反馈顶点集的快速精确参数化算法</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.24“>10.4230/LIPIcs.FSTTCS.2016.24</a></li><li>Kim G.Larsen、Radu Mardare和Bingtian Xue</span>概率Mu-Calculus：可判定性和完全公理化</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.25“>10.4230/LIPIcs.FSTTCS.2016.25</a></li><li>Laura Bozzelli、Alberto Molinari、Angelo Montanari、Adriano Peron和Pietro Sala</span>区间与点时间逻辑模型检查：表达性比较</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.26“>10.4230/LIPIcs.FSTTCS.2016.26</a></li><li>哈维尔·埃斯帕尔扎（Javier Esparza）、皮埃尔·甘蒂（Pierre Ganty）、杰尔·勒鲁（Jéróme Leroux）和鲁帕克·马朱姆达尔（Rupak Majumdar）</span>模型检查填充协议</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.27“>10.4230/LIPIcs.FSTTCS.2016.27</a></li><li>亚历山大·韦内特（Alexander Weinert）和马丁·齐默尔曼（Martin Zimmermann）</span>可视线性动态逻辑</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.28“>10.4230/LIPIcs.FSTTCS.2016.28</a></li><li>Sushmita Gupta和Sanjukta Roy</span>稳定匹配博弈：基于子图同构的操作</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.29“>10.4230/LIPIcs.FSTTCS.2016.29</a></li><li>Umang Bhaskar、Ajil Jalal和Rahul Vaze</span>具有严格容量限制的Adwords问题</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.30“>10.4230/LIPIcs.FSTTCS.2016.30</a></li><li>尼尔曼·库马尔（Nirman Kumar）、本杰明·雷切尔（Benjamin Raichel）、苏里（Subhash Suri）和凯文·韦贝克（Kevin Verbeek）</span>高维最可能的Voronoi图</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.31“>10.44230/LIPIcs.FSTTCS.2016.31</a></li><li>Aritra Banik、Fahad Panolan、Venkatesh Raman和Vibha Sahlot</span>直线和阿凡达点集之间的Fréchet距离</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.32“>10.4230/LIPIcs.FSTTCS.2016.32</a></li><li>Ankit Chauhan、Tobias Friedrich和Ralf Rothenberger</span>贪婪有利于确定性无标度网络</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.33“>10.4230/LIPIcs.FSTTCS.2016.33</a></li><li>Mark de Berg、Bart M.P.Jansen和Debankur Mukherjee</span>遗传图类的独立集重构阈值</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.34“>10.4230/LIPIcs.FSTTCS.2016.34</a></li><li>Pawel Gawrychowski和Artur Jez</span>LZ77树因子分解</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.35“>10.4230/LIPIcs.FSTTCS.2016.35</a></li><li>菲利普·比尔（Philip Bille）、安德斯·罗伊·克里斯蒂安森（Anders Roy Christiansen）、帕特里克·哈格·科尔丁（Patrick Hagge Cording）和英格·李·戈茨（Inge Li Gortz）</span>语法压缩字符串中的手指搜索</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.36“>10.4230/LIPIcs.FSTTCS.2016.36</a></li><li>Krishnamoorthy Dinesh、Sajin Koroth和Jayalal Sarma</span>使用投影维的分支程序大小的特征和下限</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.37“>10.4230/LIPIcs.FSTTCS.2016.37</a></li><li>Mrinal Kumar和Ramprasad Saptharishi</span>浅层算术电路之间的精细分离</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.38“>10.4230/LIPIcs.FSTTCS.2016.38</a></li><li>Ramya C.和B.V.Raghavendra Rao</span>只读公式乘积之和</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.39“>10.44230/LIPIcs.FSTTCS.2016.39</a></li><li>Olaf Beyersdorff、Leroy Chew、Meena Mahajan和Anil Shukla</span>了解QBF的切割平面</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.40“>10.4230/LIPIcs.FSTTCS.2016.40</a></li><li>卢卡斯·霍利克、罗兰·梅耶和塞巴斯蒂安·穆斯卡拉</span>无上下文游戏摘要</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.41“>10.4230/LIPIcs.FSTTCS.2016.41</a></li><li>罗曼·布伦吉尔、吉列尔莫·A·佩雷斯、珍妮·弗朗索斯·拉斯金和奥坎·桑库尔</span>定量图形游戏中的可容许性</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.42“>10.4230/LIPIcs.FSTTCS.2016.42</a></li><li>Felix Klein和Martin Zimmermann</span>提示延迟</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.43“>10.4230/LIPIcs.FSTTCS.2016.43</a></li><li>Shibashis Guha、Marcin Jurdzinski、Shankara Narayanan Krishna和Ashutosh Trivedi</span>Timed Automata上的Mean-Payoff游戏</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.44“>10.44230/LIPIcs.FSTTCS.2016.44</a></li><li>彼得·伯曼（Piotr Berman）、梅拉姆·穆扎布拉托夫（Meiram Murzabulatov）和索菲亚·拉斯霍德尼科娃（Sofya Raskhodnikova）</span>均匀样品在图形特性测试中的作用和局限</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.45“>10.4230/LIPIcs.FSTTCS.2016.45</a></li><li>卡提基安·钱德拉塞卡兰（Karthekeyan Chandrasekaran）、马赫迪·切拉赫奇（Mahdi Cheraghchi）、文卡塔·甘迪科塔（Venkata Gandikota）和埃琳娜·格里戈雷斯库（Elena Grigorescu）</span>格成员的局部测试</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.46“>10.4230/LIPIcs.FSTTCS.2016.46</a></li><li>Sriram V.Pemmaraju和Vivek B.Sardeshmukh</span>使用o（m）条消息的拥塞群中的超快速MST算法</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.47“>10.4230/LIPIcs.FSTTCS.2016.47</a></li><li>弗雷德里克·赫布雷托（Frédéric Herbreteau）、B.Srivathsan、Thanh-Tung Tran和Igor Walukiewicz</span><span class=“title”>为什么时间自动机很难生存，以及我们能做些什么</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.48“>10.4230/LIPIcs.FSTTCS.2016.48</a></li><li>Maximilian P.L.Haslbeck和Tobias Nipkow</span>列表更新算法的验证分析</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.49“>10.4230/LIPIcs.FSTTCS.2016.49</a></li><li>雅罗斯拉夫·本迪克（Jaroslav Bendík）、尼古拉·贝内斯（Nikola Benes）、伊万娜·塞尔纳（Ivana Cerná）和杰里·巴纳特（JiríBarnat）</span>可调在线MUS/MSS枚举</span><a class=“doi”href=“https://doi.org/10.4230/LIPIcs.FSTTCS.2016.50“>10.4230/LIPIcs.FSTTCS.2016.50</a></li></ul>

Dagstuhl出版社在其网页上提供的元数据，以及我们网站上提供的导出格式（如XML或BibTeX），根据CC0 1.0公共域专用许可证发布。也就是说，您可以自由复制、分发、使用、修改、转换、构建，并根据我们的数据制作衍生作品，即使是出于商业目的，都是未经许可的。当然，如果您能为我们提供链接作为数据来源，我们将非常高兴。

请阅读完整的CC0 1.0法律法规，了解适用的确切条款：https://creativecommons.org/publicdomain/zero/1.0/legalcode