Stem bound$ (all stems)

1140 papers:

CASE-2015-PerriBL #bound #online

Jerk bounded velocity planner for the online management of autonomous vehicles (SP, CGLB, ML), pp. 618–625.

CASE-2015-TanakaM #algorithm #bound #problem #strict

Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.

DAC-2015-FernandezJAQVC #bound #realtime

Increasing confidence on measurement-based contention bounds for real-time round-robin buses (GF, JJ, JA, EQ, TV, FJC), p. 6.

DATE-2015-DarkeCVSM #approximate #bound #model checking #using

Over-approximating loops to prove properties using bounded model checking (PD, BC, RV, US, RM), pp. 1407–1412.

DATE-2015-KimAS #bound #composition #scheduling

Schedulability bound for integrated modular avionics partitions (JEK, TFA, LS), pp. 37–42.

FASE-2015-FedyukovichDHS #bound #dependence #detection #model checking

Symbolic Detection of Assertion Dependencies for Bounded Model Checking (GF, ACD, AEJH, NS), pp. 186–201.

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

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

PLDI-2015-0010ZTZ #bound #named

Light: replay via tightly bounded recording (PL, XZ, OT, YZ), pp. 55–64.

PLDI-2015-Carbonneaux0S #bound #composition

Compositional certified resource bounds (QC, JH, ZS), pp. 467–478.

STOC-2015-AbdullahV #bound #difference

A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds (AA, SV), pp. 509–518.

STOC-2015-BarakCK #bound #independence

Sum of Squares Lower Bounds from Pairwise Independence (BB, SOC, PKK), pp. 97–106.

STOC-2015-Chechik #approximate #bound #distance

Approximate Distance Oracles with Improved Bounds (SC), pp. 1–10.

STOC-2015-HardtP #bound #learning

Tight Bounds for Learning a Mixture of Two Gaussians (MH, EP), pp. 753–760.

STOC-2015-LarsenNN #adaptation #algorithm #bound #streaming

Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms (KGL, JN, HLN), pp. 803–812.

STOC-2015-LeeRS #bound #programming

Lower Bounds on the Size of Semidefinite Programming Relaxations (JRL, PR, DS), pp. 567–576.

STOC-2015-LiuL #bound

FPTAS for #BIS with Degree Bounds on One Side (JL, PL), pp. 549–556.

STOC-2015-MekaPW #bound #clique

Sum-of-squares Lower Bounds for Planted Clique (RM, AP, AW), pp. 87–96.

DLT-2015-Yamakami #bound #complexity #quantum

Complexity Bounds of Constant-Space Quantum Computation — (Extended Abstract) (TY), pp. 426–438.

ICALP-v1-2015-Ailon #bound #fourier

Tighter Fourier Transform Lower Bounds (NA), pp. 14–25.

ICALP-v1-2015-BeameLP #bound

Finding the Median (Obliviously) with Bounded Space (PB, VL, MP), pp. 103–115.

ICALP-v1-2015-FeldmannFKP #bound #graph

A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (AEF, WSF, JK, IP), pp. 469–480.

ICALP-v1-2015-FominGKM #bound #graph #morphism #problem

Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.

ICALP-v1-2015-KayalKPS #bound

Lower Bounds for Sums of Powers of Low Degree Univariates (NK, PK, TP, CS), pp. 810–821.

ICALP-v1-2015-KomarathSS #bound #finite

Comparator Circuits over Finite Bounded Posets (BK, JS, KSS), pp. 834–845.

ICALP-v1-2015-Sanyal #bound #fourier

Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (SS), pp. 1035–1045.

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.

ICALP-v2-2015-FijalkowHKS #bound #game studies #memory management

Trading Bounds for Memory in Games with Counters (NF, FH, DK, MS), pp. 197–208.

ICALP-v2-2015-GairingKK #bound #game studies

Tight Bounds for Cost-Sharing in Weighted Congestion Games (MG, KK, GK), pp. 626–637.

LATA-2015-AmanoS #bound #multi #polynomial

A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP (KA, AS), pp. 461–472.

LATA-2015-DabrowskiHP #bound #clique #graph

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

LATA-2015-EremondiIM #bound

Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.

LATA-2015-KrishnaMT #automaton #bound #decidability #problem #reachability #recursion

Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.

FM-2015-0001K #bound #model checking #using

Property-Driven Fence Insertion Using Reorder Bounded Model Checking (SJ, DK), pp. 291–307.

FM-2015-BagheriKMJ #android #bound #design #detection #protocol #verification

Detection of Design Flaws in the Android Permission Protocol Through Bounded Verification (HB, EK, SM, DJ), pp. 73–89.

FM-2015-ChimdyalwarDCVC #abstraction #bound #model checking #static analysis #using

Eliminating Static Analysis False Positives Using Loop Abstraction and Bounded Model Checking (BC, PD, AC, SV, AC), pp. 573–576.

FM-2015-KroeningLW #automaton #bound #model checking #proving #safety

Proving Safety with Trace Automata and Bounded Model Checking (DK, ML, GW), pp. 325–341.

SEFM-2015-ClarisoGC #bound #ocl #refinement #towards #uml #verification

Towards Domain Refinement for UML/OCL Bounded Verification (RC, CAG, JC), pp. 108–114.

SEFM-2015-RochaBC #bound #c #generative #memory management #model checking #source code #testing #using

Memory Management Test-Case Generation of C Programs Using Bounded Model Checking (HR, RSB, LCC), pp. 251–267.

ICFP-2015-VazouBJ #bound #refinement

Bounded refinement types (NV, AB, RJ), pp. 48–61.

ICML-2015-AgarwalB #bound #finite #optimisation

A Lower Bound for the Optimization of Finite Sums (AA, LB), pp. 78–86.

ICML-2015-KordaA #approximate #bound #convergence #exponential #on the

On TD(0) with function approximation: Concentration bounds and a centered variant with exponential convergence (NK, PLA), pp. 626–634.

ICML-2015-LakshmananOR #bound #learning

Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning (KL, RO, DR), pp. 524–532.

ICML-2015-TagortiS #bound #convergence #fault #on the

On the Rate of Convergence and Error Bounds for LSTD(λ) (MT, BS), pp. 1521–1529.

ICML-2015-TewariC #bound #documentation #fault #learning #matter #question #rank

Generalization error bounds for learning to rank: Does the length of document lists matter? (AT, SC), pp. 315–323.

ICML-2015-Yang0JZ #bound #fault #set

An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection (TY, LZ, RJ, SZ), pp. 135–143.

ICML-2015-ZhangWJ #algorithm #bound #distributed #estimation #matrix #performance #rank

Distributed Estimation of Generalized Matrix Rank: Efficient Algorithms and Lower Bounds (YZ, MJW, MIJ), pp. 457–465.

ICML-2015-ZhouZS #analysis #bound #convergence #fault #first-order

ℓ₁_,p-Norm Regularization: Error Bounds and Convergence Rate Analysis of First-Order Methods (ZZ, QZ, AMCS), pp. 1501–1510.

KDD-2015-Kaban #bound #random

Improved Bounds on the Dot Product under Random Projection and Random Sign Projection (AK), pp. 487–496.

SAC-2015-Puffitsch #analysis #bound #branch #predict

Persistence-based branch misprediction bounds for WCET analysis (WP), pp. 1898–1905.

ASPLOS-2015-MorrisonA #bound #symmetry

Temporally Bounding TSO for Fence-Free Asymmetric Synchronization (AM, YA), pp. 45–58.

ASPLOS-2015-NguyenWBFHX #big data #bound #compilation #named #runtime

