首页>外文会议>其他>International Conference on Foundations of Software Technology and Theoretical Computer Science

International Conference on Foundations of Software Technology and Theoretical Computer Science

召开年：
召开地：
出版时间：-

会议文集：-

会议论文

热门论文

全部论文

全选（0）

1.On Clustering Using Random Walks

机译：在使用随机散步的聚类上
- 作者：David Harel;Yehuda Koren
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
2.Rewrite Closure for Ground and Cancellative AC Theories

机译：重写地面和取消AC理论的关闭
- 作者：Ashish Tiwari
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
3.From Falsification to Verification

机译：从伪造到验证
- 作者：Doron Peled;Amir Pnueli;Lenore Zuck
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
4.Semidefinite Programming Based Approximation Algorithms

机译：基于SemideFinite编程的近似算法
- 作者：Uri Zwick
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
5.Hard Sets and Pseudo-random Generators for Constant Depth Circuits

机译：用于恒定深度电路的硬装置和伪随机发电机
- 作者：Manindra Agrawal
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
6.Verification of a Leader Election Algorithm in Timed Asynchronous Systems

机译：验证定时异步系统中的领导选举算法
- 作者：Neeraj Jaggi;K. Gopinath
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
7.An Introduction to Decidability of DPDA Equivalence

机译：涉及DPDA等价性的可解锁性
- 作者：Colin Stirling
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
8.Beyond Message Sequence Graphs

机译：超出消息序列图
- 作者：P. Madhusudan;B. Meenakshi
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
9.Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter (Extended Abstract)

机译：具有自由计数器的逆转多圈机机的活力验证（扩展摘要）
- 作者：Zhe Dang;Oscar H. Ibarra;Pierluigi San Pietro
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
10.A Mechanically Verified Compiling Specification for a Lisp Compiler

机译：用于LISP编译器的机械验证编译规范
- 作者：Axel Dold;Vincent Vialard
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
11.Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity

机译：通信复杂性，线性布置和计算复杂性之间的关系
- 作者：Jurgen Forster;Matthias Krause;Satyanarayana V. Lokam;Rustam Mubarakzjanov;Niels Schmitt;Hans Ulrich Simon
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
12.The Directed Minimum-Degree Spanning Tree Problem

机译：定向最小程度的生成树问题
- 作者：Radha Krishnan;Balaji Raghavachari
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
13.List Decoding from Erasures: Bounds and Code Constructions

机译：列出擦除解码：界限和代码结构
- 作者：Venkatesan Guruswami
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
14.Thresholds and Optimal Binary Comparison Search Trees (Extended Abstract)

机译：阈值和最佳二进制比较搜索树（扩展摘要）
- 作者：Richard Anderson;Sampath Kannan;Howard Karloff;Richard E. Ladner
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
15.Grouping Techniques for One Machine Scheduling Subject to Precedence Constraints

机译：对优先约束的一台机器调度的分组技术
- 作者：Monaldo Mastrolilli
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
16.Properties of Distributed Timed-Arc Petri Nets

机译：分布式定时弧培养网的特性
- 作者：Mogens Nielsen;Vladimiro Sassone;Jiri Srba
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
17.Beyond Regular Model Checking

机译：超越正常模型检查
- 作者：Dana Fisman;Amir Pnueli
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
18.Efficient Addition on Field Programmable Gate Arrays

机译：现场可编程门阵列上的高效添加
- 作者：Andreas Jakoby;Christian Schindelhauer
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
19.On Polynomial Representations of Boolean Functions Related to Some Number Theoretic Problems

机译：关于与某些数字理论问题相关的布尔函数的多项式表示
- 作者：Erion Plaku;Igor E. Shparlinski
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
20.Distributed LTL Model Checking Based on Negative Cycle Detection

机译：基于负循环检测的分布式LTL模型检查
- 作者：Lubo Brim;Ivana Cerna;Pavel Krcal;Radek Pelanek
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
21.Computability and Complexity Results for a Spatial Assertion Language for Data Structures

