default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12. TAMC 2015: Singapore
- Rahul Jain
, Sanjay Jain, Frank Stephan:
Theory and Applications of Models of Computation - 12th Annual Conference, TAMC 2015, Singapore, May 18-20, 2015, Proceedings. Lecture Notes in Computer Science 9076, Springer 2015, ISBN 978-3-319-17141-8
Invited Papers
- Alexandra Shlapentokh:
Hilbert's Tenth Problem for Subrings of ℚ and Number Fields (Extended Abstract). 3-9 - Lance Fortnow:
Nondeterministic Separations. 10-17 - Miklos Santha:
Quantum and Randomized Query Complexities (Extended Abstract). 18-19
Recursion Theory and Mathematical Logic
- Douglas Cenzer, Christopher P. Porter:
Algorithmically Random Functions and Effective Capacities. 23-37 - Nadine Losert:
Where Join Preservation Fails in the Bounded Turing Degrees of C.E. Sets. 38-49 - Kaspars Balodis, Janis Iraids, Rusins Freivalds:
Structured Frequency Algorithms. 50-61 - Maciej Bendkowski, Katarzyna Grygiel, Marek Zaionc:
Asymptotic Properties of Combinatory Logic. 62-72
Computational Complexity and Boolean Functions
- Ning Ding:
Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size Circuits. 75-86 - Mitsunori Ogihara, Kei Uchizawa:
Computational Complexity Studies of Synchronous Boolean Finite Dynamical Systems. 87-98 - Raghav Kulkarni, Youming Qiao, Xiaoming Sun:
On the Power of Parity Queries in Boolean Decision Trees. 99-109 - Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone:
Card-Based Protocols for Any Boolean Function. 110-121 - Andris Ambainis, Jevgenijs Vihrovs:
Size of Sets with Small Sensitivity: A Generalization of Simon's Lemma. 122-133
Graph Theory
- Xin He, Dayu He:
Star Shaped Orthogonal Drawing. 137-149 - Anthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat:
The Domination Number of On-line Social Networks and Random Geometric Graphs. 150-163 - Dayu He, Xin He:
A Linear Time Algorithm for Determining Almost Bipartite Graphs. 164-176 - Nans Lefebvre:
The First-Order Contiguity of Sparse Random Graphs with Prescribed Degrees. 177-188 - Wanbin Son, Peyman Afshani:
Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls. 189-199 - Laurent Bulteau, Vincent Froese, Nimrod Talmon:
Multi-player Diffusion Games on Graph Classes. 200-211 - Takehiro Ito, Hirotaka Ono, Yota Otachi:
Reconfiguration of Cliques in a Graph. 212-223 - Laurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon:
The Complexity of Finding Effectors. 224-235 - Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara:
Common Developments of Three Incongruent Boxes of Area 30. 236-247 - Xujin Chen, Xiao-Dong Hu, Changjun Wang:
Finding Connected Dense k -Subgraphs. 248-259 - Sepp Hartung, Nimrod Talmon:
The Complexity of Degree Anonymization by Graph Contractions. 260-271 - Mingyu Xiao, Huan Tan:
An Improved Exact Algorithm for Maximum Induced Matching. 272-283 - Alexandre Talon, Jan Kratochvíl:
Completion of the Mixed Unit Interval Graphs Hierarchy. 284-296 - Nikhil Balaji, Samir Datta:
Bounded Treewidth and Space-Efficient Linear Algebra. 297-308
Quantum Computing
- Zhaohui Wei, Shengyu Zhang:
Quantum Game Players Can Have Advantage Without Discord. 311-323 - Stefano Facchini, Simon Perdrix:
Quantum Circuits for the Unitary Permutation Problem. 324-331
Parallelism and Statistics
- Arash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger:
Algorithms in the Ultra-Wide Word Model. 335-346 - Arijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul:
Uniformity of Point Samples in Metric Spaces Using Gap Ratio. 347-358 - Ankush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak:
On Pure Nash Equilibria in Stochastic Games. 359-371
Learning, Automata and Probabilistic Models
- Vu C. Dinh, Lam Si Tung Ho, Viet Cuong Nguyen, Duy M. H. Nguyen, Binh T. Nguyen:
Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in Classifiers. 375-387 - Joey Eremondi, Oscar H. Ibarra, Ian McQuillan:
Deletion Operations on Deterministic Families of Automata. 388-399 - Reema Patel, Kevin Patel, Dhiren R. Patel:
ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISM. 400-412
Parameterised Complexity
- Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. 415-427 - Robert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa:
Parameterized Complexity of Asynchronous Border Minimization. 428-440 - Pavel Dvorak, Dusan Knop:
Parametrized Complexity of Length-Bounded Cuts and Multi-cuts. 441-452 - Jin-Yong Lin, Sheung-Hung Poon:
Algorithms and Hardness for Signed Domination. 453-464
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-21 20:21 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:
