Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
97 | Juris Hartmanis, Theodore P. Baker |
Relative Succinctness of Representations of Languages and Separation of Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1979, Proceedings, 8th Symposium, Olomouc, Czechoslovakia, September 3-7, 1979, pp. 70-88, 1979, Springer, 0-387-09526-8. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
88 | Tirza Hirst, David Harel |
On the Power of Bounded Concurrency II: Pushdown Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(3), pp. 540-554, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
cooperative concurrency, pushdown automata, succinctness |
82 | Martin Grohe, Nicole Schweikardt |
The Succinctness of First-Order Logic on Linear Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 14-17 July 2004, Turku, Finland, Proceedings, pp. 438-447, 2004, IEEE Computer Society, 0-7695-2192-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
73 | Doron Drusinsky, David Harel |
On the Power of Bounded Concurrency I: Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(3), pp. 517-539, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
bounded cooperative concurrency, statecharts, finite automata, nondeterminism, alternation, succinctness, omega-automata |
67 | Benjamin Aminof, Orna Kupferman |
On the Succinctness of Nondeterminism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis, 4th International Symposium, ATVA 2006, Beijing, China, October 23-26, 2006., pp. 125-140, 2006, Springer, 3-540-47237-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Wouter Gelade |
Succinctness of Regular Expressions with Interleaving, Intersection and Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 363-374, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Laura Bozzelli, Ruggero Lanotte |
Complexity and Succinctness Issues for Linear-Time Hybrid Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence, 11th European Conference, JELIA 2008, Dresden, Germany, September 28 - October 1, 2008. Proceedings, pp. 48-61, 2008, Springer, 978-3-540-87802-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
52 | Martin Grohe, Nicole Schweikardt |
Comparing the Succinctness of Monadic Query Languages over Finite Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings, pp. 226-240, 2003, Springer, 3-540-40801-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
43 | Guozhu Dong, Chunyu Jiang, Jian Pei, Jinyan Li 0001, Limsoon Wong |
Mining Succinct Systems of Minimal Generators of Formal Concepts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DASFAA ![In: Database Systems for Advanced Applications, 10th International Conference, DASFAA 2005, Beijing, China, April 17-20, 2005, Proceedings, pp. 175-187, 2005, Springer, 3-540-25334-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
formal concepts, closed itemsets, succinctness, Minimal generators |
43 | Carson Kai-Sang Leung, Laks V. S. Lakshmanan, Raymond T. Ng |
Exploiting succinct constraints using FP-trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGKDD Explor. ![In: SIGKDD Explor. 4(1), pp. 40-49, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
data mining, constraints, FP-trees, frequent sets, succinctness |
37 | Wouter Gelade, Frank Neven |
Succinctness of Pattern-Based Schema Languages for XML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DBPL ![In: Database Programming Languages, 11th International Symposium, DBPL 2007, Vienna, Austria, September 23-24, 2007, Revised Selected Papers, pp. 201-215, 2007, Springer, 978-3-540-75986-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Carsten Lutz |
Complexity and succinctness of public announcement logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), Hakodate, Japan, May 8-12, 2006, pp. 137-143, 2006, ACM, 1-59593-303-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
public announcement, computational complexity, dynamic epistemic logic, logics for agent systems |
37 | Oscar H. Ibarra, Bala Ravikumar |
Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Seventh Conference, Pune, India, December 17-19, 1987, Proceedings, pp. 26-43, 1987, Springer, 3-540-18625-5. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
|
30 | Micah Adler, Neil Immerman |
An n! lower bound on formula size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 4(3), pp. 296-314, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
lower bounds, temporal logic, Descriptive complexity |
30 | Raymond T. Ng, Laks V. S. Lakshmanan, Jiawei Han 0001, Alex Pang |
Exploratory Mining and Pruning Optimizations of Constrained Association Rules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA., pp. 13-24, 1998, ACM Press, 0-89791-995-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
30 | Noa Globerman, David Harel |
Complexity Results for Multi-Pebble Automata and their Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings, pp. 73-82, 1994, Springer, 3-540-58201-0. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
30 | Juris Hartmanis |
On the Succintness of Different Representations of Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 282-288, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
1979 |
DBLP DOI BibTeX RDF |
|
27 | Georg Gottlob, Christoph Koch 0001, Klaus U. Schulz |
Conjunctive queries over trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 53(2), pp. 238-272, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
XML, Complexity, trees, expressiveness, conjunctive queries, succinctness |
27 | Carson Kai-Sang Leung |
Interactive Constrained Frequent-Pattern Mining System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDEAS ![In: 8th International Database Engineering and Applications Symposium (IDEAS 2004), 7-9 July 2004, Coimbra, Portugal, pp. 49-58, 2004, IEEE Computer Society, 0-7695-2168-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Data mining and knowledge discovery, constraint changes, constraints, interactive system, FP-trees, frequent sets, succinctness |
22 | Luca Geatti, Alessio Mansutti, Angelo Montanari |
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.09860, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Luca Geatti, Alessio Mansutti, Angelo Montanari |
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoSSaCS (2) ![In: Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6-11, 2024, Proceedings, Part II, pp. 95-115, 2024, Springer, 978-3-031-57230-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
22 | Daxin Liu 0002, Vaishak Belle |
Progression with Probabilities in the Situation Calculus: Representation and Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024, Auckland, New Zealand, May 6-10, 2024, pp. 1210-1218, 2024, ACM. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
22 | Sven Schewe, Qiyi Tang 0001 |
On the Succinctness of Good-for-MDPs Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.11483, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Frank Y. C. Lu |
Input Transformation Based Efficient Zero-Knowledge Argument System for Arbitrary Circuits with Practical Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2023, pp. 164, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
22 | Huili Xing |
On the Succinctness of Modal μ-Calculus Based on Covariant-Contravariant Refinement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Eng. Knowl. Eng. ![In: Int. J. Softw. Eng. Knowl. Eng. 33(4), pp. 513-542, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Aayush Jain, Huijia Lin, Ji Luo 0002 |
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (3) ![In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part III, pp. 479-510, 2023, Springer, 978-3-031-30619-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Pietro Galliani, Oliver Kutz, Nicolas Troquard |
Succinctness and Complexity of ALC with Counting Perceptrons. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, KR 2023, Rhodes, Greece, September 2-8, 2023., pp. 291-300, 2023, 978-1-956792-02-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Diego Arroyuelo, Rajeev Raman |
Adaptive Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(3), pp. 694-718, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Dan Su 0003 |
Generative Long-form Question Answering: Relevance, Faithfulness and Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.08386, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Aayush Jain, Huijia Lin, Ji Luo 0002 |
On the Optimal Succinctness and Efficiency of Functional Encryption and Attribute-Based Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1317, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
22 | Yoshiki Nakamura 0001 |
Expressive power and succinctness of the positive calculus of binary relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Log. Algebraic Methods Program. ![In: J. Log. Algebraic Methods Program. 127, pp. 100760, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
22 | Alexis de Colnet, Stefan Mengel |
A Compilation of Succinctness Results for Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.13014, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
22 | Miikka Vilander |
Games for Succinctness of Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GandALF ![In: Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Padua, Italy, 20-22 September 2021., pp. 258-272, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Alexis de Colnet, Stefan Mengel |
A Compilation of Succinctness Results for Arithmetic Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021., pp. 205-215, 2021, 978-1-956792-99-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak |
On the Succinctness of Alternating Parity Good-for-Games Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.14437, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak |
On Succinctness and Recognisability of Alternating Good-for-Games Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.07278, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Lira Wang |
Halo 0.9: A Halo Protocol with Fully-Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2020, pp. 1573, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Yoshiki Nakamura 0001 |
Expressive Power and Succinctness of the Positive Calculus of Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAMiCS ![In: Relational and Algebraic Methods in Computer Science - 18th International Conference, RAMiCS 2020, Palaiseau, France, April 8-11, 2020, Proceedings [postponed]., pp. 204-220, 2020, Springer, 978-3-030-43519-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Michal Ganczorz |
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France., pp. 22:1-22:29, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-140-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak |
On the Succinctness of Alternating Parity Good-For-Games Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference)., pp. 41:1-41:13, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-174-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
22 | Stefan Jaax |
Population Protocols: Expressiveness, Succinctness and Automatic Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
22 | Beate Bollig, Matthias Buttkus |
On the Relative Succinctness of Sentential Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 63(6), pp. 1250-1277, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Martin Lück, Miikka Vilander |
On the Succinctness of Atoms of Dependency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.02344, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
22 | Thomas Messi Nguélé, Jean-François Méhaut |
Applying Data Structure Succinctness to Graph Numbering For Efficient Graph Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ARIMA J. ![In: ARIMA J. 32, pp. 9, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Martin Lück, Miikka Vilander |
On the Succinctness of Atoms of Dependency. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 15(3), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Yan Zhang, Fasheng Cao |
On the Succinctness of Cardinality Constraint Programs and Canonical Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCID (1) ![In: 12th International Symposium on Computational Intelligence and Design, ISCID 2019, Hangzhou, China, December 14-15, 2019, Volume 1, pp. 240-244, 2019, IEEE, 978-1-7281-4653-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Yan Zhang, Zhaohui Chen |
On the Succinctness of Cardinality Constraint Programs and Simple Definite Causal Theories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCID (1) ![In: 12th International Symposium on Computational Intelligence and Design, ISCID 2019, Hangzhou, China, December 14-15, 2019, Volume 1, pp. 33-36, 2019, IEEE, 978-1-7281-4653-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | Diego Arroyuelo, Rajeev Raman |
Adaptive Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval - 26th International Symposium, SPIRE 2019, Segovia, Spain, October 7-9, 2019, Proceedings, pp. 467-481, 2019, Springer, 978-3-030-32685-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
22 | David Fernández-Duque, Petar Iliev |
Succinctness in Subsystems of the Spatial μ-Calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLAP ![In: FLAP 5(4), pp. 827-874, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev |
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 65(5), pp. 28:1-28:51, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Beate Bollig, Matthias Buttkus |
On the Relative Succinctness of Sentential Decision Diagrams. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.04544, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Michal Ganczorz |
Using statistical encoding to achieve tree succinctness never seen before. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.06359, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Marcos Villagra, Abuzer Yakaryilmaz |
Language recognition power and succinctness of affine automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Nat. Comput. ![In: Nat. Comput. 17(2), pp. 283-293, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
22 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 18(4), pp. 33:1-33:25, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Sebastian Rudolph |
Succinctness and tractability of closure operator representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 658, pp. 327-345, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Fuyuki Kitagawa, Ryo Nishimaki, Keisuke Tanaka |
From Single-Key to Collusion-Resistant Secret-Key Functional Encryption by Leveraging Succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2017, pp. 638, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
22 | Udi Boker |
On the (In)Succinctness of Muller Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: 26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden, pp. 12:1-12:16, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-045-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
22 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1603.09055, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev |
Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1605.01207, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Lauri Hella, Miikka Vilander |
The Succinctness of First-order Logic over Modal Logic via a Formula Size Game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1604.07225, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Marcos Villagra, Abuzer Yakaryilmaz |
Language Recognition Power and Succinctness of Affine Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UCNC ![In: Unconventional Computation and Natural Computation - 15th International Conference, UCNC 2016, Manchester, UK, July 11-15, 2016, Proceedings, pp. 116-129, 2016, Springer, 978-3-319-41311-2. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Lauri Hella, Miikka Vilander |
The succinctness of first-order logic over modal logic via a formula size game. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Advances in Modal Logic ![In: Advances in Modal Logic 11, proceedings of the 11th conference on `Advances in Modal Logic,` held in Budapest, Hungary, August 30 - September 2, 2016, pp. 401-419, 2016, College Publications, 978-1-84890-201-5. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang |
Succinctness of Languages for Judgment Aggregation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pp. 176-186, 2016, AAAI Press, 978-1-57735-755-1. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
22 | Hans van Ditmarsch, Petar Iliev |
The succinctness of the cover modality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 25(4), pp. 373-405, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | John Christopher McCabe-Dansted, Tim French 0002, Sophie Pinchinat, Mark Reynolds 0001 |
Expressiveness and succinctness of a logic of robustness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Appl. Non Class. Logics ![In: J. Appl. Non Class. Logics 25(3), pp. 193-228, 2015. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Tushant Jha, Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch |
Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICSOC Workshops ![In: Service-Oriented Computing - ICSOC 2015 Workshops - WESOA, RMSOC, ISC, DISCO, WESE, BSCI, FOR-MOVES, Goa, India, November 16-19, 2015, Revised Selected Papers, pp. 145-156, 2015, Springer, 978-3-662-50538-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii |
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pp. 317-328, 2015, IEEE Computer Society, 978-1-4799-8875-4. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | David Harel, Guy Katz, Robby Lampert, Assaf Marron, Gera Weiss |
On the Succinctness of Idioms for Concurrent Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONCUR ![In: 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015, pp. 85-99, 2015, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-91-0. The full citation details ...](Pics/full.jpeg) |
2015 |
DBLP DOI BibTeX RDF |
|
22 | Nadeschda Nikitina, Sebastian Rudolph |
(Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 215, pp. 120-140, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii |
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.3047, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev |
On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.4420, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Henning Schnoor |
The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.5993, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Kord Eickmeyer, Michael Elberfeld, Frederik Harwath |
Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS (1) ![In: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, pp. 256-266, 2014, Springer, 978-3-662-44521-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Sebastian Rudolph |
On the Succinctness of Closure Operator Representations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis - 12th International Conference, ICFCA 2014, Cluj-Napoca, Romania, June 10-13, 2014. Proceedings, pp. 15-36, 2014, Springer, 978-3-319-07247-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev |
On the succinctness of query rewriting over shallow ontologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL-LICS ![In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS '14, Vienna, Austria, July 14 - 18, 2014, pp. 57:1-57:10, 2014, ACM, 978-1-4503-2886-9. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
22 | Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii |
Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014., pp. 45-57, 2014, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Wiebe van der Hoek, Petar Iliev |
On the relative succinctness of modal logics with union, intersection and quantification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '14, Paris, France, May 5-9, 2014, pp. 341-348, 2014, IFAAMAS/ACM, 978-1-4503-2738-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
22 | Tim French 0002, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi |
On the succinctness of some modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 197, pp. 56-85, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Shenggen Zheng, Daowen Qiu, Jozef Gruska, Lvzhou Li, Paulo Mateus |
State succinctness of two-way finite automata with quantum and classical states. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 499, pp. 98-112, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Dominik D. Freydenberger |
Extended Regular Expressions: Succinctness and Decidability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 53(2), pp. 159-193, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Jérôme Lang, Bruno Zanuttini |
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.6429, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Jérôme Lang, Bruno Zanuttini |
Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TARK ![In: Proceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge (TARK 2013), Chennai, India, January 7-9, 2013, 2013, 978-0-615-74716-3. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Nadeschda Nikitina, Sven Schewe |
More is Sometimes Less: Succinctness in EL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Description Logics ![In: Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013, pp. 403-414, 2013, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
22 | Petar Iliev |
On the relative succinctness of some modal logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2013 |
RDF |
|
22 | Wouter Gelade, Frank Neven |
Succinctness of the Complement and Intersection of Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 13(1), pp. 4:1-4:19, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Shenggen Zheng, Daowen Qiu, Lvzhou Li |
State succinctness of two-way finite automata with quantum and classical states ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1202.2651, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
22 | Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi |
On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings, pp. 323-333, 2012, Springer, 978-3-642-30869-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Shenggen Zheng, Daowen Qiu, Lvzhou Li |
State Succinctness of two-Way finite Automata with quantum and Classical States. ![Search on Bibsonomy](Pics/bibsonomy.png) |
QLSC ![In: Quantitative Logic and Soft Computing, Proceedings of the QLSC 2012, Xi'an, China, 12-15 May 2012, 2012, World Scientific, 978-981-4401-52-4. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Nadeschda Nikitina, Sebastian Rudolph |
On the (Non-)Succinctness of Uniform Interpolation in General ${\mathcal{EL}}$ Terminologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RR ![In: Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings, pp. 246-249, 2012, Springer, 978-3-642-33202-9. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Alessio Orlandi |
Advanced rank/select data structures: succinctness, bounds and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
22 | Carme Àlvarez, Joaquim Gabarró, Maria J. Serna |
Equilibria problems on games: Complexity versus succinctness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 77(6), pp. 1172-1197, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Wouter Gelade, Frank Neven |
Succinctness of pattern-based schema languages for XML. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 77(3), pp. 505-519, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Dominik D. Freydenberger |
Extended Regular Expressions: Succinctness and Decidability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany, pp. 507-518, 2011, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-25-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Sebastian Kupferschmid, Martin Wehrle |
Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TACAS ![In: Tools and Algorithms for the Construction and Analysis of Systems - 17th International Conference, TACAS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Saarbrücken, Germany, March 26-April 3, 2011. Proceedings, pp. 276-290, 2011, Springer, 978-3-642-19834-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | John Christopher McCabe-Dansted |
On the Succinctness of RoCTL*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CATS ![In: Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011, pp. 85-94, 2011, Australian Computer Society, 978-1-920682-98-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
22 | Tim French 0002, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi |
Succinctness of Epistemic Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, Barcelona, Catalonia, Spain, July 16-22, 2011, pp. 881-886, 2011, IJCAI/AAAI, 978-1-57735-516-8. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | David Lo 0001, Shahar Maoz |
Towards Succinctness in Mining Scenario-Based Specifications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICECCS ![In: 16th IEEE International Conference on Engineering of Complex Computer Systems, ICECCS 2011, Las Vegas, Nevada, USA, 27-29 April 2011, pp. 231-240, 2011, IEEE Computer Society, 978-0-7695-4381-9. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
22 | Abuzer Yakaryilmaz, A. C. Cem Say |
Succinctness of two-way probabilistic and quantum finite automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 12(4), pp. 19-40, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Wouter Gelade |
Succinctness of regular expressions with interleaving, intersection and counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(31-33), pp. 2987-2998, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
22 | Laura Bozzelli, Ruggero Lanotte |
Complexity and succinctness issues for linear-time hybrid logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(2), pp. 454-469, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|