机译：用于数据结构的空间断言语言的计算性和复杂性结果
- 作者：Cristiano Calcagno;Hongseok Yang;Peter W. OHearn
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
22.Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

机译：最佳，输出敏感算法，用于并行构造线段上部包络
- 作者：Neelima Gupta;Sumit Chopra;Sandeep Sen
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
23.Using Nondeterminism to Design Efficient Deterministic Algorithms

机译：使用非季度设计设计有效的确定性算法
- 作者：Jianer Chen;Donald K. Friesen;Weijia Jia;Iyad A. Kanj
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
24.Approximation Schemes for Geometric NP-Hard Problems: A Survey

机译：几何NP难题的近似方案：调查
- 作者：Sanjeev Arora
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
25.Range Allocation for Equivalence Logic

机译：等价逻辑的范围分配
- 作者：Amir Pnueli;Yoav Rodeh;Ofer Shtrichman
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
26.Using Nondeterminism to Design Deterministic Algorithms

机译：使用非季度主义设计确定性算法
- 作者：Jianer Chen;Donald K. Friesen;Weijia Jia;Iyad A. Kanj
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
27.The First-Order Isomorphism Theorem

机译：一阶同义定理
- 作者：Manindra Agrawal
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
28.Beyond Regular Model Checking (Extended Abstract)

机译：超越常规模型检查（扩展摘要）
- 作者：Dana Fisman;Amir Pnueli
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
29.I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

机译：I / O高效的批量计数及其在邻近问题的应用
- 作者：Tamas Lukovszki;Anil Maheshwari;Norbert Zeh
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
30.When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity

机译：当世界碰撞时：嘲弄，下限和kolmogorov复杂性
- 作者：Eric Allender
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2001年
31.Practical Algorithms for Tracking Database Join Sizes

机译：跟踪数据库连接大小的实用算法
- 作者：Sumit Ganguly;Deepanjan Kesh;Chandan Saha
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
32.Reachability of Hennessy-Milner Properties for Weakly Extended PRS

机译：Hennessy-Milner属性的可达性弱扩展的PRS
- 作者：Mojmir Kretinsky;Vojtech Rehak;Jan Strejcek
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
33.No Coreset, No Cry: II

机译：没有Coreset，没有哭：II
- 作者：Michael Edwards;Kasturi Varadarajan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
34.Comparing Trees Via Crossing Minimization

机译：通过交叉最小化比较树木
- 作者：Henning Fernau;Michael Kaufmann;Mathias Poths
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
35.From Logic to Games

机译：从逻辑到游戏
- 作者：Igor Walukiewicz
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
36.On the Controller Synthesis for Finite-State Markov Decision Processes

机译：关于有限州马尔可夫决策过程的控制器综合
- 作者：Antonin Kucera;Oldfich Strazovsky
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
37.Towards a CTL~* Tableau

机译：朝着CTL〜* Tableau
- 作者：Mark Reynolds
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
38.Market Equilibrium for CES Exchange Economies: Existence, Multiplicity, and Computation

机译：CES交换经济体的市场均衡：存在，多重和计算
- 作者：Bruno Codenotti;Benton McCune;Sriram Penumatcha;Kasturi Varadarajan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
39.Reasoning About Quantum Knowledge

机译：关于量子知识的推理
- 作者：Ellie DHondt;Prakash Panangaden
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
40.Refining the Undecidability Frontier of Hybrid Automata

机译：炼制混合自动机的不可剥离性前沿
- 作者：Venkatesh Mysore;Amir Pnueli
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
41.When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?

机译：当定时自动机是弱定步的培养网？
- 作者：Beatrice Berard;Franck Cassez;Serge Haddad;Didier Lime;Olivier H. Roux
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
- time petri nets;
- timed automata;
- weak timed bisimilarity;
42.On the Bisimulation Congruence in χ -Calculus

机译：关于χ-Clulululul的双催化同一致性
- 作者：Taolue Chen;Tingting Han;Jian Lu
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
43.Computational Complexity Since 1980

机译：自1980年以来计算复杂性
- 作者：Russell Impagliazzo
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
44.Towards a CTL{sup}* Tableau