FACADE: A Compiler and Runtime for (Almost) Object-Bounded Big Data Applications (KN, KW, YB, LF, JH, G(X), pp. 675–690.

ASPLOS-2015-SenguptaBZBK #bound #dynamic analysis #hybrid

Hybrid Static: Dynamic Analysis for Statically Bounded Region Serializability (AS, SB, MZ, MDB, MK), pp. 561–575.

CADE-2015-BackemanR #bound #proving #theorem proving

Theorem Proving with Bounded Rigid E-Unification (PB, PR), pp. 572–587.

CAV-2015-MajumdarW #bound #model checking #named #source code

Bbs: A Phase-Bounded Model Checker for Asynchronous Programs (RM, ZW), pp. 496–503.

CAV-2015-ErezN #automation #bound #graph #smt #using

Finding Bounded Path in Graph Using SMT for Automatic Clock Routing (AE, AN), pp. 20–36.

LICS-2015-HeijltjesH #bound #complexity #logic #petri net #proving

Complexity Bounds for Sum-Product Logic via Additive Proof Nets and Petri Nets (WH, DJDH), pp. 80–91.

LICS-2015-KrebsV #bound #logic #refinement

Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.

RTA-2015-FrohnGHAS #bound #complexity #runtime

Inferring Lower Bounds for Runtime Complexity (FF, JG, JH, CA, TS), pp. 334–349.

SAT-2015-MenciaPM #bound #satisfiability

SAT-Based Horn Least Upper Bounds (CM, AP, JMS), pp. 423–433.

VMCAI-2015-MukundRS #bound #data type #implementation

Bounded Implementations of Replicated Data Types (MM, GSR, SPS), pp. 355–372.

CASE-2014-TanakaT #algorithm #bound #performance #problem

A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.

DAC-2014-AxerTED #bound #network #performance

Exploiting Shaper Context to Improve Performance Bounds of Ethernet AVB Networks (PA, DT, RE, JD), p. 6.

DATE-2014-LongLY #analysis #bound #evaluation #modelling #multi

Analysis and evaluation of per-flow delay bound for multiplexing models (YL, ZL, XY), pp. 1–4.

DATE-2014-SongDY #analysis #bound #multi #order #parametricity #performance #reduction

Zonotope-based nonlinear model order reduction for fast performance bound analysis of analog circuits with multiple-interval-valued parameter variations (YS, SMPD, HY), pp. 1–6.

DATE-2014-ZhaoL #bound

Empowering study of delay bound tightness with simulated annealing (XZ, ZL), pp. 1–6.

SIGMOD-2014-FanWW #bound #graph #query

Querying big graphs within bounded resources (WF, XW, YW), pp. 301–312.

VLDB-2014-CaoFWY #bound #query

Bounded Conjunctive Queries (YC, WF, TW, WY), pp. 1231–1242.

VLDB-2014-YanCZ #bound

Error-bounded Sampling for Analytics on Big Sparse Data (YY, LJC, ZZ), pp. 1508–1519.

ESOP-2014-GhicaS #bound #linear

Bounded Linear Types in a Resource Semiring (DRG, AIS), pp. 331–350.

ESOP-2014-KothaACESB #bound #parallel #runtime

Affine Parallelization of Loops with Run-Time Dependent Bounds from Binaries (AK, KA, TC, KE, MS, RB), pp. 554–574.

FoSSaCS-2014-Fu #bound #markov #probability #process #reachability

Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes (HF), pp. 73–87.

TACAS-2014-KroeningT #bound #c #contest #model checking #named

CBMC — C Bounded Model Checker — (Competition Contribution) (DK, MT), pp. 389–391.

TACAS-2014-Siirtola #bound #composition #multi #named #verification

Bounds2: A Tool for Compositional Multi-parametrised Verification (AS), pp. 599–604.

PLDI-2014-Carbonneaux0RS #bound #c #source code #verification

End-to-end verification of stack-space bounds for C programs (QC, JH, TR, ZS), p. 30.

PLDI-2014-GreenmanMT #bound #morphism #polymorphism

Getting F-bounded polymorphism into shape (BG, FM, RT), p. 12.

STOC-2014-ChekuriC #bound #polynomial #theorem

Polynomial bounds for the grid-minor theorem (CC, JC), pp. 60–69.

STOC-2014-DworkTT0 #analysis #bound #component #privacy

Analyze gauss: optimal bounds for privacy-preserving principal component analysis (CD, KT, AT, LZ), pp. 11–20.

STOC-2014-ElberfeldK #bound #graph

Embedding and canonizing graphs of bounded genus in logspace (ME, KiK), pp. 383–392.

STOC-2014-EneV #algorithm #approximate #bound #design #network #problem #requirements

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.

STOC-2014-FournierLMS #bound #matrix #multi

Lower bounds for depth 4 formulas computing iterated matrix multiplication (HF, NL, GM, SS), pp. 128–135.

STOC-2014-FriggstadS #algorithm #approximate #bound

Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (ZF, CS), pp. 744–753.

STOC-2014-GavinskyMWW #approach #bound #complexity #composition #towards

Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture (DG, OM, OW, AW), pp. 213–222.

STOC-2014-GoosP #bound #communication

Communication lower bounds via critical block sensitivity (MG, TP), pp. 847–856.

STOC-2014-KayalLSS #bound

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (NK, NL, CS, SS), pp. 119–127.

STOC-2014-KayalSS #bound

A super-polynomial lower bound for regular arithmetic formulas (NK, CS, RS), pp. 146–153.

STOC-2014-Lovett #bound #communication #rank

Communication is bounded by root of rank (SL), pp. 842–846.

STOC-2014-Williams #algorithm #bound #linear

New algorithms and lower bounds for circuits with linear threshold gates (RW), pp. 194–202.

CIAA-2014-DumitranGMM #bound

Bounded Prefix-Suffix Duplication (MD, JG, FM, VM), pp. 176–187.

DLT-2014-BrzozowskiS #bound #complexity

Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.

DLT-2014-TorreNP #automaton #bound

Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.

ICALP-v1-2014-BravermanG #bound

Public vs Private Coin in Bounded-Round Information (MB, AG), pp. 502–513.

ICALP-v1-2014-BrietDHS #approximate #bound

Lower Bounds for Approximate LDCs (JB, ZD, GH, SS), pp. 259–270.

ICALP-v1-2014-KolMSY #approximate #bound #rank

Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.

ICALP-v1-2014-KumarS #bound

Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits (MK, SS), pp. 751–762.

ICALP-v1-2014-NelsonN #bound

Lower Bounds for Oblivious Subspace Embeddings (JN, HLN), pp. 883–894.

ICALP-v1-2014-Volkovich #bound #learning #on the

On Learning, Lower Bounds and (un)Keeping Promises (IV), pp. 1027–1038.

ICALP-v2-2014-AdjiashviliR #bound #graph

Labeling Schemes for Bounded Degree Graphs (DA, NR), pp. 375–386.

ICALP-v2-2014-AschnerK #bound #constraints #modelling #network

Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.

ICALP-v2-2014-KopelowitzKPS #bound #graph #worst-case

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.

LATA-2014-BestD #bound #graph #petri net

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (EB, RRD), pp. 161–172.

LATA-2014-KonitzerS #automaton #bound #process

DFA with a Bounded Activity Level (MK, HUS), pp. 478–489.

FM-2014-PonzioRAF #bound #performance

Efficient Tight Field Bounds Computation Based on Shape Predicates (PP, NR, NA, MFF), pp. 531–546.

CIKM-2014-LiuXCXTY #approach #bound #linear #network #scalability #social

Influence Maximization over Large-Scale Social Networks: A Bounded Linear Approach (QL, BX, EC, HX, FT, JXY), pp. 171–180.

ICML-c1-2014-AroraBGM #bound #learning

Provable Bounds for Learning Some Deep Representations (SA, AB, RG, TM), pp. 584–592.

ICML-c1-2014-CombesP #algorithm #bound

Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms (RC, AP), pp. 521–529.

ICML-c1-2014-DenisGH #bound #learning #matrix

Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning (FD, MG, AH), pp. 449–457.

ICML-c1-2014-IyerNS #bound #convergence #estimation #kernel

Maximum Mean Discrepancy for Class Ratio Estimation: Convergence Bounds and Kernel Selection (AI, SN, SS), pp. 530–538.

ICML-c1-2014-JainT #bound #independence #learning

(Near) Dimension Independent Risk Bounds for Differentially Private Learning (PJ, AGT), pp. 476–484.

ICML-c2-2014-MuHWG #bound

Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery (CM, BH, JW, DG), pp. 73–81.

ICML-c2-2014-PentinaL #bound #learning

A PAC-Bayesian bound for Lifelong Learning (AP, CHL), pp. 991–999.

ICML-c2-2014-ToshD #bound

Lower Bounds for the Gibbs Sampler over Mixtures of Gaussians (CT, SD), pp. 1467–1475.

ICML-c2-2014-ZoghiWMR #bound #problem

Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem (MZ, SW, RM, MdR), pp. 10–18.

KR-2014-Razgon #bound #on the

On OBDDs for CNFs of Bounded Treewidth (IR).

OOPSLA-2014-RosnerBPKAFK #bound #generative #hybrid #invariant

Bounded exhaustive test input generation from hybrid invariants (NR, VSB, PP, SAK, NA, MFF, SK), pp. 655–674.

SLE-2014-KursLN #bound #semiparsing

Bounded Seas — Island Parsing Without Shipwrecks (JK, ML, ON), pp. 62–81.

ASPLOS-2014-MorrisonA #bound

Fence-free work stealing on bounded TSO processors (AM, YA), pp. 413–426.

PPoPP-2014-ThomsonDB #bound #concurrent #empirical #testing #using

Concurrency testing using schedule bounding: an empirical study (PT, AFD, AB), pp. 15–28.

CAV-2014-BinghamL #bound #fault #simulation #using #verification

Verifying Relative Error Bounds Using Symbolic Simulation (JB, JLH), pp. 277–292.

CAV-2014-InversoT0TP #bound #c #concurrent #lazy evaluation #model checking #multi #source code #thread

Bounded Model Checking of Multi-threaded C Programs via Lazy Sequentialization (OI, ET, BF, SLT, GP), pp. 585–602.

CAV-2014-MadhavanK #bound #functional #source code

Symbolic Resource Bound Inference for Functional Programs (RM, VK), pp. 762–778.

CAV-2014-SinnZV #bound #complexity #scalability #static analysis

A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (MS, FZ, HV), pp. 745–761.

LICS-CSL-2014-GottlobM #bound #logic #problem

Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.

LICS-CSL-2014-HarwathHS #bound #composition #theorem

Preservation and decomposition theorems for bounded degree structures (FH, LH, NS), p. 10.

LICS-CSL-2014-LerouxPS #automaton #bound

Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.

SAT-2014-JarvisaloK #bound

Conditional Lower Bounds for Failed Literals and Related Techniques (MJ, JHK), pp. 75–84.

TAP-2014-KampmannGZ #bound #execution #named #performance #verification

JTACO: Test Execution for Faster Bounded Verification (AK, JPG, AZ), pp. 134–141.

ASE-2013-ChandramohanTBSP #approach #behaviour #bound #detection #modelling #scalability

A scalable approach for malware detection through bounded feature space behavior modeling (MC, HBKT, LCB, LKS, BMP), pp. 312–322.

ASE-2013-ChoDS #bound #composition #model checking #named #source code

BLITZ: Compositional bounded model checking for real-world programs (CYC, VD, DS), pp. 136–146.

ASE-2013-FalkeMS #bound #model checking

The bounded model checker LLBMC (SF, FM, CS), pp. 706–709.

DATE-2013-ShahKA #analysis #bound

Bounding SDRAM interference: detailed analysis vs. latency-rate analysis (HS, AK, BA), pp. 308–313.

DATE-2013-TzouBHC #bound #composition #using

Periodic jitter and bounded uncorrelated jitter decomposition using incoherent undersampling (NT, DB, SWH, AC), pp. 1667–1672.

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-VlachouDNK #algorithm #bound #query

Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.

SIGMOD-2013-YakoutBE #automation #bound #scalability

Don’t be SCAREd: use SCalable Automatic REpairing with maximal likelihood and bounded changes (MY, LBE, AKE), pp. 553–564.

VLDB-2013-AfratiSSU #bound #cost analysis

Upper and Lower Bounds on the Cost of a Map-Reduce Computation (FNA, ADS, SS, JDU), pp. 277–288.

FoSSaCS-2013-BonnetC #bound

Bounded Context-Switching and Reentrant Locking (RB, RC), pp. 65–80.

TACAS-2013-FalkeMS #bound #c #contest #model checking #named #source code #using

LLBMC: Improved Bounded Model Checking of C Programs Using LLVM — (Competition Contribution) (SF, FM, CS), pp. 623–626.

SCAM-2013-MattsenCS #bound

Driving a sound static software analyzer with branch-and-bound (SM, PC, SS), pp. 63–68.

PLDI-2013-CohenP #bound #towards

Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.

STOC-2013-Ajtai #bound #quantifier

Lower bounds for RAMs and quantifier elimination (MA), pp. 803–812.

STOC-2013-AzarCKS #bound #online

Tight bounds for online vector bin packing (YA, IRC, SK, FBS), pp. 961–970.

STOC-2013-BhowmickDL #bound #product line

New bounds for matching vector families (AB, ZD, SL), pp. 823–832.

STOC-2013-BurgisserI #bound #complexity #geometry

Explicit lower bounds via geometric complexity theory (PB, CI), pp. 141–150.

STOC-2013-ChakrabartyS13a #bound #testing

Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (DC, CS), pp. 419–428.

STOC-2013-FeldmanGRVX #algorithm #bound #clique #detection #statistics

Statistical algorithms and a lower bound for detecting planted cliques (VF, EG, LR, SV, YX), pp. 655–664.

STOC-2013-GuptaTW #algorithm #bound #graph

Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.

STOC-2013-GuruswamiX #algebra #bound #geometry

List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound (VG, CX), pp. 843–852.

STOC-2013-KalaiRR #bound

Delegation for bounded space (YTK, RR, RDR), pp. 565–574.

STOC-2013-KomargodskiR #bound

Average-case lower bounds for formula size (IK, RR), pp. 171–180.

STOC-2013-NelsonN #bound

Sparsity lower bounds for dimensionality reducing maps (JN, HLN), pp. 101–110.

STOC-2013-Sherstov #bound #communication #using

Communication lower bounds using directional derivatives (AAS), pp. 921–930.

DLT-2013-Blanchet-SadriW #bound #strict

Strict Bounds for Pattern Avoidance (FBS, BW), pp. 106–117.

ICALP-v1-2013-AndoniNPW #bound #linear #sketching

Tight Lower Bound for Linear Sketches of Moments (AA, HLN, YP, YW), pp. 25–32.

ICALP-v1-2013-BunT #approximate #bound

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (MB, JT), pp. 303–314.

ICALP-v1-2013-CyganP #algorithm #bound #graph #performance

Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.

ICALP-v1-2013-FilmusLMNV #bound #calculus #comprehension #polynomial #towards

Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (Extended Abstract) (YF, ML, MM, JN, MV), pp. 437–448.

ICALP-v1-2013-KumarMN #bound

Arithmetic Circuit Lower Bounds via MaxRank (MK, GM, JS), pp. 661–672.

ICALP-v1-2013-Lampis #bound #graph #model checking

Model Checking Lower Bounds for Simple Graphs (ML), pp. 673–683.

ICALP-v1-2013-Leonardos #bound #complexity #random #recursion

An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.

ICALP-v1-2013-MoruzN #algorithm #bound #random

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (GM, AN), pp. 757–768.

ICALP-v2-2013-BecchettiBDKM #bound #complexity #convergence #proving

Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds (LB, VB, MD, AK, KM), pp. 472–483.

ICALP-v2-2013-MertziosS #bound #evolution #network

Strong Bounds for Evolution in Networks (GBM, PGS), pp. 669–680.

LATA-2013-IbarraR #automaton #bound #on the

On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.

LATA-2013-Tveretina #bound

A Conditional Superpolynomial Lower Bound for Extended Resolution (OT), pp. 559–569.

HCI-IMT-2013-BraunFMSM #bound #gesture

Context-Based Bounding Volume Morphing in Pointing Gesture Application (AB, AF, AM, CS, MM), pp. 147–156.

HILT-2013-Chaki #bound #model checking

Bounded model checking of high-integrity software (SC), pp. 9–10.

ICML-c1-2013-GiguereLMS #algorithm #approach #bound #learning #predict

Risk Bounds and Learning Algorithms for the Regression Approach to Structured Output Prediction (SG, FL, MM, KS), pp. 107–114.

ICML-c1-2013-KumarB #bound #graph #learning

Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs (KSSK, FRB), pp. 525–533.

ICML-c1-2013-KumarLVV #bound

Near-Optimal Bounds for Cross-Validation via Loss Stability (RK, DL, SV, AV), pp. 27–35.

ICML-c1-2013-MaillardNOR #bound #learning #representation

Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning (OAM, PN, RO, DR), pp. 543–551.

ICML-c1-2013-MehtaG #bound #predict

Sparsity-Based Generalization Bounds for Predictive Sparse Coding (NAM, AGG), pp. 36–44.

ICML-c3-2013-DurrantK #bound #classification #fault

Sharp Generalization Error Bounds for Randomly-projected Classifiers (RJD, AK), pp. 693–701.

ICML-c3-2013-HonorioJ #bound #exponential #fault

Two-Sided Exponential Concentration Bounds for Bayes Error Rate and Shannon Entropy (JH, TSJ), pp. 459–467.

ICML-c3-2013-PiresSG #bound #classification #multi

Cost-sensitive Multiclass Classification Risk Bounds (BAP, CS, MG), pp. 1391–1399.

ICML-c3-2013-ZhangYJLH #bound #kernel #learning #online

Online Kernel Learning with a Near Optimal Sparsity Bound (LZ, JY, RJ, ML, XH), pp. 621–629.

KDD-2013-NarasimhanA #bound #named #optimisation

SVMpAUCtight: a new support vector method for optimizing partial AUC based on a tight convex upper bound (HN, SA), pp. 167–175.

MLDM-2013-PrieditisL #bound #classification #performance #problem #using

When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency (AP, ML), pp. 466–480.

SIGIR-2013-TakumaY #bound #performance

Faster upper bounding of intersection sizes (DT, HY), pp. 703–712.

OOPSLA-2013-CoonsMM #bound #partial order #reduction

Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.

SAC-2013-BrancoLR #bound #protocol #scalability

Bounded gossip: a gossip protocol for large-scale datacenters (MB, JL, LR), pp. 591–596.

SAC-2013-LarrosaR #bound #constraints #distributed #optimisation

Risk-neutral bounded max-sum for distributed constraint optimization (JL, ER), pp. 92–97.

CGO-2013-LaiS #analysis #bound #optimisation #performance

Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs (JL, AS), p. 10.

CAV-2013-AlglaveKT #bound #concurrent #model checking #partial order #performance

Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.

CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability

Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.

CSL-2013-BerkholzKV #bound #logic #quantifier

Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.

CSL-2013-GhasemlooC #bound #proving

Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.

ICLP-J-2013-AzizCS #bound #semantics

Stable model semantics for founded bounds (RAA, GC, PJS), pp. 517–532.

ICST-2013-AbadABCFGMMRV #bound #contract #generative #incremental #satisfiability #testing

Improving Test Generation under Rich Contracts by Tight Bounds and Incremental SAT Solving (PA, NA, VSB, DC, MFF, JPG, TSEM, MMM, NR, IV), pp. 21–30.

ISSTA-2013-BindalBL #bound #concurrent #parallel #source code #testing #thread

Variable and thread bounding for systematic testing of multithreaded programs (SB, SB, AL), pp. 145–155.

ISSTA-2013-RosnerGBBRPZF #analysis #bound #invariant #parallel #refinement

Parallel bounded analysis in code with rich invariants by refinement of field bounds (NR, JPG, SB, GMB, SPDR, LP, LZ, MFF), pp. 23–33.

LICS-2013-HeimbergKS #bound #normalisation

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.

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-Lauria #bound #proving #rank #theorem

A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.

SAT-2013-MisraORS #bound #detection #set

Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.

TLCA-2013-Clairambault #bound #linear #reduction

Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.

CASE-2012-KehoeBG #adaptation #bound

Estimating part tolerance bounds based on adaptive Cloud-based grasp planning with slip (BK, DB, KG), pp. 1106–1113.

CASE-2012-ParkM #behaviour #bound #clustering #hybrid #linear #performance #tool support

Performance bounds for hybrid flow lines: Fundamental behavior, practical features and application to linear cluster tools (KP, JRM), pp. 371–376.

DAC-2012-El-ShambakeyR #bound #concurrent #embedded #realtime

STM concurrency control for embedded real-time software with tighter time bounds (MES, BR), pp. 437–446.

DATE-2012-AxerSE #bound #probability

Probabilistic response time bound for CAN messages with arbitrary deadlines (PA, MS, RE), pp. 1114–1117.

DATE-2012-ShahRK #bound #scheduling #using

Bounding WCET of applications using SDRAM with Priority Based Budget Scheduling in MPSoCs (HS, AR, AK), pp. 665–670.

SIGMOD-2012-FraternaliMT #bound

Top-k bounded diversification (PF, DM, MT), pp. 421–432.

VLDB-2012-BailisVFHS #bound

Probabilistically Bounded Staleness for Practical Partial Quorums (PB, SV, MJF, JMH, IS), pp. 776–787.

TACAS-2012-BouajjaniE #analysis #bound #message passing #source code

Bounded Phase Analysis of Message-Passing Programs (AB, ME), pp. 451–465.

TACAS-2012-CordeiroMNF #bound #contest #model checking

Context-Bounded Model Checking with ESBMC 1.17 — (Competition Contribution) (LCC, JM, DN, BF), pp. 534–537.

TACAS-2012-CoxSC #bound #precise #verification

A Bit Too Precise? Bounded Verification of Quantized Digital Filters (AC, SS, BYEC), pp. 33–47.

TACAS-2012-DSilvaHKT #analysis #bound #learning

Numeric Bounds Analysis with Conflict-Driven Learning (VD, LH, DK, MT), pp. 48–63.

TACAS-2012-SinzMF #bound #contest #model checking #named #representation

LLBMC: A Bounded Model Checker for LLVM’s Intermediate Representation — (Competition Contribution) (CS, FM, SF), pp. 542–544.

STOC-2012-AgrawalSSS #bound

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (MA, CS, RS, NS), pp. 599–614.

STOC-2012-BeameBI #bound #trade-off

Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space (PB, CB, RI), pp. 213–232.

STOC-2012-BulanekKS #bound #online #problem

Tight lower bounds for the online labeling problem (JB, MK, MES), pp. 1185–1198.

STOC-2012-ChanP #analysis #bound #fourier #network

Tight bounds for monotone switching networks via fourier analysis (SMC, AP), pp. 495–504.

STOC-2012-FioriniMPTW #bound #exponential #linear

Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.

STOC-2012-GalHKPV #bound

Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates (AG, KAH, MK, PP, EV), pp. 479–494.

STOC-2012-GiakkoupisW #bound #random

A tight RMR lower bound for randomized mutual exclusion (GG, PW), pp. 983–1002.

STOC-2012-WoodruffZ #bound #distributed #functional #monitoring

Tight bounds for distributed functional monitoring (DPW, QZ), pp. 941–960.

AFL-J-2011-IbarraS12 #bound #linear

Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.

CIAA-2012-Gusev #automaton #bound #rank

Synchronizing Automata of Bounded Rank (VVG), pp. 171–179.

CIAA-2012-HeamHK #bound #constraints #on the

On Positive TAGED with a Bounded Number of Constraints (PCH, VH, OK), pp. 329–336.

CIAA-2012-ReidenbachS #automaton #bound #nondeterminism

Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.

DLT-2012-FazekasMS #bound

Hairpin Completion with Bounded Stem-Loop (SZF, RM, KST), pp. 428–439.

ICALP-v1-2012-AchlioptasM #bound #random #satisfiability

Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.

ICALP-v1-2012-ChanLN #bound #fault tolerance #metric

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree (THHC, ML, LN), pp. 182–193.

ICALP-v1-2012-CrowstonJM #bound

Max-Cut Parameterized above the Edwards-Erdős Bound (RC, MJ, MM), pp. 242–253.

ICALP-v1-2012-KapralovP #bound #metric

NNS Lower Bounds via Metric Expansion for l ∞ and EMD (MK, RP), pp. 545–556.

ICALP-v1-2012-Kimmel #bound #quantum

Quantum Adversary (Upper) Bound (SK), pp. 557–568.

ICALP-v1-2012-LaplanteLR #bound #detection #quantum

Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.

ICALP-v1-2012-Marx #bound #multi

A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (DM), pp. 677–688.

ICALP-v2-2012-AtseriasD #approximate #bound #quantifier

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.

ICALP-v2-2012-FearnleyS #bound #game studies

Time and Parallelizability Results for Parity Games with Bounded Treewidth (JF, SS), pp. 189–200.

ICALP-v2-2012-KikotKPZ #bound #exponential #query

Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.

LATA-2012-ReidenbachS #bound

Patterns with Bounded Treewidth (DR, MLS), pp. 468–479.

IFM-2012-RochaBCN #bound #comprehension #debugging #model checking #programming #using

Understanding Programming Bugs in ANSI-C Software Using Bounded Model Checking Counter-Examples (HR, RSB, LCC, ADN), pp. 128–142.

ICML-2012-FoxT #bound

Bounded Planning in Passive POMDPs (RF, NT), p. 15.

ICML-2012-FreitasSZ #bound #exponential #process

Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations (NdF, AJS, MZ), p. 125.

ICML-2012-HoiWZJW #algorithm #bound #kernel #learning #online #performance #scalability

Fast Bounded Online Gradient Descent Algorithms for Scalable Kernel-Based Online Learning (SCHH, JW, PZ, RJ, PW), p. 141.

ICML-2012-JiYLJH #algorithm #bound #fault #learning

A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound (MJ, TY, BL, RJ, JH), p. 110.

ICML-2012-MorvantKR #bound #classification #matrix #multi

PAC-Bayesian Generalization Bound on Confusion Matrix for Multi-Class Classification (EM, SK, LR), p. 158.

ICML-2012-Petrik #approximate #bound #programming #robust

Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds (MP), p. 207.

ICPR-2012-SongZJB #bound #robust #video

Robust video stabilization based on bounded path planning (CS, HZ, WJ, YB), pp. 3684–3687.

KDD-2012-ZhangY #bound #community #detection #matrix

Overlapping community detection via bounded nonnegative matrix tri-factorization (YZ, DYY), pp. 606–614.

KR-2012-GiacomoLP #bound #calculus #decidability #verification

Bounded Situation Calculus Action Theories and Decidable Verification (GDG, YL, FP).

KR-2012-GiordanoMD #bound #model checking

Achieving Completeness in Bounded Model Checking of Action Theories in ASP (LG, AM, DTD).

QAPL-2012-PalamidessiS #algebra #bound #constraints #difference #privacy #relational

Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems (CP, MS), pp. 92–105.

POPL-2012-KrishnaswamiBH #bound #functional #higher-order #programming

Higher-order functional reactive programming in bounded space (NRK, NB, JH), pp. 45–58.

SAC-2012-El-ShambakeyR #bound #concurrent #embedded #manycore #realtime #trade-off

STM concurrency control for multicore embedded real-time software: time bounds and tradeoffs (MES, BR), pp. 1602–1609.

SAC-2012-OliveiraCS #bound #on the #using

On using adversary simulators to obtain tight lower bounds for response times (RSdO, AC, RAS), pp. 1573–1579.

SAC-2012-ShahidPO #bound

Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.

FSE-2012-NearJ #bound #named #verification #web

Rubicon: bounded verification of web applications (JPN, DJ), p. 60.

ICSE-2012-ZhouXZ #bound #named #polynomial #search-based

Stride: Search-based deterministic replay in polynomial time via bounded linkage (JZ, XX, CZ), pp. 892–902.

CC-2012-ShirakoSFPRSS #bound

Analytical Bounds for Optimal Tile Size Selection (JS, KS, NF, LNP, JR, PS, VS), pp. 101–121.

CGO-2012-HasabnisMS #bound

Light-weight bounds checking (NH, AM, RS), pp. 135–144.

CAV-2012-HagueL #analysis #bound #parallel #source code #thread

Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters (MH, AWL), pp. 260–276.

CSL-2012-BertrandFS #bound #satisfiability

Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.

CSL-2012-DudderMRU #bound #combinator #logic

Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.

CSL-2012-Kuroda #axiom #bound #concept #proving

Axiomatizing proof tree concepts in Bounded Arithmetic (SK), pp. 440–454.

ICST-2012-LiuNT #bound #case study #smt #using #verification

Bounded Program Verification Using an SMT Solver: A Case Study (TL, MN, MT), pp. 101–110.

IJCAR-2012-EmmerKKSV #bound #model checking #word

EPR-Based Bounded Model Checking at Word Level (ME, ZK, KK, CS, AV), pp. 210–224.

LICS-2012-BartoKW #bound #constraints

Near Unanimity Constraints Have Bounded Pathwidth Duality (LB, MK, RW), pp. 125–134.

LICS-2012-Berkholz #bound #game studies #testing

Lower Bounds for Existential Pebble Games and k-Consistency Tests (CB), pp. 25–34.

LICS-2012-BundalaOW #bound #model checking #on the

On the Magnitude of Completeness Thresholds in Bounded Model Checking (DB, JO, JW), pp. 155–164.

LICS-2012-EsparzaGM #bound #verification

A Perfect Model for Bounded Verification (JE, PG, RM), pp. 285–294.

LICS-2012-GrigorieffV #algorithm #bound #using

Functionals Using Bounded Information and the Dynamics of Algorithms (SG, PV), pp. 345–354.

SAT-2012-AchlioptasM #algorithm #bound #exponential #random #satisfiability

Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.

TAP-2012-BengoleaAMF #bound #test coverage #testing #using

Using Coverage Criteria on RepOK to Reduce Bounded-Exhaustive Test Suites (VSB, NA, DM, MFF), pp. 19–34.

ASE-2011-IvancicBGSMTIM #bound #framework #named #scalability #verification

DC2: A framework for scalable, scope-bounded software verification (FI, GB, AG, SS, NM, HT, TI, YM), pp. 133–142.

CASE-2011-WuS #bound #multi #problem

A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems (TW, LS), pp. 78–83.

DAC-2011-HaoTSS #analysis #bound #performance #process

Performance bound analysis of analog circuits considering process variations (ZH, SXDT, RS, GS), pp. 310–315.

DATE-2011-LuHCT #bound

Steiner tree based rotary clock routing with bounded skew and capacitive load balancing (JL, VH, XC, BT), pp. 455–460.

DATE-2011-ShahRK #bound #latency #performance

Priority division: A high-speed shared-memory bus arbitration with bounded latency (HS, AR, AK), pp. 1497–1500.

PODS-2011-JowhariST #bound #problem

Tight bounds for Lp samplers, finding duplicates in streams, and related problems (HJ, MS, GT), pp. 49–58.

TACAS-2011-Ehlers #bound #named #synthesis

Unbeast: Symbolic Bounded Synthesis (RE), pp. 272–275.

PEPM-2011-Rinard #bound #probability #program analysis #program transformation #source code

Probabilistic accuracy bounds for perforated programs: a new foundation for program analysis and transformation (MCR), pp. 79–80.

SAS-2011-MonniauxG #bound #fixpoint #model checking #using

Using Bounded Model Checking to Focus Fixpoint Iterations (DM, LG), pp. 369–385.

SAS-2011-ZulegerGSV #abstraction #analysis #bound #imperative #source code

Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.

STOC-2011-AdamaszekCER #bound #order

Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.

STOC-2011-BarakDYW #bound #design #geometry #matrix #rank

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes (BB, ZD, AY, AW), pp. 519–528.

STOC-2011-ChakrabartiR #bound #communication #complexity

An optimal lower bound on the communication complexity of gap-hamming-distance (AC, OR), pp. 51–60.

STOC-2011-FriedmannHZ #algorithm #bound #random

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.

STOC-2011-LeeS #bound

Near-optimal distortion bounds for embedding doubling spaces into L1 (JRL, AS), pp. 765–772.

STOC-2011-LenzenW #bound #parallel #random

Tight bounds for parallel randomized load balancing: extended abstract (CL, RW), pp. 11–20.

STOC-2011-SaxenaS #bound #matter #testing

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn’t matter (NS, CS), pp. 431–440.

STOC-2011-Yoshida #algorithm #approximate #bound #csp

Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.

DLT-J-2009-BealBP11 #automaton #bound #clustering #polynomial #word

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.

DLT-J-2009-Petersen11 #bound #simulation

Simulations by Time-Bounded Counter Machines (HP), pp. 395–409.

AFL-2011-IbarraS #bound #linear

Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.

DLT-2011-KortelainenS #bound #context-free grammar

There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages (JK, TS), pp. 312–323.

ICALP-v1-2011-AdlerKKLST #bound #graph

Tight Bounds for Linkages in Planar Graphs (IA, SGK, PKK, DL, SS, DMT), pp. 110–121.

ICALP-v1-2011-BeyersdorffGLR #bound

Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.

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.

ICALP-v1-2011-CliffordJ #bound #integer #multi #online

Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model (RC, MJ), pp. 593–604.

ICALP-v1-2011-FilmusPS #bound #exponential

Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (YF, TP, RS), pp. 618–629.

ICALP-v1-2011-HarkinsH #algorithm #bound #game studies #learning

Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (RCH, JMH), pp. 416–423.

ICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph

Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.

ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.

ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of #quantum

On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.

ICALP-v2-2011-BrihayeDGORW #automaton #bound #hybrid #on the #reachability

On Reachability for Hybrid Automata over Bounded Time (TB, LD, GG, JO, JFR, JW), pp. 416–427.

ICALP-v2-2011-HalldorssonM #bound #distributed #scheduling

Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model (MMH, PM), pp. 625–636.

ICALP-v2-2011-SchmitzS #bound #multi #recursion

Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.

LATA-2011-Quaas #automaton #bound #on the #problem

On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.

FM-2011-AlbertGGJST #behaviour #bound #concurrent #simulation #worst-case

Simulating Concurrent Behaviors with Worst-Case Cost Bounds (EA, SG, MGZ, EBJ, RS, SLTT), pp. 353–368.

FM-2011-DiosP #bound #certification #memory management #polynomial

Certification of Safe Polynomial Memory Bounds (JdD, RP), pp. 184–199.

SEFM-2011-MorseCNF #bound #ltl #model checking

Context-Bounded Model Checking of LTL Properties for ANSI-C Software (JM, LCC, DN, BF), pp. 302–317.

SEFM-2011-ParrinoGGF #analysis #bound #data flow #satisfiability #verification

A Dataflow Analysis to Improve SAT-Based Bounded Program Verification (BCP, JPG, DG, MFF), pp. 138–154.

CIKM-2011-LiuLH #bound #fault #kernel #learning

Learning kernels with upper bounds of leave-one-out error (YL, SL, YH), pp. 2205–2208.

CIKM-2011-LvZ #bound #normalisation

Lower-bounding term frequency normalization (YL, CZ), pp. 7–16.

ICML-2011-JegelkaB11a #approximate #bound #using

Approximation Bounds for Inference using Cooperative Cuts (SJ, JAB), pp. 577–584.

ICML-2011-LiuI #bound #difference #using

Bounding the Partition Function using Holder’s Inequality (QL, ATI), pp. 849–856.

ICML-2011-MarlinKM #bound #modelling

Piecewise Bounds for Estimating Bernoulli-Logistic Latent Gaussian Models (BMM, MEK, KPM), pp. 633–640.

ICML-2011-RoyLM #bound #polynomial #source code

From PAC-Bayes Bounds to Quadratic Programs for Majority Votes (JFR, FL, MM), pp. 649–656.

ICML-2011-Scott #bound #classification

Surrogate losses and regret bounds for cost-sensitive classification with example-dependent costs (CS), pp. 153–160.

KDD-2011-IfrimW #biology #bound #classification #coordination #predict #sequence

Bounded coordinate-descent for biological sequence classification in high dimensional predictor space (GI, CW), pp. 708–716.

KDD-2011-RaissiP #bound #towards

Towards bounding sequential patterns (CR, JP), pp. 1379–1387.

POPL-2011-BenderskyP #bound #memory management

Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.

POPL-2011-EmmiQR #bound #scheduling

Delay-bounded scheduling (ME, SQ, ZR), pp. 411–422.

ICSE-2011-CordeiroF #bound #concurrent #model checking #multi #smt #thread #using #verification

Verifying multi-threaded software using smt-based context-bounded model checking (LC, BF), pp. 331–340.

CC-2011-JoynerBS #analysis #array #bound

Subregion Analysis and Bounds Check Elimination for High Level Arrays (MJ, ZB, VS), pp. 246–265.

CADE-2011-KorovinV #bound #linear

Solving Systems of Linear Inequalities by Bound Propagation (KK, AV), pp. 369–383.

CAV-2011-KroeningOSWW #bound #linear #model checking

Linear Completeness Thresholds for Bounded Model Checking (DK, JO, OS, TW, JW), pp. 557–572.

CSL-2011-CaiZ #bound

Tight Upper Bounds for Streett and Parity Complementation (YC, TZ), pp. 112–128.

ISSTA-2011-NijjarB #bound #modelling #ruby #verification

Bounded verification of Ruby on Rails data models (JN, TB), pp. 67–77.

LICS-2011-FigueiraFSS #bound #recursion

Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.

RTA-2011-DurandS #bound #linear

Left-linear Bounded TRSs are Inverse Recognizability Preserving (ID, MS), pp. 361–376.

SAT-2011-Williams #algorithm #bound #complexity #satisfiability

Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.

TAP-2011-AguirreBFG #black box #bound #generative #test coverage #testing

Incorporating Coverage Criteria in Bounded Exhaustive Black Box Test Generation of Structural Inputs (NA, VSB, MFF, JPG), pp. 15–32.

ASE-2010-HeJBGW #approach #bound #model checking #statistics

A bounded statistical approach for model checking of unbounded until properties (RH, PJ, SB, APG, HW), pp. 225–234.

CASE-2010-Hsu #bound #markov #safety

Control of continuous-time Markov chains with safety upper bounds (SPH), pp. 990–993.

CASE-2010-WuZ #bound #clustering #petri net #process #scheduling #tool support

Petri net-based scheduling of time-constrained dual-arm cluster tools with bounded activity time variation (NW, MZ), pp. 465–470.

DAC-2010-Breuer #bound #hardware

Hardware that produces bounded rather than exact results (MAB), pp. 871–876.

DAC-2010-LiuKLC #bound #concurrent #multi #thread

Multi-threaded collision-aware global routing with bounded-length maze routing (WHL, WCK, YLL, KYC), pp. 200–205.

DATE-2010-BuLWCL #bound #composition #hybrid #linear #reachability

BACH 2 : Bounded reachability checker for compositional linear hybrid systems (LB, YL, LW, XC, XL), pp. 1512–1517.

DATE-2010-SchlieckerNE #analysis #bound #multi #performance

Bounding the shared resource load for the performance analysis of multiprocessor systems (SS, MN, RE), pp. 759–764.

FoSSaCS-2010-WiesZH #analysis #bound #process

Forward Analysis of Depth-Bounded Processes (TW, DZ, TAH), pp. 94–108.

TACAS-2010-MalinowskiN #automaton #bound #model checking #partial order #satisfiability #semantics

SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.

PEPM-2010-AndersonK #approximate #bound #termination

Regular approximation and bounded domains for size-change termination (HA, SCK), pp. 53–62.

PLDI-2010-GulwaniZ #bound #problem

The reachability-bound problem (SG, FZ), pp. 292–304.

SAS-2010-AliasDFG #bound #complexity #multi #ranking #source code #termination

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.

STOC-2010-BateniHM #approximate #bound #graph

Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.

STOC-2010-ChierichettiLP #bound

Almost tight bounds for rumour spreading with conductance (FC, SL, AP), pp. 399–408.

STOC-2010-DiakonikolasHKMRST #bound #polynomial

Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (ID, PH, AK, RM, PR, RAS, LYT), pp. 533–542.

STOC-2010-Hirai #bound #multi #problem

The maximum multiflow problems with bounded fractionality (HH), pp. 115–120.

STOC-2010-KarninMSV #bound #multi #testing

Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in (ZSK, PM, AS, IV), pp. 649–658.

STOC-2010-Patrascu #bound #polynomial #problem #towards

Towards polynomial lower bounds for dynamic problems (MP), pp. 603–610.

STOC-2010-Raz #bound

Tensor-rank and lower bounds for arithmetic formulas (RR), pp. 659–666.

STOC-2010-Sherstov #bound

Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (AAS), pp. 523–532.

STOC-2010-VerbinZ #bound #memory management

The limits of buffering: a tight lower bound for dynamic membership in the external memory model (EV, QZ), pp. 447–456.

STOC-2010-Williams #bound

Improving exhaustive search implies superpolynomial lower bounds (RW), pp. 231–240.

FLOPS-2010-KetemaS #bound #diagrams #term rewriting #λ-calculus

Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.

AFL-J-2008-MalcherMP10 #array #bound

Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 843–858.

DLT-2010-BremerF #bound #problem

Inclusion Problems for Patterns with a Bounded Number of Variables (JB, DDF), pp. 100–111.

DLT-2010-DrosteV #automaton #bound #logic #multi #theorem

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices (MD, HV), pp. 160–172.

ICALP-v1-2010-GreveJLT #approximate #bound

Cell Probe Lower Bounds and Approximations for Range Mode (MG, AGJ, KDL, JT), pp. 605–616.

ICALP-v2-2010-Fearnley #bound #exponential #policy

Exponential Lower Bounds for Policy Iteration (JF), pp. 551–562.

ICALP-v2-2010-OuaknineW #bound #formal method #towards #verification

Towards a Theory of Time-Bounded Verification (JO, JW), pp. 22–37.

LATA-2010-FlorencioF #approach #bound #consistency

Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.

CHI-2010-AssogbaD #bound #named #programming

Share: a programming environment for loosely bound cooperation (YA, JSD), pp. 961–970.

ECIR-2010-AnderkaSP #bound #similarity #why

Cross-Language High Similarity Search: Why No Sub-linear Time Bound Can Be Expected (MA, BS, MP), pp. 640–644.

ICML-2010-CortesMR10a #bound #kernel #learning

Generalization Bounds for Learning Kernels (CC, MM, AR), pp. 247–254.

ICML-2010-SzitaS #bound #complexity #learning #modelling

Model-based reinforcement learning with nearly tight exploration complexity bounds (IS, CS), pp. 1031–1038.

ICPR-2010-DurrantK #bound #performance

A Bound on the Performance of LDA in Randomly Projected Data Spaces (RJD, AK), pp. 4044–4047.

ICPR-2010-PhamTN #bound #segmentation #similarity #using

Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity (VQP, KT, TN), pp. 4420–4423.

KDD-2010-PrengerLVCH #bound #classification #fault

Class-specific error bounds for ensemble classifiers (RJP, TDL, KRV, BYC, WGH), pp. 843–852.

KR-2010-PichlerRSW #bound #constraints #programming

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).

