Stem width$ (all stems)

70 papers:

FoSSaCS-2015-Ganardi #bound #clique #game studies

Parity Games of Bounded Tree- and Clique-Width (MG), pp. 390–404.

ICALP-v2-2015-BojanczykMW #bound #clique #datalog #monad #source code

Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.

LATA-2015-DabrowskiHP #bound #clique #graph

Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.

DATE-2014-DuanW

Exploiting narrow-width values for improving non-volatile cache lifetime (GD, SW), pp. 1–4.

DATE-2014-LiuCHWCDN #array #synthesis

Width minimization in the Single-Electron Transistor array synthesis (CWL, CEC, CYH, CYW, YCC, SD, VN), pp. 1–4.

ICALP-v1-2014-Lampis #approximate #graph #using

Parameterized Approximation Schemes Using Graph Widths (ML), pp. 775–786.

SAT-2014-SakaiST #reduction #satisfiability #strict

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.

DATE-2013-BrandonW #using

Support for dynamic issue width in VLIW processors using generic binaries (AB, SW), pp. 827–832.

ICDAR-2013-Ramirez-OrtegonMRC #documentation #metric

An Objective Method to Evaluate Stroke-Width Measures for Binarized Documents (MARO, VM, RR, EC), pp. 175–179.

CADE-2013-IosifRS #logic #recursion

The Tree Width of Separation Logic with Recursive Definitions (RI, AR, JS), pp. 21–38.

SAT-2013-Atserias #algebra #bound #problem #proving

The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.

SAT-2013-HeuleS #approach #clique #satisfiability

A SAT Approach to Clique-Width (MH, SS), pp. 318–334.

DAC-2012-KongC #3d #process

Exploiting narrow-width values for process variation-tolerant 3-D microprocessors (JK, SWC), pp. 1197–1206.

ICPR-2012-LiL #detection

Scene text detection via stroke width (YL, HL), pp. 681–684.

SMT-2012-KovasznaiFB #complexity #logic #on the

On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (GK, AF, AB), pp. 44–56.

DAC-2011-ZhouJBHS #library #standard

A 40 nm inverse-narrow-width-effect-aware sub-threshold standard cell library (JZ, SJ, BB, LH, JS), pp. 441–446.

ICALP-v1-2011-AllenderW #algebra #branch #on the #power of #source code

On the Power of Algebraic Branching Programs of Width Two (EA, FW), pp. 736–747.

ICALP-v1-2011-BordewichK #agile #bound #graph #set

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (MB, RJK), pp. 533–544.

POPL-2011-MadhusudanP

The tree width of auxiliary storage (PM, GP), pp. 283–294.

ICALP-v1-2010-Kral #composition

Decomposition Width of Matroids (DK), pp. 55–66.

SAT-2010-Ben-SassonJ #bound #learning #strict

Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.

DATE-2009-HeH #algorithm #encoding #performance #verification

An efficient path-oriented bitvector encoding width computation algorithm for bit-precise verification (NH, MSH), pp. 1602–1607.

DATE-2009-KinsmanN #finite #modulo theories #precise #using

Finite Precision bit-width allocation using SAT-Modulo Theory (ABK, NN), pp. 1106–1111.

DATE-2009-WangHZC #design

Exploiting narrow-width values for thermal-aware register file designs (SW, JSH, SGZ, SWC), pp. 1422–1427.

ICALP-v2-2009-AzarMMPS #adaptation #network

Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.

CHI-2009-Guiard #consistency #design #distance #problem

The problem of consistency in the design of Fitts’ law experiments: consider either target distance and width or movement form and scale (YG), pp. 1809–1818.

CSL-2009-AdlerW #first-order

Tree-Width for First Order Formulae (IA, MW), pp. 71–85.

SAT-2009-AtseriasFT #algorithm #bound

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.

SAT-2009-Johannsen #bound #exponential #learning #strict

An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.

SAT-2009-PipatsrisawatD #policy #satisfiability

Width-Based Restart Policies for Clause-Learning Satisfiability Solvers (KP, AD), pp. 341–355.

DAC-2008-GargNK #design #performance

A fast, analytical estimator for the SEU-induced pulse width in combinational designs (RG, CN, SPK), pp. 918–923.

PODS-2008-Adler #database #dependence #functional

Tree-width and functional dependencies in databases (IA), pp. 311–320.

ICPR-2008-Feschet

The lattice width and quasi-straightness in digital spaces (FF), pp. 1–4.

DAC-2007-BanerjeeBDN #architecture #configuration management #resource management #scheduling

Selective Band width and Resource Management in Scheduling for Dynamically Reconfigurable Architectures (SB, EB, ND, JN), pp. 771–776.

DAC-2007-GuSK #modelling #random #statistics

Width-dependent Statistical Leakage Modeling for Random Dopant Induced Threshold Voltage Shift (JG, SSS, CHK), pp. 87–92.

CSL-2007-Obdrzalek #clique #game studies

Clique-Width and Parity Games (JO), pp. 54–68.