机译：迈向CTL {sup} * tableau
- 作者：Mark Reynolds
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
45.Developments in Data Structure Research During the First 25 Years of FSTTCS

机译：在FSTTC的前25年中数据结构研究的发展
- 作者：Raimund Seidel
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
46.Decision Procedures for Queues with Integer Constraints

机译：用整数约束的队列决策程序
- 作者：Ting Zhang;Henny B. Sipma;Zohar Manna
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
47.Proving Lower Bounds Via Pseudo-random Generators

机译：通过伪随机发电机证明下限
- 作者：Manindra Agrawal
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
48.Reachability Analysis of Multithreaded Software with Asynchronous Communication

机译：具有异步通信多线程软件的可达性分析
- 作者：Ahmed Bouajjami;Javier Esparza;Stefan Schwoon;Jan Strejcek
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
49.Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem

机译：多仓库车辆路由问题的概率分析
- 作者：Andreas Baltz;Devdatt Dubhashi;Libertad Tansini;Anand Srivastav;Soeren Werth
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
50.Improved Bounds on the Union Complexity of Fat Objects

机译：改进了脂肪对象的联盟复杂性的边界
- 作者：Mark de Berg
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
51.Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains

机译：计算Infinite Markov链的子类的预期累计奖励和收益
- 作者：Tomas Brazdil;Antonin Kucera
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
52.Dimensions of Copeland-Erdos Sequences

机译：COPELAND-ERDOS序列的尺寸
- 作者：Xiaoyang Gu;Jack H. Lutz;Philippe Moser
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
53.Testing Concurrent Systems: An Interpretation of Intuitionistic Logic

机译：测试并发系统：直觉逻辑的解释
- 作者：Radha Jagadeesan;Gopalan Nadathur;Vijay Saraswat
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
54.Quantitative Models and Implicit Complexity

机译：定量模型和隐含复杂性
- 作者：Ugo Dal Lago;Martin Hofmann
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
55.Modal Strength Reduction in Quantified Discrete Duration Calculus

机译：量化离散持续时间微积分的模态强度降低
- 作者：Shankara Narayanan Krishna;Paritosh K. Pandya
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
56.Fixpoint Logics on Hierarchical Structures

机译：分层结构上的FixPoint逻辑
- 作者：Stefan Goeller;Markus Lohrey
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
57.The Equivalence Problem for Deterministic MSO Tree Transducers Is Decidable

机译：确定性MSO树传感器的等价问题是可解除的
- 作者：Joost Engelfriet;Sebastian Maneth
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
58.Eventual Timed Automata

机译：最终的自动机
- 作者：Deepak DSouza;M. Raj Mohan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
59.Subquadratic Algorithms for Workload-Aware Haar Wavelet Synopses

机译：用于工作负载感知HAAR小波概要的子相关算法
- 作者：S. Muthukrishnan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
60.Approximation Algorithms for Wavelength Assignment

机译：波长分配的近似算法
- 作者：Vijay Kumar;Atri Rudra
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
61.On Sampled Semantics of Timed Systems

机译：关于定时系统的采样语义
- 作者：Pavel Krcal;Radek Pelanek
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
62.Extending Howe's Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

机译：扩展Howe对具有本地名称键入的移动嵌入式资源的早期BISIMULATION的方法
- 作者：Jens Chr. Godskesen;Thomas Hildebrandt
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
63.Logarithmic-Time Single Deleter, Multiple Inserter Wait-Free Queues and Stacks

机译：对数时间单点数据，多个inserter等待免费队列和堆栈
- 作者：Prasad Jayanti;Srdjan Petrovic
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
64.On the Bisimulation Congruence in X-Calculus

机译：论X-COMPULUS中的双催化一致
- 作者：Taolue Chen;Tingting Han;Jian Lu
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
65.Proofs of Termination of Rewrite Systems for Polytime Functions

机译：多时间函数的重写系统终止证明
- 作者：Toshiyasu Arai;Georg Moser
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
- termination;
- term rewriting characterisation;
- derivation length;
- complexity theory;
66.On the Expressiveness of TPTL and MTL

