Abstract is missing.
- Hilbert's Tenth Problem for Subrings of ℚ and Number Fields (Extended Abstract)Alexandra Shlapentokh. 3-9 [doi]
- Nondeterministic SeparationsLance Fortnow. 10-17 [doi]
- Quantum and Randomized Query Complexities (Extended Abstract)Miklos Santha. 18-19 [doi]
- Algorithmically Random Functions and Effective CapacitiesDouglas Cenzer, Christopher P. Porter. 23-37 [doi]
- Where Join Preservation Fails in the Bounded Turing Degrees of C.E. SetsNadine Losert. 38-49 [doi]
- Structured Frequency AlgorithmsKaspars Balodis, Janis Iraids, Rusins Freivalds. 50-61 [doi]
- Asymptotic Properties of Combinatory LogicMaciej Bendkowski, Katarzyna Grygiel, Marek Zaionc. 62-72 [doi]
- Some New Consequences of the Hypothesis That P Has Fixed Polynomial-Size CircuitsNing Ding. 75-86 [doi]
- Computational Complexity Studies of Synchronous Boolean Finite Dynamical SystemsMitsunori Ogihara, Kei Uchizawa. 87-98 [doi]
- On the Power of Parity Queries in Boolean Decision TreesRaghav Kulkarni, Youming Qiao, Xiaoming Sun. 99-109 [doi]
- Card-Based Protocols for Any Boolean FunctionTakuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone. 110-121 [doi]
- Size of Sets with Small Sensitivity: A Generalization of Simon's LemmaAndris Ambainis, Jevgenijs Vihrovs. 122-133 [doi]
- Star Shaped Orthogonal DrawingXin He, Dayu He. 137-149 [doi]
- The Domination Number of On-line Social Networks and Random Geometric GraphsAnthony Bonato, Marc Lozier, Dieter Mitsche, Xavier Pérez-Giménez, Pawel Pralat. 150-163 [doi]
- A Linear Time Algorithm for Determining Almost Bipartite GraphsDayu He, Xin He. 164-176 [doi]
- The First-Order Contiguity of Sparse Random Graphs with Prescribed DegreesNans Lefebvre. 177-188 [doi]
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint BallsWanbin Son, Peyman Afshani. 189-199 [doi]
- Multi-player Diffusion Games on Graph ClassesLaurent Bulteau, Vincent Froese, Nimrod Talmon. 200-211 [doi]
- Reconfiguration of Cliques in a GraphTakehiro Ito, Hirotaka Ono, Yota Otachi. 212-223 [doi]
- The Complexity of Finding EffectorsLaurent Bulteau, Stefan Fafianie, Vincent Froese, Rolf Niedermeier, Nimrod Talmon. 224-235 [doi]
- Common Developments of Three Incongruent Boxes of Area 30Dawei Xu, Takashi Horiyama, Toshihiro Shirakawa, Ryuhei Uehara. 236-247 [doi]
- Finding Connected Dense k -SubgraphsXujin Chen, Xiao-Dong Hu, Changjun Wang. 248-259 [doi]
- The Complexity of Degree Anonymization by Graph ContractionsSepp Hartung, Nimrod Talmon. 260-271 [doi]
- An Improved Exact Algorithm for Maximum Induced MatchingMingyu Xiao, Huan Tan. 272-283 [doi]
- Completion of the Mixed Unit Interval Graphs HierarchyAlexandre Talon, Jan Kratochvíl. 284-296 [doi]
- Bounded Treewidth and Space-Efficient Linear AlgebraNikhil Balaji, Samir Datta. 297-308 [doi]
- Quantum Game Players Can Have Advantage Without DiscordZhaohui Wei, Shengyu Zhang. 311-323 [doi]
- Quantum Circuits for the Unitary Permutation ProblemStefano Facchini, Simon Perdrix. 324-331 [doi]
- Algorithms in the Ultra-Wide Word ModelArash Farzan, Alejandro López-Ortiz, Patrick K. Nicholson, Alejandro Salinger. 335-346 [doi]
- Uniformity of Point Samples in Metric Spaces Using Gap RatioArijit Bishnu, Sameer Desai, Arijit Ghosh, Mayank Goswami, Subhabrata Paul. 347-358 [doi]
- On Pure Nash Equilibria in Stochastic GamesAnkush Das, Shankara Narayanan Krishna, Lakshmi Manasa, Ashutosh Trivedi, Dominik Wojtczak. 359-371 [doi]
- Learning from Non-iid Data: Fast Rates for the One-vs-All Multiclass Plug-in ClassifiersVu Dinh, Lam Si Tung Ho, Viet Cuong Nguyen, Duy Nguyen, Binh T. Nguyen. 375-387 [doi]
- Deletion Operations on Deterministic Families of AutomataJoey Eremondi, Oscar H. Ibarra, Ian McQuillan. 388-399 [doi]
- ExplicitPRISMSymm: Symmetry Reduction Technique for Explicit Models in PRISMReema Patel, Kevin Patel, Dhiren Patel. 400-412 [doi]
- Kernelization Algorithms for Packing Problems Allowing OverlapsHenning Fernau, Alejandro López-Ortiz, Jazmín Romero. 415-427 [doi]
- Parameterized Complexity of Asynchronous Border MinimizationRobert Ganian, Martin Kronegger, Andreas Pfandler, Alexandru Popa. 428-440 [doi]
- Parametrized Complexity of Length-Bounded Cuts and Multi-cutsPavel Dvorak, Dusan Knop. 441-452 [doi]
- Algorithms and Hardness for Signed DominationJin-Yong Lin, Sheung-Hung Poon. 453-464 [doi]