Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
succinct representation
Description:
A succinct representation is a compact encoding of an object, system, or problem, studied in computer science and computational complexity.
Related topics:
Complexity and Algorithms in Graphs (14%),
Algorithms and Data Compression (12%),
Game Theory and Voting Systems (12%),
semigroups and automata theory (10%),
Advanced Graph Theory Research (9%),
Formal Methods in Verification (7%)
show all 6
OpenAlex ID:
keywords/succinct-representation
The complexity of combinatorial problems with succinct input representation
1986
·
Klaus W. Wagner
·
Acta Informatica
·
352
Approximate Probabilistic Model Checking
2004
·
Thomas Hérault
, Richard Lassaigne
, et al.
·
Lecture notes in computer science
·
339
Succinct representations of graphs
1983
·
Hana Galperin
, Avi Wigderson
·
Information and Control
·
263
An optimal Bloom filter replacement
2005
·
Anna Pagh
, Rasmus Pagh
, et al.
·
Symposium on Discrete Algorithms
·
221
Complexity of finite-horizon Markov decision process problems
2000
·
Martin Mundhenk
, Judy Goldsmith
, et al.
·
Journal of the ACM
·
206
PDF
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
2008
·
S. Bouveret
, J. Lang
·
Journal of Artificial Intelligence Research
·
204
PDF
Size Bounds for Factorised Representations of Query Results
2015
·
Dan Olteanu
, Jakub Závodný
·
ACM Transactions on Database Systems
·
181
Succinct representation of balanced parentheses, static trees and planar graphs
2002
·
J.I. Munro
, V. Raman
·
Annual Symposium on Foundations of Computer Science
·
176
Property Testing: A Learning Theory Perspective
2008
·
Dana Ron
·
Foundations and Trends® in Machine Learning
·
158
PDF
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
2013
·
Martin Dyer
, David Richerby
·
SIAM Journal on Computing
·
121
PDF
Hedonic coalition nets
2009
·
Edith Elkind
, Michael Wooldridge
·
Adaptive Agents and Multi-Agents Systems
·
111
Entropy, optimization and counting
2014
·
Mohit Singh
, Nisheeth K. Vishnoi
·
ACM Symposium on Theory of Computing (STOC)
·
105
On the computational complexity of coalitional resource games
2006
·
Michael Wooldridge
, Paul E. Dunne
·
Artificial Intelligence
·
97
PDF
Property Testing
2008
·
Dana Ron
·
93
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
1997
·
Marek Karpiński
, Wojciech Rytter
, et al.
·
Nordic journal of computing
·
90
Dynamic text and static pattern matching
2007
·
Amihood Amir
, Gad M. Landau
, et al.
·
ACM Transactions on Algorithms
·
86
On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
2010
·
Danny Harnik
, Moni Naor
·
SIAM Journal on Computing
·
85
On the minimization of XML Schemas and tree automata for unranked trees
2006
·
Wim Martens
, Joachim Niehren
·
Journal of Computer and System Sciences
·
82
The Logical Difference for the Lightweight Description Logic EL
2012
·
B. Konev
, M. Ludwig
, et al.
·
Journal of Artificial Intelligence Research
·
73
PDF
The Complexity of Algorithmic Problems on Succinct Instances
1992
·
José L. Balcázar
, Antoni Lozano
, et al.
·
Springer eBooks
·
73
Symmetries and the complexity of pure Nash equilibrium
2008
·
Felix Brandt
, Felix Fischer
, et al.
·
Journal of Computer and System Sciences
·
63
On the Representation of Probabilities over Structured Domains
1999
·
Marius Bozga
, Oded Maler
·
Lecture notes in computer science
·
57
Complexity of control of Borda count elections
2007
·
Nathan Russell
·
RIT Scholar Works (Rochester Institute of Technology)
·
50
PDF
The complexity of graph problems for succinctly represented graphs
1990
·
Antonio Lozano
, José L. Balcázar
·
Lecture notes in computer science
·
47
Repetition Detection in a Dynamic String
2019
·
Amir, Amihood
, Boneh, Itai
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
36
PDF
Show more works
View as search
Works count:
295
Citation count:
5,190
Year
Topic
Type