机译：关于TPTL和MTL的富有效率
- 作者：Patricia Bouyer;Fabrice Chevalier;Nicolas Markey
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
67.Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems

机译：在动态对等分布式系统中监控稳定的属性
- 作者：Sathya Peri;Neeraj Mittal
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
68.The MSO Theory of Connectedly Communicating Processes

机译：连通过程的MSO理论
- 作者：P. Madhusudan;P.S. Thiagarajan;Shaofa Yang
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
69.Inference Systems for Logical Algorithms

机译：用于逻辑算法的推理系统
- 作者：Natarajan Shankar
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
70.The Set Cover with Pairs Problem

机译：具有对问题的集合盖
- 作者：Refael Hassin;Danny Segev
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
71.Semiperfect-Information Games

机译：Semipfect-Information Games
- 作者：Krishnendu Chatterjee;Thomas A. Henzinger
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
72.Extending Howe’s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names

机译：扩展Howe对具有本地名称键入的移动嵌入式资源的早期BISIMULATION的方法
- 作者：Jens Chr. Godskesen;Thomas Hildebrandt
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
73.Bisimulation Quantified Logics: Undecidability

机译：Bisimulation量化逻辑：不可剥离性
- 作者：Tim French
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
74.The Directed Planar Reachability Problem

机译：定向的平面可达性问题
- 作者：Eric Allender;Samir Datta;Sambuddha Roy
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
75.Non-disclosure for Distributed Mobile Code

机译：不披露分布式移动代码
- 作者：Ana Almeida Matos
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
76.On Counting the Number of Consistent Genotype Assignments for Pedigrees

机译：关于划分百分比的一致基因型分配的数量
- 作者：Jiri Srba
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
77.On the Expressiveness of

机译：论表达的
- 作者：Patricia Bouyer;Fabrice Chevalier;Nicolas Markey
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
78.Causal Closure for MSC Languages

机译：MSC语言的因果闭合
- 作者：Bharat Adsul;Madhavan Mukund;K. Narayan Kumar;Vasumathi Narayanan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
79.Erdos Magic

机译：埃尔多斯魔术
- 作者：Joel Spencer
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2005年
80.Fair Matchings and Related Problems

机译：公平匹配和相关问题
- 作者：Chien-Chung Huang;Telikepalli Kavitha;Kurt Mehlhorn;Dimitrios Michail
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Matching with Preferences;
- Fairness;
- and Rank-Maximality;
- Bipartite Vertex Cover;
- Linear Programming Duality;
- Complementary Slackness;
81.Computation of Summaries Using Net Unfoldings

机译：使用网展开计算摘要
- 作者：Javier Esparza;Lo?g Jezequel;Stefan Schwoon
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Net unfoldings;
- Concurrent systems;
- Petri nets;
82.A Strong Direct Product Theorem for the Tribes Function via the Smooth-Rectangle Bound

机译：通过光滑矩形绑定的部落函数的强大直接产品定理
- 作者：Prahladh Harsha;Rahul Jain
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Rectangle bound;
- Tribes function;
- Strong direct product;
83.Decidability Results on the Existence of Lookahead Delegators for NFA

机译：可判定性导致NFA的寻找代理人的存在
- 作者：Christof L?ding;Stefan Repke
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Automata;
- Lookahead Delegators;
- Safety Games;
84.On Infinite Words Determined by Stack Automata

机译：堆栈自动机确定的无限单词
- 作者：Tim Smith
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- stack automaton;
- infinite word;
- pumping lemma;
- prefix language;
- multi-head finite automaton;
85.Renting a Cloud

机译：租云
- 作者：Barna Saha
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Scheduling Algorithm;
- Online Algorithm;
- Approximation Algorithm;
86.On the Structure and Complexity of Rational Sets of Regular Languages

机译：论Rational Sets常规语言的结构和复杂性
- 作者：Andreas Holzer;Christian Schallhart;Michael Tautschnig;Helmut Veith
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Rational Sets;
- Regular Languages;
- Test Specification in FQL;
- Closure Properties;
- Decision Problems;
87.Ranking with Diverse Intents and Correlated Contents

