Decidability and Complexity of Tree Share Formulas (Englisch)
Freier Zugriff
- Neue Suche nach: Le, Xuan Bach
- Neue Suche nach: Hobor, Aquinas
- Neue Suche nach: Lin, Anthony W.
- Neue Suche nach: Le, Xuan Bach
- Neue Suche nach: Hobor, Aquinas
- Neue Suche nach: Lin, Anthony W.
- Neue Suche nach: Lal, Akash
- Neue Suche nach: Akshay, S.
- Neue Suche nach: Saurabh, Saket
- Neue Suche nach: Sen, Sandeep
In:
LIPIcs, Volume 65, FSTTCS 2016
: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
;
65
;
19:1-19:14
;
2016
-
ISBN:
-
ISSN:
- Aufsatz (Konferenz) / Elektronische Ressource
-
Titel:Decidability and Complexity of Tree Share Formulas
-
Beteiligte:Le, Xuan Bach ( Autor:in ) / Hobor, Aquinas ( Autor:in ) / Lin, Anthony W. ( Autor:in ) / Lal, Akash ( Herausgeber:in ) / Akshay, S. ( Herausgeber:in ) / Saurabh, Saket ( Herausgeber:in ) / Sen, Sandeep ( Herausgeber:in )
-
Erschienen in:LIPIcs, Volume 65, FSTTCS 2016 : 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016) ; 65 ; 19:1-19:14Leibniz International Proceedings in Informatics (LIPIcs) ; 65 ; 19:1-19:14
-
Verlag:
- Neue Suche nach: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
-
Erscheinungsdatum:10.12.2016
-
Format / Umfang:14 pages , 597246 byte
-
Anmerkungen:LIPIcs, Vol. 65, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016), pages 19:1-19:14
-
ISBN:
-
ISSN:
-
DOI:
-
Medientyp:Aufsatz (Konferenz)
-
Format:Elektronische Ressource
-
Sprache:Englisch
-
Schlagwörter:
-
Lizenzbestimmungen:
-
Datenquelle:
Inhaltsverzeichnis Konferenzband
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Fast and Powerful Hashing Using Tabulation (Invited Talk)Thorup, Mikkel et al. | 2016
- 2
-
Simple Invariants for Proving the Safety of Distributed Protocols (Invited Talk)Sagiv, Mooly et al. | 2016
- 3
-
My O Is Bigger Than Yours (Invited Talk)Hermanns, Holger et al. | 2016
- 4
-
Continuous Optimization: The “Right” Language for Graph Algorithms? (Invited Talk)Madry, Aleksander et al. | 2016
- 5
-
Graph Decompositions and Algorithms (Invited Talk)Fomin, Fedor V. et al. | 2016
- 6
-
Side Channel Analysis Using a Model Counting Constraint Solver and Symbolic Execution (Invited Talk)Bultan, Tevfik et al. | 2016
- 7
-
Mixed-Criticality Scheduling to Minimize MakespanBaruah, Sanjoy / Easwaran, Arvind / Guo, Zhishan et al. | 2016
- 8
-
Capacitated k-Center Problem with Vertex WeightsKumar, Aounon et al. | 2016
- 9
-
Improved Pseudo-Polynomial-Time Approximation for Strip PackingGálvez, Waldo / Grandoni, Fabrizio / Ingala, Salvatore / Khan, Arindam et al. | 2016
- 10
-
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1Deshpande, Amit / Harsha, Prahladh / Venkat, Rakesh et al. | 2016
- 11
-
Relational Logic with Framing and HypothesesBanerjee, Anindya / Naumann, David A. / Nikouei, Mohammad et al. | 2016
- 12
-
FO-Definable Transformations of Infinite StringsDave, Vrunda / Krishna, Shankara Narayanan / Trivedi, Ashutosh et al. | 2016
- 13
-
Aperiodicity of Rational Functions Is PSPACE-CompleteFiliot, Emmanuel / Gauwin, Olivier / Lhote, Nathan et al. | 2016
- 14
-
Homomorphism Problems for First-Order Definable StructuresKlin, Bartek / Lasota, Slawomir / Ochremiak, Joanna / Torunczyk, Szymon et al. | 2016
- 15
-
On the Sensitivity Conjecture for Disjunctive Normal FormsS., Karthik C. / Tavenas, Sébastien et al. | 2016
- 16
-
The Zero-Error Randomized Query Complexity of the Pointer FunctionRadhakrishnan, Jaikumar / Sanyal, Swagato et al. | 2016
- 17
-
Robust Multiplication-Based Tests for Reed-Muller CodesHarsha, Prahladh / Srinivasan, Srikanth et al. | 2016
- 18
-
Querying Regular Languages over Sliding WindowsGanardi, Moses / Hucke, Danny / Lohrey, Markus et al. | 2016
- 19
-
Decidability and Complexity of Tree Share FormulasLe, Xuan Bach / Hobor, Aquinas / Lin, Anthony W. et al. | 2016
- 20
-
One-Counter Automata with Counter ObservabilityBollig, Benedikt et al. | 2016
- 21
-
Strong Parameterized Deletion: Bipartite GraphsRai, Ashutosh / Ramanujan, M. S. et al. | 2016
- 22
-
Parameterized Algorithms for List K-CyclePanolan, Fahad / Zehavi, Meirav et al. | 2016
- 23
-
Lossy Kernels for Graph Contraction ProblemsKrithika, R. / Misra, Pranabendu / Rai, Ashutosh / Tale, Prafullkumar et al. | 2016
- 24
-
Faster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite TournamentsKumar, Mithilesh / Lokshtanov, Daniel et al. | 2016
- 25
-
Probabilistic Mu-Calculus: Decidability and Complete AxiomatizationLarsen, Kim G. / Mardare, Radu / Xue, Bingtian et al. | 2016
- 26
-
Interval vs. Point Temporal Logic Model Checking: an Expressiveness ComparisonBozzelli, Laura / Molinari, Alberto / Montanari, Angelo / Peron, Adriano / Sala, Pietro et al. | 2016
- 27
-
Model Checking Population ProtocolsEsparza, Javier / Ganty, Pierre / Leroux, Jérôme / Majumdar, Rupak et al. | 2016
- 28
-
Visibly Linear Dynamic LogicWeinert, Alexander / Zimmermann, Martin et al. | 2016
- 29
-
Stable Matching Games: Manipulation via Subgraph IsomorphismGupta, Sushmita / Roy, Sanjukta et al. | 2016
- 30
-
The Adwords Problem with Strict Capacity ConstraintsBhaskar, Umang / Jalal, Ajil / Vaze, Rahul et al. | 2016
- 31
-
Most Likely Voronoi Diagrams in Higher DimensionsKumar, Nirman / Raichel, Benjamin / Suri, Subhash / Verbeek, Kevin et al. | 2016
- 32
-
Fréchet Distance Between a Line and Avatar Point SetBanik, Aritra / Panolan, Fahad / Raman, Venkatesh / Sahlot, Vibha et al. | 2016
- 33
-
Greed is Good for Deterministic Scale-Free NetworksChauhan, Ankit / Friedrich, Tobias / Rothenberger, Ralf et al. | 2016
- 34
-
Independent-Set Reconfiguration Thresholds of Hereditary Graph Classesde Berg, Mark / Jansen, Bart M. P. / Mukherjee, Debankur et al. | 2016
- 35
-
LZ77 Factorisation of TreesGawrychowski, Pawel / Jez, Artur et al. | 2016
- 36
-
Finger Search in Grammar-Compressed StringsBille, Philip / Christiansen, Anders Roy / Cording, Patrick Hagge / Gortz, Inge Li et al. | 2016
- 37
-
Characterization and Lower Bounds for Branching Program Size Using Projective DimensionDinesh, Krishnamoorthy / Koroth, Sajin / Sarma, Jayalal et al. | 2016
- 38
-
Finer Separations Between Shallow Arithmetic CircuitsKumar, Mrinal / Saptharishi, Ramprasad et al. | 2016
- 39
-
Sum of Products of Read-Once FormulasC., Ramya / Rao, B. V. Raghavendra et al. | 2016
- 40
-
Understanding Cutting Planes for QBFsBeyersdorff, Olaf / Chew, Leroy / Mahajan, Meena / Shukla, Anil et al. | 2016
- 41
-
Summaries for Context-Free GamesHolík, Lukás / Meyer, Roland / Muskalla, Sebastian et al. | 2016
- 42
-
Admissibility in Quantitative Graph GamesBrenguier, Romain / Pérez, Guillermo A. / Raskin, Jean-Francois / Sankur, Ocan et al. | 2016
- 43
-
Prompt DelayKlein, Felix / Zimmermann, Martin et al. | 2016
- 44
-
Mean-Payoff Games on Timed AutomataGuha, Shibashis / Jurdzinski, Marcin / Krishna, Shankara Narayanan / Trivedi, Ashutosh et al. | 2016
- 45
-
The Power and Limitations of Uniform Samples in Testing Properties of FiguresBerman, Piotr / Murzabulatov, Meiram / Raskhodnikova, Sofya et al. | 2016
- 46
-
Local Testing for Membership in LatticesChandrasekaran, Karthekeyan / Cheraghchi, Mahdi / Gandikota, Venkata / Grigorescu, Elena et al. | 2016
- 47
-
Super-Fast MST Algorithms in the Congested Clique Using o(m) MessagesPemmaraju, Sriram V. / Sardeshmukh, Vivek B. et al. | 2016
- 48
-
Why Liveness for Timed Automata Is Hard, and What We Can Do About ItHerbreteau, Frédéric / Srivathsan, B. / Tran, Thanh-Tung / Walukiewicz, Igor et al. | 2016
- 49
-
Verified Analysis of List Update AlgorithmsHaslbeck, Maximilian P. L. / Nipkow, Tobias et al. | 2016
- 50
-
Tunable Online MUS/MSS EnumerationBendík, Jaroslav / Benes, Nikola / Cerná, Ivana / Barnat, Jirí et al. | 2016