ICSE-2010-Cordeiro #bound #concurrent #embedded #model checking #multi #smt #thread

SMT-based bounded model checking for multi-threaded software in embedded systems (LC), pp. 373–376.

ICSE-2010-YangL #approach #bound #verification

A cut-off approach for bounded verification of parameterized systems (QY, ML), pp. 345–354.

LCTES-2010-AltmeyerMR #analysis #bound

Resilience analysis: tightening the CRPD bound for set-associative caches (SA, CM, JR), pp. 153–162.

CAV-2010-Ehlers #bound #synthesis

Symbolic Bounded Synthesis (RE), pp. 365–379.

CAV-2010-GantyMM #approximate #bound

Bounded Underapproximations (PG, RM, BM), pp. 600–614.

CAV-2010-Seth #automaton #bound #multi #reachability

Global Reachability in Bounded Phase Multi-stack Pushdown Systems (AS), pp. 615–628.

CAV-2010-ZhouHWG #array #bound #on the

On Array Theory of Bounded Elements (MZ, FH, BYW, MG), pp. 570–584.

ISSTA-2010-GaleottiRPF #analysis #bound #invariant #performance #verification

Analysis of invariants for efficient bounded verification (JPG, NR, CLP, MFF), pp. 25–36.

LICS-2010-JenkinsORW #automaton #bound

Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.

LICS-2010-KreutzerT #bound #complexity #higher-order #logic #monad

Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.

RTA-2010-DurandSS #bound #linear #term rewriting #termination

Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.

RTA-2010-Waldmann #bound #matrix

Polynomially Bounded Matrix Interpretations (JW), pp. 357–372.

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

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

SAT-2010-BoufkhadH #bound #satisfiability

Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold (YB, TH), pp. 99–112.

SAT-2010-MillerKLB #bound #design #encoding #model checking

Encoding Techniques, Craig Interpolants and Bounded Model Checking for Incomplete Designs (CM, SK, MDTL, BB), pp. 194–208.

SAT-2010-RathiARS #bound #random #satisfiability

Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.

VMCAI-2010-ChadhaLPV #bound #complexity #realtime #verification

Complexity Bounds for the Verification of Real-Time Software (RC, AL, PP, MV), pp. 95–111.

VMCAI-2010-Dubrovin #bound #reachability

Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing (JD), pp. 146–162.

ASE-2009-CordeiroFM #bound #embedded #model checking #smt

SMT-Based Bounded Model Checking for Embedded ANSI-C Software (LCC, BF, JMS), pp. 137–148.

DAC-2009-FeySD #bound #fault tolerance #using

Computing bounds for fault tolerance using formal techniques (GF, AS, RD), pp. 190–195.

DATE-2009-FahmyRJ #bound #distributed #memory management #multi #on the #realtime #transaction

On bounding response times under software transactional memory in distributed multiprocessor real-time systems (SFF, BR, EDJ), pp. 688–693.

DATE-2009-PollexKAS #bound #worst-case

Improved worst-case response-time calculations by upper-bound conditions (VP, SK, KA, FS), pp. 105–110.

PODS-2009-BerindeCIS #bound #fault

Space-optimal heavy hitters with strong error bounds (RB, GC, PI, MJS), pp. 157–166.

PODS-2009-GottlobLV #bound #query

Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.

PODS-2009-Yi #bound #query

Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes (KY), pp. 187–196.

VLDB-2009-MoerkotteNS #bound #estimation #fault

Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors (GM, TN, GS), pp. 982–993.

FASE-2009-JagannathLDM #bound #cost analysis #testing

Reducing the Costs of Bounded-Exhaustive Testing (VJ, YYL, BD, DM), pp. 171–185.

FoSSaCS-2009-KupfermanP #automaton #bound

Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.

FoSSaCS-2009-Schewe #automaton #bound #nondeterminism

Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.

TACAS-2009-AtigBQ #analysis #bound #concurrent #source code #thread

Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (MFA, AB, SQ), pp. 107–123.

TACAS-2009-NaumovichBG #bound #named #performance #petri net

ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets (EPN, SB, MG), pp. 50–53.

PLDI-2009-GulwaniJK #analysis #bound #control flow #invariant #refinement

Control-flow refinement and progress invariants for bound analysis (SG, SJ, EK), pp. 375–385.

PLDI-2009-NagarakatteZMZ #bound #c #memory management #named #safety

SoftBound: highly compatible and complete spatial memory safety for c (SN, JZ, MMKM, SZ), pp. 245–258.

PLDI-2009-PetrankMS #bound #parallel #source code

Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.

SAS-2009-NiedzielskiRGP #bound #constraints #control flow

A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination (DN, JvR, AG, KP), pp. 137–153.

STOC-2009-BateniCG #bound

MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.

STOC-2009-DietzfelbingerW #bound

Tight lower bounds for greedy routing in uniform small world rings (MD, PW), pp. 591–600.

STOC-2009-Viola #bound #data type

Bit-probe lower bounds for succinct data structures (EV), pp. 475–482.

DLT-2009-BealP #automaton #bound #clustering #polynomial #word

A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.

DLT-2009-GruberH #bound #complexity #regular expression

Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.

DLT-2009-Petersen #bound #simulation

Simulations by Time-Bounded Counter Machines (HP), pp. 410–418.