机译：用不同意图和相关内容排名
- 作者：Jian Li;Zeyu Zhang
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Approximation Algorithm;
- Diversification;
- min-sum Set Cover;
88.Faster Deterministic Algorithms for r-Dimensional Matching Using Representative Sets

机译：使用代表集的R维匹配更快的确定性算法
- 作者：Prachi Goyal;Neeldhara Misra;Fahad Panolan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- 3-Dimensional Matching;
- Fixed-Parameter Algorithms;
- Iterative Expansion;
89.Energy Efficient Scheduling and Routing via Randomized Rounding

机译：通过随机舍入的节能调度和路由
- 作者：Evripidis Bampis;Alexander Kononov;Dimitrios Letsios;Giorgio Lucarelli;Maxim Sviridenko
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- randomized rounding;
- scheduling;
- approximation;
- energy-aware;
- configuration linear program;
90.Clustering With Center Constraints

机译：聚类与中心约束
- 作者：Parinya Chalermsook;Suresh Venkatasubramanian
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Clustering;
- vertex cover;
- approximation algorithms;
91.Partially Polynomial Kernels for Set Cover and Test Cover

机译：用于设定盖板和测试盖的部分多项式核
- 作者：Manu Basavaraju;Mathew C. Francis;M.S. Ramanujan;Saket Saurabh
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Set Cover;
- Test Cover;
- Kernelization;
- Parameterized Algorithms;
92.Polynomial Kernels for λ-extendible Properties Parameterized Above the Poljak-Turzik Bound

机译：用于λ-伸展属性的多项式内核，参数化Poljak-turzik绑定
- 作者：Robert Crowston;Mark Jones;Gabriele Muciaccia;Geevarghese Philip;Ashutosh Rai;Saket Saurabh
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Kernelization;
- Lambda Extension;
- Above-Guarantee Parameterization;
- MaxCut;
93.Knapsack Cover Subject to a Matroid Constraint

机译：背包覆盖受MATROID约束
- 作者：Venkatesan T. Chakaravarthy;Anamitra Roy Choudhury;Sivaramakrishnan R. Natarajan;Sambuddha Roy
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Approximation Algorithms;
- LP rounding;
- Matroid Constraints;
- Knapsack problems;
94.Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs

机译：针对定向图的锚定k核心问题的参数化复杂性
- 作者：Rajesh Chitnis;Fedor V. Fomin;Petr A. Golovach
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Parameterized complexity;
- directed graphs;
- anchored k-core;
95.On Improved Degree Lower Bounds for Polynomial Approximation

机译：关于多项式近似的改进程度下限
- 作者：Srikanth Srinivasan
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Polynomials;
- Approximation;
- Compression;
- Circuit lower bounds;
96.Model Checking and Functional Program Transformations

机译：模型检查和功能计划转换
- 作者：Axel Haddad
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Higher-order recursion schemes;
- Model checking;
- Tree automata;
97.On the Parameterised Complexity of String Morphism Problems

机译：论弦态源问题的参数化复杂性
- 作者：Henning Fernau;Markus L. Schmid;Yngve Villanger
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- String Problems;
- String Morphisms;
- Parameterised Complexity;
- Exponential Time Hypothesis;
- Pattern Languages;
98.B?hm Trees as Higher-Order Recursive Schemes

机译：B？HM树作为高阶递归方案
- 作者：Pierre Clairambault;Andrzej S. Murawski
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Lambda calculus;
- B?hm trees;
- Recursion Schemes;
99.DLOGTIME Proof Systems

机译：DLOGTIME证明系统
- 作者：Andreas Krebs;Nutan Limaye
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年
- Proof systems;
- DLOGTIME;
- NC~0;
100.The Combinatorics of Non-determinism

机译：非确定性的组合学
- 作者：Olivier Bodini;Antoine Genitrini;Frederic Peschanski
- 会议名称：《International Conference on Foundations of Software Technology and Theoretical Computer Science》 | 2013年