Stem enumer$ (all stems)

74 papers:

PODS-2015-HuQT15a #dependence #testing

Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration (XH, MQ, YT), pp. 291–301.

SIGMOD-2015-BerlowitzCK #performance

Efficient Enumeration of Maximal k-Plexes (DB, SC, BK), pp. 431–444.

VLDB-2015-ChangLZYZQ #performance

Optimal Enumeration: Efficient Top-k Tree Matching (LC, XL, WZ, JXY, YZ, LQ), pp. 533–544.

VLDB-2015-LaiQLC #pipes and filters #scalability

Scalable Subgraph Enumeration in MapReduce (LL, LQ, XL, LC), pp. 974–985.

CIAA-2015-HeamJ15a #automaton #generative #random #realtime

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.

DLT-2015-DolceP #set

Enumeration Formulæ in Neutral Sets (FD, DP), pp. 215–227.

LATA-2015-CreignouKMMOV #problem

Parameterized Enumeration for Modification Problems (NC, RK, AM, JSM, FO, HV), pp. 524–536.

OOPSLA-2015-KurajKJ #programming #set

Programming with enumerable sets of structures (IK, VK, DJ), pp. 37–56.

PPoPP-2015-ChangG #algorithm #concurrent #parallel

A parallel algorithm for global states enumeration in concurrent systems (YJC, VKG), pp. 140–149.

SAT-2015-ArifMM #axiom #performance

Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.

SAT-2015-Zielke0 #approach

A New Approach to Partial MUS Enumeration (CZ, MK), pp. 387–404.

DAC-2014-ElbayoumiCKSHE #algorithm #named #parallel #synthesis

TACUE: A Timing-Aware Cuts Enumeration Algorithm for Parallel Synthesis (ME, MC, VNK, AS, MSH, MYE), p. 6.

PODS-2014-DurandSS #database #first-order #query

Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.

PODS-2014-PaghS #complexity

The input/output complexity of triangle enumeration (RP, FS), pp. 224–233.

VLDB-2014-ShanbhagS #optimisation #query

Optimizing Join Enumeration in Transformation-based Query Optimizers (AS, SS), pp. 1243–1254.

CIKM-2014-ParkSKP #pipes and filters

MapReduce Triangle Enumeration With Guarantees (HMP, FS, UK, RP), pp. 1739–1748.

LICS-CSL-2014-LosemannM #query

MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.

CASE-2013-WuCY #analysis #policy #reachability

A control policy for γ-nets without reachability analysis and siphon enumeration (WW, DYC, FY), pp. 1133–1138.

PODS-2013-KazanaS #bound #first-order #query

Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.

SIGMOD-2013-MoerkotteFE #on the

On the correct and complete enumeration of the core search space (GM, PF, ME), pp. 493–504.

VLDB-2013-FenderM #top-down

Counter Strike: Generic Top-Down Join Enumeration for Hypergraphs (PF, GM), pp. 1822–1833.

FASE-2013-LinPEHR #analysis #behaviour #requirements #sequence #specification #string

Augmenting Sequence Enumeration with String-Rewriting for Requirements Analysis and Behavioral Specification (LL, JHP, RE, RMH, CRM), pp. 179–193.

ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.

CIKM-2013-AkibaIY #linear #network #random #scalability

Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction (TA, YI, YY), pp. 909–918.

CASE-2012-NazeemR #algorithm #performance #resource management

An efficient algorithm for the enumeration of the minimal unsafe states in complex resource allocation systems (AN, SAR), pp. 686–693.

DLT-J-2011-CharlierRS12 #automation #decidability #sequence

Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 1035–1066.

KDD-2012-ChengZKC #algorithm #clique #memory management #performance

Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.

DAC-2011-Stergiou #diagrams #network #order #permutation

Implicit permutation enumeration networks and binary decision diagrams reordering (SS), pp. 615–620.

VLDB-2011-GolenbergKS #optimisation

Optimizing and Parallelizing Ranked Enumeration (KG, BK, YS), pp. 1028–1039.

DLT-2011-CharlierRS #automation #decidability #sequence

Enumeration and Decidable Properties of Automatic Sequences (EC, NR, JS), pp. 165–179.

CSL-2011-DurandS #complexity #higher-order #logic #problem #query

Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.

SAT-2011-CreignouOS #csp

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.

ASE-2010-KhatchadourianM #automation #java #refactoring

Enumeration refactoring: a tool for automatically converting Java constants to enumerated types (RK, BM), pp. 181–182.

SAC-2010-BaudetD #algorithm #permutation

An improved algorithm to enumerate all traces that sort a signed permutation by reversals (CB, ZD), pp. 1521–1525.

CAV-2010-Monniaux #lazy evaluation #quantifier

Quantifier Elimination by Lazy Model Enumeration (DM), pp. 585–599.

CSL-2010-BaganDFG #performance #query

Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.

DLT-2008-CaludeNSS #recursion #set #string

Universal Recursively Enumerable Sets of Strings (CSC, AN, LS, FS), pp. 170–182.

CIKM-2008-ModaniD #clique #graph #scalability

Large maximal cliques enumeration in sparse graphs (NM, KD), pp. 1377–1378.

