default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. TAMC 2007: Shanghai, China
- Jin-yi Cai, S. Barry Cooper, Hong Zhu:
Theory and Applications of Models of Computation, 4th International Conference, TAMC 2007, Shanghai, China, May 22-25, 2007, Proceedings. Lecture Notes in Computer Science 4484, Springer 2007, ISBN 978-3-540-72503-9
Plenary Lectures
- Reid Andersen, Fan R. K. Chung:
Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. 1-12 - Miklós Ajtai:
Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures. 13-33
Contributed Papers
- Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack. 34-45 - Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng:
A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. 46-57 - Haiyang Hou, Guochuan Zhang:
The Hardness of Selective Network Design for Bottleneck Routing Games. 58-66 - Hitoshi Yamasaki, Takayoshi Shoudai:
A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns. 67-78 - Angsheng Li:
Elementary Differences Among Jump Hierarchies. 79-88 - George Barmpalias
, Andrew E. M. Lewis, Mariya Ivanova Soskova:
Working with the LR Degrees. 89-99 - Yatao Xu, Tanja Grubba:
Computability on Subsets of Locally Compact Spaces. 100-114 - Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. 115-127 - Jun Tarui:
Finding a Duplicate and a Missing Item in a Stream. 128-135 - Boting Yang, Yi Cao:
Directed Searching Digraphs: Monotonicity and Complexity. 136-147 - Jin Wang, Xi Bai, Jia Yu, Daxing Li:
Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem. 148-158 - Rongquan Feng, Hongfeng Wu:
Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing. 159-170 - Xiaoming Hu, Shangteng Huang:
A Provably Secure Blind Signature Scheme. 171-180 - Shi-Hui Pei, Yong-Zhe Zhao, Hong-Wei Zhao:
Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2). 181-188 - Fanyu Kong, Jia Yu, Zhun Cai, Daxing Li:
New Left-to-Right Radix- r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems. 189-198 - Mariya Ivanova Soskova, S. Barry Cooper:
The Strongest Nonsplitting Theorem. 199-211 - Yun Fan:
There is an Sw-Cuppable Strongly c.e. Real. 212-221 - Li Pan, Weidong Zhao, Zhicheng Wang, Gang Wei, Shumei Wang:
On Computation Complexity of the Concurrently Enabled Transition Set Problem. 222-233 - A. N. Trahtman:
Synchronization of Some DFA. 234-243 - Sheng-Lung Peng, Yi-Chuan Yang:
On the Treewidth and Pathwidth of Biconvex Bipartite Graphs. 244-255 - Andrzej Lingas, Martin Wahlen:
On Exact Complexity of Subgraph Homeomorphism. 256-261 - Xuehou Tan:
Searching a Polygonal Region by Two Guards. 262-273 - Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang:
On the Internal Steiner Tree Problem. 274-283 - Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao:
Approximately Optimal Trees for Group Key Management with Batch Updates. 284-295 - Qi Cheng, Elizabeth Murray:
On Deciding Deep Holes of Reed-Solomon Codes. 296-305 - Iordanis Kerenidis:
Quantum Multiparty Communication Complexity and Circuit Lower Bounds. 306-317 - Feng Liu, Keqin Feng:
Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions. 318-329 - Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer:
Improving the Average Delay of Sorting. 330-341 - Ehab Morsy, Hiroshi Nagamochi:
Approximating Capacitated Tree-Routings in Networks. 342-353 - Sushmita Gupta:
Feedback Arc Set Problem in Bipartite Tournaments. 354-361 - Yufeng Wang, Yoshiaki Hori, Kouichi Sakurai:
Studying on Economic-Inspired Mechanisms for Routing and Forwarding in Wireless Ad Hoc Network. 362-373 - Jin Yi, Wenhui Zhang:
Enhancing Simulation for Checking Language Containment. 374-385 - Conghua Zhou, Zhenyu Chen, Zhihong Tao:
QBF-Based Symbolic Model Checking for Knowledge and Time. 386-397 - Cristina Tîrnauca, Satoshi Kobayashi:
A Characterization of the Language Classes Learnable with Correction Queries. 398-407 - Zhimin Li, Xiang Li:
Learnable Algorithm on the Continuum. 408-415 - Joseph Wun-Tat Chan, Tak Wah Lam, Kin-Sum Mak, Prudence W. H. Wong:
Online Deadline Scheduling with Bounded Energy Efficiency. 416-427 - Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno:
Efficient Algorithms for Airline Problem. 428-439 - Yong Li, Jun-Hai Yong:
Efficient Exact Arithmetic over Constructive Reals. 440-449 - M. V. Panduranga Rao:
Bounding Run-Times of Local Adiabatic Algorithms. 450-461 - Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on Universal Composable Zero Knowledge in Common Reference String Model. 462-473 - Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao:
A Note on the Feasibility of Generalized Universal Composability. 474-485 - Markus Hinkelmann, Andreas Jakoby, Peer Stechert:
t -Private and Secure Auctions. 486-498 - Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone:
Secure Multiparty Computations Using a Dial Lock. 499-510 - Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai:
A Time Hierarchy Theorem for Nondeterministic Cellular Automata. 511-520 - Zhenhua Duan, Cong Tian:
Decidability of Propositional Projection Temporal Logic with Infinite Models. 521-532 - Hong Seo Ryoo, Kwangsoo Kim:
Separation of Data Via Concurrently Determined Discriminant Functions. 533-541 - Stuart A. Kurtz, Janos Simon:
The Undecidability of the Generalized Collatz Problem. 542-553 - Yingchao Zhao, Shang-Hua Teng:
Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. 554-565 - Mingji Xia:
Maximum Edge-Disjoint Paths Problem in Planar Graphs. 566-572 - Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu:
An Efficient Algorithm for Generating Colored Outerplanar Graphs. 573-583 - Akifumi Kawaguchi, Hiroshi Nagamochi:
Orthogonal Drawings for Plane Graphs with Specified Face Areas. 584-594 - Decheng Ding, Klaus Weihrauch, Yongcheng Wu:
Absolutely Non-effective Predicates and Functions in Computable Analysis. 595-604 - Hiroki Morizumi, Jun Tarui:
Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences. 605-615 - Qingshun Zhang, Daoyun Xu:
The Existence of Unsatisfiable Formulas in k-LCNF for k>=3. 616-623 - Xin Li, Tian Liu, Han Peng, Liyan Qian, Hongtao Sun, Jin Xu, Ke Xu, Jiaqi Zhu:
Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model. 624-631 - Giordano Fusco, Eric Bach:
Phase Transition of Multivariate Polynomial Systems. 632-645 - Wangsen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang:
Approximation Algorithms for Maximum Edge Coloring Problem. 646-658 - He Sun, Chung Keung Poon:
Two Improved Range-Efficient Algorithms for F 0 Estimation. 659-669 - Wenbo Zhao, Peng Zhang:
Approximation to the Minimum Rooted Star Cover Problem. 670-679 - Michael Dom, Jiong Guo, Rolf Niedermeier:
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. 680-691 - Yunlong Liu, Jianer Chen, Jianxin Wang:
Parameterized Algorithms for Weighted Matching and Packing Problems. 692-702 - Marc Thurley:
Kernelizations for Parameterized Counting Problems. 703-714 - Xingwu Liu, Zhiwei Xu, Juhua Pu:
Revisiting the Impossibility for Boosting Service Resilience. 715-727 - Peng Zhang:
An Approximation Algorithm to the k -Steiner Forest Problem. 728-737 - Indranil Saha, Debapriyay Mukhopadhyay:
A Distributed Algorithm of Fault Recovery for Stateful Failover. 738-749 - Sun-Yuan Hsieh:
Path Embedding on Folded Hypercubes. 750-759 - Jianxin Wang, Xiaoshuang Xu, Jianer Chen:
An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. 760-769
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
