BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
tree (8)
represent (7)
complex (6)
data (5)
queri (5)

Stem succinct$ (all stems)

54 papers:

STOCSTOC-2015-BassilyS #performance #protocol
Local, Private, Efficient Protocols for Succinct Histograms (RB, ADS), pp. 127–135.
STOCSTOC-2015-BitanskyGLPT #encoding #random
Succinct Randomized Encodings and their Applications (NB, SG, HL, RP, ST), pp. 439–448.
STOCSTOC-2015-CanettiH0V #obfuscation #ram #source code
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (RC, JH, AJ, VV), pp. 429–437.
POPLPOPL-2015-GuptaHRST #concurrent #representation #set
Succinct Representation of Concurrent Trace Sets (AG, TAH, AR, RS, TT), pp. 433–444.
ICSTICST-2015-0001YPGS #analysis #generative #testing #using
Generating Succinct Test Cases Using Don’t Care Analysis (CN, HY, MRP, IG, KS), pp. 1–10.
LICSLICS-2015-BienvenuKP #complexity #owl #query
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LATALATA-2014-DasST #encoding #graph #morphism
Succinct Encodings of Graph Isomorphism (BD, PS, JT), pp. 285–296.
CIKMCIKM-2014-TanC #query #social #social media
Succinct Queries for Linking and Tracking News in Social Media (LT, CLAC), pp. 1883–1886.
KRKR-2014-ShenZ #canonical #logic programming #source code
Canonical Logic Programs are Succinctly Incomparable with Propositional Formulas (YS, XZ).
LICSLICS-CSL-2014-KikotKPZ #on the #ontology #query
On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.
MSRMSR-2013-WangDZCXZ #api #mining #source code
Mining succinct and high-coverage API usage patterns from source code (JW, YD, HZ, KC, TX, DZ), pp. 319–328.
STOCSTOC-2013-BringmannL
Succinct sampling from discrete distributions (KB, KGL), pp. 775–782.
STOCSTOC-2013-GoldwasserKPVZ #encryption #functional #reuse
Reusable garbled circuits and succinct functional encryption (SG, YTK, RAP, VV, NZ), pp. 555–564.
KDDKDD-2013-TabeiKKY #constraints #scalability #similarity
Succinct interval-splitting tree for scalable similarity search of compound-protein pairs with property constraints (YT, AK, MK, YY), pp. 176–184.
ESEC-FSEESEC-FSE-2013-SunK #debugging #mining
Mining succinct predicated bug signatures (CS, SCK), pp. 576–586.
SASSAS-2012-HenryMM #abstract interpretation #algorithm #analysis #evaluation
Succinct Representations for Abstract Interpretation — Combined Analysis Algorithms and Experimental Evaluation (JH, DM, MM), pp. 283–299.
STOCSTOC-2012-HuynhN #communication #complexity #on the #proving #trade-off
On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity (TH, JN), pp. 233–248.
ICALPICALP-v1-2012-FarzanMR #orthogonal #query
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
HTHT-2011-GoedeMNW #network #social #summary #using
Succinct summaries of narrative events using social networks (BdG, MM, AN, JvW), pp. 299–304.
TACASTACAS-2011-KupferschmidW #abstraction #database
Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy (SK, MW), pp. 276–290.
STOCSTOC-2011-GentryW
Separating succinct non-interactive arguments from all falsifiable assumptions (CG, DW), pp. 99–108.
ICALPICALP-v1-2011-JansenS #constant #polynomial
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (MJJ, RS), pp. 724–735.
KDDKDD-2011-MampaeyTV #what
Tell me what i need to know: succinctly summarizing data with itemsets (MM, NT, JV), pp. 573–581.
ICALPICALP-v1-2010-GrossiOR #string #trade-off
Optimal Trade-Offs for Succinct String Indexes (RG, AO, RR), pp. 678–689.
ICALPICALP-v2-2010-GollerHOW #automaton #model checking #parametricity
Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
KDDKDD-2010-AlaeiKMV #representation
Balanced allocation with succinct representation (SA, RK, AM, EV), pp. 523–532.
STOCSTOC-2009-Viola #bound #data type
Bit-probe lower bounds for succinct data structures (EV), pp. 475–482.
ICALPICALP-v1-2009-FarzanM #order
Dynamic Succinct Ordered Trees (AF, JIM), pp. 439–450.
ICALPICALP-v1-2009-FarzanRR #question
Universal Succinct Representations of Trees? (AF, RR, SSR), pp. 451–462.
STOCSTOC-2008-FortnowS
Infeasibility of instance compression and succinct PCPs for NP (LF, RS), pp. 133–142.
ICALPICALP-A-2008-DietzfelbingerP #approximate #data type #retrieval
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) (MD, RP), pp. 385–396.
ICEISICEIS-DISI-2008-MuldnerML #data access #dataset #policy #xml
Succinct Access Control Policies for Published XML Datasets (TM, JKM, GL), pp. 380–385.
KDDKDD-2008-ChakrabartiKP #generative #web
Generating succinct titles for web URLs (DC, RK, KP), pp. 79–87.
KDDKDD-2008-XiangJFD #database #summary #transaction
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme (YX, RJ, DF, FFD), pp. 758–766.
ICDARICDAR-2007-CharW #approximate #functional #representation
Representing and Characterizing Handwritten Mathematical Symbols through Succinct Functional Approximation (BWC, SMW), pp. 1198–1202.
ICALPICALP-2007-GuptaHSV #data type #framework
A Framework for Dynamizing Succinct Data Structures (AG, WKH, RS, JSV), pp. 521–532.
ICALPICALP-2007-HeMR
Succinct Ordinal Trees Based on Tree Covering (MH, JIM, SSR), pp. 509–520.
LATALATA-2007-KutribR #automaton #regular expression
Succinct Description of Regular Languages by Weak Restarting Automata (MK, JR), pp. 343–354.
LATALATA-2007-TorreNPP #state machine #verification
Verification of Succinct Hierarchical State Machines (SLT, MN, MP, GP), pp. 485–496.
ICALPICALP-v1-2006-DaskalakisFP #complexity #game studies #nash
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games (CD, AF, CHP), pp. 513–524.
SIGIRSIGIR-2006-BastW #performance
Type less, find more: fast autocompletion search with a succinct index (HB, IW), pp. 364–371.
TACASTACAS-2004-NielsonNSBHPS
The Succinct Solver Suite (FN, HRN, HS, MB, RRH, HP, HS), pp. 251–265.
ICALPICALP-2004-MunroR
Succinct Representations of Functions (JIM, SSR), pp. 1006–1015.
ICALPICALP-2004-VassilvitskiiY #trade-off
Efficiently Computing Succinct Trade-Off Curves (SV, MY), pp. 1201–1213.
KRKR-2004-Coste-MarquisLLM #representation
Expressive Power and Succinctness of Propositional Languages for Preference Representation (SCM, JL, PL, PM), pp. 203–212.
LICSLICS-2004-GroheS #first-order #linear #logic
The Succinctness of First-Order Logic on Linear Orders (MG, NS), pp. 438–447.
CIAACIAA-2003-Zijl #regular expression
Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.
ICALPICALP-2003-GalM #complexity #data type
The Cell Probe Complexity of Succinct Data Structures (AG, PBM), pp. 332–344.
ICALPICALP-2003-MunroRRR #permutation
Succinct Representations of Permutations (JIM, RR, VR, SSR), pp. 345–356.
ICALPICALP-2003-RamanR
Succinct Dynamic Dictionaries and Trees (RR, SSR), pp. 357–368.
CSLCSL-2003-GroheS #finite #monad #query
Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
SACSAC-1998-ChunLC #semantics
Succinct model semantics: a simple model for inclusive interpretations (SC, HL, JC), pp. 39–44.
ICALPICALP-1995-Balcazar #complexity #graph
The Complexity of Searching Succinctly Represented Graphs (JLB), pp. 208–219.
STOCSTOC-1994-MaratheHSR #approximate #problem #specification
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) (MVM, HBHI, RES, VR), pp. 468–477.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.