DLT-2009-Shur #bound

Two-Sided Bounds for the Growth Rates of Power-Free Languages (AMS), pp. 466–477.

ICALP-v1-2009-Amano #approximate #bound

Bounds on the Size of Small Depth Circuits for Approximating Majority (KA), pp. 59–70.

ICALP-v1-2009-BansalCPK #bound #scalability

Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule (NB, HLC, KP, DK), pp. 144–155.

ICALP-v1-2009-BuhrmanFS #bound

Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.

ICALP-v1-2009-ElsasserS #bound #multi #random

Tight Bounds for the Cover Time of Multiple Random Walks (RE, TS), pp. 415–426.

ICALP-v1-2009-GuhaH #bound #order #random #theorem

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.

ICALP-v1-2009-MastrolilliS #bound #scheduling

Improved Bounds for Flow Shop Scheduling (MM, OS), pp. 677–688.

ICALP-v2-2009-ColcombetZ #automaton #bound

A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.

LATA-2009-Bollig #bound #complexity #integer #multi

Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.

LATA-2009-GauwinNT #bound #concurrent #query

Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.

LATA-2009-ItoLM #bound

Bounded Hairpin Completion (MI, PL, VM), pp. 434–445.

FM-2009-BonakdarpourK #bound #complexity #on the

On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery (BB, SSK), pp. 660–675.

FM-2009-JostLHSH #analysis #bound #using

“Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis (SJ, HWL, KH, NS, MH), pp. 354–369.

FM-2009-PradellaMP #bound #encoding #metric #model checking

A Metric Encoding for Bounded Model Checking (MP, AM, PSP), pp. 741–756.

FM-2009-ShaoKP #approach #bound #formal method #incremental #lightweight #using

An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method (DS, SK, DEP), pp. 757–772.

ICML-2009-Cesa-BianchiGO #bound #classification #robust

Robust bounds for classification via selective sampling (NCB, CG, FO), pp. 121–128.

ICML-2009-ReidW #bound

Surrogate regret bounds for proper losses (MDR, RCW), pp. 897–904.

SAC-2009-ManuchSS #bound #self

Two lower bounds for self-assemblies at temperature 1 (JM, LS, CS), pp. 808–809.

SAC-2009-YipH #bound #consistency #constraints

Length-lex bound consistency for knapsack constraints (JY, PVH), pp. 1397–1401.

CAV-2009-FuhrmannH #bound #induction #on the #proving

On Extending Bounded Proofs to Inductive Proofs (OF, SH), pp. 278–290.

CAV-2009-Gulwani #analysis #bound #complexity #named

SPEED: Symbolic Complexity Bound Analysis (SG), pp. 51–62.

CAV-2009-TorreMP #bound #concurrent #reachability

Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (SLT, PM, GP), pp. 477–492.

CSL-2009-GaboardiP #bound #semantics #using

Upper Bounds on Stream I/O Using Semantic Interpretations (MG, RP), pp. 271–286.

CSL-2009-KuskeL #automation #bound #revisited

Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.

ICST-2009-PostS #bound #equivalence #functional #implementation #model checking #proving #using

Proving Functional Equivalence of Two AES Implementations Using Bounded Model Checking (HP, CS), pp. 31–40.

LICS-2009-CaiZL #automaton #bound

An Improved Lower Bound for the Complementation of Rabin Automata (YC, TZ, HL), pp. 167–176.

LICS-2009-Friedmann #algorithm #bound #exponential #game studies

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.

RTA-2009-BursucC #algebra #bound #protocol #security

Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (SB, HCL), pp. 133–147.

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-LarrosaNOR #bound #branch #generative #optimisation

Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (JL, RN, AO, ERC), pp. 453–466.

TLCA-2009-LagoH #bound #linear #logic #revisited

Bounded Linear Logic, Revisited (UDL, MH), pp. 80–94.

VMCAI-2009-Oshman #bound #model checking

An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking (RO), pp. 275–289.

VMCAI-2009-WimmerBB #bound #generative #markov #model checking #using

Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (RW, BB, BB), pp. 366–380.

ASE-2008-PostSKG #abstract interpretation #bound #model checking

Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking (HP, CS, AK, TG), pp. 188–197.

ASE-2008-PradellaMP #bound #realtime #satisfiability #specification

Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking (MP, AM, PSP), pp. 119–127.

DAC-2008-GuptaK #bound

Bounded-lifetime integrated circuits (PG, ABK), pp. 347–348.

SIGMOD-2008-GemullaL #bound

Sampling time-based sliding windows in bounded space (RG, WL), pp. 379–392.

SIGMOD-2008-NavlakhaRS #bound #fault #graph #summary

Graph summarization with bounded error (SN, RR, NS), pp. 419–432.

ESOP-2008-TerauchiM #bound #linear #programming

Inferring Channel Buffer Bounds Via Linear Programming (TT, AM), pp. 284–298.

FoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using

Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.

TACAS-2008-LalTKR #analysis #bound #concurrent #interprocedural #source code

Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.

TACAS-2008-TorreMP #analysis #bound #concurrent #queue

Context-Bounded Analysis of Concurrent Queue Systems (SLT, PM, GP), pp. 299–314.

PEPM-2008-Mu #algorithm #bound #problem

Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.

PEPM-2008-PopeeaXC #array #bound #precise

A practical and precise inference and specializer for array bound checks elimination (CP, DNX, WNC), pp. 177–187.

PEPM-2008-PuchingerS #automation #bound #source code

Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.

SAS-2008-AlbertAGP #automation #bound #cost analysis

Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (EA, PA, SG, GP), pp. 221–237.

STOC-2008-AttiyaHW #bound #problem

Tight rmr lower bounds for mutual exclusion and other problems (HA, DH, PW), pp. 217–226.

STOC-2008-BansalKN #bound #design #network

Additive guarantees for degree bounded directed network design (NB, RK, VN), pp. 769–778.

STOC-2008-CaiCL #bound #exclamation #polynomial #problem

A quadratic lower bound for the permanent and determinant problem over any characteristic != 2 (JyC, XC, DL), pp. 491–498.

STOC-2008-ChakrabartiCM #bound #communication #robust

Robust lower bounds for communication and stream computation (AC, GC, AM), pp. 641–650.

STOC-2008-ChoiK #bound #complexity #graph #query

Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.

STOC-2008-DinurGKS #bound #morphism

Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.

STOC-2008-DvirSY #bound #trade-off

Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.

STOC-2008-JainKN #bound #communication #complexity #theorem

Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract (RJ, HK, AN), pp. 599–608.

STOC-2008-LauS #approximate #bound #design #network

Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.

STOC-2008-Rao #bound #game studies #parallel

Parallel repetition in projection games and a concentration bound (AR), pp. 1–10.

STOC-2008-Raz #bound

Elusive functions and lower bounds for arithmetic circuits (RR), pp. 711–720.

STOC-2008-Sherstov #bound #communication #matrix #quantum

The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.

AFL-2008-MalcherMP #array #bound

Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 292–301.

DLT-2008-CrochemoreFIJ #bound #string

Bounds on Powers in Strings (MC, SZF, CSI, IJ), pp. 206–215.

DLT-2008-HromkovicS #automaton #bound #nondeterminism #on the #proving

On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (JH, GS), pp. 34–55.

ICALP-A-2008-BansalCLL #bound #scheduling

Scheduling for Speed Bounded Processors (NB, HLC, TWL, LKL), pp. 409–420.

ICALP-A-2008-BjorklundHKK #bound #graph #problem

The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.

ICALP-A-2008-ChildsL #bound #order #quantum

Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.

ICALP-A-2008-GuhaM #bound #multi

Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (SG, AM), pp. 760–772.

ICALP-A-2008-KaleS #bound #graph

An Expansion Tester for Bounded Degree Graphs (SK, CS), pp. 527–538.

ICALP-A-2008-KempeRUW #bound #fault tolerance #quantum

Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing (JK, OR, FU, RdW), pp. 845–856.

ICALP-A-2008-Saxena #bound #testing

Diagonal Circuit Identity Testing and Lower Bounds (NS), pp. 60–71.

ICALP-C-2008-GoyalJPS #bound #encryption #policy

Bounded Ciphertext Policy Attribute Based Encryption (VG, AJ, OP, AS), pp. 579–591.

ICALP-C-2008-WehnerW #bound #composition #security

Composable Security in the Bounded-Quantum-Storage Model (SW, JW), pp. 604–615.

LATA-2008-KorpM #bound #dependence #proving #term rewriting #termination

Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (MK, AM), pp. 321–332.

LATA-2008-Mercer #automaton #bound #finite #quantum

Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.

FM-2008-BonakdarpourK #bound #fault

Masking Faults While Providing Bounded-Time Phased Recovery (BB, SSK), pp. 374–389.

SEFM-2008-PhamTTC #algorithm #bound #java #memory management #performance

A Fast Algorithm to Compute Heap Memory Bounds of Java Card Applets (THP, AHT, NTT, WNC), pp. 259–267.

ICEIS-ISAS2-2008-AlencarSAFF #approach #bound #branch

Maximizing the Business Value of Software Projects — A Branch & Bound Approach (AJA, EAS, EPdA, MCF, ALF), pp. 162–169.

ICML-2008-GomesWP #bound #memory management #modelling #topic

Memory bounded inference in topic models (RG, MW, PP), pp. 344–351.

ICML-2008-OrabonaKC #bound #kernel

The projectron: a bounded kernel-based Perceptron (FO, JK, BC), pp. 720–727.

ICPR-2008-PohK #authentication #bound #fault #multimodal #on the #using

On using error bounds to optimize cost-sensitive multimodal biometric authentication (NP, JK), pp. 1–4.

SEKE-2008-ParkK #automaton #bound #constraints #lts #model checking #using

Using Boolean Cardinality Constraint for LTS Bounded Model Checking (SP, GK), pp. 537–542.

SIGIR-2008-Diaz08b #bound #empirical #metric #robust #similarity

Theoretical bounds on and empirical robustness of score regularization to different similarity measures (FDD), pp. 809–810.

SAC-2008-Andersson #bound #scheduling

The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% (BA), pp. 281–283.

FSE-2008-LivshitsK #bound #named #web

Doloto: code splitting for network-bound web 2.0 applications (VBL, EK), pp. 350–360.

ICSE-2008-FritschSSC #adaptation #bound

Time-bounded adaptation for automotive system software (SF, AS, DCS, SC), pp. 571–580.

ISMM-2008-ChinNPQ #bound #low level #memory management #source code

Analysing memory resource bounds for low-level programs (WNC, HHN, CP, SQ), pp. 151–160.

CAV-2008-LalR #analysis #bound #concurrent

Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis (AL, TWR), pp. 37–51.

CSL-2008-BeyersdorffM #bound

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (OB, SM), pp. 199–214.

CSL-2008-Eisinger #automaton #bound #integer #linear

Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (JE), pp. 431–445.

CSL-2008-PiskacK #bound #linear

Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (RP, VK), pp. 124–138.

ICLP-2008-SchulteS #bound #dynamic analysis

Dynamic Analysis of Bounds Versus Domain Propagation (CS, PJS), pp. 332–346.

IJCAR-2008-Melquiond #bound #proving

Proving Bounds on Real-Valued Functions with Computations (GM), pp. 2–17.

LICS-2008-Moschovakis #axiom #bound

The Axiomatic Derivation of Absolute Lower Bounds (YNM), p. 405.

SAT-2008-KottlerKS08a #bound #np-hard #satisfiability #subclass #using

A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors (SK, MK, CS), pp. 161–167.

TAP-2008-DunetsSR #analysis #bound #data type #relational

Bounded Relational Analysis of Free Data Types (AD, GS, WR), pp. 99–115.

DATE-2007-GrosseKD #bound #functional #model checking

Estimating functional coverage in bounded model checking (DG, UK, RD), pp. 1176–1181.

DATE-2007-SathanurCBMMP #bound #clustering #interactive #performance

Interactive presentation: Efficient computation of discharge current upper bounds for clustered sleep transistor sizing (AVS, AC, LB, AM, EM, MP), pp. 1544–1549.

PODS-2007-GottlobPW #bound #datalog #finite #monad

Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.

PODS-2007-Schweikardt #bound #modelling #query

Machine models and lower bounds for query processing (NS), pp. 41–52.

FoSSaCS-2007-MarnetteKR #bound #constraints #polynomial #set

Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.

FoSSaCS-2007-MuschollW #bound #composition #web #web service

A Lower Bound on Web Services Composition (AM, IW), pp. 274–286.

TACAS-2007-YuCL #bound #diagrams #reachability #using

Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams (AJY, GC, GL), pp. 648–663.

PLDI-2007-MusuvathiQ #bound #parallel #source code #testing #thread

Iterative context bounding for systematic testing of multithreaded programs (MM, SQ), pp. 446–455.

STOC-2007-AttiyaC #bound #random

Tight bounds for asynchronous randomized consensus (HA, KC), pp. 155–164.

STOC-2007-BeameJR #algorithm #bound #random

Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.

STOC-2007-LinialS #bound #communication #complexity

Lower bounds in communication complexity based on factorization norms (NL, AS), pp. 699–708.

STOC-2007-Patrascu #2d #bound

Lower bounds for 2-dimensional range counting (MP), pp. 40–46.

STOC-2007-Santhanam #bound

Circuit lower bounds for Merlin-Arthur classes (RS), pp. 275–283.

STOC-2007-SinghL #approximate #bound

Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.

DLT-2007-MalcherP #bound #complexity #context-free grammar

Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.

ICALP-2007-BjorklundB #bound

Bounded Depth Data Trees (HB, MB), pp. 862–874.

ICALP-2007-BozzelliT #automaton #bound #parametricity #problem

Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.

ICALP-2007-GuhaM #bound #estimation #multi #streaming

Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (SG, AM), pp. 704–715.

ICALP-2007-MontanaroW #bound #communication #complexity #quantum

A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.

LATA-2007-Thorne #bound #finite

Categorial Module Grammars of Bounded Size have Finite Bounded Density (CT), pp. 577–588.

ICML-2007-Hanneke #bound #complexity #learning

A bound on the label complexity of agnostic active learning (SH), pp. 353–360.

ICML-2007-Shah #bound

Sample compression bounds for decision trees (MS), pp. 799–806.

MLDM-2007-SaittaRS #bound #clustering

A Bounded Index for Cluster Validity (SS, BR, IFCS), pp. 174–187.

SAC-2007-Armendariz-InigoJMDM #bound #database #flexibility #protocol #replication

k-bound GSI: a flexible database replication protocol (JEAI, JRJR, JRGdM, HD, FDME), pp. 556–560.

SAC-2007-SausenSLP #bound #multi #network

Bounded-distance multi-coverage backbones in wireless sensor networks (PSS, MAS, AMNdL, AP), pp. 203–208.

CADE-2007-GieslTSS #bound #proving #termination

Proving Termination by Bounded Increase (JG, RT, SS, PSK), pp. 443–459.

CADE-2007-PerezV #bound #effectiveness #encoding #logic #ltl #model checking

Encodings of Bounded LTL Model Checking in Effectively Propositional Logic (JANP, AV), pp. 346–361.

CAV-2007-BouajjaniFQ #analysis #bound #parallel #source code #thread

Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures (AB, SF, SQ), pp. 207–220.

CAV-2007-MalerNP #bound #on the

On Synthesizing Controllers from Bounded-Response Properties (OM, DN, AP), pp. 95–107.

ICLP-2007-NavasMLH #analysis #bound #logic programming #source code

User-Definable Resource Bounds Analysis for Logic Programs (JAN, EM, PLG, MVH), pp. 348–363.

LICS-2007-Schopp #bound #logic

Stratified Bounded Affine Logic for Logarithmic Space (US), pp. 411–420.

RTA-2007-KorpM #bound #proving #term rewriting #termination #using

Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.

SAT-2007-BubeckB #bound #preprocessor

Bounded Universal Expansion for Preprocessing QBF (UB, HKB), pp. 244–257.

SAT-2007-Kojevnikov #bound #linear

Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.

SAT-2007-LangloisST #bound

Horn Upper Bounds and Renaming (ML, RHS, GT), pp. 80–93.

TestCom-FATES-2007-PapSKN #algorithm #bound #finite #generative #incremental #state machine #testing

A Bounded Incremental Test Generation Algorithm for Finite State Machines (ZP, MS, GK, GÁN), pp. 244–259.

VMCAI-2007-PeronH #abstract domain #bound #constraints #matrix

An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (MP, NH), pp. 268–282.

ASE-2006-DengLR #bound #execution #named #symbolic computation

Bogor/Kiasan: A k-bounded Symbolic Execution for Checking Strong Heap Properties of Open Systems (XD, JL, R), pp. 157–166.

DAC-2006-AwedhS #automation #bound #invariant #model checking

Automatic invariant strengthening to prove properties in bounded model checking (MA, FS), pp. 1073–1076.

DAC-2006-PeranandamNRWKR #bound #performance

Fast falsification based on symbolic bounded property checking (PMP, PKN, JR, RJW, TK, WR), pp. 1077–1082.

DAC-2006-WangZ #bound

Optimal jumper insertion for antenna avoidance under ratio upper-bound (JW, HZ), pp. 761–766.

DAC-2006-WuH #bound #constraints #equivalence #mining

Mining global constraints for improving bounded sequential equivalence checking (WW, MSH), pp. 743–748.

DATE-2006-ChakrabortySDMMP #bound #optimisation

Thermal resilient bounded-skew clock tree optimization methodology (AC, PS, KD, AM, EM, MP), pp. 832–837.

PODS-2006-GottlobPW #bound #database #design

Tractable database design through bounded treewidth (GG, RP, FW), pp. 124–133.

PODS-2006-GroheHS #bound #random #scalability #set

Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.

STOC-2006-AmbainisSW #bound #quantum #theorem #trade-off

A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs (AA, RS, RdW), pp. 618–633.

STOC-2006-Antonakopoulos #bound #performance #protocol

Fast leader-election protocols with bounded cheaters’ edge (SA), pp. 187–196.

STOC-2006-ColeG #bound #set

Searching dynamic point sets in spaces with bounded doubling dimension (RC, LAG), pp. 574–583.

STOC-2006-DinurFKO #bound #fourier #on the

On the fourier tails of bounded functions over the discrete cube (ID, EF, GK, RO), pp. 437–446.

STOC-2006-GavinskyKRW #bound #communication #complexity #exponential #identification #quantum

Bounded-error quantum state identification and exponential separations in communication complexity (DG, JK, OR, RdW), pp. 594–603.

STOC-2006-Gurvits #algorithm #approach #bound #proving

Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures: sharper bounds, simpler proofs and algorithmic applications (LG), pp. 417–426.

STOC-2006-Zhang #bound #quantum #random

New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.