DATE-2006-MallikSBZ #design #optimisation #power management

Smart bit-width allocation for low power optimization in a systemc based ASIC design environment (AM, DS, PB, HZ), pp. 618–623.

DATE-2006-ParkCR #adaptation #energy #image #quality #trade-off

Dynamic bit-width adaptation in DCT: image quality versus computation energy trade-off (JP, JHC, KR), pp. 520–521.

DATE-2006-ThornbergO #memory management #realtime #specification #video

Impact of bit-width specification on the memory hierarchy for a real-time video processing system (BT, MO), pp. 752–753.

STOC-2006-FellowsRRS #clique #np-hard

Clique-width minimization is NP-hard (MRF, FAR, UR, SS), pp. 354–362.

STOC-2006-NesetrilM #algorithm #linear

Linear time low tree-width partitions and algorithmic consequences (JN, POdM), pp. 391–400.

STOC-2006-Nordstrom #proving

Narrow proofs may be spacious: separating space and width in resolution (JN), pp. 507–516.

ICPR-v1-2006-MarmoAC #classification #set #using

Microfossils shape classification using a set of width values (RM, SA, VC), pp. 691–694.

ICPR-v2-2006-QuanHXLL #analysis #online #verification

Spectrum Analysis Based onWindows with Variable Widths for Online Signature Verification (ZHQ, DSH, XLX, MRL, TML), pp. 1122–1125.

DAC-2005-LeeGML #named #optimisation

MiniBit: bit-width optimization via affine arithmetic (DUL, AAG, OM, WL), pp. 837–840.

DAC-2005-TomL #clustering #design #logic #scalability

Logic block clustering of large designs for channel-width constrained FPGAs (MT, GGL), pp. 726–731.

AdaEurope-2004-BurgstallerBS #ada #on the #source code

On the Tree Width of Ada Programs (BB, JB, BS), pp. 78–90.

CC-2004-OzerNG #approximate #probability #using

Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors (EÖ, AN, DG), pp. 250–264.

LCTES-2004-PokamRSB #energy #optimisation

Speculative software management of datapath-width for energy optimization (GP, OR, AS, FB), pp. 78–87.

CAV-2003-Obdrzalek #bound #calculus #model checking #performance #μ-calculus

Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.

SAT-2003-BroeringL #algorithm #satisfiability

Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract) (EB, SVL), pp. 162–171.

DATE-2002-HalambiSBDN #compilation #performance #reduction #using

An Efficient Compiler Technique for Code Size Reduction Using Reduced Bit-Width ISAs (AH, AS, PB, NDD, AN), pp. 402–408.

FLOPS-2002-Meer #algebra #consistency #constraints #on the #source code

On Consistency and Width Notions for Constraint Programs with Algebraic Constraints (KM), pp. 88–102.

ICALP-2002-AblayevMP #bound #branch #probability #quantum #source code

Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.

PODS-2001-GottlobLS #game studies #logic

Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width (GG, NL, FS).

ICALP-2001-GottlobP #clique #model checking

Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width (GG, RP), pp. 708–719.

HCI-CCAD-1999-MurataFAI #2d #effectiveness

Extending effective target width in Fitt’s law to two-dimensional pointing task (AM, MF, YA, HI), pp. 1236–1240.

HPCA-1999-BrooksM #performance

Dynamically Exploiting Narrow Width Operands to Improve Processor Power and Performance (DMB, MM), pp. 13–22.

STOC-1994-BodlaenderFH #bound #problem

Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (HLB, MRF, MTH), pp. 449–458.

DAC-1993-PullelaMP #optimisation #reliability #using

Reliable Non-Zero Skew Clock Trees Using Wire Width Optimization (SP, NM, LTP), pp. 165–170.

STOC-1992-Reed #approximate

Finding Approximate Separators and Computing Tree Width Quickly (BAR), pp. 221–228.

DAC-1991-MaziaszH

Exact Width and Height Minimization of CMOS Cells (RLM, JPH), pp. 487–493.

ASPLOS-1991-KatevenisT #branch #memory management

Reducing the Branch Penalty by Rearranging Instructions in Double-Width Memory (MK, NT), pp. 15–27.

STOC-1990-Cleve #bound #simulation #source code #towards

Towards Optimal Simulations of Formulas by Bounded-Width Programs (RC), pp. 271–277.

CSL-1989-Meinel #bound #source code

Ω-Branching Programs of Bounded Width (CM), pp. 242–253.

DAC-1987-Ng #design

A “gridless” Variable-Width Channel Router for Marco Cell Design (CHN), pp. 633–636.

STOC-1986-Barrington #bound #branch #source code

Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.

STOC-1983-BorodinDFP #bound #branch #source code

Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.

ICALP-1983-MakedonS #linear

Minimizing Width in Linear Layouts (FM, IHS), pp. 478–490.

DAC-1979-KawamotoK

The minimum width routing of A 2-row 2-layer polycell-layout (TK, YK), pp. 290–296.