FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
复制标题
FST TCS 2002：软件技术和理论计算机科学基础
DOI：
--
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
Anil Seth
中科院分区：
文献类型：
--
作者：
Manindra Agrawal;Anil Seth
邀请函-高斯周期的素性检验从希尔伯特空间到呆伯特空间：上下文语义变得简单。编码一般判断。使用游戏语义对类Algol语言进行模型检查。建模软件：从理论到实践贡献论文。迹上逻辑的局部正规形用锐化三角不等式构造完全图中最小2-连通生成子图的困难性移动的封闭环境中的通信干扰重新审视密封演算：上下文等价和双相似性。组成串空间。将自动性推广到有限结构的模态特性。一种自动机理论的方法来约束LTL。多播成本分担的硬结果。如何编写Presburger加速：应用于广播协议。基于模拟等价的交替Buchi自动机商的状态空间约简基于切片偏序集的数学组合学弧注释序列的模式匹配。知识在密集的时间流（从混合的角度来看）。惯性的复杂性。指针追踪问题的量子通信复杂性：比特版本。一元签名情形下Knuth-Benzinger序的一阶理论的可判定性决定第一级的？-微积分交替层次。动态消息序列图。确定性树传感器组成的复杂性。关于近似最小垄断问题的难度。遗传历史保持互模拟是可决定的跟踪标记系统。图嵌入小特征图的下界最近邻搜索使用球中的点位置与应用到近似Voronoi分解。序列数据库中基于相似性检索的形式语言和算法异步电路设计中的分解队列布局、树宽度和三维图形绘制。
Invited Papers.- Primality Testing with Gaussian Periods.- From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple.- Encoding Generic Judgments.- Model Checking Algol-Like Languages Using Game Semantics.- Modeling Software: From Theory to Practice.- Contributed Papers.- Local Normal Forms for Logics over Traces.- On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality.- Communication Interference in Mobile Boxed Ambients.- The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity.- Composing Strand Spaces.- Generalising Automaticity to Modal Properties of Finite Structures.- An Automata-Theoretic Approach to Constraint LTL.- Hardness Results for Multicast Cost Sharing.- How to Compose Presburger-Accelerations: Applications to Broadcast Protocols.- State Space Reductions for Alternating Buchi Automata Quotienting by Simulation Equivalences.- Algorithmic Combinatorics Based on Slicing Posets.- Pattern Matching for Arc-Annotated Sequences.- Knowledge over Dense Flows of Time (from a Hybrid Point of View).- The Complexity of the Inertia.- The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version.- The Decidability of the First-Order Theory of the Knuth-Bendix Order in the Case of Unary Signatures.- Deciding the First Level of the ?-Calculus Alternation Hierarchy.- Dynamic Message Sequence Charts.- The Complexity of Compositions of Deterministic Tree Transducers.- On the Hardness of Approximating Minimum Monopoly Problems.- Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems.- Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic.- Nearest Neighbors Search Using Point Location in Balls with Applications to Approximate Voronoi Decompositions.- Formal Languages and Algorithms for Similarity Based Retrieval from Sequence Databases.- Decomposition in Asynchronous Circuit Design.- Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.