FLOPS-2006-Avery #analysis #bound #termination

Size-Change Termination and Bound Analysis (JA), pp. 192–207.

DLT-2006-BellP #bound #matrix

Lowering Undecidability Bounds for Decision Questions in Matrices (PB, IP), pp. 375–385.

DLT-2006-GruberH #bound #complexity #nondeterminism

Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.

DLT-2006-ItoLS #bound

Closure of Language Classes Under Bounded Duplication (MI, PL, KST), pp. 238–247.

ICALP-v1-2006-BaierEHKSS #bound

Length-Bounded Cuts and Flows (GB, TE, AH, EK, HS, MS), pp. 679–690.

ICALP-v1-2006-CaragiannisFKKM #bound

Tight Bounds for Selfish and Greedy Load Balancing (IC, MF, CK, PK, LM), pp. 311–322.

ICALP-v1-2006-CarrollGM #bound #graph

Embedding Bounded Bandwidth Graphs into l1 (DEC, AG, AM), pp. 27–37.

ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate #bound

A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.

ICALP-v1-2006-Golynski #bound #rank

Optimal Lower Bounds for Rank and Select Indexes (AG), pp. 370–381.

ICALP-v1-2006-KojevnikovI #bound #calculus #proving

Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.

ICALP-v1-2006-Wolf #bound #matrix #quantum

Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.

ICALP-v2-2006-HarnikN #bound #hybrid #on the #security

On Everlasting Security in the Hybrid Bounded Storage Model (DH, MN), pp. 192–203.

ICALP-v2-2006-Pietrzak #bound

A Tight Bound for EMAC (KP), pp. 168–179.

ICALP-v2-2006-Yan #automaton #bound

Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (QY), pp. 589–600.

ICML-2006-Banerjee #bound #on the

On Bayesian bounds (AB), pp. 81–88.

ICML-2006-MoghaddamWA #bound

Generalized spectral bounds for sparse LDA (BM, YW, SA), pp. 641–648.

ICPR-v2-2006-SaragihG #bound #fault

Iterative Error Bound Minimisation for AAM Alignment (JS, RG), pp. 1192–1195.

SEKE-2006-OgataKF #bound

Falsification of OTSs by Searches of Bounded Reachable State Spaces (KO, WK, KF), pp. 440–445.

SAC-2006-Capron #bound #static analysis

Static analysis of time bounded reactive properties of Boolean symbols (GC), pp. 1827–1834.

SAC-2006-WuRJ #bound #embedded #energy #on the #realtime

On bounding energy consumption in dynamic, embedded real-time systems (HW, BR, EDJ), pp. 933–934.

ICSE-2006-DhurjatiA #array #bound #c

Backwards-compatible array bounds checking for C with very low overhead (DD, VSA), pp. 162–171.

HPDC-2006-DjerrahCCR #bound #framework #optimisation #problem

Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods (AD, BLC, VDC, CR), pp. 369–370.

PPoPP-2006-BrevikNW #bound #parallel #predict

Predicting bounds on queuing delay for batch-scheduled parallel machines (JB, DN, RW), pp. 110–118.

CAV-2006-BurckhardtAM #bound #case study #concurrent #data type #memory management #model checking #modelling

Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study (SB, RA, MMKM), pp. 489–502.

CAV-2006-HeljankoJKLL #automaton #bound #model checking

Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.

IJCAR-2006-DyckhoffKL #bound #calculus #logic

Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (RD, DK, SL), pp. 347–361.

LICS-2006-BojanczykC #bound

Bounds in w-Regularity (MB, TC), pp. 285–296.

LICS-2006-LaurentF #bound #clique #complexity #semantics

Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity (OL, LTdF), pp. 179–188.

LICS-2006-MacielP #bound #composition #proving

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.

LICS-2006-SchroderP #bound #logic

PSPACE Bounds for Rank-1 Modal Logics (LS, DP), pp. 231–242.

RTA-2006-LevySV #bound #higher-order #unification

Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.

SAT-2006-ZabiyakaD #bound #complexity #dependence #functional

Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (YZ, AD), pp. 116–129.

TestCom-2006-BerradaCFS #bound #realtime #testing #using

Test Case Minimization for Real-Time Systems Using Timed Bound Traces (IB, RC, PF, AS), pp. 289–305.

TestCom-2006-Ipate #bound #finite #nondeterminism #sequence #state machine #testing

Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.

DAC-2005-LiSB #bound #effectiveness #problem

Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.

DATE-2005-KatzHD #bound #model checking

Space-Efficient Bounded Model Checking (JK, ZH, ND), pp. 686–687.

DATE-2005-ManquinhoM #bound #effectiveness #optimisation #pseudo

Effective Lower Bounding Techniques for Pseudo-Boolean Optimization (VMM, JPMS), pp. 660–665.

DATE-2005-Marculescu #bound #design #energy #fault tolerance

Energy Bounds for Fault-Tolerant Nanoscale Designs (DM), pp. 74–79.

DATE-2005-MartinelliD #bound #composition #set

Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition (AM, ED), pp. 430–431.

PODS-2005-GroheS #bound #memory management #random #sorting

Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.

SIGMOD-2005-PolJ #bound #relational

Relational Confidence Bounds Are Easy With The Bootstrap (AP, CJ), pp. 587–598.

ESOP-2005-ChanderEILN #bound #dynamic analysis #verification

Enforcing Resource Bounds via Static Verification of Dynamic Checks (AC, DE, NI, PL, GCN), pp. 311–325.

TACAS-2005-QadeerR #bound #concurrent #model checking

Context-Bounded Model Checking of Concurrent Software (SQ, JR), pp. 93–107.

TACAS-2005-SharmaPC #bound #logic

Bounded Validity Checking of Interval Duration Logic (BS, PKP, SC), pp. 301–316.

STOC-2005-Alekhnovich #bound #random

Lower bounds for k-DNF resolution on random 3-CNFs (MA), pp. 251–256.

STOC-2005-CryanDR #approximate #bound

Approximately counting integral flows and cell-bounded contingency tables (MC, MED, DR), pp. 413–422.

STOC-2005-GafniGP #adaptation #bound #complexity #set

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement (EG, RG, BP), pp. 714–722.

STOC-2005-KouckyPT #bound

Bounded-depth circuits: separating wires from gates (MK, PP, DT), pp. 257–265.

CIAA-2005-CanoG #automaton #bound #constant #finite

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.

ICALP-2005-Ambuhl #algorithm #bound #energy #network #performance

An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks (CA), pp. 1139–1150.

ICALP-2005-BeamePS #bound #communication #complexity #multi

Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (PB, TP, NS), pp. 1176–1188.

ICALP-2005-ChattopadhyayH #bound #composition #symmetry

Lower Bounds for Circuits with Few Modular and Symmetric Gates (AC, KAH), pp. 994–1005.

ICALP-2005-CzeizlerK #automaton #bound #linear

A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.

ICALP-2005-DiehlM #bound #polynomial #random

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines (SD, DvM), pp. 982–993.

ICALP-2005-FialaGK #bound #distance #graph

Distance Constrained Labelings of Graphs of Bounded Treewidth (JF, PAG, JK), pp. 360–372.

ICALP-2005-FordG #bound #communication #complexity #multi

Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity (JF, AG), pp. 1163–1175.

ICALP-2005-GroheKS #bound #memory management #query #streaming

Tight Lower Bounds for Query Processing on Streaming and External Memory Data (MG, CK, NS), pp. 1076–1088.

ICALP-2005-HorvitzK #black box #bound #performance

Bounds on the Efficiency of “Black-Box” Commitment Schemes (OH, JK), pp. 128–139.

ICALP-2005-KoiranNP #bound #complexity #problem #quantum #query

A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.

ICALP-2005-TamassiaT #bound #security

Computational Bounds on Hierarchical Data Processing with Applications to Information Security (RT, NT), pp. 153–165.

ICALP-2005-WehnerW #bound #information retrieval

Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval (SW, RdW), pp. 1424–1436.

CEFP-2005-Hammond #approach #behaviour #bound #functional #programming

Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach (KH), pp. 100–134.

CIKM-2005-Yeh #bound

An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription (JhY), pp. 285–286.

ICML-2005-JoachimsH #bound #clustering #correlation #fault

Error bounds for correlation clustering (TJ, JEH), pp. 385–392.

ICML-2005-KaariainenL #bound #comparison #fault

A comparison of tight generalization error bounds (MK, JL), pp. 409–416.

ICML-2005-LavioletteM #bound #classification

PAC-Bayes risk bounds for sample-compressed Gibbs classifiers (FL, MM), pp. 481–488.

ICML-2005-McMahanLG #bound #performance #programming #realtime

Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees (HBM, ML, GJG), pp. 569–576.

ICML-2005-SzepesvariM #bound #finite

Finite time bounds for sampling based fitted value iteration (CS, RM), pp. 880–887.

CGO-2005-BrueningA #bound #capacity #consistency #maintenance

Maintaining Consistency and Bounding Capacity of Software Code Caches (DB, SPA), pp. 74–85.

LCTES-2005-DefoeCC #bound

Upper bound for defragmenting buddy heaps (DCD, SRC, RC), pp. 222–229.

SAT-J-2004-PorschenS05 #bound #problem

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.

CAV-2005-GuptaS #abstraction #bound #model checking #refinement

Abstraction Refinement for Bounded Model Checking (AG, OS), pp. 112–124.

CAV-2005-HeljankoJL #bound #incremental #model checking

Incremental and Complete Bounded Model Checking for Full PLTL (KH, TAJ, TL), pp. 98–111.

CAV-2005-RabinovitzG #bound #concurrent #model checking #source code

Bounded Model Checking of Concurrent Programs (IR, OG), pp. 82–97.

CSL-2005-CharatonikGM #bound #model checking #pointer #source code

Bounded Model Checking of Pointer Programs (WC, LG, PM), pp. 397–412.

CSL-2005-Kolokolova #bound

Closure Properties of Weak Systems of Bounded Arithmetic (AK), pp. 369–383.

RTA-2005-BonfanteMM #bound

Quasi-interpretations and Small Space Bounds (GB, JYM, JYM), pp. 150–164.

SAT-2005-DantsinW #bound #satisfiability

An Improved Upper Bound for SAT (ED, AW), pp. 400–407.

SAT-2005-DershowitzHK #bound #model checking

Bounded Model Checking with QBF (ND, ZH, JK), pp. 408–414.

SAT-2005-Gelder #bound #distance #proving

Input Distance and Lower Bounds for Propositional Resolution Proof Length (AVG), pp. 282–293.

SAT-2005-HeuleM #bound #linear #programming #random #satisfiability #using

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.

SAT-2005-MneimnehLASS #algorithm #bound #satisfiability

A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.

SAT-2005-Zarpas #benchmark #bound #metric #model checking #satisfiability

Benchmarking SAT Solvers for Bounded Model Checking (EZ), pp. 340–354.

VMCAI-2005-AbrahamBKS #bound #hybrid #linear #model checking #optimisation

Optimizing Bounded Model Checking for Linear Hybrid Systems (EÁ, BB, FK, MS), pp. 396–412.

VMCAI-2005-LatvalaBHJ #bound #ltl #model checking #performance

Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.

DAC-2004-WangJHS #bound #model checking #satisfiability

Refining the SAT decision ordering for bounded model checking (CW, HJ, GDH, FS), pp. 535–538.

DATE-v1-2004-AlmukhaizimDM #bound #concurrent #detection #fault #latency #on the

On Concurrent Error Detection with Bounded Latency in FSMs (SA, PD, YM), pp. 596–603.

DATE-v1-2004-BaumgartnerK #bound

Enhanced Diameter Bounding via Structural (JB, AK), pp. 36–41.

VLDB-2004-KoudasOT0 #approximate #bound #fault #performance #query

Approximate NN queries on Streams with Guaranteed Error/performance Bounds (NK, BCO, KLT, RZ), pp. 804–815.

VLDB-2004-RossS #bound #database #multi #symmetry

Symmetric Relations and Cardinality-Bounded Multisets in Database Systems (KAR, JS), pp. 912–923.

FoSSaCS-2004-LuttgenV #bisimulation #bound

Bisimulation on Speed: Lower Time Bounds (GL, WV), pp. 333–347.

TACAS-2004-BaierHHK #bound #markov #performance #process #reachability

Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes (CB, BRH, HH, JPK), pp. 61–76.

TACAS-2004-BehrmannBLP #abstraction #automaton #bound

Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.

TACAS-2004-RaviS #bound #model checking

Minimal Assignments for Bounded Model Checking (KR, FS), pp. 31–45.

PLDI-2004-VenetB #array #bound #c #embedded #performance #precise #scalability #source code

Precise and efficient static array bound checking for large embedded C programs (AV, GPB), pp. 231–242.

STOC-2004-Aaronson04a #bound #quantum

Lower bounds for local search by quantum arguments (SA), pp. 465–474.

STOC-2004-AilonC #bound #linear #testing

Lower bounds for linear degeneracy testing (NA, BC), pp. 554–560.

STOC-2004-ChenHKX #bound #linear #reduction

Linear FPT reductions and computational lower bounds (JC, XH, IAK, GX), pp. 212–221.

STOC-2004-ChenKLRSV #bound #confluence #theorem

(Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.

STOC-2004-Elkin #approximate #bound #distributed #problem #trade-off

Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (ME), pp. 331–340.

STOC-2004-Kelner #bound #clustering #graph

Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (JAK), pp. 455–464.

STOC-2004-Pass #bound #multi

Bounded-concurrent secure multi-party computation with a dishonest majority (RP), pp. 232–241.

STOC-2004-PatrascuD #bound

Lower bounds for dynamic connectivity (MP, EDD), pp. 546–553.

CIAA-2004-CampeanuP #automaton #bound #nondeterminism

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.

ICALP-2004-AlekhnovichHI #algorithm #bound #exponential #satisfiability

Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.

ICALP-2004-BlundoDS #bound #self

Definitions and Bounds for Self-Healing Key Distribution Schemes (CB, PD, ADS), pp. 234–245.

ICALP-2004-Fleischer #algorithm #bound #linear #network

Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks (LF), pp. 544–554.

ICALP-2004-FlumGW #bound #nondeterminism #parametricity

Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits (JF, MG, MW), pp. 555–567.

ICALP-2004-MelkebeekR #bound #satisfiability

A Time Lower Bound for Satisfiability (DvM, RR), pp. 971–982.

ICALP-2004-Midrijanis #bound #polynomial #problem #quantum #query #set #similarity

A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.

ICALP-2004-SandersSS #bound #migration #online #scheduling

Online Scheduling with Bounded Migration (PS, NS, MS), pp. 1111–1122.

ICALP-2004-Zhang #bound #on the #power of

On the Power of Ambainis’s Lower Bounds (SZ), pp. 1238–1250.

SEFM-2004-FlakeM #bound #ocl

Past- and Future-Oriented Time-Bounded Temporal Properties with OCL (SF, WM), pp. 154–163.

ICML-2004-ConitzerS #bound #communication #complexity #game studies #learning

Communication complexity as a lower bound for learning in games (VC, TS).

ICML-2004-RuckertK #bound #learning #towards

Towards tight bounds for rule learning (UR, SK).

ICPR-v1-2004-GokcenJD #bound #learning

Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning (IG, DJ, JRD), pp. 172–175.

ICPR-v1-2004-KangD #approximate #bound #classification #fault

Product Approximation by Minimizing the Upper Bound of Bayes Error Rate for Bayesian Combination of Classifiers (HJK, DSD), pp. 252–255.

ICPR-v3-2004-DePiero #bound #graph #memory management #polynomial #worst-case

Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort (FWD), pp. 379–382.

ICPR-v4-2004-FarenzenaBFB #bound #re-engineering

Rigorous Accuracy Bounds for Calibrated Stereo Reconstruction (MF, AB, AF, AB), pp. 288–292.

ICPR-v4-2004-ShihKG #analysis #bound #fault #image

An Error Bound of Relative Image Blur Analysis (SWS, PSK, WSG), pp. 100–103.

KDD-2004-XiongSTK #bound #correlation #identification

Exploiting a support-based upper bound of Pearson’s correlation coefficient for efficiently identifying strongly correlated pairs (HX, SS, PNT, VK), pp. 334–343.

KR-2004-EiterFFPW #bound #complexity #model checking #programming #set

Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming (TE, WF, MF, GP, SW), pp. 377–387.

RE-2004-LinNIJ #bound #problem #security #using

Using Abuse Frames to Bound the Scope of Security Problems (LL, BN, DCI, MJ), pp. 354–355.

SAC-2004-MichaelsonHS #automaton #bound #named #programming #using

FSM-Hume: programming resource-limited systems using bounded automata (GM, KH, JS), pp. 1455–1461.

ASPLOS-2004-SmolensGKFHN #bound #detection #latency #named

Fingerprinting: bounding soft-error detection latency and bandwidth (JCS, BTG, JK, BF, JCH, AN), pp. 224–234.

CAV-2004-AwedhS #bound #model checking #proving

Proving More Properties with Bounded Model Checking (MA, FS), pp. 96–108.

CAV-2004-GanaiGA #bound #embedded #model checking #modelling #performance

Efficient Modeling of Embedded Memories in Bounded Model Checking (MKG, AG, PA), pp. 440–452.

CAV-2004-JinAS #bound #model checking #named #satisfiability #towards

CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking (HJ, MA, FS), pp. 519–522.

CSL-2004-AmadioCDJ #bound #bytecode #functional #verification

A Functional Scenario for Bytecode Verification of Resource Bounds (RMA, SCG, SDZ, LJ), pp. 265–279.

CSL-2004-Bojanczyk #bound #quantifier

A Bounding Quantifier (MB), pp. 41–55.

CSL-2004-Skelley #bound #higher-order

A Third-Order Bounded Arithmetic Theory for PSPACE (AS), pp. 340–354.

LICS-2004-SeshiaB #bound #quantifier #using

Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.

RTA-2004-Waldmann #bound #named #string

Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.

SAT-2004-ManquinhoM #bound #optimisation #pseudo #satisfiability #using

Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (VMM, JPMS), pp. 120–126.

VMCAI-2004-ClarkeKOS #bound #complexity #model checking

Completeness and Complexity of Bounded Model Checking (EMC, DK, JO, OS), pp. 85–96.

DAC-2003-AgarwalBZV #bound #refinement #statistics

Computation and Refinement of Statistical Bounds on Circuit Delay (AA, DB, VZ, SBKV), pp. 348–353.

DAC-2003-ClarkeKY #behaviour #bound #c #consistency #model checking #source code #using

Behavioral consistency of C and verilog programs using bounded model checking (EMC, DK, KY), pp. 368–371.

DAC-2003-GuptaGWYA #bound #learning #model checking #satisfiability

Learning from BDDs in SAT-based bounded model checking (AG, MKG, CW, ZY, PA), pp. 824–829.

DATE-2003-AgarwalBZV #analysis #bound #statistics #using

Statistical Timing Analysis Using Bounds (AA, DB, VZ, SBKV), pp. 10062–10067.

DATE-2003-CabodiNQ #approximate #bound #model checking #satisfiability #traversal

Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals (GC, SN, SQ), pp. 10898–10905.

DATE-2003-EbendtGD #bound

Combination of Lower Bounds in Exact BDD Minimization (RE, WG, RD), pp. 10758–10763.

DRR-2003-Fan #bound #parametricity

Text extraction via an edge-bounded averaging and a parametric character model (JF), pp. 8–19.

ICDAR-2003-CaoDL #approach #bound #documentation #image #modelling

Rectifying the Bound Document Image Captured by the Camera: A Model Based Approach (HC, XD, CL), pp. 71–75.

PODS-2003-Segoufin #bound #complexity #documentation #query #type system #xml

Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.

TACAS-2003-AmlaKMM #analysis #bound #model checking

Experimental Analysis of Different Techniques for Bounded Model Checking (NA, RPK, KLM, RM), pp. 34–48.

TACAS-2003-BartzisB #bound #constraints #performance

Construction of Efficient BDDs for Bounded Arithmetic Constraints (CB, TB), pp. 394–408.

TACAS-2003-BenedettiC #bound #ltl #model checking

Bounded Model Checking for Past LTL (MB, AC), pp. 18–33.

STOC-2003-Bar-Yossef #bound

Sampling lower bounds via information theory (ZBY), pp. 335–344.

STOC-2003-FakcharoenpholRT #approximate #bound #metric

A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.

STOC-2003-FatourouFR #bound #implementation #multi

A tight time lower bound for space-optimal implementations of multi-writer snapshots (PF, FEF, ER), pp. 259–268.

STOC-2003-GalR #bound

Lower bounds on the amount of randomness in private computation (AG, AR), pp. 659–666.

STOC-2003-GennaroGK #bound #encryption #performance

Lower bounds on the efficiency of encryption and digital signature schemes (RG, YG, JK), pp. 417–425.

STOC-2003-JayramKKR #bound #problem

Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.

STOC-2003-KabanetsI #bound #polynomial #proving #testing

Derandomizing polynomial identity tests means proving circuit lower bounds (VK, RI), pp. 355–364.

STOC-2003-KerenidisW #bound #exponential #quantum

Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.

STOC-2003-KonemannR #approximate #bound

Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.

STOC-2003-Lindell #bound

Bounded-concurrent secure two-party computation without setup assumptions (YL), pp. 683–692.

STOC-2003-ODonnellS #bound #polynomial

New degree bounds for polynomial threshold functions (RO, RAS), pp. 325–334.

STOC-2003-SauerhoffW #bound #graph #integer #multi #trade-off

Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (MS, PW), pp. 186–195.

DLT-2003-Giammarresi #bound #set

Computing Languages by (Bounded) Local Sets (DG), pp. 304–315.

ICALP-2003-AmirACLP #algorithm #bound

Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.

ICALP-2003-HoyerMW #bound #quantum

Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.

ICALP-2003-RybinaV #bound #formal method

Upper Bounds for a Theory of Queues (TR, AV), pp. 714–724.

ICFP-2003-Simonet #bound #data type

An extension of HM(X) with bounded existential and universal data-types (VS), pp. 39–50.

ICML-2003-ConitzerS03a #bound #framework #game studies #named

BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (VC, TS), pp. 91–98.

ICML-2003-Munos #approximate #bound #fault #policy

Error Bounds for Approximate Policy Iteration (RM), pp. 560–567.

ICML-2003-SalakhutdinovR #adaptation #bound #optimisation

Adaptive Overrelaxed Bound Optimization Methods (RS, STR), pp. 664–671.

PPDP-2003-GrecoZ #bound #datalog #on the #performance #query

On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.

SAC-2003-RaidlJ #algorithm #bound #heuristic #problem

Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.

CADE-2003-Schmidt-Schauss #bound #decidability #higher-order

Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.

CAV-2003-MouraRS #bound #induction #model checking #verification

Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) (LMdM, HR, MS), pp. 14–26.

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

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