DATE-2007-BonziniP #automation #polynomial #set

Polynomial-time subgraph enumeration for automated instruction set extension (PB, LP), pp. 1331–1336.

SIGMOD-2007-DeHaanT #top-down

Optimal top-down join enumeration (DD, FWT), pp. 785–796.

ICSM-2007-KhatchadourianSR #automation #java #legacy #refactoring

Automated Refactoring of Legacy Java Software to Enumerated Types (RK, JS, AR), pp. 224–233.

CIAA-2007-AckermanS #performance #regular expression

Efficient Enumeration of Regular Languages (MA, JS), pp. 226–242.

CSL-2007-BaganDG #constant #on the #query

On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.

DAC-2005-JinS #performance

Prime clauses for fast enumeration of satisfying assignments to boolean circuits (HJ, FS), pp. 750–753.

DLT-2005-Kortelainen #generative #polynomial #recursion

Polynomial Generators of Recursively Enumerable Languages (JK), pp. 320–326.

CC-2005-VerdoolaegeBBC #case study #experience #integer #parametricity

Experiences with Enumeration of Integer Projections of Parametric Polytopes (SV, KB, MB, FC), pp. 91–105.

DAC-2004-ChopraV #algorithm #pseudo

Implicit pseudo boolean enumeration algorithms for input vector control (KC, SBKV), pp. 767–772.

DAC-2004-KravetsK #optimisation

Implicit enumeration of structural changes in circuit optimization (VNK, PK), pp. 438–441.

CIAA-2004-LeeS #regular expression

Enumerating Regular Expressions and Their Languages (JL, JS), pp. 2–22.

LOPSTR-2004-WellsY #graph #proving #synthesis

Graph-Based Proof Counting and Enumeration with Applications for Program Fragment Synthesis (JBW, BY), pp. 262–277.

DLT-2003-Domaratzki #automaton #on the

On Enumeration of Müller Automata (MD), pp. 254–265.

SAT-2003-KhurshidMSJ #performance

A Case for Efficient Solution Enumeration (SK, DM, IS, DJ), pp. 272–286.

CIAA-2001-BoigelotL #equation

Counting the Solutions of Presburger Equations without Enumerating Them (BB, LL), pp. 40–51.

SIGMOD-2000-WaasG #cost analysis #execution #query

Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer (FW, CAGL), pp. 499–509.

FoSSaCS-1998-BottreauM #graph #normalisation

Minor Searching, Normal Forms of Graph Relabelling: Two Applications Based on Enumerations by Graph Relabelling (AB, YM), pp. 110–124.

CIKM-1998-Zaki #performance #sequence

Efficient Enumeration of Frequent Sequences (MJZ), pp. 68–75.

VLDB-1997-PellenkoftLK #complexity

The Complexity of Transformation-Based Join Enumeration (AP, CAGL, MLK), pp. 306–315.

DAC-1996-VerlindJL #analysis #performance

Efficient Partial Enumeration for Timing Analysis of Asynchronous Systems (EV, GGdJ, BL), pp. 55–58.

WCRE-1996-GravleyL #identification

Identifying Enumeration Types Modeled with Symbolic Constants (JMG, AL), p. 227–?.

DAC-1995-LiM #analysis #embedded #performance #using

Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 456–461.

LCT-RTS-1995-LiM #analysis #embedded #performance #using

Performance Analysis of Embedded Software Using Implicit Path Enumeration (YTSL, SM), pp. 88–98.

CADE-1994-Slaney94a #finite #named

FINDER: Finite Domain Enumerator — System Description (JKS), pp. 798–801.

WSA-1992-BreuerB #decompiler #performance

Decompilation is the Efficient Enumeration of Types (PTB, JPB), pp. 255–273.

ICALP-1992-VaziraniY

Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) (VVV, MY), pp. 366–377.

KR-1992-Rymon #set

Search through Systematic Set Enumeration (RR), pp. 539–550.

VLDB-1990-OnoL #complexity #optimisation #query

Measuring the Complexity of Join Enumeration in Query Optimization (KO, GML), pp. 314–325.

CADE-1986-Weispfenning #logic #recursion #source code

Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs (VW), pp. 564–571.

ILPC-1984-HirakawaCF84 #concurrent #lazy evaluation #prolog

Eager and Lazy Enumerations in Concurrent Prolog (HH, TC, KF), pp. 89–100.

ICALP-1983-DelestV #algebra

Algebraic Languages and Polyominoes Enumeration (MPD, GV), pp. 173–181.

ICALP-1983-SatoT #logic programming #source code

Enumeration of Success Patterns in Logic Programs (TS, HT), pp. 640–652.

ICALP-1979-Istrail #fixpoint #monad #recursion #semantics #source code #theorem

A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.

ICALP-1976-Galil #integer #on the #programming #proving #theorem proving

On Enumeration Procedures for Theorem Proving and for Integer Programming (ZG), pp. 355–381.

STOC-1971-GinsburgG #recursion

Intersection-Closed full AFL and the Recursively Enumerable Languages (SG, JG), pp. 121–131.

STOC-1969-Young #order #set

Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version) (PRY), pp. 89–92.