理论计算机科学研究中心

A Deterministic Algorithm for Counting Colorings with 2? Colors (Jingcheng Liu)
Robustness and Strategic Concerns in Machine Learning (Yu Cheng)
I/O-Efficient Algorithms for Topological Sort and Related Problems (Nairen Cao)
Online Scheduling of Car-Sharing Requests with Many Cars and Flexible Bookings (Kelin Luo)
PPP-Completeness with Connections to Cryptography (Katerina Sotiraki)
An End-to-end Argument in Mechanism Design (Yiding Feng)
The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users (Ioannis Caragiannis )
Dynamic Spanning Forest: Techniques and Connections to Other Fields (Thatchaphol Saranurak)
Pseudorandom Quantum States and Quantum Money (Zhengfeng Ji)
The Fine-Grained Complexity of Strengthenings of First-Order Logic (Jiawei Gao)
An O(log^2{k}/log log {k})-Approximation Algorithm for Directed Steiner: A Tight Quasi-Polynomial-Time Algorit...
Settling the Sample Complexity of Single-parameter Revenue Maximization (Zhiyi Huang)
Industrial Challenges of Computer Vision in Deep Learning Era (Ning Chen)
A Mathematical Model For Optimal Decisions In A Representative Democracy (Lirong Xia)

每页 14 记录总共 232 记录
第一页 <<上一页下一页>> 尾页
页码 11/17 跳转到