VMCAI-2003-UnnikrishnanSL #analysis #bound

Optimized Live Heap Bound Analysis (LU, SDS, YAL), pp. 70–85.

DAC-2002-CabodiCQ #bound #model checking #question #satisfiability

Can BDDs compete with SAT solvers on bounded model checking? (GC, PC, SQ), pp. 117–122.

PODS-2002-Chirkova #bound #problem #query

The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views (RC), pp. 159–168.

FoSSaCS-2002-JancarKMS #automaton #bound #proving

Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.

FoSSaCS-2002-LohreyM #bound #communication

Bounded MSC Communication (ML, AM), pp. 295–309.

PEPM-2002-GomezL #analysis #automation #bound #higher-order

Automatic time-bound analysis for a higher-order language (GG, YAL), pp. 75–86.

STOC-2002-Aaronson #bound #problem #quantum

Quantum lower bound for the collision problem (SA), pp. 635–642.

STOC-2002-Ben-Sasson02a #bound

Hard examples for bounded depth frege (EBS), pp. 563–572.

STOC-2002-DziembowskiM #bound #proving #security

Tight security proofs for the bounded-storage model (SD, UMM), pp. 341–350.

STOC-2002-Kontogiannis #algorithm #bound #online #scheduling

Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines (SCK), pp. 124–133.

STOC-2002-Raz02a #bound #principle

Resolution lower bounds for the weak pigeonhole principle (RR), pp. 553–562.

STOC-2002-SaksS #approximate #bound #data type #distance

Space lower bounds for distance approximation in the data stream model (MES, XS), pp. 360–369.

DLT-2002-DoL #bound #on the #product line

On a Family of Codes with Bounded Deciphering Delay (DLV, IL), pp. 369–380.

DLT-2002-Domaratzki #automaton #bound #finite

Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.

DLT-2002-SasakiIIW #2d #bound #probability #turing machine

A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines (YS, KI, AI, YW), pp. 185–196.

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

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

ICALP-2002-BermanK #approximate #bound

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.

ICALP-2002-ChristerssonGL #ad hoc #bound #network

Gossiping with Bounded Size Messages in ad hoc Radio Networks (MC, LG, AL), pp. 377–389.

ICALP-2002-DemetrescuI #bound #trade-off

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.

ICALP-2002-EpsteinSS #bound #online

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing (LE, SSS, RvS), pp. 306–317.

ICALP-2002-EstebanGM #bound #complexity #on the

On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.

ICALP-2002-GarganoHSV #bound #branch

Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.

ICALP-2002-GrigorievHP #algebra #bound #exponential #proving

Exponential Lower Bound for Static Semi-algebraic Proofs (DG, EAH, DVP), pp. 257–268.

ICALP-2002-ImpagliazzoS #axiom #bound #simulation

Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations (RI, NS), pp. 208–219.

ICALP-2002-Radzik #bound #network

Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network (TR), pp. 611–622.

ICML-2002-GargHR #bound #on the

On generalization bounds, projection profile, and margin distribution (AG, SHP, DR), pp. 171–178.

ICML-2002-Langford #bound #testing

Combining Trainig Set and Test Set Bounds (JL), pp. 331–338.

ICML-2002-ZhangL #bound #network

Representational Upper Bounds of Bayesian Networks (HZ, CXL), pp. 674–681.

ICPR-v1-2002-WechslerDLC #bound #predict #using

Motion Prediction Using VC-Generalization Bounds (HW, ZD, FL, VC), pp. 151–154.

ICPR-v2-2002-FrantiVK #bound #clustering

Branch-and-Bound Technique for Solving Optimal Clustering (PF, OV, TK), pp. 232–235.

POPL-2002-Boehm #bound #garbage collection

Bounding space usage of conservative garbage collectors (HJB), pp. 93–100.

CC-2002-QianHV #approach #array #bound #java

A Comprehensive Approach to Array Bounds Check Elimination for Java (FQ, LJH, CV), pp. 325–342.

CADE-2002-MouraRS #bound #infinity #lazy evaluation #model checking #proving #theorem proving

Lazy Theorem Proving for Bounded Model Checking over Infinite Domains (LMdM, HR, MS), pp. 438–455.

CAV-2002-BinghamH #bound #model checking

Semi-formal Bounded Model Checking (JDB, AJH), pp. 280–294.

CSL-2002-MarcinkowskiT #bound #complexity #game studies #ltl

Optimal Complexity Bounds for Positive LTL Games (JM, TT), pp. 262–275.

CSL-2002-Schmidt-SchaussS #bound #decidability #higher-order #unification

Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.

ISSTA-2002-Bishop #bound #reliability

Rescaling reliability bounds for a new operational profile (PGB), pp. 180–190.

RTA-2002-Tahhan-Bittar #bound #confluence #recursion #term rewriting

Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.

SAT-2002-Schoening #bound #satisfiability

New worst case bounds on k-SAT (Keynote Talk) (US), p. 1.

ICDAR-2001-ZhangT #bound #documentation #image

Recovery of Distorted Document Images from Bound Volumes (ZZ, CLT), pp. 429–433.

TACAS-2001-Carvajal-SchiaffinoDC #bound #petri net #validation

Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets (RCS, GD, GC), pp. 435–449.

STOC-2001-Ambainis #bound #protocol #quantum

A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.

STOC-2001-Bar-YossefKS #algorithm #bound

Sampling algorithms: lower bounds and applications (ZBY, RK, DS), pp. 266–275.

STOC-2001-BolligW #bound #branch #integer #multi #using

A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.

STOC-2001-ChazelleL #bound

Lower bounds for intersection searching and fractional cascading in higher dimension (BC, DL), pp. 322–329.

STOC-2001-IckingM #3d #bound #complexity #diagrams #distance

A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D (CI, LM), pp. 316–321.

STOC-2001-LachishR #bound

Explicit lower bound of 4.5n — o(n) for boolena circuits (OL, RR), pp. 399–408.

STOC-2001-PitassiR #bound #principle

Regular resolution lower bounds for the weak pigeonhole principle (TP, RR), pp. 347–355.

STOC-2001-RazS #bound #matrix

Lower bounds for matrix product, in bounded depth circuits with arbitrary gates (RR, AS), pp. 409–418.

STOC-2001-Trevisan #bound #optimisation #problem

Non-approximability results for optimization problems on bounded degree instances (LT), pp. 453–461.

CIAA-2001-FarreG #bound #parsing

Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers (JF, JFG), pp. 101–114.

ICALP-2001-AtseriasBE #bound

Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution (AA, MLB, JLE), pp. 1005–1016.

ICALP-2001-Blaser #algebra #bound

Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical (MB), pp. 79–91.

ICALP-2001-BuhrmanTV #bound #simulation

Time and Space Bounds for Reversible Simulation (HB, JT, PMBV), pp. 1017–1027.

ICALP-2001-ChakrabartiK #bound #complexity #graph #random

Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.

ICALP-2001-EngebretsenK #approximate #bound #metric

Approximation Hardness of TSP with Bounded Metrics (LE, MK), pp. 201–212.

ICALP-2001-SenV #bound #quantum

Lower Bounds in the Quantum Cell Probe Model (PS, SV), pp. 358–369.

ICML-2001-Geibel #bound #learning

Reinforcement Learning with Bounded Risk (PG), pp. 162–169.

ICML-2001-Hutter #bound #predict #sequence

General Loss Bounds for Universal Sequence Prediction (MH), pp. 210–217.

ICML-2001-LangfordSM #bound #classification #predict

An Improved Predictive Accuracy Bound for Averaging Classifiers (JL, MWS, NM), pp. 290–297.

ICML-2001-Zhang #approximate #bound #problem

Some Sparse Approximation Bounds for Regression Problems (TZ0), pp. 624–631.

LOPSTR-2001-FerrariFO #bound #logic #proving

Extracting Exact Time Bounds from Logical Proofs (MF, CF, MO), pp. 245–266.

PPDP-2001-SchulteS #bound #question

When Do Bounds and Domain Propagation Lead to the Same Search Space? (CS, PJS), pp. 115–126.

CC-2001-FarreG #bound #parsing

A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.

CAV-2001-CoptyFFGKTV #bound #industrial #model checking

Benefits of Bounded Model Checking at an Industrial Setting (FC, LF, RF, EG, GK, AT, MYV), pp. 436–453.

LICS-2001-AdlerI #bound #exclamation

An n! Lower Bound on Formula Size (MA, NI), pp. 197–206.

LICS-2001-Stoller #bound #protocol

A Bound on Attacks on Payment Protocols (SDS), pp. 61–70.

TLCA-2001-Hofmann #behaviour #bound #complexity #memory management #type system

From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour (MH0), pp. 2–3.

DAC-2000-GaurdianiSMSC #bound #component #constant #simulation #statistics

An asymptotically constant, linearly bounded methodology for the statistical simulation of analog circuits including component mismatch effects (CG, SS, PM, PS, DC), pp. 15–18.

DAC-2000-Hassoun #analysis #bound #using

Critical path analysis using a dynamically bounded delay model (SH), pp. 260–265.

DAC-2000-NarasimhanR #bound #on the #problem #scheduling #synthesis

On lower bounds for scheduling problems in high-level synthesis (MN, JR), pp. 546–551.

DATE-2000-KruseSJSN #bound #constraints #data flow #graph #power management

Lower Bounds on the Power Consumption in Scheduled Data Flow Graphs with Resource Constraints (LK, ES, GJ, AS, WN), p. 737.

VLDB-2000-YuV #bound #fault #network #performance

Efficient Numerical Error Bounding for Replicated Network Services (HY, AV), pp. 123–133.

ESOP-2000-Hofmann #bound #functional #type system

A Type System for Bounded Space and Functional In-Place Update--Extended Abstract (MH0), pp. 165–179.

PLDI-2000-BodikGS #array #bound #named

ABCD: eliminating array bounds checks on demand (RB, RG, VS), pp. 321–333.

PLDI-2000-RuginaR #analysis #array #bound #memory management #pointer

Symbolic bounds analysis of pointers, array indices, and accessed memory regions (RR, MCR), pp. 182–195.

STOC-2000-Achlioptas #bound #random #satisfiability

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (DA), pp. 28–37.

STOC-2000-Ambainis #bound #quantum

Quantum lower bounds by quantum arguments (AA), pp. 636–643.

STOC-2000-AnderssonT #bound #worst-case

Tight(er) worst-case bounds on dynamic searching and priority queues (AA, MT), pp. 335–342.

STOC-2000-BarkolR #bound #nearest neighbour #problem

Tighter bounds for nearest neighbor search and related problems in the cell probe model (OB, YR), pp. 388–396.

STOC-2000-HarnikR #bound

Higher lower bounds on monotone size (DH, RR), pp. 378–387.

STOC-2000-KonemannR #algorithm #approximate #bound #matter

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.

ICALP-2000-AdlerFGP #bound

Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.

ICALP-2000-BolligW #bound #problem

Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.

ICALP-2000-CsirikW #bound #online

Resource Augmentation for Online Bounded Space Bin Packing (JC, GJW), pp. 296–304.

ICALP-2000-FournierK #bound

Lower Bounds Are Not Easier over the Reals: Inside PH (HF, PK), pp. 832–843.

ICALP-2000-GoldbergJKP #bound #capacity #protocol

A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (LAG, MJ, SK, MP), pp. 705–716.

ICALP-2000-Seiden #algorithm #bound #online

An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing (SSS), pp. 283–295.

IFL-2000-GustavssonS #analysis #bound #morphism #polymorphism #type system

A Usage Analysis with Bounded Usage Polymorphism and Subtyping (JG, JS), pp. 140–157.

IFL-2000-Hammond #behaviour #bound #concurrent

The Dynamic Properties of Hume: A Functionally-Based Concurrent Language with Bounded Time and Space Behaviour (KH), pp. 122–139.

ICML-2000-EvgeniouPPP #bound #kernel #performance

Bounds on the Generalization Performance of Kernel Machine Ensembles (TE, LPB, MP, TP), pp. 271–278.

ICML-2000-ForsterW #bound #learning

Relative Loss Bounds for Temporal-Difference Learning (JF, MKW), pp. 295–302.

ICPR-v1-2000-SappaG #bound #fault #image #modelling #optimisation

Modeling Range Images with Bounded Error Triangular Meshes without Optimization (ADS, MAG), pp. 1392–1395.

ICPR-v3-2000-KletteZ #bound #fault #multi #order

Multigrid Error Bounds for Moments of Arbitrary Order (RK, JDZ), pp. 3790–3793.

POPL-2000-CraryW #bound #certification

Resource Bound Certification (KC, SW), pp. 184–198.

CAV-2000-AyariB #bound #higher-order #logic #monad

Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.

CAV-2000-Shtrichman #bound #model checking #satisfiability

Tuning SAT Checkers for Bounded Model Checking (OS), pp. 480–494.

CL-2000-ChirkovaG #bound #database

Linearly Bounded Reformulations of Conjunctive Databases (RC, MRG), pp. 987–1001.

CSL-2000-Atserias #bound #complexity #fixpoint

The Descriptive Complexity of the Fixed-Points of Bounded Formulas (AA), pp. 172–186.

CSL-2000-Blumensath #bound #complexity

Bounded Arithmetic and Descriptive Complexity (AB), pp. 232–246.

LICS-2000-BussK #bound

Resource-Bounded Continuity and Sequentiality for Type-Two Functionals (SRB, BMK), pp. 77–83.

DAC-1999-ChenW #approximate #bound #fault

Error Bounded Padé Approximation via Bilinear Conformal Transformation (CPC, DFW), pp. 7–12.

DAC-1999-DrechslerG #bound #using

Using Lower Bounds During Dynamic BDD Minimization (RD, WG), pp. 29–32.

TACAS-1999-AbdullaAB #bound #protocol #verification

Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol (PAA, AA, AB), pp. 208–222.

PLDI-1999-BlellochC #bound #garbage collection #multi #on the

On Bounding Time and Space for Multiprocessor Garbage Collection (GEB, PC), pp. 104–117.

STOC-1999-AmbainisNTV #automaton #bound #quantum

Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.

STOC-1999-BeameF #bound #problem

Optimal Bounds for the Predecessor Problem (PB, FEF), pp. 295–304.

STOC-1999-BorodinOR #bound #nearest neighbour #problem

Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.

STOC-1999-ChakrabartiCGL #approximate #bound #complexity #nearest neighbour

A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube (AC, BC, BG, AL), pp. 305–311.

STOC-1999-ChenKLW #bound

Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns (GHC, MYK, YDL, HKW), pp. 119–128.

