Search results for "succinctness"

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.	MFCS	1979	DBLP DOI BibTeX RDF
88	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: Pushdown Automata.	J. ACM	1994	DBLP DOI BibTeX RDF	cooperative concurrency, pushdown automata, succinctness
82	Martin Grohe, Nicole Schweikardt	The Succinctness of First-Order Logic on Linear Orders.	LICS	2004	DBLP DOI BibTeX RDF
73	Doron Drusinsky, David Harel	On the Power of Bounded Concurrency I: Finite Automata.	J. ACM	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.	ATVA	2006	DBLP DOI BibTeX RDF
52	Wouter Gelade	Succinctness of Regular Expressions with Interleaving, Intersection and Counting.	MFCS	2008	DBLP DOI BibTeX RDF
52	Laura Bozzelli, Ruggero Lanotte	Complexity and Succinctness Issues for Linear-Time Hybrid Logics.	JELIA	2008	DBLP DOI BibTeX RDF
52	Martin Grohe, Nicole Schweikardt	Comparing the Succinctness of Monadic Query Languages over Finite Trees.	CSL	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.	DASFAA	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.	SIGKDD Explor.	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.	DBPL	2007	DBLP DOI BibTeX RDF
37	Carsten Lutz	Complexity and succinctness of public announcement logic.	AAMAS	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.	FSTTCS	1987	DBLP DOI BibTeX RDF
30	Micah Adler, Neil Immerman	An n! lower bound on formula size.	ACM Trans. Comput. Log.	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.	SIGMOD Conference	1998	DBLP DOI BibTeX RDF
30	Noa Globerman, David Harel	Complexity Results for Multi-Pebble Automata and their Logics.	ICALP	1994	DBLP DOI BibTeX RDF
30	Juris Hartmanis	On the Succintness of Different Representations of Languages.	ICALP	1979	DBLP DOI BibTeX RDF
27	Georg Gottlob, Christoph Koch 0001, Klaus U. Schulz	Conjunctive queries over trees.	J. ACM	2006	DBLP DOI BibTeX RDF	XML, Complexity, trees, expressiveness, conjunctive queries, succinctness
27	Carson Kai-Sang Leung	Interactive Constrained Frequent-Pattern Mining System.	IDEAS	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).	CoRR	2024	DBLP DOI BibTeX RDF
22	Luca Geatti, Alessio Mansutti, Angelo Montanari	Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems.	FoSSaCS (2)	2024	DBLP DOI BibTeX RDF
22	Daxin Liu 0002, Vaishak Belle	Progression with Probabilities in the Situation Calculus: Representation and Succinctness.	AAMAS	2024	DBLP BibTeX RDF
22	Sven Schewe, Qiyi Tang 0001	On the Succinctness of Good-for-MDPs Automata.	CoRR	2023	DBLP DOI BibTeX RDF
22	Frank Y. C. Lu	Input Transformation Based Efficient Zero-Knowledge Argument System for Arbitrary Circuits with Practical Succinctness.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
22	Huili Xing	On the Succinctness of Modal μ-Calculus Based on Covariant-Contravariant Refinement.	Int. J. Softw. Eng. Knowl. Eng.	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.	EUROCRYPT (3)	2023	DBLP DOI BibTeX RDF
22	Pietro Galliani, Oliver Kutz, Nicolas Troquard	Succinctness and Complexity of ALC with Counting Perceptrons.	KR	2023	DBLP DOI BibTeX RDF
22	Diego Arroyuelo, Rajeev Raman	Adaptive Succinctness.	Algorithmica	2022	DBLP DOI BibTeX RDF
22	Dan Su 0003	Generative Long-form Question Answering: Relevance, Faithfulness and Succinctness.	CoRR	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.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
22	Yoshiki Nakamura 0001	Expressive power and succinctness of the positive calculus of binary relations.	J. Log. Algebraic Methods Program.	2022	DBLP DOI BibTeX RDF
22	Alexis de Colnet, Stefan Mengel	A Compilation of Succinctness Results for Arithmetic Circuits.	CoRR	2021	DBLP BibTeX RDF
22	Miikka Vilander	Games for Succinctness of Regular Expressions.	GandALF	2021	DBLP DOI BibTeX RDF
22	Alexis de Colnet, Stefan Mengel	A Compilation of Succinctness Results for Arithmetic Circuits.	KR	2021	DBLP DOI BibTeX RDF
22	Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak	On the Succinctness of Alternating Parity Good-for-Games Automata.	CoRR	2020	DBLP BibTeX RDF
22	Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak	On Succinctness and Recognisability of Alternating Good-for-Games Automata.	CoRR	2020	DBLP BibTeX RDF
22	Lira Wang	Halo 0.9: A Halo Protocol with Fully-Succinctness.	IACR Cryptol. ePrint Arch.	2020	DBLP BibTeX RDF
22	Yoshiki Nakamura 0001	Expressive Power and Succinctness of the Positive Calculus of Relations.	RAMiCS	2020	DBLP DOI BibTeX RDF
22	Michal Ganczorz	Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before.	STACS	2020	DBLP DOI BibTeX RDF
22	Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak	On the Succinctness of Alternating Parity Good-For-Games Automata.	FSTTCS	2020	DBLP DOI BibTeX RDF
22	Stefan Jaax	Population Protocols: Expressiveness, Succinctness and Automatic Verification.		2020	RDF
22	Beate Bollig, Matthias Buttkus	On the Relative Succinctness of Sentential Decision Diagrams.	Theory Comput. Syst.	2019	DBLP DOI BibTeX RDF
22	Martin Lück, Miikka Vilander	On the Succinctness of Atoms of Dependency.	CoRR	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.	ARIMA J.	2019	DBLP DOI BibTeX RDF
22	Martin Lück, Miikka Vilander	On the Succinctness of Atoms of Dependency.	Log. Methods Comput. Sci.	2019	DBLP DOI BibTeX RDF
22	Yan Zhang, Fasheng Cao	On the Succinctness of Cardinality Constraint Programs and Canonical Logic Programs.	ISCID (1)	2019	DBLP DOI BibTeX RDF
22	Yan Zhang, Zhaohui Chen	On the Succinctness of Cardinality Constraint Programs and Simple Definite Causal Theories.	ISCID (1)	2019	DBLP DOI BibTeX RDF
22	Diego Arroyuelo, Rajeev Raman	Adaptive Succinctness.	SPIRE	2019	DBLP DOI BibTeX RDF
22	David Fernández-Duque, Petar Iliev	Succinctness in Subsystems of the Spatial μ-Calculus.	FLAP	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.	J. ACM	2018	DBLP DOI BibTeX RDF
22	Beate Bollig, Matthias Buttkus	On the Relative Succinctness of Sentential Decision Diagrams.	CoRR	2018	DBLP BibTeX RDF
22	Michal Ganczorz	Using statistical encoding to achieve tree succinctness never seen before.	CoRR	2018	DBLP BibTeX RDF
22	Marcos Villagra, Abuzer Yakaryilmaz	Language recognition power and succinctness of affine automata.	Nat. Comput.	2018	DBLP DOI BibTeX RDF
22	Kord Eickmeyer, Michael Elberfeld, Frederik Harwath	Succinctness of Order-Invariant Logics on Depth-Bounded Structures.	ACM Trans. Comput. Log.	2017	DBLP DOI BibTeX RDF
22	Sebastian Rudolph	Succinctness and tractability of closure operator representations.	Theor. Comput. Sci.	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.	IACR Cryptol. ePrint Arch.	2017	DBLP BibTeX RDF
22	Udi Boker	On the (In)Succinctness of Muller Automata.	CSL	2017	DBLP DOI BibTeX RDF
22	Kord Eickmeyer, Michael Elberfeld, Frederik Harwath	Succinctness of Order-Invariant Logics on Depth-Bounded Structures.	CoRR	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.	CoRR	2016	DBLP BibTeX RDF
22	Lauri Hella, Miikka Vilander	The Succinctness of First-order Logic over Modal Logic via a Formula Size Game.	CoRR	2016	DBLP BibTeX RDF
22	Marcos Villagra, Abuzer Yakaryilmaz	Language Recognition Power and Succinctness of Affine Automata.	UCNC	2016	DBLP DOI BibTeX RDF
22	Lauri Hella, Miikka Vilander	The succinctness of first-order logic over modal logic via a formula size game.	Advances in Modal Logic	2016	DBLP BibTeX RDF
22	Ulle Endriss, Umberto Grandi, Ronald de Haan, Jérôme Lang	Succinctness of Languages for Judgment Aggregation.	KR	2016	DBLP BibTeX RDF
22	Hans van Ditmarsch, Petar Iliev	The succinctness of the cover modality.	J. Appl. Non Class. Logics	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.	J. Appl. Non Class. Logics	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.	ICSOC Workshops	2015	DBLP DOI BibTeX RDF
22	Meghyn Bienvenu, Stanislav Kikot, Vladimir V. Podolskii	Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results.	LICS	2015	DBLP DOI BibTeX RDF
22	David Harel, Guy Katz, Robby Lampert, Assaf Marron, Gera Weiss	On the Succinctness of Idioms for Concurrent Programming.	CONCUR	2015	DBLP DOI BibTeX RDF
22	Nadeschda Nikitina, Sebastian Rudolph	(Non-)Succinctness of uniform interpolants of general terminologies in the description logic EL.	Artif. Intell.	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.	CoRR	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.	CoRR	2014	DBLP BibTeX RDF
22	Henning Schnoor	The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex.	CoRR	2014	DBLP BibTeX RDF
22	Kord Eickmeyer, Michael Elberfeld, Frederik Harwath	Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures.	MFCS (1)	2014	DBLP DOI BibTeX RDF
22	Sebastian Rudolph	On the Succinctness of Closure Operator Representations.	ICFCA	2014	DBLP DOI BibTeX RDF
22	Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Michael Zakharyaschev	On the succinctness of query rewriting over shallow ontologies.	CSL-LICS	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.	Description Logics	2014	DBLP BibTeX RDF
22	Wiebe van der Hoek, Petar Iliev	On the relative succinctness of modal logics with union, intersection and quantification.	AAMAS	2014	DBLP BibTeX RDF
22	Tim French 0002, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi	On the succinctness of some modal logics.	Artif. Intell.	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.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
22	Dominik D. Freydenberger	Extended Regular Expressions: Succinctness and Decidability.	Theory Comput. Syst.	2013	DBLP DOI BibTeX RDF
22	Jérôme Lang, Bruno Zanuttini	Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence.	CoRR	2013	DBLP BibTeX RDF
22	Jérôme Lang, Bruno Zanuttini	Knowledge-Based Programs as Plans: Succinctness and the Complexity of Plan Existence.	TARK	2013	DBLP BibTeX RDF
22	Nadeschda Nikitina, Sven Schewe	More is Sometimes Less: Succinctness in EL.	Description Logics	2013	DBLP BibTeX RDF
22	Petar Iliev	On the relative succinctness of some modal logics.		2013	RDF
22	Wouter Gelade, Frank Neven	Succinctness of the Complement and Intersection of Regular Expressions.	ACM Trans. Comput. Log.	2012	DBLP DOI BibTeX RDF
22	Shenggen Zheng, Daowen Qiu, Lvzhou Li	State succinctness of two-way finite automata with quantum and classical states	CoRR	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.	CiE	2012	DBLP DOI BibTeX RDF
22	Shenggen Zheng, Daowen Qiu, Lvzhou Li	State Succinctness of two-Way finite Automata with quantum and Classical States.	QLSC	2012	DBLP DOI BibTeX RDF
22	Nadeschda Nikitina, Sebastian Rudolph	On the (Non-)Succinctness of Uniform Interpolation in General ${\mathcal{EL}}$ Terminologies.	RR	2012	DBLP DOI BibTeX RDF
22	Alessio Orlandi	Advanced rank/select data structures: succinctness, bounds and applications.		2012	RDF
22	Carme Àlvarez, Joaquim Gabarró, Maria J. Serna	Equilibria problems on games: Complexity versus succinctness.	J. Comput. Syst. Sci.	2011	DBLP DOI BibTeX RDF
22	Wouter Gelade, Frank Neven	Succinctness of pattern-based schema languages for XML.	J. Comput. Syst. Sci.	2011	DBLP DOI BibTeX RDF
22	Dominik D. Freydenberger	Extended Regular Expressions: Succinctness and Decidability.	STACS	2011	DBLP DOI BibTeX RDF
22	Sebastian Kupferschmid, Martin Wehrle	Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy.	TACAS	2011	DBLP DOI BibTeX RDF
22	John Christopher McCabe-Dansted	On the Succinctness of RoCTL*.	CATS	2011	DBLP BibTeX RDF
22	Tim French 0002, Wiebe van der Hoek, Petar Iliev, Barteld P. Kooi	Succinctness of Epistemic Languages.	IJCAI	2011	DBLP DOI BibTeX RDF
22	David Lo 0001, Shahar Maoz	Towards Succinctness in Mining Scenario-Based Specifications.	ICECCS	2011	DBLP DOI BibTeX RDF
22	Abuzer Yakaryilmaz, A. C. Cem Say	Succinctness of two-way probabilistic and quantum finite automata.	Discret. Math. Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
22	Wouter Gelade	Succinctness of regular expressions with interleaving, intersection and counting.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
22	Laura Bozzelli, Ruggero Lanotte	Complexity and succinctness issues for linear-time hybrid logics.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF