The SCEAS System
Navigation Menu

Conferences in DBLP

(tamc)
2007 (conf/tamc/2007)

  1. Reid Andersen, Fan Chung
    Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:1-12 [Conf]
  2. Miklós Ajtai
    Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:13-33 [Conf]
  3. Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas
    Approximation Algorithms for 3D Orthogonal Knapsack. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:34-45 [Conf]
  4. Bing Yang, Jing Chen, Enyue Lu, S. Q. Zheng
    A Comparative Study of Efficient Algorithms for Partitioning a Sequence into Monotone Subsequences. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:46-57 [Conf]
  5. Haiyang Hou, Guochuan Zhang
    The Hardness of Selective Network Design for Bottleneck Routing Games. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:58-66 [Conf]
  6. Hitoshi Yamasaki, Takayoshi Shoudai
    A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:67-78 [Conf]
  7. Angsheng Li
    Elementary Differences Among Jump Hierarchies. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:79-88 [Conf]
  8. George Barmpalias, Andrew E. M. Lewis, Mariya Ivanova Soskova
    Working with the LR Degrees. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:89-99 [Conf]
  9. Yatao Xu, Tanja Grubba
    Computability on Subsets of Locally Compact Spaces. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:100-114 [Conf]
  10. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    A New Approach to Graph Recognition and Applications to Distance-Hereditary Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:115-127 [Conf]
  11. Jun Tarui
    Finding a Duplicate and a Missing Item in a Stream. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:128-135 [Conf]
  12. Boting Yang, Yi Cao
    Directed Searching Digraphs: Monotonicity and Complexity. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:136-147 [Conf]
  13. Jin Wang, Xi Bai, Jia Yu, Daxing Li
    Protecting Against Key Escrow and Key Exposure in Identity-Based Cryptosystem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:148-158 [Conf]
  14. Rongquan Feng, Hongfeng Wu
    Encapsulated Scalar Multiplications and Line Functions in the Computation of Tate Pairing. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:159-170 [Conf]
  15. Xiaoming Hu, Shangteng Huang
    A Provably Secure Blind Signature Scheme. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:171-180 [Conf]
  16. Pei Shi-Hui, Zhao Yong-Zhe, Zhao Hong-Wei
    Construct Public Key Encryption Scheme Using Ergodic Matrices over GF(2). [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:181-188 [Conf]
  17. Fanyu Kong, Jia Yu, Zhun Cai, Daxing Li
    New Left-to-Right Radix- r Signed-Digit Recoding Algorithm for Pairing-Based Cryptosystems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:189-198 [Conf]
  18. Mariya Ivanova Soskova, S. Barry Cooper
    The Strongest Nonsplitting Theorem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:199-211 [Conf]
  19. Yun Fan
    There is an Sw-Cuppable Strongly c.e. Real. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:212-221 [Conf]
  20. Li Pan, Weidong Zhao, Zhicheng Wang, Gang Wei, Shumei Wang
    On Computation Complexity of the Concurrently Enabled Transition Set Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:222-233 [Conf]
  21. A. N. Trahtman
    Synchronization of Some DFA. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:234-243 [Conf]
  22. Sheng-Lung Peng, Yi-Chuan Yang
    On the Treewidth and Pathwidth of Biconvex Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:244-255 [Conf]
  23. Andrzej Lingas, Martin Wahlen
    On Exact Complexity of Subgraph Homeomorphism. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:256-261 [Conf]
  24. Xuehou Tan
    Searching a Polygonal Region by Two Guards. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:262-273 [Conf]
  25. Sun-Yuan Hsieh, Huang-Ming Gao, Shih-Cheng Yang
    On the Internal Steiner Tree Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:274-283 [Conf]
  26. Minming Li, Ze Feng, Ronald L. Graham, Frances F. Yao
    Approximately Optimal Trees for Group Key Management with Batch Updates. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:284-295 [Conf]
  27. Qi Cheng, Elizabeth Murray
    On Deciding Deep Holes of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:296-305 [Conf]
  28. Iordanis Kerenidis
    Quantum Multiparty Communication Complexity and Circuit Lower Bounds. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:306-317 [Conf]
  29. Feng Liu, Keqin Feng
    Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:318-329 [Conf]
  30. Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk, Christian Schindelhauer
    Improving the Average Delay of Sorting. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:330-341 [Conf]
  31. Ehab Morsy, Hiroshi Nagamochi
    Approximating Capacitated Tree-Routings in Networks. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:342-353 [Conf]
  32. Sushmita Gupta
    Feedback Arc Set Problem in Bipartite Tournaments. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:354-361 [Conf]
  33. Jin Yi, Wenhui Zhang
    Enhancing Simulation for Checking Language Containment. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:374-385 [Conf]
  34. Conghua Zhou, Zhenyu Chen, Zhihong Tao
    QBF-Based Symbolic Model Checking for Knowledge and Time. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:386-397 [Conf]
  35. Cristina Tîrnauca, Satoshi Kobayashi
    A Characterization of the Language Classes Learnable with Correction Queries. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:398-407 [Conf]
  36. Zhimin Li, Xiang Li
    Learnable Algorithm on the Continuum. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:408-415 [Conf]
  37. Joseph Wun-Tat Chan, Tak Wah Lam, Kin-Sum Mak, Prudence W. H. Wong
    Online Deadline Scheduling with Bounded Energy Efficiency. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:416-427 [Conf]
  38. Shin-Ichi Nakano, Ryuhei Uehara, Takeaki Uno
    Efficient Algorithms for Airline Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:428-439 [Conf]
  39. Yong Li, Jun-Hai Yong
    Efficient Exact Arithmetic over Constructive Reals. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:440-449 [Conf]
  40. M. V. Panduranga Rao
    Bounding Run-Times of Local Adiabatic Algorithms. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:450-461 [Conf]
  41. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
    A Note on Universal Composable Zero Knowledge in Common Reference String Model. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:462-473 [Conf]
  42. Andrew Chi-Chih Yao, Frances F. Yao, Yunlei Zhao
    A Note on the Feasibility of Generalized Universal Composability. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:474-485 [Conf]
  43. Markus Hinkelmann, Andreas Jakoby, Peer Stechert
    t -Private and Secure Auctions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:486-498 [Conf]
  44. Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone
    Secure Multiparty Computations Using a Dial Lock. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:499-510 [Conf]
  45. Chuzo Iwamoto, Harumasa Yoneda, Kenichi Morita, Katsunobu Imai
    A Time Hierarchy Theorem for Nondeterministic Cellular Automata. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:511-520 [Conf]
  46. Zhenhua Duan, Cong Tian
    Decidability of Propositional Projection Temporal Logic with Infinite Models. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:521-532 [Conf]
  47. Hong Seo Ryoo, Kwangsoo Kim
    Separation of Data Via Concurrently Determined Discriminant Functions. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:533-541 [Conf]
  48. Stuart A. Kurtz, Janos Simon
    The Undecidability of the Generalized Collatz Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:542-553 [Conf]
  49. Yingchao Zhao, Shang-Hua Teng
    Combinatorial and Spectral Aspects of Nearest Neighbor Graphs in Doubling Dimensional and Nearly-Euclidean Spaces. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:554-565 [Conf]
  50. Mingji Xia
    Maximum Edge-Disjoint Paths Problem in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:566-572 [Conf]
  51. Jiexun Wang, Liang Zhao, Hiroshi Nagamochi, Tatsuya Akutsu
    An Efficient Algorithm for Generating Colored Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:573-583 [Conf]
  52. Akifumi Kawaguchi, Hiroshi Nagamochi
    Orthogonal Drawings for Plane Graphs with Specified Face Areas. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:584-594 [Conf]
  53. Decheng Ding, Klaus Weihrauch, Yongcheng Wu
    Absolutely Non-effective Predicates and Functions in Computable Analysis. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:595-604 [Conf]
  54. Hiroki Morizumi, Jun Tarui
    Linear-Size Log-Depth Negation-Limited Inverter for k -Tonic Binary Sequences. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:605-615 [Conf]
  55. Qingshun Zhang, Daoyun Xu
    The Existence of Unsatisfiable Formulas in k-LCNF for k>=3. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:616-623 [Conf]
  56. 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. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:624-631 [Conf]
  57. Giordano Fusco, Eric Bach
    Phase Transition of Multivariate Polynomial Systems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:632-645 [Conf]
  58. WangSen Feng, Li'ang Zhang, Wanling Qu, Hanpin Wang
    Approximation Algorithms for Maximum Edge Coloring Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:646-658 [Conf]
  59. He Sun, Chung Keung Poon
    Two Improved Range-Efficient Algorithms for F 0 Estimation. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:659-669 [Conf]
  60. Wenbo Zhao, Peng Zhang
    Approximation to the Minimum Rooted Star Cover Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:670-679 [Conf]
  61. Michael Dom, Jiong Guo, Rolf Niedermeier
    Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:680-691 [Conf]
  62. Yunlong Liu, Jianer Chen, Jianxin Wang
    Parameterized Algorithms for Weighted Matching and Packing Problems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:692-702 [Conf]
  63. Marc Thurley
    Kernelizations for Parameterized Counting Problems. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:703-714 [Conf]
  64. Xingwu Liu, Zhiwei Xu, Juhua Pu
    Revisiting the Impossibility for Boosting Service Resilience. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:715-727 [Conf]
  65. Peng Zhang
    An Approximation Algorithm to the k -Steiner Forest Problem. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:728-737 [Conf]
  66. Indranil Saha, Debapriyay Mukhopadhyay
    A Distributed Algorithm of Fault Recovery for Stateful Failover. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:738-749 [Conf]
  67. Sun-Yuan Hsieh
    Path Embedding on Folded Hypercubes. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:750-759 [Conf]
  68. Jianxin Wang, Xiaoshuang Xu, Jianer Chen
    An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    TAMC, 2007, pp:760-769 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002