FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
复制标题
FST TCS 2003：软件技术和理论计算机科学基础
DOI：
--
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
J. Radhakrishnan
中科院分区：
文献类型：
--
作者：
P. Pandya;J. Radhakrishnan
贡献了论文。-在Needham-Schroeder-lowe公共钥匙方案中具有密码的声音安全证明。-稀疏不对称连接器的构造。-用于资源分布的分离逻辑。无法确定1个结合的TWA。-对过程重写系统的可及性分析。-以无限制和正常状态的下降游戏。-实时模型检查：到处都是参数。-根据逻辑和高阶俯卧撑自动机的无限图的观点层次结构。-在指数中使用Diffie-Hellman指数和产品确定协议的安全性。-在准静态中的子类型约束。-一个改进的近似方案。用于计算线性案例的箭头 - debreu价格。在种植分区模型中进行协作过滤的算法。-将序列与段重排比较。-在逻辑定义的可识别的树语言上。-定向的有向图连接的随机时间间隔折衷。-距离距离的距离近似值近似值。-多边形路径的近似值。以及常规多面体的极端不规则性。空间逻辑。-在平行磁盘上放置非均匀尺寸数据的算法。-对阿贝尔集团同构和相关问题的有效算法。-quasi-polynomial时间近似算法，用于低数量的最小施罐树。破坏模态逻辑。-通过带状移动合并和分类。-宏观换能器线性尺寸增加功能的层次结构崩溃。分布式游戏。-维护多维直方图。-标记也可以通过无限的nonces确定保密性。-量子和经典的复杂性类别：分离，折叠和闭合属性。猜想。-邀请论文 - 使用布尔方法对无限状态系统的推理。-严格相对化 - 基于组件的无僵硬系统的构建。
Contributed Papers.- A Cryptographically Sound Security Proof of the Needham-Schroeder-Lowe Public-Key Protocol.- Constructions of Sparse Asymmetric Connectors.- A Separation Logic for Resource Distribution.- An Equational Theory for Transactions.- Axioms for Regular Words.- 1-Bounded TWA Cannot Be Determinized.- Reachability Analysis of Process Rewrite Systems.- Pushdown Games with Unboundedness and Regular Conditions.- Real-Time Model-Checking: Parameters Everywhere.- The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.- Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.- Subtyping Constraints in Quasi-lattices.- An Improved Approximation Scheme for Computing Arrow-Debreu Prices for the Linear Case.- Word Equations over Graph Products.- Analysis and Experimental Evaluation of a Simple Algorithm for Collaborative Filtering in Planted Partition Models.- Comparing Sequences with Segment Rearrangements.- On Logically Defined Recognizable Tree Languages.- Randomized Time-Space Tradeoffs for Directed Graph Connectivity.- Distance-Preserving Approximations of Polygonal Paths.- Joint Separation of Geometric Clusters and the Extreme Irregularities of Regular Polyhedra.- On the Covering Steiner Problem.- Minimality Results for the Spatial Logics.- Algorithms for Non-uniform Size Data Placement on Parallel Disks.- Efficient Algorithms for Abelian Group Isomorphism and Related Problems.- Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.- Model Checking and Satisfiability for Sabotage Modal Logic.- Merging and Sorting By Strip Moves.- The Macro Tree Transducer Hierarchy Collapses for Functions of Linear Size Increase.- Distributed Games.- Maintenance of Multidimensional Histograms.- Tagging Makes Secrecy Decidable with Unbounded Nonces as Well.- Quantum and Classical Complexity Classes: Separations, Collapses, and Closure Properties.- On the Greedy Superstring Conjecture.- Invited Papers.- Reasoning about Infinite State Systems Using Boolean Methods.- Stringent Relativization.- Component-Based Construction of Deadlock-Free Systems.- Moderately Hard Functions: From Complexity to Spam Fighting.- Zigzag Products, Expander Constructions, Connections, and Applications.