STOC-1999-DodisK #bound #design #distance #network

Design Networks with Bounded Pairwise Distance (YD, SK), pp. 750–759.

STOC-1999-IshaiK #bound #information retrieval

Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract) (YI, EK), pp. 79–88.

STOC-1999-RazR #bound #on the

On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.

STOC-1999-RussellSZ #bound

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (AR, MES, DZ), pp. 339–347.

Best-of-PLDI-1999-BlellochC99a #bound #garbage collection #multi #on the

On bounding time and space for multiprocessor garbage collection (with retrospective) (GEB, PC), pp. 626–641.

ICALP-1999-AllenderABDL #bound

Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.

ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.

ICALP-1999-GavoilleH #bound #graph

Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.

ICALP-1999-NiedermeierR #bound #satisfiability

New Upper Bounds for MaxSat (RN, PR), pp. 575–584.

ICFP-1999-HughesP #bound #embedded #ml #programming #recursion #towards

Recursion and Dynamic Data-structures in Bounded Space: Towards Embedded ML Programming (JH, LP), pp. 70–81.

TOOLS-USA-1999-PlasilBV #behaviour #bound #component #protocol

Bounding Component Behavior via Protocols (FP, MB, SV), pp. 387–398.

CSL-1999-Beklemishev #bound #query

Open Least Element Principle and Bounded Query Computation (LDB), pp. 389–404.

CSL-1999-Toran #bound

Lower Bounds for Space in Resolution (JT), pp. 362–373.

ICLP-1999-PedreschiR #bound #logic programming #nondeterminism #source code

Bounded Nondeterminism of Logic Programs (DP, SR), pp. 350–364.

LICS-1999-Johannsen #bound #problem

Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable’s Class K (JJ), pp. 268–274.

LICS-1999-Libkin #bound #invariant #logic #query

Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.

DATE-1998-HelvigRZ #approximate #bound #problem

Improved Approximation Bounds for the Group Steiner Problem (CSH, GR, AZ), pp. 406–413.

PODS-1998-KoutsoupiasT #2d #bound

Tight Bounds for 2-Dimensional Indexing Schemes (EK, DST), pp. 52–58.

PODS-1998-SamoladasM #bound #multi #query #theorem

A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries (VS, DPM), pp. 44–51.

PLDI-1998-XiP #array #bound #dependent type

Eliminating Array Bound Checking Through Dependent Types (HX, FP), pp. 249–257.

STOC-1998-FeigeS #bound #scheduling

Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract) (UF, CS), pp. 624–633.

STOC-1998-FournierK #bound #question

Are Lower Bounds Easier over the Reals? (HF, PK), pp. 507–513.

STOC-1998-Gal #bound #source code

A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.

STOC-1998-Grigoriev #bound #complexity #random

Randomized Complexity Lower Bounds (DG), pp. 219–223.

STOC-1998-GrigorievK #bound #exponential

An Exponential Lower Bound for Depth 3 Arithmetic Circuits (DG, MK), pp. 577–582.

STOC-1998-ShokrollahiW #algebra #bound #geometry

Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound (MAS, HW), pp. 241–248.

ICALP-1998-JuknaZ #bound #branch #nondeterminism #on the #source code

On Branching Programs With Bounded Uncertainty (Extended Abstract) (SJ, SZ), pp. 259–270.

ICML-1998-Cesa-BianchiF #bound #finite #multi #problem

Finite-Time Regret Bounds for the Multiarmed Bandit Problem (NCB, PF), pp. 100–108.

LCTES-1998-LiuG #analysis #automation #bound

Automatic Accurate Time-Bound Analysis for High-Level Languages (YAL, GG), pp. 31–40.

CSL-1998-Buning #bound

An Upper Bound for Minimal Resolution Refutations (HKB), pp. 171–178.

CSL-1998-Schwentick #bound #complexity #linear

Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.

DAC-1997-BeattieP #bound

Bounds for BEM Capacitance Extraction (MWB, LTP), pp. 133–136.

DAC-1997-KahngT #bound

More Practical Bounded-Skew Clock Routing (ABK, CWAT), pp. 594–599.

DAC-1997-LiaoD #bound #problem #using

Solving Covering Problems Using LPR-Based Lower Bounds (SYL, SD), pp. 117–120.

TACAS-1997-DArgenioKRT #bound #exclamation #protocol

The Bounded Retransmission Protocol Must Be on Time! (PRD, JPK, TCR, JT), pp. 416–431.

PEPM-1997-Debray #bound #partial evaluation

Resource-Bounded Partial Evaluation (SKD), pp. 179–192.

STOC-1997-Albers #bound #online #scheduling

Better Bounds for Online Scheduling (SA), pp. 130–139.

STOC-1997-Aspnes #bound #distributed #random

Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.

STOC-1997-GoldreichR #bound #graph #testing

Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.

STOC-1997-GrigorievK #bound #random

Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.

STOC-1997-PaturiSZ #bound #exponential

Exponential Lower Bounds for Depth 3 Boolean Circuits (RP, MES, FZ), pp. 86–91.

DLT-1997-BuchholzK #bound #on the #power of

On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.

DLT-1997-FernauHF #bound #distributed

Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.

DLT-1997-IwamaT #automaton #bound #nondeterminism

Tight Bounds on the Number of States of DFA’s That Are Equivalent to n-state NFA’s (KI, KT), pp. 147–154.

DLT-1997-KarhumakiPM #bound #constant

A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.

ICALP-1997-Ambainis #bound #communication #complexity #information retrieval

Upper Bound on Communication Complexity of Private Information Retrieval (AA), pp. 401–407.

ICALP-1997-BeigelF #bound #nondeterminism #performance #recursion

Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.

ICALP-1997-Bournez #bound #constant #power of

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract) (OB), pp. 143–153.

ICALP-1997-Bruyere #algorithm #bound

A Completion Algorithm for Codes with Bounded Synchronization Delay (VB), pp. 87–97.

ICALP-1997-BuhrmanFF #bound

Results on Resource-Bounded Measure (HB, SAF, LF), pp. 188–194.

ICALP-1997-Hagerup #algorithm #bound #graph

Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.

ICFP-1997-ChinH #bound

A Bounds Inference Method for Vector-Based Memoisation (WNC, MH), pp. 176–187.

ICML-1997-Fiechter #bound #learning #online

Expected Mistake Bound Model for On-Line Reinforcement Learning (CNF), pp. 116–124.

CSL-1997-BonetG #bound #linear #simulation

Linear Lower Bounds and Simulations in Frege Systems with Substitutions (MLB, NG), pp. 115–128.

ILPS-1997-DebrayLHL #bound #estimation #logic programming #source code

Lower Bound Cost Estimation for Logic Programs (SKD, PLG, MVH, NWL), pp. 291–305.

ILPS-1997-KingSB #analysis #bound #logic programming #source code

Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.

DAC-1996-OhPP #bound #linear #programming #using

Constructing Lower and Upper Bounded Delay Routing Trees Using Linear Programming (JO, IP, MP), pp. 401–404.

DAC-1996-ParulkarGB #bound #data flow #graph

Lower Bounds on Test Resources for Scheduled Data Flow Graphs (IP, SKG, MAB), pp. 143–148.

STOC-1996-BabaiGKRSW #bound #graph #source code

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.

STOC-1996-BartalFL #bound #graph #online #problem

Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing (YB, AF, SL), pp. 531–540.

STOC-1996-Basu #algebra #bound #on the #set

On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets (SB), pp. 408–417.

STOC-1996-Cesa-BianchiDFS #bound #learning

Noise-Tolerant Learning Near the Information-Theoretic Bound (NCB, ED, PF, HUS), pp. 141–150.

STOC-1996-EvansP #bound

Lower Bounds for Noisy Boolean Decision Trees (WSE, NP), pp. 620–628.

STOC-1996-GrigorievKHS #algebra #bound #random

A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.

ICALP-1996-AtenieseBSS #bound #encryption #visual notation

Constructions and Bounds for Visual Cryptography (GA, CB, ADS, DRS), pp. 416–428.

ICALP-1996-BradfordR #bound

Lower Bounds for Row Minima Searching (Extended Abstract) (PGB, KR), pp. 454–465.

ICALP-1996-Hashiguchi #automaton #bound #distance

New Upper Bounds to the Limitedness of Distance Automata (KH), pp. 324–335.

ICALP-1996-Miltersen #bound #multi

Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication (PBM), pp. 442–453.

ICALP-1996-Razborov #bound #independence #proving

Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (AAR), pp. 48–62.

CSCW-1996-RandallR #bound #development #tutorial

Ethnography and Systems Development: Bounding the Intersection (Tutorial) (DR, MR), p. 5.

CIKM-1996-Greco #bound #set #unification

Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.

ICPR-1996-LakshmananW #bound #detection #image

Detection of bounded weak echo regions in meteorological radar images (VL, AW), pp. 895–899.

ICPR-1996-SzeL #algorithm #bound #branch #classification

Branch and bound algorithm for the Bayes classifier (LS, CHL), pp. 705–709.

CADE-1996-Vorobyov #bound

An Improved Lower Bound for the Elementary Theories of Trees (SGV), pp. 275–287.

CAV-1996-ClarkeBLXS #analysis #bound #named #realtime #specification #tool support #visual notation

XVERSA: An Integrated Graphical and Textual Toolset for the Specification and Analysis of Resource-Bound Real-Time Sytems (DC, HBA, IL, HlX, OS), pp. 402–405.

CSL-1996-Dziembowski #bound #fixpoint #query

Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.

CSL-1996-Merkle #bound

Exact Pairs for Abstract Bounded Reducibilities (WM), pp. 349–368.

DAC-1995-GuptaKTWP #bound

The Elmore Delay as a Bound for RC Trees with Generalized Input Signals (RG, BK, BT, JW, LTP), pp. 364–369.

DAC-1995-HuangKT #bound #on the #problem

On the Bounded-Skew Clock and Steiner Routing Problems (DJHH, ABK, CWAT), pp. 508–513.

ICDAR-v2-1995-HaHP #bound #component #recursion #using

Recursive X-Y cut using bounding boxes of connected components (JH, RMH, ITP), pp. 952–955.

ICDAR-v2-1995-HaHP95a #bound #composition #documentation

Document page decomposition by the bounding-box project (JH, RMH, ITP), pp. 1119–1122.

PODS-1995-DongS #bound

Space-Bounded FOIES (GD, JS), pp. 139–150.

PODS-1995-Vardi #bound #complexity #on the #query

On the Complexity of Bounded-Variable Queries (MYV), pp. 266–276.

SIGMOD-1995-PapadiasTSE #bound #case study

Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees (DP, YT, TKS, MJE), pp. 92–103.

VLDB-1995-FlodinR #bound #object-oriented #query

Processing Object-Oriented Queries with Invertible Late Bound Functions (SF, TR), pp. 335–344.

STOC-1995-AnderssonHP #array #bound

A tight lower bound for searching a sorted array (AA, JH, OP), pp. 417–426.

STOC-1995-BonetPR #bound #proving

Lower bounds for cutting planes proofs with small coefficients (MLB, TP, RR), pp. 575–584.

STOC-1995-CanettiI #bound #power of #random #scheduling

Bounding the power of preemption in randomized scheduling (RC, SI), pp. 606–615.

STOC-1995-Chazelle #bound

Lower bounds for off-line range searching (BC), pp. 733–740.

STOC-1995-EdmondsP #bound

A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model (JE, CKP), pp. 147–156.

STOC-1995-Eppstein #bound #geometry #optimisation #parametricity

Geometric lower bounds for parametric matroid optimization (DE), pp. 662–671.

STOC-1995-Harchol-BalterW #bound #network

Bounding delays in packet-routing networks (MHB, DW), pp. 248–257.

STOC-1995-KahaleLMPSS #bound #network #sorting

Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.

STOC-1995-KarpinskiM #bound #network #polynomial

Polynomial bounds for VC dimension of sigmoidal neural networks (MK, AM), pp. 200–208.

STOC-1995-Ponzio #bound #branch #integer #multi #source code

A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.

DLT-1995-Dorr #abstract interpretation #bound

Computing an Upper Bound for SVS(gg) by Abstract Interpretation (HD), pp. 279–288.

DLT-1995-GvozdjakR #bound #parallel

Time-Bounded Parallel Rewriting (PG, BR), pp. 79–87.

ICALP-1995-Ben-AmramG #algebra #bound #random

Lower Bounds on Algebraic Random Access Machines (Extended Abstract) (AMBA, ZG), pp. 360–371.

ICALP-1995-BodlaenderH #algorithm #bound #parallel

Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.

ICALP-1995-BozanisKMT #bound #problem

New Upper Bounds for Generalized Intersection Searching Problems (PB, NK, CM, AKT), pp. 464–474.

ICALP-1995-FreivaldsK #bound #random

Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.

ICML-1995-Drakopoulos #bound #classification #fault #nearest neighbour

Bounds on the Classification Error of the Nearest Neighbor Rule (JAD), pp. 203–208.

POPL-1995-CastagnaP #bound #decidability #named #quantifier

Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.

POPL-1995-HoangM #bound #type inference #type system

Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.

POPL-1995-Vorobyov #bound #decidability #quantifier

Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.

DAC-1994-ZhuW #bound

Switch Bound Allocation for Maximizing Routability in Timing-Driven Routing of FPGAs (KZ, DFW), pp. 165–170.

EDAC-1994-DalkilicP #bound #scheduling #using

Optimal Operation Scheduling Using Resource Lower Bound Estimations (MED, VP), pp. 319–324.

PODS-1994-Afrati #bound #datalog #exclamation #graph #query

Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.

STOC-1994-BodlaenderFH #bound #problem

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

STOC-1994-FortnowW #bound #game studies

Optimality and domination in repeated games with bounded players (LF, DW), pp. 741–749.

STOC-1994-GrigorievKV #algebra #bound #testing

Lower bounds on testing membership to a polyhedron by algebraic decision trees (DG, MK, NV), pp. 635–644.

STOC-1994-HalldorssonR #approximate #bound #graph #independence #set

Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.

STOC-1994-Miltersen #bound #problem #random

Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.

STOC-1994-Mulmuley #bound #linear #parallel #problem #programming

Lower bounds for parallel linear programming and other problems (KM), pp. 603–614.

STOC-1994-PapadimitriouY #bound #complexity #on the

On complexity as bounded rationality (extended abstract) (CHP, MY), pp. 726–733.

STOC-1994-YangA #bound #problem

Time bounds for mutual exclusion and related problems (JHY, JHA), pp. 224–233.

ICALP-1994-AumannBF #bound #cost analysis #fault #on the

On the Cost of Recomputing: Tight Bounds on Pebbling with Faults (YA, JBI, UF), pp. 47–58.

ICALP-1994-Bonizzoni #bound

A Tight Lower Bound for Primitivity in k-Structures (PB), pp. 556–567.

ICALP-1994-BuhrmanT #bound #on the

On the Cutting Edge of Relativization: The Resource Bounded Injury Method (HB, LT), pp. 263–273.

ICALP-1994-FreivaldsK #bound #random

Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.

ICALP-1994-PlaxtonS #bound #network #sorting

A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.

ICALP-1994-Pudlak #bound #communication #complexity #game studies

Unexpected Upper Bounds on the Complexity of Some Communication Games (PP), pp. 1–10.

TAGT-1994-ArnborgP #bound #graph #subclass

A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.

TAGT-1994-SkodinisW #bound #graph grammar #problem

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars (KS, EW), pp. 211–224.

POPL-1994-CastagnaP #bound #decidability #quantifier

Decidable Bounded Quantification (GC, BCP), pp. 151–162.

ICRE-1994-DrakeT #analysis #bound

System bounding issues for analysis (JMD, WTT), pp. 24–31.

ISSTA-1994-BertolinoM #bound #branch #testing

A Meaningful Bound for Branch Testing (Abstract) (AB, MM), p. 202.

LICS-1994-ImpagliazzoPU #bound #proving

Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.

DAC-1993-Lee #2d #algorithm #bound #design

A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules (TcL), pp. 525–530.

KBSE-1993-Feather #bound #implementation

An Implementation of Bounded Obligations (MSF), p. 18.

ICDAR-1993-Breul #bound #fault #recognition #using

Recognition of handprinted digits using optimal bounded error matching (TMB), pp. 493–496.

STOC-1993-ChazelleEGGSW #bound #set

Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.

STOC-1993-KushilevitzMRZ #bound #random

Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.

STOC-1993-Maass #bound #complexity #learning

Bounds for the computational power and learning complexity of analog neural nets (WM), pp. 335–344.

STOC-1993-PlotkinT #bound #multi

Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.

STOC-1993-WigdersonZ #bound

Expanders that beat the eigenvalue bound: explicit construction and applications (AW, DZ), pp. 245–251.

ICALP-1993-Ablayev #bound #communication #complexity #probability

Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.

ICALP-1993-Kann #approximate #bound #problem

Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.

ICALP-1993-KozenZ #bound #problem

Optimal Bounds for the Change-Making Problem (DK, SZ), pp. 150–161.

ICALP-1993-Yamamoto #bound #nondeterminism #trade-off #turing machine

Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines (HY), pp. 203–214.

CIKM-1993-CosarLS #bound #multi #optimisation #query

Multiple Query Optimization with Depth-First Branch-and-Bound and Dynamic Query Ordering (AC, EPL, JS), pp. 433–438.

CIKM-1993-Maine #bound #named #performance

HSGIMS — A Secure High-Speed Tool with Bound Search Times for Transparently Managing and Manipulating Information (PADdM), pp. 216–222.

PLILP-1993-BarklundB #bound #memory management #multi

Executing Bounded Quantifications on Shared Memory Multiprocessors (JB, JB), pp. 302–317.

SAC-1993-VaidyanathanL #analysis #bound #learning

Analysis of Upper Bound in Valiant’s Model for Learning Bounded CNF Expressions (SV, SL), pp. 754–761.

SAC-1993-VeezhinathanKT #bound #branch #hybrid

A Hybrid of Neural Net and Branch and Bound Techniques for Seismic Horizon Tracking (JV, FK, JT), pp. 173–178.

CSL-1993-Grohe #bound #fixpoint #logic

Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.

ICLP-1993-Brzoska #bound #logic programming

Temporal Logic Programming with Bounded Universal Modality Goals (CB), pp. 239–256.

ISSTA-1993-CorbettA #bound #concurrent #realtime

A Practical Technique for Bounding the Time Between Events in Concurrent Real-Time Systems (JCC, GSA), pp. 110–116.

TLCA-1993-Pierce #bound #morphism #polymorphism

Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.

TLCA-1993-Springintveld #bound #reduction

Lower and Upper Bounds for Reductions of Types in λω and λP (JS), pp. 391–405.

PODS-1992-WongA #bound #concurrent #consistency #database #nondeterminism

Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems (MHW, DA), pp. 236–245.

STOC-1992-BeameIKPPW #bound #exponential #principle

Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.

STOC-1992-BjornerLY #bound #linear

Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.

STOC-1992-DworkW #bound #concurrent #exclamation #performance

Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! (CD, OW), pp. 655–666.

STOC-1992-MaggsS #algorithm #bound #network

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) (BMM, RKS), pp. 150–161.

ICALP-1992-ChazelleR #bound #complexity #pointer

Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine (BC, BR), pp. 439–449.

ICALP-1992-SantisPY #bound #proving #statistics #verification

One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier (ADS, GP, MY), pp. 28–40.

KR-1992-Schwarz #bound #logic

Bounding Introspection in Nonmonotonic Logic (GS), pp. 581–590.

POPL-1992-NielsonN #bound #fixpoint

Bounded Fixed Point Iteration (HRN, FN), pp. 71–82.

POPL-1992-Pierce #bound #decidability #quantifier

Bounded Quantification is Undecidable (BCP), pp. 305–315.

HPDC-1992-ClaytonDMW #bound #latency

Determining Update Latency Bounds in Galactica Net (SC, RJD, WM, AW), pp. 104–111.

CSL-1992-Stewart #bound #logic #polynomial #query

Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines (IAS), pp. 410–424.

DAC-1991-OnoderaTT #bound #layout

Branch-and-Bound Placement for Building Block Layout (HO, YT, KT), pp. 433–439.

PODS-1991-JohnsonR #bound #consistency #protocol #replication

A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols (DBJ, LR), pp. 75–81.

PODS-1991-KrishnakumarB #bound

Bounded Ignorance in Replicated Systems (NK, AJB), pp. 63–74.

STOC-1991-AslamD #bound #fault

Searching in the Presence of Linearly Bounded Errors (Extended Abstract) (JAA, AD), pp. 486–493.

STOC-1991-AttiyaDLS #bound #nondeterminism

Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (HA, CD, NAL, LJS), pp. 359–369.

STOC-1991-BreslauerG #bound #parallel #string

A Lower Bound for Parallel String Matching (DB, ZG), pp. 439–443.

STOC-1991-KarloffRR #algorithm #bound #random

Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.

STOC-1991-Nisan #bound #commutative

Lower Bounds for Non-Commutative Computation (Extended Abstract) (NN), pp. 410–418.

ICALP-1991-HonkalaS #ambiguity #bound #morphism

L Morphisms: Bounded Delay and Regularity of Ambiguity (JH, AS), pp. 566–574.

PPoPP-1991-NicolauW #bound #parallel

Optimal Schedules for Parallel Prefix Computation with Bounded Resources (AN, HW), pp. 1–10.

CAV-1991-JardJ #algorithm #bound #on the fly #verification

Bounded-memory Algorithms for Verification On-the-fly (CJ, TJ), pp. 192–202.

CSL-1991-Flum #bound #on the

On Bounded Theories (JF), pp. 111–118.

CSL-1991-Goerdt #bound #proving

The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.

LICS-1991-Hungar #bound #complexity #hoare #proving

Complexity Bounds of Hoare-style Proof Systems (HH), pp. 120–126.

RTA-1991-Baader #bound #problem #unification

Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems (FB), pp. 86–97.

RTA-1991-Brandenburg #bound #confluence #equivalence #graph grammar

The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.

RTA-1991-Hofbauer #bound #proving #term rewriting #termination

Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding (DH), pp. 62–73.

RTA-1991-Pottier #algorithm #bound #linear

Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms (LP), pp. 162–173.

PLDI-1990-Gupta #array #bound #fresh look #optimisation

A Fresh Look at Optimizing Array Bound Checking (RG), pp. 272–282.

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

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

STOC-1990-Frederickson #bound

The Information Theory Bound Is Tight for Selection in a Heap (GNF), pp. 26–33.

STOC-1990-Nisan #bound #generative

Psuedorandom Generators for Space-Bounded Computation (NN), pp. 204–212.

STOC-1990-OgiwaraW #bound #on the #polynomial #set

On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets (MO, OW), pp. 457–467.

STOC-1990-Poutre #bound #pointer #problem

Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines (JALP), pp. 34–44.

STOC-1990-Szegedy #bound #communication #complexity #symmetry

Functions with Bounded Symmetric Communication Complexity and Circuits with mod m Gates (MS), pp. 278–286.

STOC-1990-Zuckerman #bound

A Technique for Lower Bounding the Cover Time (DZ), pp. 254–259.

ML-1990-Hirsh #bound #consistency #learning #nondeterminism

Learning from Data with Bounded Inconsistency (HH), pp. 32–39.

CSL-1990-HertrampfW #bound #fault #interactive #proving

Interactive Proof Systems: Provers, Rounds, and Error Bounds (UH, KWW), pp. 261–273.

CSL-1990-Pudlak #bound #theorem

Ramsey’s Theorem in Bounded Arithmetic (PP), pp. 308–317.

CSL-1990-Ranaivoson #bound #graph #problem

Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.

LICS-1990-HarelRV #bound #concurrent #on the #power of #reasoning #source code

On the Power of Bounded Concurrency~III: Reasoning About Programs (Preliminary Report) (DH, RR, MYV), pp. 478–488.

DAC-1989-PatilB #algorithm #bound #branch #generative #parallel #testing

A Parallel Branch and Bound Algorithm for Test Generation (SP, PB), pp. 339–343.

PODS-1989-DublishM #bound #fixpoint #query

Expressibility of Bounded-Arity Fixed-Point Query Hierarchies (PD, SNM), pp. 324–335.

STOC-1989-BorodinRT #bound #sequence #traversal

Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract) (AB, WLR, MT), pp. 562–573.

STOC-1989-DolevS #bound #concurrent

Bounded Concurrent Time-Stamp Systems Are Constructible (DD, NS), pp. 454–466.

ICALP-1989-AllenderH #bound

Lower Bounds for the Low Hierarchy (Extended Abstract) (EA, LAH), pp. 31–45.

ICALP-1989-BilardiM #bound

Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions (GB, AM), pp. 95–107.

ICALP-1989-BrassardC #bound

Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.

ICALP-1989-Cardone #bound #quantifier #recursion #relational #semantics

Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.

ICALP-1989-MansourST #bound

Lower Bounds for Computations with the Floor Operation (YM, BS, PT), pp. 559–573.

FPCA-1989-CanningCHOM #bound #morphism #object-oriented #polymorphism #programming

F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.

SOSP-1989-BarkleyL #bound #lazy evaluation

A Lazy Buddy System Bounded by Two Coalescing Delays per Class (REB, TPL), pp. 167–176.

CSL-1989-Meinel #bound #source code

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

LICS-1989-Stolboushkin #bound #complexity #logic

Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.

PODS-1988-RamakrishnaM #analysis #bound

Analysis of Bounded Disorder File Organization (MVR, PM), pp. 117–125.

STOC-1988-KarpZ #bound #parallel #random

A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.

STOC-1988-King #bound #complexity #graph

Lower Bounds on the Complexity of Graph Properties (VK), pp. 468–476.

ICALP-1988-Bodlaender #bound #graph #programming

Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.

ICALP-1988-ChangIP #bound #modelling #parallel #performance #simulation

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM’s and Space-Bounded TM’s (JHC, OHI, MAP), pp. 119–132.

LFP-1988-Martini #bound #modelling #quantifier

Bounded Quantifiers Have Interval Models (SM), pp. 164–173.

CADE-1988-VermaR #bound #parallel

Optimal Time Bounds for Parallel Term Matching (RMV, IVR), pp. 694–703.

CADE-1988-Walther #algorithm #automation #bound #proving #termination

Argument-Bounded Algorithms as a Basis for Automated Termination Proofs (CW), pp. 602–621.

LICS-1988-BruceL #bound #inheritance #quantifier

A Modest Model of Records, Inheritance and Bounded Quantification (KBB, GL), pp. 38–50.

PODS-1987-BeeriKBR #bound #logic programming #source code

Bounds on the Propagation of Selection into Logic Programs (CB, PCK, FB, RR), pp. 214–226.

PODS-1987-ChanH #bound #database #dependence #design #functional #on the

On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies (EPFC, HJH), pp. 48–57.

PODS-1987-NaughtonS #bound #decidability #recursion

A Decidable Class of Bounded Recursions (JFN, YS), pp. 227–236.

STOC-1987-BeameH #bound #problem

Optimal Bounds for Decision Problems on the CRCW PRAM (PB, JH), pp. 83–93.

STOC-1987-Smolensky #algebra #bound #complexity #formal method

Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity (RS), pp. 77–82.

ICALP-1987-Dietzfelbinger #bound #sorting

Lower Bounds for Sorting of Sums (MD), pp. 457–466.

ICALP-1987-MehlhornNA #bound #complexity #problem

A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.

LICS-1987-ImmermanK #bound

Definability with Bounded Number of Bound Variables (NI, DK), pp. 236–244.

DAC-1986-LinA #bound #layout #named

Minplex — a compactor that minimizes the bounding rectangle and individual rectangles in a layout (SLL, JA), pp. 123–130.

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

Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.

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

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

STOC-1986-DworkPPU #bound #fault tolerance #network

Fault Tolerance in Networks of Bounded Degree (Preliminary Version) (CD, DP, NP, EU), pp. 370–379.

STOC-1986-Hastad #bound

Almost Optimal Lower Bounds for Small Depth Circuits (JH), pp. 6–20.

STOC-1986-LeightonS #algorithm #analysis #bound #grid

Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.

STOC-1986-LiY #bound #parallel

New Lower Bounds for Parallel Computation (ML, YY), pp. 177–187.

ICALP-1986-Schoning #bound #recursion

Lower Bounds by Recursion Theoretic Arguments (Extended Abstract) (US), pp. 370–375.

ICALP-1986-Willard #bound #problem #query

Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract) (DEW), pp. 444–453.

VLDB-1985-Ioannidis #bound #recursion

A Time Bound on the Materialization of some Recursively Defined Views (YEI), pp. 219–226.

STOC-1985-Buss #bound #polynomial

The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) (SRB), pp. 285–290.

STOC-1985-FichHRW #bound #infinity #parallel

One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.

STOC-1985-VardiS #bound #logic #source code

Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report (MYV, LJS), pp. 240–251.

ICALP-1985-KarlssonMR #bound #nearest neighbour #problem

The Nearest Neighbor Problem on Bounded Domains (RGK, JIM, ELR), pp. 318–327.

ICALP-1985-Li #bound

Lower Bounds by Kolmogorov-Complexity (Extended Abstract) (ML0), pp. 383–393.

DAC-1984-LewandowskiL #algorithm #bound #branch

A branch and bound algorithm for optimal pla folding (JLL, CLL), pp. 426–433.

STOC-1984-AdlerM #algorithm #bound #polynomial

A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension (IA, NM), pp. 312–323.

STOC-1984-Boppana #bound

Threshold Functions and Bounded Depth Monotone Circuits (RBB), pp. 475–479.

STOC-1984-DurisGS #bound #communication #complexity

Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.

STOC-1984-HartS #bound #finite #logic #modelling #probability

Probabilistic Temporal Logics for Finite and Bounded Models (SH, MS), pp. 1–13.

STOC-1984-Leighton #bound #complexity #parallel #sorting

Tight Bounds on the Complexity of Parallel Sorting (FTL), pp. 71–80.

STOC-1984-Maass #bound #nondeterminism #polynomial #turing machine

Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.

ILPC-1984-Sintzoff84 #bound #source code #strict

Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.

DAC-1983-LiuA #bound

Bounds on the saved area ratio due to PLA folding (WL, DEA), pp. 538–544.

STOC-1983-Ben-Or #algebra #bound

Lower Bounds for Algebraic Computation Trees (Preliminary Report) (MBO), pp. 80–86.

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

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

STOC-1983-DurisGPR #bound

Two Nonlinear Lower Bounds (PD, ZG, WJP, RR), pp. 127–132.

STOC-1983-Fich #bound #parallel

New Bounds for Parallel Prefix Circuits (FEF), pp. 100–109.

STOC-1983-FurerSS #bound #graph #normalisation

Normal Forms for Trivalent Graphs and Graphs of Bounded Valence (MF, WS, ES), pp. 161–170.

STOC-1983-Valiant #bound #exponential #strict

Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.

ICALP-1983-ChandraFL #bound #constant #problem

Lower Bounds for Constant Depth Circuits for Prefix Problems (AKC, SF, RJL), pp. 109–117.

ICALP-1983-ChoffrutK #bound #morphism #testing

Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.

ICALP-1983-HambruschS #bound #graph #problem

Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.

DAC-1982-Grass #algorithm #bound

A depth-first branch-and-bound algorithm for optimal PLA folding (WG), pp. 133–140.

DAC-1982-Kalay #bound #modelling #multi #parametricity

Modeling polyhedral solids bounded by multi-curved parametric surfaces (YEK), pp. 501–507.

STOC-1982-BabaiGM #bound #graph #morphism #multi

Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.

STOC-1982-CookD #bound #parallel #ram

Bounds on the Time for Parallel RAM’s to Compute Simple Functions (SAC, CD), pp. 231–233.

STOC-1982-PachlKR #algorithm #bound #distributed #proving

A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms (JKP, EK, DR), pp. 378–382.

STOC-1982-RuzzoST #bound #probability

Space-Bounded Hierarchies and Probabilistic Computations (WLR, JS, MT), pp. 215–223.

ICALP-1982-DurisG #automaton #bound #on the

On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store (PD, ZG), pp. 166–175.

ICALP-1982-Kalorkoti #bound

A Lower Bound for the Formula Size of Rational Functions (KK), pp. 330–338.

LFP-1982-White #bound #constant

Constant Time Interpretation for Shallow-bound Variables in the Presence of Mixed SPECIAL/LOCAL Declarations (JLW), pp. 196–200.

DAC-1981-Goldstein #bound

Defining the bounding edges of a SynthaVision solid model (RCG), pp. 457–461.

STOC-1981-Fich #bound #detection #problem

Lower Bounds for the Cycle Detection Problem (FEF), pp. 96–105.

STOC-1981-LiptonS #bound

Lower Bounds for VLSI (RJL, RS), pp. 300–307.

STOC-1981-PatersonRS #bound

Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.

STOC-1981-Simon #bound #complexity #probability #turing machine

Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (Preliminary Version) (JS), pp. 158–167.

ICALP-1981-BlattnerL #bound

Parikh-Bounded Languages (MB, ML), pp. 316–323.

ICALP-1981-Snir #bound #proving

Proving Lower Bounds for Linar Decision Trees (MS), pp. 305–315.

ICALP-1981-Ukkonen #bound #on the #parsing

On Size Bounds for Deterministic Parsers (EU), pp. 218–228.

STOC-1980-Miller #bound #graph #morphism #testing

Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.

STOC-1980-Mirkowska #algorithm #axiom #bound #nondeterminism

Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations (GM), pp. 14–21.

STOC-1980-PaulSS #approach #bound #online

An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) (WJP, JIS, JS), pp. 357–367.

ICALP-1980-LewisP #bound #symmetry

Symmetric Space-Bounded Computation (Extended Abstract) (HRL, CHP), pp. 374–384.

DAC-1979-DysartK #automation #bound #branch

An application of branch and bound method to automatic printed circuit board routing (LD, MK), pp. 494–499.

STOC-1979-LengauerT #bound #trade-off

Upper and Lower Bounds on Time-Space Tradeoffs (TL, RET), pp. 262–277.

STOC-1979-Ruzzo #bound

Tree-Size Bounded Alternation (WLR), pp. 352–359.

STOC-1979-Sipser #automaton #bound

Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.

STOC-1978-ReddyL #bound #quantifier

Presburger Arithmetic with Bounded Quantifier Alternation (CRR, DWL), pp. 320–325.

ICALP-1978-DobkinM #bound #problem

Time and Space Bounds for Selection Problems (DPD, JIM), pp. 192–204.

STOC-1977-Sudborough #automaton #bound

Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.

STOC-1977-YaoAR #bound #problem

An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.

ICALP-1977-BookY #bound #on the #power of

On the Computational Power of Reversal-Bounded Machines (RVB, CKY), pp. 111–119.

ICALP-1977-Brandenburg #bound #context-sensitive grammar

The Contextsensitivity Bounds of Contextsensitive Grammars and Languages (FJB), pp. 120–134.

POPL-1977-SuzukiI #array #bound #implementation

Implementation of an Array Bound Checker (NS, KI), pp. 132–143.

STOC-1976-PaulTC #bound #game studies #graph

Space Bounds for a Game of Graphs (WJP, RET, JRC), pp. 149–160.

ICALP-1976-AltM #bound #complexity #recognition

Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.

STOC-1975-FischerMP #bound

Lower Bounds on the Size of Boolean Formulas: Preliminary Report (MJF, ARM, MP), pp. 37–44.

STOC-1975-Galil #bound #complexity #on the

On the Validity and Complexity of Bounded Resolution (ZG), pp. 72–82.

STOC-1975-Paul #bound #combinator #complexity

A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions (WJP), pp. 27–36.

STOC-1975-Valiant #bound #complexity #on the

On Non-linear Lower Bounds in Computational Complexity (LGV), pp. 45–53.

STOC-1974-BookNP #bound #context-free grammar #linear #multi

Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) (RVB, MN, MP), pp. 290–296.

STOC-1974-Kedem #bound #multi

Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications (ZMK), pp. 334–341.

STOC-1974-Kung #algorithm #bound #evaluation #parallel

New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions (HTK), pp. 323–333.

ICALP-1974-Monien #bound #recursion

Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.

STOC-1973-Oppen #bound

Elementary Bounds for Presburger Arithmetic (DCO), pp. 34–37.

SOSP-1973-GareyG #bound #scheduling

Bounds on Scheduling with Limited Resources (MRG, RLG), pp. 104–111.

DAC-1972-Lewis #bound #detection #logic #simulation

Hazard detection by a quinary simulation of logic devices with bounded propagation delays (DWL), pp. 157–164.

STOC-1972-BlumFPRT #bound #linear

Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.

STOC-1972-CookR #bound #random

Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.

STOC-1972-Kung #bound #multi #performance

A Bound on the Multiplication Efficiency of Iteration (HTK), pp. 102–107.

STOC-1972-NievergeltR #bound

Binary Search Trees of Bounded Balance (JN, EMR), pp. 137–142.

ICALP-1972-Monien #automaton #bound #turing machine

Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.

STOC-1970-Ausiello #bound #on the

On Bounds on the Number of Steps to Compute Functions (GA), pp. 41–47.

STOC-1970-BookGW #bound

Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.

STOC-1969-McCreightM #bound

Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report (EMM, ARM), pp. 79–88.