default search action
15th TAMC 2019: Kitakyushu, Japan
- T. V. Gopal, Junzo Watada:
Theory and Applications of Models of Computation - 15th Annual Conference, TAMC 2019, Kitakyushu, Japan, April 13-16, 2019, Proceedings. Lecture Notes in Computer Science 11436, Springer 2019, ISBN 978-3-030-14811-9 - Aakash Agrawal, Krunal Shah, Amit Kumar, Ranveer Chandra:
Battery Scheduling Problem. 1-12 - Ei Ando
, Shoichi Tsuchiya
The Volume of a Crosspolytope Truncated by a Halfspace. 13-27 - Nikolay Bazhenov
Computable Isomorphisms of Distributive Lattices. 28-41 - Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda, Naoki Katoh:
Minmax-Regret Evacuation Planning for Cycle Networks. 42-58 - Achilles A. Beros, Bjørn Kjos-Hanssen
Planar Digraphs for Automatic Complexity. 59-73 - Anthony Bonato, Shahin Kamali:
Approximation Algorithms for Graph Burning. 74-92 - Thach V. Bui, Minoru Kuribayashi
Sublinear Decoding Schemes for Non-adaptive Group Testing with Inhibitors. 93-113 - Shantanu Das, Giuseppe Antonio Di Luna, Linda Pagli, Giuseppe Prencipe
Compacting and Grouping Mobile Agents on Dynamic Rings. 114-133 - Amit Kumar Dhar, Raghunath Reddy Madireddy, Supantha Pandit, Jagpreet Singh:
Maximum Independent and Disjoint Coverage. 134-153 - Liviu P. Dinu, Bogdan Dumitru, Alexandru Popa
Algorithms for Closest and Farthest String Problems via Rank Distance. 154-171 - Amin Farjudian
Computable Analysis of Linear Rearrangement Optimization. 172-187 - Szilárd Zsolt Fazekas
On the Power of Oritatami Cotranscriptional Folding with Unary Bead Sequence. 188-207 - Tomoki Fukuba, Takayuki Shiina, Ken-ichi Tokoro
Stochastic Programming for Energy Plant Operation. 208-221 - Tomas Gavenciak
Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts. 222-241 - Guillaume Fertin
Unshuffling Permutations: Trivial Bijections and Compositions. 242-261 - Åsa Hirvonen
Continuous Team Semantics. 262-278 - Gordon Hoi, Sanjay Jain
Exact Satisfiabitity with Jokers. 279-294 - Martin Hora, Václav Koncický, Jakub Tetek
Theoretical Model of Computation and Algorithms for FPGA-Based Hardware Accelerators. 295-312 - Peihuang Huang, Wenxing Zhu, Longkun Guo:
On the Complexity of and Algorithms for Min-Max Target Coverage On a Line Boundary. 313-324 - Vinay A. Jawgal, V. N. Muralidhara, P. S. Srinivasan:
Online Travelling Salesman Problem on a Circle. 325-336 - Akitoshi Kawamura, Florian Steinberg, Holger Thies
Second-Order Linear-Time Computability with Applications to Computable Analysis. 337-358 - Astrid Kiehn, Mohnish Pattathurajan:
Consistency as a Branching Time Notion. 359-377 - Takayuki Kihara
Finite Choice, Convex Choice and Sorting. 378-393 - Bjørn Kjos-Hanssen, Lei Liu:
The Number of Languages with Maximum State Complexity. 394-409 - Harry Lang, Cenk Baykal, Najib Abu Samra, Tony Tannous, Dan Feldman, Daniela Rus:
Deterministic Coresets for Stochastic Matrices with Applications to Scalable Sparse PageRank. 410-423 - Vanel A. Lazcano
GPU Based Horn-Schunck Method to Estimate Optical Flow and Occlusion. 424-437 - Pei-Chun Lin
Robot Computing for Music Visualization. 438-447 - Manasi S. Kulkarni
Combinatorial Properties of Fibonacci Arrays. 448-466 - Kalpana Mahalingam
Watson-Crick Jumping Finite Automata. 467-480 - Anisur Rahaman Molla
Dispersion of Mobile Robots: The Power of Randomness. 481-500 - Thieu Nguyen
Building Resource Auto-scaler with Functional-Link Neural Network and Adaptive Bacterial Foraging Optimization. 501-517 - Petra Mutzel
On the Enumeration of Bicriteria Temporal Paths. 518-535 - Alexandru Popa
An Output-Sensitive Algorithm for the Minimization of 2-Dimensional String Covers. 536-549 - Sho Shimamura, Kouichi Hirata
Introducing Fluctuation into Increasing Order of Symmetric Uncertainty for Consistency-Based Feature Selection. 550-565 - Kazumasa Shinagawa:
Card-Based Cryptography with Invisible Ink. 566-577 - K. Subramani, Piotr Wojciechowski:
Read-Once Certification of Linear Infeasibility in UTVPI Constraints. 578-593 - Kenjiro Takazawa
Generalizations of Weighted Matroid Congestion Games: Pure Nash Equilibrium, Sensitivity Analysis, and Discrete Convex Function. 594-614 - Ronny Tredup, Christian Rosenke:
The Complexity of Synthesis for 43 Boolean Petri Net Types. 615-634 - Paritosh Verma:
Space Lower Bounds for Graph Stream Problems. 635-646 - Guohua Wu, Huishan Wu:
Bounded Jump and the High/Low Hierarchy. 647-658 - Tomoyuki Yamakami:
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P. 659-673 - Yuji Yoshida, Satoru Kumamoto:
Dynamic Average Value-at-Risk Allocation on Worst Scenarios in Asset Management. 674-683 - Shufang Zhu
First-Order vs. Second-Order Encodings for \textsc ltl_f -to-Automata Translation. 684-705
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: