位置：成果数据库 > 会议 > 会议详情页
Tighter relations between sensitivity and other complexity measures
  • 所属机构名称：中国科学院计算技术研究所
  • 会议名称：41st International Colloquium on Automata, Languages, and Programming, ICALP 2014
  • 时间：2014
  • 成果类型：会议
  • 相关项目：理论计算机科学
同会议论文项目
理论计算机科学
期刊论文 17 会议论文 64
同项目会议论文
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
Tight Bounds for Graph Problems in Insertion Streams
Tighter relations between sensitivity and other complexity measures
How to select the top k elements from evolving data?
How to select the top k elements from evolving data?
How to select the top k elements from evolving data?
How to select the top k elements from evolving data?
On the communication complexity of linear algebraic problems in the message passing model
On the communication complexity of linear algebraic problems in the message passing model
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
On the communication complexity of linear algebraic problems in the message passing model
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Computing the Least-Core and Nucleolus for Threshold Cardinality Matching Games
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
Solving multi-choice secretary problem in parallel: An optimal observation-selection protocol
On the communication complexity of linear algebraic problems in the message passing model
Optimal Pricing for Improving Efficiency of Taxi Systems
Optimal Pricing for Improving Efficiency of Taxi Systems
Optimal Pricing for Improving Efficiency of Taxi Systems
Influence Maximization in Dynamic Social Networks
Influence Maximization in Dynamic Social Networks
Space-bounded communication complexity
Determinantal Complexities and Field Extensions
Determinantal Complexities and Field Extensions
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Optimal Pricing for Improving Efficiency of Taxi Systems
Tighter relations between sensitivity and other complexity measures
Space-bounded communication complexity
Space-bounded communication complexity
Space-bounded communication complexity
Learning Market Parameters using Aggregate Demand Queries
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Minimizing seed set selection with probabilistic coverage guarantee in a social network
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Learning Market Parameters using Aggregate Demand Queries
Learning Market Parameters using Aggregate Demand Queries
Learning Market Parameters using Aggregate Demand Queries
Influence Maximization in Dynamic Social Networks
The least-core and nucleolus of path cooperative games
The least-core and nucleolus of path cooperative games
On the power of parity queries in boolean decision trees
On the power of parity queries in boolean decision trees
Multi-classes Feature Engineering with Sliding Window for Purchase Prediction in Mobile Commerce
Determinantal Complexities and Field Extensions
Determinantal Complexities and Field Extensions
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
Influence Maximization in Dynamic Social Networks
Tighter relations between sensitivity and other complexity measures
The least-core and nucleolus of path cooperative games
The least-core and nucleolus of path cooperative games
On the power of parity queries in boolean decision trees
On the power of parity queries in boolean decision trees