default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID11. TAMC 2014: Chennai, India
- T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8402, Springer 2014, ISBN 978-3-319-06088-0
Contributed Papers
- T. V. Gopal
, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
A Roadmap for TAMC. 1-6 - Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A Tight Lower Bound Instance for k-means++ in Constant Dimension. 7-22 - Bala Ravikumar, Duncan Innes:
An Improved Upper-Bound for Rivest et al.'s Half-Lie Problem. 23-38 - Biswanath Sethi, Nazim Fatès, Sukanta Das:
Reversibility of Elementary Cellular Automata under Fully Asynchronous Update. 39-49 - Cristian S. Calude, Ludwig Staiger, Frank Stephan:
Finite State Incompressible Infinite Sequences. 50-66 - David Auger, Pierre Coucheney, Yann Strozecki:
Finding Optimal Strategies of Almost Acyclic Simple Stochastic Games. 67-85 - David Cattanéo, Simon Perdrix:
The Parameterized Complexity of Domination-Type Problems and Application to Linear Codes. 86-103 - Ievgen Ivanov:
On Representations of Abstract Systems with Partial Inputs and Outputs. 104-123 - Jean-Yves Marion, Romain Péchoux:
Complexity Information Flow in a Multi-threaded Imperative Language. 124-140 - Jia Jiao, Peng Liu, Xianxian Li:
A Personalized Privacy Preserving Method for Publishing Social Network Data. 141-157 - Jingchao Chen:
A Bit-Encoding Phase Selection Strategy for Satisfiability Solvers. 158-167 - Klaus Meer, Ameen Naif:
Generalized Finite Automata over Real and Complex Numbers. 168-187 - Manoj K. Raut:
An Incremental Algorithm for Computing Prime Implicates in Modal Logic. 188-202 - Marc Goerigk, Yogish Sabharwal, Anita Schöbel, Sandeep Sen:
Approximation Algorithms for the Weight-Reducible Knapsack Problem. 203-215 - Matsuo Konagaya, Yota Otachi, Ryuhei Uehara:
Polynomial-Time Algorithms for Subgraph Isomorphism in Small Graph Classes of Perfect Graphs. 216-228 - Michael François, David Defour, Pascal Berthomé:
A Pseudo-Random Bit Generator Based on Three Chaotic Logistic Maps and IEEE 754-2008 Floating-Point Arithmetic. 229-247 - Min Lu, Tian Liu, Weitian Tong, Guohui Lin, Ke Xu:
Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. 248-258 - Peng Zhang:
Efficient Algorithms for the Label Cut Problems. 259-270 - Rajiv Veeraraghavan, Rakesh Kashyap, Archita Chopde, Swapan Bhattacharya:
A Dynamic Approach to Frequent Flyer Program. 271-279 - Romain Péchoux, Thanh Dinh Ta:
A Categorical Treatment of Malicious Behavioral Obfuscation. 280-299 - Samir Datta, Raghav Kulkarni:
Space Complexity of Optimization Problems in Planar Graphs. 300-311 - Shibsankar Das, Kalpesh Kapoor:
Fine-Tuning Decomposition Theorem for Maximum Weight Bipartite Matching. 312-322 - Steven Chaplick, Pavol Hell, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara:
Intersection Dimension of Bipartite Graphs. 323-340 - Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. 341-351 - Venkata Padmavati Metta, Alica Kelemenová:
Universality of Spiking Neural P Systems with Anti-spikes. 352-365 - Yihua Ding, James Z. Wang, Pradip K. Srimani:
Self-stabilizing Minimal Global Offensive Alliance Algorithm with Safe Convergence in an Arbitrary Graph. 366-377 - Yuan Tian, Rongxin Sun, Xueyong Zhu:
A Local-Global Approach to Solving Ideal Lattice Problems. 378-400 - Yuan Tian, Xueyong Zhu, Rongxin Sun:
Modular Form Approach to Solving Lattice Problems. 401-421
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 2024-11-06 20:16 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:
