BibSLEIGH — bound tag

bound

bound

Tag #bound

1558 papers:

POPL-2020-HarkKGK #induction #probability #verification: Aiming low is harder: induction for lower bounds in probabilistic program verification (MH, BLK, JG, JPK), p. 28.
ASPLOS-2020-AngstadtJW #automaton #kernel #learning #legacy #string: Accelerating Legacy String Kernels via Bounded Automata Learning (KA, JBJ, WW), pp. 235–249.
CGO-2020-OjogboTV #automation: Secure automatic bounds checking: prevention is simpler than cure (EJO, MT, TNV), pp. 43–55.
CSL-2020-Tzameret #proving: From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk) (IT), p. 2.
CIAA-2019-Okhotin #automaton: Graph-Walking Automata: From Whence They Come, and Whither They are Bound (AO), pp. 10–29.
DLT-2019-AzfarCCJ #linear #matrix #set: A Linear Bound on the K-Rendezvous Time for Primitive Sets of NZ Matrices (UA, CC, LC, RMJ), pp. 59–73.
DLT-2019-BhaveKPT #context-sensitive grammar #on the: On Timed Scope-Bounded Context-Sensitive Languages (DB, SNK, RP, AT0), pp. 168–181.
DLT-2019-Frid: First Lower Bounds for Palindromic Length (AEF), pp. 234–243.
DLT-2019-Gao #complexity #education #pattern matching: The Teaching Complexity of Erasing Pattern Languages with Bounded Variable Frequency (ZG), pp. 154–167.
FSCD-2019-Ikebuchi: A Lower Bound of the Number of Rewrite Rules Obtained by Homological Methods (MI), p. 17.
SEFM-2019-RouxT #verification: Partially Bounded Context-Aware Verification (LLR, CT), pp. 532–548.
DiGRA-2019-Fleet #trust: Boundaries, Trust and Reputation in Virtual and Illicit Markets (RF).
DiGRA-2019-Ford #game studies: Beyond the Wall: The Boundaries of the Neomedieval Town in Singleplayer Roleplaying Games (DF).
CIKM-2019-FujiwaraIKKAU #algorithm #incremental #performance #random: Fast Random Forest Algorithm via Incremental Upper Bound (YF, YI, SK, AK, JA, NU), pp. 2205–2208.
CIKM-2019-WangCCCHHLC #interactive #mining #mobile #named #process #visualisation: TraVis: An Interactive Visualization System for Mining Inbound Traveler Activities by Leveraging Mobile Ad Request Data (PXW, HC, WQC, CCC, YHH, THH, YL, CHC), pp. 2881–2884.
ICML-2019-AminKMV #difference #privacy #trade-off: Bounding User Contributions: A Bias-Variance Trade-off in Differential Privacy (KA, AK, AMM, SV), pp. 263–271.
ICML-2019-Chen #analysis #consistency #fault #kernel #nearest neighbour: Nearest Neighbor and Kernel Survival Analysis: Nonasymptotic Error Bounds and Strong Consistency Rates (GHC), pp. 1001–1010.
ICML-2019-LiuTC #on the: On Certifying Non-Uniform Bounds against Adversarial Attacks (CL, RT, VC), pp. 4072–4081.
ICML-2019-PolianskiiP #approach #classification #geometry #integration #monte carlo: Voronoi Boundary Classification: A High-Dimensional Geometric Approach via Weighted Monte Carlo Integration (VP, FTP), pp. 5162–5170.
ICML-2019-PooleOOAT #on the: On Variational Bounds of Mutual Information (BP, SO, AvdO, AA, GT), pp. 5171–5180.
ICML-2019-RamamurthyVM #data analysis: Topological Data Analysis of Decision Boundaries with Application to Model Selection (KNR, KRV, KM), pp. 5351–5360.
ICML-2019-X #named #policy #predict #using: POLITEX: Regret Bounds for Policy Iteration using Expert Prediction, pp. 3692–3702.
ICML-2019-ZanetteB #learning #problem #using: Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds (AZ, EB), pp. 7304–7312.
ICML-2019-ZhouG #optimisation: Lower Bounds for Smooth Nonconvex Finite-Sum Optimization (DZ, QG), pp. 7574–7583.
Onward-2019-StoelSV #named #relational: AlleAlle: bounded relational model finding with unbounded data (JS, TvdS, JJV), pp. 46–61.
OOPSLA-2019-GencRXB #concurrent #detection #predict: Dependence-aware, unbounded sound predictive race detection (KG, JR, YX, MDB), p. 30.
POPL-2019-BaeL #logic #model checking #using: Bounded model checking of signal temporal logic properties using syntactic separation (KB, JL), p. 30.
POPL-2019-BlanchetteGPT: Bindings as bounded natural functors (JCB, LG, AP0, DT), p. 34.
POPL-2019-DudenhefnerR #approximate: Principality and approximation under dimensional bound (AD, JR), p. 29.
CASE-2019-JiangL #game studies #network: Bayesian Stackelberg Game Model for Water Supply Networks against Bounded Rational Interdictors (JJ, XL), pp. 842–847.
CASE-2019-RaineriB #realtime: Jerk limited planner for real-time applications requiring variable velocity bounds (MR, CGLB), pp. 1611–1617.
CASE-2019-ZabinskyHH #approximate #branch #heuristic: Integrating Heuristics and Approximations into a Branch and Bound Framework* (ZBZ, TYH, HH), pp. 774–779.
CASE-2019-ZakerimaneshTHT: Task-Space Position and Containment Control of Redundant Manipulators with Bounded Inputs (AZ, AT, FH, MT), pp. 431–436.
CGO-2019-RodriguesGP #array #generative #in memory: Generation of In-Bounds Inputs for Arrays in Memory-Unsafe Languages (MR, BG, FMQP), pp. 136–148.
FASE-2019-ZhangSMC #analysis #constraints #scheduling #smt #specification: SMT-Based Bounded Schedulability Analysis of the Clock Constraint Specification Language (MZ0, FS, FM, XC0), pp. 61–78.
CAV-2019-FengCZF0 #difference #equation #verification: Taming Delays in Dynamical Systems - Unbounded Verification of Delay Differential Equations (SF, MC, NZ, MF, BX0), pp. 650–669.
CAV-2019-KolblLW: Clock Bound Repair for Timed Systems (MK, SL, TW), pp. 79–96.
ICTSS-2019-ErardG #source code #testing: Bounded Exhaustive Testing with Certified and Optimized Data Enumeration Programs (CE, AG), pp. 159–175.
VMCAI-2019-LuCC0 #source code: Type-Directed Bounding of Collections in Reactive Programs (TL, PC, BYEC, AT0), pp. 275–296.
JCDL-2018-JayarathnaS #eye tracking #modelling: Evaluating Saccade-Bounded Eye Movement Features for the User Modeling (SJ, SS), pp. 21–24.
DLT-2018-JiraskovaO #automaton #complexity #towards: Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata (GJ, AO), pp. 441–452.
ICFP-2018-AccattoliGK: Tight typings and split bounds (BA, SGL, DK), p. 30.
ICML-2018-AbeilleL #linear #polynomial #problem: Improved Regret Bounds for Thompson Sampling in Linear Quadratic Control Problems (MA, AL), pp. 1–9.
ICML-2018-Allen-ZhuBL #first-order: Make the Minority Great Again: First-Order Regret Bound for Contextual Bandits (ZAZ, SB, YL), pp. 186–194.
ICML-2018-Arora0NZ #approach: Stronger Generalization Bounds for Deep Nets via a Compression Approach (SA, RG0, BN, YZ), pp. 254–263.
ICML-2018-ChenTZHC: Variational Inference and Model Selection with Generalized Evidence Bounds (LC, CT, RZ, RH, LC), pp. 892–901.
ICML-2018-Dziugaite0: Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priors (GKD, DMR0), pp. 1376–1385.
ICML-2018-KimW #approximate #predict #self #string: Self-Bounded Prediction Suffix Tree via Approximate String Matching (DK0, CJW), pp. 2664–2672.
ICML-2018-LangeKA #clustering #correlation #performance: Partial Optimality and Fast Lower Bounds for Weighted Correlation Clustering (JHL, AK, BA), pp. 2898–2907.
ICML-2018-MehrabiTY #approximate #network #power of: Bounds on the Approximation Power of Feedforward Neural Networks (MM, AT, MIY), pp. 3450–3458.
ICML-2018-MouZGW: Dropout Training, Data-dependent Regularization, and Generalization Bounds (WM, YZ, JG, LW0), pp. 3642–3650.
ICML-2018-NguyenNDRST #convergence #exclamation: SGD and Hogwild! Convergence Without the Bounded Gradients Assumption (LMN, PHN, MvD, PR, KS, MT), pp. 3747–3755.
ICML-2018-RainforthKLMIWT: Tighter Variational Bounds are Not Necessarily Better (TR, ARK, TAL, CJM, MI, FW, YWT), pp. 4274–4282.
ICML-2018-Scarlett #optimisation: Tight Regret Bounds for Bayesian Optimization in One Dimension (JS), pp. 4507–4515.
ICML-2018-SerraTR #linear #network: Bounding and Counting Linear Regions of Deep Neural Networks (TS, CT, SR), pp. 4565–4573.
ICML-2018-WeiszGS #algorithm #approximate #named: LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration (GW, AG, CS), pp. 5254–5262.
ICML-2018-ZanetteB #identification #learning #problem: Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs (AZ, EB), pp. 5732–5740.
ICML-2018-ZhouMBGYLF #distributed #how #optimisation #question: Distributed Asynchronous Optimization with Unbounded Delays: How Slow Can You Go? (ZZ, PM, NB, PWG, YY, LJL, LFF0), pp. 5965–5974.
ICPR-2018-LiZLL #bottom-up #constraints #estimation #multi: Bottom-up Pose Estimation of Multiple Person with Bounding Box Constraint (ML, ZZ, JL, XL), pp. 115–120.
ICPR-2018-PramerdorferKL #3d #classification #multi #network: Multi-View Classification and 3D Bounding Box Regression Networks (CP, MK, MVL), pp. 734–739.
ICPR-2018-SongZR #network: UAV Target Tracking with A Boundary-Decision Network (KS, WZ0, XR), pp. 2576–2581.
ICPR-2018-ZhangZZL #detection #image #performance: Boundary-based Image Forgery Detection by Fast Shallow CNN (ZZ, YZ, ZZ, JL), pp. 2658–2663.
KDD-2018-KumagaiI #learning: Learning Dynamics of Decision Boundaries without Additional Labeled Data (AK, TI), pp. 1627–1636.
KDD-2018-Ting #empirical #estimation #fault #named #using: Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributions (DT), pp. 2319–2328.
OOPSLA-2018-KakiESJ #concurrent #replication #verification: Safe replication through bounded concurrency verification (GK, KE, KCS, SJ), p. 27.
PLDI-2018-DolanSM: Bounding data races in space and time (SD, KCS, AM), pp. 242–255.
PLDI-2018-LiuW #analysis #concurrent #interprocedural #named #source code: CUBA: interprocedural Context-UnBounded Analysis of concurrent programs (PL, TW), pp. 105–119.
PLDI-2018-NgoC0 #analysis #probability #source code: Bounded expectations: resource analysis for probabilistic programs (VCN, QC, JH0), pp. 496–512.
PLDI-2018-RoemerGB #concurrent #detection #predict: High-coverage, unbounded sound predictive race detection (JR, KG, MDB), pp. 374–389.
SAS-2018-JacqueminPV #analysis #fault #float: A Reduced Product of Absolute and Relative Error Bounds for Floating-Point Analysis (MJ, SP, FV), pp. 223–242.
SAS-2018-MastroeniP #verification: Verifying Bounded Subset-Closed Hyperproperties (IM, MP), pp. 263–283.
ASE-2018-MonteiroGCF #c++ #framework #model checking #platform #source code: Bounded model checking of C++ programs based on the Qt cross-platform framework (journal-first abstract) (FRM, MAPG, LCC, EBdLF), p. 954.
CASE-2018-JantschNWHM #approach #branch: Enhanced branch and bound approach for receding horizon based planning (MJ, NNN, LW, MH, UM), pp. 160–163.
CC-2018-ZhaoK0 #compilation #framework: A polyhedral compilation framework for loops with dynamic data-dependent bounds (JZ0, MK, AC0), pp. 14–24.
CAV-2018-CordeiroKKST #bytecode #java #model checking #named #verification: JBMC: A Bounded Model Checking Tool for Verifying Java Bytecode (LCC, PK, DK, PS, MT), pp. 183–190.
CAV-2018-BouajjaniEJQ #message passing #on the #source code #verification: On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony (AB, CE, KJ, SQ), pp. 372–391.
CSL-2018-FijalkowMMR #logic: Quantifying Bounds in Strategy Logic (NF, BM, AM, SR), p. 23.
IJCAR-2018-Bromberger #linear #problem #reduction: A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems (MB), pp. 329–345.
IJCAR-2018-PayetS #abstract interpretation #array: Checking Array Bounds by Abstract Interpretation and Symbolic Expressions (ÉP, FS), pp. 706–722.
TAP-2018-Keller #higher-order #testing #verification: Tactic Program-Based Testing and Bounded Verification in Isabelle/HOL (CK), pp. 103–119.
DLT-2017-Yamakami #automaton #complexity #probability: One-Way Bounded-Error Probabilistic Pushdown Automata and Kolmogorov Complexity - (Preliminary Report) (TY), pp. 353–364.
FSCD-2017-KanovichKMS #algorithm #calculus #order #polynomial: A Polynomial-Time Algorithm for the Lambek Calculus with Brackets of Bounded Order (MIK, SK, GM, AS), p. 17.
SEFM-2017-CabodiCPPV #learning #model checking: Interpolation-Based Learning as a Mean to Speed-Up Bounded Model Checking (Short Paper) (GC, PC, MP, PP, DV), pp. 382–387.
AIIDE-2017-PowleyCW #memory management #monte carlo: Memory Bounded Monte Carlo Tree Search (EJP, PIC, DW), pp. 94–100.
ICML-2017-AvronKMMVZ #approximate #fourier #kernel #random #statistics: Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees (HA, MK, CM, CM, AV, AZ), pp. 253–262.
ICML-2017-AzarOM #learning: Minimax Regret Bounds for Reinforcement Learning (MGA, IO, RM), pp. 263–272.
ICML-2017-BachemLH0 #clustering: Uniform Deviation Bounds for k-Means Clustering (OB, ML, SHH, AK0), pp. 283–291.
ICML-2017-Domke: A Divergence Bound for Hybrids of MCMC and Variational Inference and an Application to Langevin Dynamics and SGVI (JD), pp. 1029–1038.
ICML-2017-McNamaraB: Risk Bounds for Transferring Representations With and Without Fine-Tuning (DM, MFB), pp. 2373–2381.
ICML-2017-MirrokniLVW #approximate: Tight Bounds for Approximate Carathéodory and Beyond (VSM, RPL, AV, SCwW), pp. 2440–2448.
ICML-2017-MukkamalaH: Variants of RMSProp and Adagrad with Logarithmic Regret Bounds (MCM, MH0), pp. 2545–2553.
ICML-2017-ShalitJS #algorithm: Estimating individual treatment effect: generalization bounds and algorithms (US, FDJ, DAS), pp. 3076–3085.
KDD-2017-AvinLNP #network: Improved Degree Bounds and Full Spectrum Power Laws in Preferential Attachment Networks (CA, ZL, YN, DP), pp. 45–53.
KDD-2017-YinLN #education #scalability: Small Batch or Large Batch?: Gaussian Walk with Rebound Can Teach (PY, PL0, TN), pp. 1275–1284.
Onward-2017-JangdaY: Unbounded superoptimization (AJ, GY), pp. 78–88.
OOPSLA-2017-CelikPKG #generative: Bounded exhaustive test-input generation on GPUs (AÇ, SP, SK, MG), p. 25.
AdaEurope-2017-DiazFKMHAC #analysis #manycore #named #probability: MC2: Multicore and Cache Analysis via Deterministic and Probabilistic Jitter Bounding (ED, MF, LK, EM, CH, JA, FJC), pp. 102–118.
LOPSTR-2017-LiqatBLH #energy #modelling #program analysis: Inferring Energy Bounds via Static Program Analysis and Evolutionary Modeling of Basic Blocks (UL, ZB, PLG0, MVH), pp. 54–72.
POPL-2017-DudenhefnerR #calculus: Intersection type calculi of bounded dimension (AD, JR), pp. 653–665.
POPL-2017-HoffmannDW #analysis #automation #ml #towards: Towards automatic resource bound analysis for OCaml (JH0, AD, SCW), pp. 359–373.
ESEC-FSE-2017-CelikVMG #testing #virtual machine: Regression test selection across JVM boundaries (AÇ, MV, AM, MG), pp. 809–820.
ASPLOS-2017-BarbalaceLJCCLR: Breaking the Boundaries in Heterogeneous-ISA Datacenters (AB, RL, CJ, AC, HRC, VL, BR), pp. 645–659.
CASE-2017-0003AG #fault #reduction: Model reduction techniques with error bounds (MI0, MJA, AG), pp. 1510–1515.
CASE-2017-RiaziWBL #energy #optimisation: Energy and peak-power optimization of time-bounded robot trajectories (SR, OW, KB, BL), p. 1301.
CC-2017-FedericoPA #analysis #framework: rev.ng: a unified binary analysis framework to recover CFGs and function boundaries (ADF, MP, GA), pp. 131–141.
CGO-2017-SenguptaCBK #hardware #memory management #named #transaction #using: Legato: end-to-end bounded region serializability using commodity hardware transactional memory (AS, MC, MDB, MK0), pp. 1–13.
CADE-2017-Cruanes #satisfiability: Satisfiability Modulo Bounded Checking (SC), pp. 114–129.
CAV-2017-ChatterjeeFM #analysis #automation: Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds (KC, HF0, AM), pp. 118–139.
CAV-2017-FaymonvilleFT #framework #named #synthesis: BoSy: An Experimentation Framework for Bounded Synthesis (PF, BF, LT), pp. 325–332.
CAV-2017-KhalimovB #synthesis: Bounded Synthesis for Streett, Rabin, and CTL* (AK, RB), pp. 333–352.
CAV-2017-MaricSB #algorithm: Cutoff Bounds for Consensus Algorithms (OM, CS0, DAB), pp. 217–237.
CSL-2017-ChenFH #first-order #logic #quantifier #rank #slicing: Slicewise Definability in First-Order Logic with Bounded Quantifier Rank (YC, JF, XH), p. 16.
ICST-2017-DarkeCCV #abstraction #model checking #performance #proving #safety #using: Efficient Safety Proofs for Industry-Scale Code Using Abstractions and Bounded Model Checking (PD, BC, AC, RV), pp. 468–475.
SCAM-2016-GaoHMW #model checking #named #testing: LLSPLAT: Improving Concolic Testing by Bounded Model Checking (MG0, LH, RM, ZW), pp. 127–136.
CIAA-2016-IbarraM #linear #on the: On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L (OHI, IM), pp. 138–149.
FM-2016-DellabaniCBB #interactive #multi: Local Planning of Multiparty Interactions with Bounded Horizons (MD, JC, MB, SB), pp. 199–216.
FM-2016-Flores-Montoya #source code: Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations (AFM), pp. 254–273.
SEFM-2016-BendikBBC #analysis #order #requirements #safety #set: Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis (JB, NB, JB, IC), pp. 121–136.
ICML-2016-AltschulerBFMRZ #algorithm #distributed #set: Greedy Column Subset Selection: New Bounds and Distributed Algorithms (JA, AB, GF, VSM, AR, MZ), pp. 2539–2548.
ICML-2016-DavidS #algorithm #performance #problem: PAC Lower Bounds and Efficient Algorithms for The Max K-Armed Bandit Problem (YD, NS), pp. 878–887.
ICML-2016-HoilesS #design #education #evaluation #recommendation: Bounded Off-Policy Evaluation with Missing Data for Course Recommendation and Curriculum Design (WH, MvdS), pp. 1596–1604.
ICML-2016-KomiyamaHN #algorithm #performance #problem: Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm (JK, JH, HN), pp. 1235–1244.
ICML-2016-NewlingF #performance: Fast k-means with accurate bounds (JN, FF), pp. 936–944.
ICML-2016-PuleoM #clustering #correlation #fault: Correlation Clustering and Biclustering with Locally Bounded Errors (GJP, OM), pp. 869–877.
ICPR-2016-BullingerBWA #generative #re-engineering #using #video: Moving object reconstruction in monocular video data using boundary generation (SB, CB, SW, MA), pp. 240–246.
ICPR-2016-Lan0DAH #matrix: A PAC bound for joint matrix completion based on Partially Collective Matrix Factorization (CL, XL0, YD, JSA, JH), pp. 2628–2633.
ICPR-2016-LuoLQ #analysis #optimisation #probability: Bound analysis of natural gradient descent in stochastic optimization setting (ZL, DL, YQ), pp. 4166–4171.
ICPR-2016-MezumanW #finite: A tight convex upper bound on the likelihood of a finite mixture (EM, YW), pp. 1683–1688.
ICPR-2016-RubioYSM #named #segmentation: BASS: Boundary-Aware Superpixel Segmentation (AR, LY, ESS, FMN), pp. 2824–2829.
KDD-2016-HooiSBSSF #graph #named: FRAUDAR: Bounding Graph Fraud in the Face of Camouflage (BH, HAS, AB, NS, KS, CF), pp. 895–904.
KDD-2016-ReddyLBJ #learning #scheduling: Unbounded Human Learning: Optimal Scheduling for Spaced Repetition (SR, IL, SB, TJ), pp. 1815–1824.
MoDELS-2016-Blache #c #development #embedded #modelling #safety #using: Handling index-out-of-bounds in safety-critical embedded C code using model-based development (GB), pp. 143–149.
LOPSTR-2016-JanaKDVC #array #model checking #scalability #source code: Scaling Bounded Model Checking by Transforming Programs with Arrays (AJ, UPK, AD, RV, NC), pp. 275–292.
POPL-2016-HagueKO #automaton #higher-order: Unboundedness and downward closures of higher-order pushdown automata (MH, JK, CHLO), pp. 151–163.
QAPL-2016-LarsenLZ15 #energy #exclamation #game studies: Limit Your Consumption! Finding Bounds in Average-energy Games (KGL, SL, MZ0), pp. 1–14.
SAS-2016-ChristakisW #abstract interpretation: Bounded Abstract Interpretation (MC, VW), pp. 105–125.
SAS-2016-GangeNSSS #matrix: Exploiting Sparsity in Difference-Bound Matrices (GG, JAN, PS, HS, PJS), pp. 189–211.
ASE-2016-Nishi #model checking #programming #towards #using: Towards bounded model checking using nonlinear programming solver (MN), pp. 560–565.
FSE-2016-Monteiro #finite #fixpoint #implementation #model checking #modelling: Bounded model checking of state-space digital systems: the impact of finite word-length effects on the implementation of fixed-point digital controllers based on state-space modeling (FRM), pp. 1151–1153.
CASE-2016-HanLD #feedback #mobile: Flocking of mobile robots by bounded feedback (TTH, HML, BHD), pp. 689–694.
CASE-2016-LeeL #3d #estimation #recognition: Object recognition and pose estimation based on 3D planar closed loop boundaries (YL, SL0), pp. 245–250.
CASE-2016-Ritt #algorithm #permutation #problem #scheduling: A branch-and-bound algorithm with cyclic best-first search for the permutation flow shop scheduling problem (MR), pp. 872–877.
CC-2016-DuckY #pointer: Heap bounds protection with low fat pointers (GJD, RHCY), pp. 132–142.
FASE-2016-WeckesserLSRS #automation #detection #exclamation #feature model #modelling: Mind the Gap! Automated Anomaly Detection for Potentially Unbounded Cardinality-Based Feature Models (MW, ML, TS, BR, AS), pp. 158–175.
CAV-2016-FinkbeinerK #synthesis: Bounded Cycle Synthesis (BF, FK0), pp. 118–135.
CAV-2016-LeggNR #satisfiability #synthesis: A SAT-Based Counterexample Guided Method for Unbounded Synthesis (AL, NN, LR), pp. 364–382.
CSL-2016-KotekVZ #finite #higher-order #monad #satisfiability: Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (TK, HV, FZ), p. 20.
IJCAR-2016-AthanasiouLW #equation #thread #using #verification: Unbounded-Thread Program Verification using Thread-State Equations (KA, PL, TW), pp. 516–531.
IJCAR-2016-FrohnNHBG #integer #runtime #source code: Lower Runtime Bounds for Integer Programs (FF, MN, JH, MB, JG), pp. 550–567.
VMCAI-2016-HashemiH0 #nondeterminism #probability #reachability: Reward-Bounded Reachability Probability for Uncertain Weighted MDPs (VH, HH, LS0), pp. 351–371.
VLDB-2015-AkidauBCCFLMMPS #approach #correctness #data flow #latency: The Dataflow Model: A Practical Approach to Balancing Correctness, Latency, and Cost in Massive-Scale, Unbounded, Out-of-Order Data Processing (TA, RB, CC, SC, RFM, RL, SM, DM, FP, ES, SW), pp. 1792–1803.
CIAA-J-2013-JirasekJ15 #on the #regular expression: On the boundary of regular languages (JJ, GJ), pp. 42–57.
DLT-2015-JirasekJ: The Boundary of Prefix-Free Languages (JJ, GJ), pp. 300–312.
DLT-2015-Yamakami #complexity #quantum: Complexity Bounds of Constant-Space Quantum Computation — (TY), pp. 426–438.
ICALP-v1-2015-Ailon #fourier: Tighter Fourier Transform Lower Bounds (NA), pp. 14–25.
ICALP-v1-2015-BeameLP: Finding the Median (Obliviously) with Bounded Space (PB, VL, MP), pp. 103–115.
ICALP-v1-2015-FeldmannFKP #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 #graph #morphism #problem: Lower Bounds for the Graph Homomorphism Problem (FVF, AG, ASK, IM), pp. 481–493.
ICALP-v1-2015-KayalKPS: Lower Bounds for Sums of Powers of Low Degree Univariates (NK, PK, TP, CS), pp. 810–821.
ICALP-v1-2015-KomarathSS #finite: Comparator Circuits over Finite Bounded Posets (BK, JS, KSS), pp. 834–845.
ICALP-v1-2015-Sanyal #fourier: Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (SS), pp. 1035–1045.
ICALP-v2-2015-BojanczykMW #clique #datalog #monad #source code: Containment of Monadic Datalog Programs via Bounded Clique-Width (MB, FM, AW), pp. 427–439.
ICALP-v2-2015-FijalkowHKS #game studies #memory management: Trading Bounds for Memory in Games with Counters (NF, FH, DK, MS), pp. 197–208.
ICALP-v2-2015-GairingKK #game studies: Tight Bounds for Cost-Sharing in Weighted Congestion Games (MG, KK, GK), pp. 626–637.
LATA-2015-AmanoS #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 #clique #graph: Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.
LATA-2015-EremondiIM: Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.
LATA-2015-KrishnaMT #automaton #decidability #problem #reachability #recursion: Time-Bounded Reachability Problem for Recursive Timed Automata is Undecidable (SNK, LM, AT), pp. 237–248.
FM-2015-0001K #model checking #using: Property-Driven Fence Insertion Using Reorder Bounded Model Checking (SJ, DK), pp. 291–307.
FM-2015-BagheriKMJ #android #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 #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 #model checking #proving #safety: Proving Safety with Trace Automata and Bounded Model Checking (DK, ML, GW), pp. 325–341.
RTA-2015-FrohnGHAS #complexity #runtime: Inferring Lower Bounds for Runtime Complexity (FF, JG, JH, CA, TS), pp. 334–349.
SEFM-2015-ClarisoGC #ocl #refinement #towards #uml #verification: Towards Domain Refinement for UML/OCL Bounded Verification (RC, CAG, JC), pp. 108–114.
SEFM-2015-RochaBC #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 #refinement: Bounded refinement types (NV, AB, RJ), pp. 48–61.
CHI-2015-BlomkvistPA #agile #communication #distributed: Communication through Boundary Objects in Distributed Agile Teams (JKB, JP, JÅ), pp. 1875–1884.
CHI-2015-CecchinatoCB #difference #email: Working 9-5?: Professional Differences in Email and Boundary Management Practices (MEC, ALC, JB), pp. 3989–3998.
CHI-2015-FleckCR #multi #using: Balancing Boundaries: Using Multiple Devices to Manage Work-Life Balance (RF, ALC, RAVR), pp. 3985–3988.
CHI-2015-YerousisARRRW: Computer-Enabled Project Spaces: Connecting with Palestinian Refugees across Camp Boundaries (GPY, KA, TvR, DWR, MR, VW), pp. 3749–3758.
DUXU-UI-2015-GomezFD #education: Transcending Disciplinary, Cultural and National Boundaries: Emergent Technologies, New Education Landscape and the Cloud Workshop Project (RG, PF, RD), pp. 631–642.
HCI-IT-2015-HakodaKSST #gesture #mobile #named #using: AirFlip: A Double Crossing In-Air Gesture Using Boundary Surfaces of Hover Zone for Mobile Devices (HH, TK, KS, BS, JT), pp. 44–53.
ICML-2015-AgarwalB #finite #optimisation: A Lower Bound for the Optimization of Finite Sums (AA, LB), pp. 78–86.
ICML-2015-KordaA #approximate #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 #learning: Improved Regret Bounds for Undiscounted Continuous Reinforcement Learning (KL, RO, DR), pp. 524–532.
ICML-2015-TagortiS #convergence #fault #on the: On the Rate of Convergence and Error Bounds for LSTD(λ) (MT, BS), pp. 1521–1529.
ICML-2015-TewariC #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 #fault #set: An Explicit Sampling Dependent Spectral Error Bound for Column Subset Selection (TY, LZ, RJ, SZ), pp. 135–143.
ICML-2015-ZhangWJ #algorithm #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 #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 #random: Improved Bounds on the Dot Product under Random Projection and Random Sign Projection (AK), pp. 487–496.
KDD-2015-YuW0PSIW #markov #multi: Tornado Forecasting with Multiple Markov Boundaries (KY, DW, WD, JP, DLS, SI, XW), pp. 2237–2246.
PLDI-2015-0010ZTZ #named: Light: replay via tightly bounded recording (PL, XZ, OT, YZ), pp. 55–64.
PLDI-2015-Carbonneaux0S #composition: Compositional certified resource bounds (QC, JH, ZS), pp. 467–478.
POPL-2015-FarzanKP #parallel #proving: Proof Spaces for Unbounded Parallelism (AF, ZK, AP), pp. 407–420.
SAS-2015-CattaruzzaASK #analysis: Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (DC, AA, PS, DK), pp. 312–331.
ASE-2015-InversoN0TP #concurrent #model checking #multi #named #thread: Lazy-CSeq: A Context-Bounded Model Checking Tool for Multi-threaded C-Programs (OI, TLN, BF, SLT, GP), pp. 807–812.
ASE-2015-LerchSBM #abstraction #analysis #data flow #scalability: Access-Path Abstraction: Scaling Field-Sensitive Data-Flow Analysis with Unbounded Access Paths (T) (JL, JS, EB, MM), pp. 619–629.
ASE-2015-TomanPT #named #rust #verification: Crust: A Bounded Verifier for Rust (N) (JT, SP, ET), pp. 75–80.
SAC-2015-Puffitsch #analysis #branch #predict: Persistence-based branch misprediction bounds for WCET analysis (WP), pp. 1898–1905.
GPCE-2015-ReyndersDP #api #generative: Generating safe boundary APIs between typed EDSLs and their environments (BR, DD, FP), pp. 31–34.
ASPLOS-2015-MorrisonA #symmetry: Temporally Bounding TSO for Fence-Free Asymmetric Synchronization (AM, YA), pp. 45–58.
ASPLOS-2015-NguyenWBFHX #big data #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 #dynamic analysis #hybrid: Hybrid Static: Dynamic Analysis for Statically Bounded Region Serializability (AS, SB, MZ, MDB, MK), pp. 561–575.
CASE-2015-FeiAR #clustering #resource management #symbolic computation #using: Symbolic computation of boundary unsafe states in complex resource allocation systems using partitioning techniques (ZF, KÅ, SAR), pp. 799–806.
CASE-2015-Michalek #standard: Motion control with minimization of a boundary off-track for non-Standard N-trailers along forward-followed paths (MMM), pp. 1564–1569.
CASE-2015-PerriBL #online: Jerk bounded velocity planner for the online management of autonomous vehicles (SP, CGLB, ML), pp. 618–625.
CASE-2015-TanakaM #algorithm #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 #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 #model checking #using: Over-approximating loops to prove properties using bounded model checking (PD, BC, RV, US, RM), pp. 1407–1412.
DATE-2015-KimAS #composition #scheduling: Schedulability bound for integrated modular avionics partitions (JEK, TFA, LS), pp. 37–42.
PDP-2015-KonstantinidisC #gpu #kernel #memory management #performance: A Practical Performance Model for Compute and Memory Bound GPU Kernels (EK, YC), pp. 651–658.
FASE-2015-FedyukovichDHS #dependence #detection #model checking: Symbolic Detection of Assertion Dependencies for Bounded Model Checking (GF, ACD, AEJH, NS), pp. 186–201.
FoSSaCS-2015-Ganardi #clique #game studies: Parity Games of Bounded Tree- and Clique-Width (MG), pp. 390–404.
STOC-2015-AbdullahV #difference: A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds (AA, SV), pp. 509–518.
STOC-2015-BarakCK #independence: Sum of Squares Lower Bounds from Pairwise Independence (BB, SOC, PKK), pp. 97–106.
STOC-2015-Chechik #approximate #distance: Approximate Distance Oracles with Improved Bounds (SC), pp. 1–10.
STOC-2015-HardtP #learning: Tight Bounds for Learning a Mixture of Two Gaussians (MH, EP), pp. 753–760.
STOC-2015-KoppulaLW #memory management #obfuscation #turing machine: Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (VK, ABL, BW), pp. 419–428.
STOC-2015-LarsenNN #adaptation #algorithm #streaming: Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms (KGL, JN, HLN), pp. 803–812.
STOC-2015-LeeRS #programming: Lower Bounds on the Size of Semidefinite Programming Relaxations (JRL, PR, DS), pp. 567–576.
STOC-2015-LiuL: FPTAS for #BIS with Degree Bounds on One Side (JL, PL), pp. 549–556.
STOC-2015-MekaPW #clique: Sum-of-squares Lower Bounds for Planted Clique (RM, AP, AW), pp. 87–96.
TACAS-2015-Nguyen0TP #c #contest #lazy evaluation #source code: Unbounded Lazy-CSeq: A Lazy Sequentialization Tool for C Programs with Unbounded Context Switches — (Competition Contribution) (TLN, BF, SLT, GP), pp. 461–463.
CADE-2015-BackemanR #proving #theorem proving: Theorem Proving with Bounded Rigid E-Unification (PB, PR), pp. 572–587.
CAV-2015-MajumdarW #model checking #named #source code: Bbs: A Phase-Bounded Model Checker for Asynchronous Programs (RM, ZW), pp. 496–503.
CAV-2015-ErezN #automation #graph #smt #using: Finding Bounded Path in Graph Using SMT for Automatic Clock Routing (AE, AN), pp. 20–36.
CSL-2015-Kaiser0LL #approach: A Unified Approach to Boundedness Properties in MSO (LK, ML, SL, CL), pp. 441–456.
ICST-2015-XuLCK #approach #detection #lightweight #thread: A Lightweight, Static Approach to Detecting Unbounded Thread-Instantiation Loops (JX, YL, RHC, DCK), pp. 1–10.
ICTSS-2015-WeisslederWL #automation #design #product line: Automated Test Design for Boundaries of Product Line Variants (SW, FW, HL), pp. 86–101.
LICS-2015-BenediktCCB #complexity #logic: The Complexity of Boundedness for Guarded Logics (MB, BtC, TC, MVB), pp. 293–304.
LICS-2015-HeijltjesH #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 #logic #refinement: Universal Covers, Color Refinement, and Two-Variable Counting Logic: Lower Bounds for the Depth (AK, OV), pp. 689–700.
SAT-2015-MenciaPM #satisfiability: SAT-Based Horn Least Upper Bounds (CM, AP, JMS), pp. 423–433.
VMCAI-2015-MukundRS #data type #implementation: Bounded Implementations of Replicated Data Types (MM, GSR, SPS), pp. 355–372.
WICSA-2014-BiancoMKR #case study #ecosystem #framework #platform: The Role of Platform Boundary Resources in Software Ecosystems: A Case Study (VdB, VM, MK, MR), pp. 11–20.
SIGMOD-2014-FanWW #graph #query: Querying big graphs within bounded resources (WF, XW, YW), pp. 301–312.
VLDB-2014-CaoFWY #query: Bounded Conjunctive Queries (YC, WF, TW, WY), pp. 1231–1242.
VLDB-2014-YanCZ: Error-bounded Sampling for Analytics on Big Sparse Data (YY, LJC, ZZ), pp. 1508–1519.
VLDB-2015-BegumK14: Rare Time Series Motif Discovery from Unbounded Streams (NB, EJK), pp. 149–160.
ITiCSE-2014-MI #query: A method to prove query lower bounds (JM, SI), pp. 81–86.
CIAA-2014-DumitranGMM: Bounded Prefix-Suffix Duplication (MD, JG, FM, VM), pp. 176–187.
DLT-2014-BrzozowskiS #complexity: Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.
DLT-2014-TorreNP #automaton: Scope-Bounded Pushdown Languages (SLT, MN, GP), pp. 116–128.
ICALP-v1-2014-BravermanG: Public vs Private Coin in Bounded-Round Information (MB, AG), pp. 502–513.
ICALP-v1-2014-BrietDHS #approximate: Lower Bounds for Approximate LDCs (JB, ZD, GH, SS), pp. 259–270.
ICALP-v1-2014-KolMSY #approximate #rank: Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound (GK, SM, AS, AY), pp. 701–712.
ICALP-v1-2014-KumarS: Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits (MK, SS), pp. 751–762.
ICALP-v1-2014-MancinskaV #probability: Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability (LM, TV), pp. 835–846.
ICALP-v1-2014-NelsonN: Lower Bounds for Oblivious Subspace Embeddings (JN, HLN), pp. 883–894.
ICALP-v1-2014-Volkovich #learning #on the: On Learning, Lower Bounds and (un)Keeping Promises (IV), pp. 1027–1038.
ICALP-v2-2014-AdjiashviliR #graph: Labeling Schemes for Bounded Degree Graphs (DA, NR), pp. 375–386.
ICALP-v2-2014-AschnerK #constraints #modelling #network: Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints (RA, MJK), pp. 387–398.
ICALP-v2-2014-KopelowitzKPS #graph #worst-case: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.
LATA-2014-BestD #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 #process: DFA with a Bounded Activity Level (MK, HUS), pp. 478–489.
FM-2014-PonzioRAF #performance: Efficient Tight Field Bounds Computation Based on Shape Predicates (PP, NR, NA, MFF), pp. 531–546.
ICFP-2014-SchoepeHS #named: SeLINQ: tracking information across application-database boundaries (DS, DH, AS), pp. 25–38.
CIG-2014-VodopivecS #difference: Enhancing upper confidence bounds for trees with temporal difference values (TV, BS), pp. 1–8.
FDG-2014-GarbeRDWM #combinator #visualisation: Author assistance visualizations for Ice-Bound, a combinatorial narrative (JG, AAR, MD, NWF, MM).
FDG-2014-GarbeRWM #configuration management #named #novel: Ice-Bound: A novel of reconfiguration (JG, AAR, NWF, MM).
FDG-2014-ReedGWM #named: Ice-Bound: Combining richly-realized story with expressive gameplay (AAR, JG, NWF, MM).
CHI-2014-LeeSS #analysis #design #research: Stay on the boundary: artifact analysis exploring researcher and user framing of robot design (HRL, SS, ES), pp. 1471–1474.
CHI-2014-WaycottDVMGOK: Captioned photographs in psychosocial aged care: relationship building and boundary work (JW, HD, FV, AM, AG, EO, LK), pp. 4167–4176.
CSCW-2014-GavilanesMQ #communication #social #twitter: Twitter ain’t without frontiers: economic, social, and cultural boundaries in international communication (ROGG, YM, DQ), pp. 1511–1522.
CIKM-2014-LiuXCXTY #approach #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 #learning: Provable Bounds for Learning Some Deep Representations (SA, AB, RG, TM), pp. 584–592.
ICML-c1-2014-CombesP #algorithm: Unimodal Bandits: Regret Lower Bounds and Optimal Algorithms (RC, AP), pp. 521–529.
ICML-c1-2014-DenisGH #learning #matrix: Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning (FD, MG, AH), pp. 449–457.
ICML-c1-2014-IyerNS #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 #independence #learning: (Near) Dimension Independent Risk Bounds for Differentially Private Learning (PJ, AGT), pp. 476–484.
ICML-c2-2014-Kontorovich #algorithm #metric: Concentration in unbounded metric spaces and algorithmic stability (AK), pp. 28–36.
ICML-c2-2014-MuHWG: Square Deal: Lower Bounds and Improved Relaxations for Tensor Recovery (CM, BH, JW, DG), pp. 73–81.
ICML-c2-2014-PentinaL #learning: A PAC-Bayesian bound for Lifelong Learning (AP, CHL), pp. 991–999.
ICML-c2-2014-ToshD: Lower Bounds for the Gibbs Sampler over Mixtures of Gaussians (CT, SD), pp. 1467–1475.
ICML-c2-2014-ZoghiWMR #problem: Relative Upper Confidence Bound for the K-Armed Dueling Bandit Problem (MZ, SW, RM, MdR), pp. 10–18.
KR-2014-HaririCD: State-Boundedness in Data-Aware Dynamic Systems (BBH, DC, MM, AD).
KR-2014-LomuscioM14a #model checking: Model Checking Unbounded Artifact-Centric Systems (AL, JM).
KR-2014-Razgon #on the: On OBDDs for CNFs of Bounded Treewidth (IR).
OOPSLA-2014-RosnerBPKAFK #generative #hybrid #invariant: Bounded exhaustive test input generation from hybrid invariants (NR, VSB, PP, SAK, NA, MFF, SK), pp. 655–674.
PLDI-2014-Carbonneaux0RS #c #source code #verification: End-to-end verification of stack-space bounds for C programs (QC, JH, TR, ZS), p. 30.
PLDI-2014-GreenmanMT #morphism #polymorphism: Getting F-bounded polymorphism into shape (BG, FM, RT), p. 12.
PLDI-2014-LuuSSD #constraints #string: A model counter for constraints over unbounded strings (LL, SS, PS, BD), p. 57.
ASE-2014-BasuB #automation #interactive #verification: Automatic verification of interactions in asynchronous systems with unbounded buffers (SB, TB), pp. 743–754.
SLE-2014-KursLN #semiparsing: Bounded Seas — Island Parsing Without Shipwrecks (JK, ML, ON), pp. 62–81.
ASPLOS-2014-MorrisonA: Fence-free work stealing on bounded TSO processors (AM, YA), pp. 413–426.
ASPLOS-2014-SaniBQZ: I/o paravirtualization at the device file boundary (AAS, KB, SQ, LZ), pp. 319–332.
CASE-2014-ChiuC #detection #image: A variance-reduction method for thyroid nodule boundary detection on ultrasound images (LYC, AC), pp. 681–685.
CASE-2014-TanakaT #algorithm #performance #problem: A faster branch-and-bound algorithm for the block relocation problem (ST, KT), pp. 7–12.
DAC-2014-AxerTED #network #performance: Exploiting Shaper Context to Improve Performance Bounds of Ethernet AVB Networks (PA, DT, RE, JD), p. 6.
DATE-2014-LongLY #analysis #evaluation #modelling #multi: Analysis and evaluation of per-flow delay bound for multiplexing models (YL, ZL, XY), pp. 1–4.
DATE-2014-SongDY #analysis #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: Empowering study of delay bound tightness with simulated annealing (XZ, ZL), pp. 1–6.
PPoPP-2014-ThomsonDB #concurrent #empirical #testing #using: Concurrency testing using schedule bounding: an empirical study (PT, AFD, AB), pp. 15–28.
ESOP-2014-GhicaS #linear: Bounded Linear Types in a Resource Semiring (DRG, AIS), pp. 331–350.
ESOP-2014-KothaACESB #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 #markov #probability #process #reachability: Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes (HF), pp. 73–87.
STOC-2014-ChekuriC #polynomial #theorem: Polynomial bounds for the grid-minor theorem (CC, JC), pp. 60–69.
STOC-2014-DworkTT0 #analysis #component #privacy: Analyze gauss: optimal bounds for privacy-preserving principal component analysis (CD, KT, AT, LZ), pp. 11–20.
STOC-2014-ElberfeldK #graph: Embedding and canonizing graphs of bounded genus in logspace (ME, KiK), pp. 383–392.
STOC-2014-EneV #algorithm #approximate #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 #matrix #multi: Lower bounds for depth 4 formulas computing iterated matrix multiplication (HF, NL, GM, SS), pp. 128–135.
STOC-2014-FriggstadS #algorithm #approximate: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing (ZF, CS), pp. 744–753.
STOC-2014-GavinskyMWW #approach #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 #communication: Communication lower bounds via critical block sensitivity (MG, TP), pp. 847–856.
STOC-2014-KayalLSS: Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas (NK, NL, CS, SS), pp. 119–127.
STOC-2014-KayalSS: A super-polynomial lower bound for regular arithmetic formulas (NK, CS, RS), pp. 146–153.
STOC-2014-Lovett #communication #rank: Communication is bounded by root of rank (SL), pp. 842–846.
STOC-2014-Williams #algorithm #linear: New algorithms and lower bounds for circuits with linear threshold gates (RW), pp. 194–202.
TACAS-2014-KroeningT #c #contest #model checking #named: CBMC — C Bounded Model Checker — (Competition Contribution) (DK, MT), pp. 389–391.
TACAS-2014-Siirtola #composition #multi #named #verification: Bounds2: A Tool for Compositional Multi-parametrised Verification (AS), pp. 599–604.
CAV-2014-BinghamL #fault #simulation #using #verification: Verifying Relative Error Bounds Using Symbolic Simulation (JB, JLH), pp. 277–292.
CAV-2014-InversoT0TP #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-LeeS #abstraction #approximate #reachability #scalability #verification: Unbounded Scalable Verification Based on Approximate Property-Directed Reachability and Datapath Abstraction (SL, KAS), pp. 849–865.
CAV-2014-MadhavanK #functional #source code: Symbolic Resource Bound Inference for Functional Programs (RM, VK), pp. 762–778.
CAV-2014-SinnZV #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 #logic #problem: Achieving new upper bounds for the hypergraph duality problem through logic (GG, EM), p. 10.
LICS-CSL-2014-HarwathHS #composition #theorem: Preservation and decomposition theorems for bounded degree structures (FH, LH, NS), p. 10.
LICS-CSL-2014-LerouxPS #automaton: Hyper-Ackermannian bounds for pushdown vector addition systems (JL, MP, GS), p. 10.
SAT-2014-JarvisaloK: Conditional Lower Bounds for Failed Literals and Related Techniques (MJ, JHK), pp. 75–84.
TAP-2014-HentschelHB #execution #symbolic computation #visualisation: Visualizing Unbounded Symbolic Execution (MH, RH, RB), pp. 82–98.
TAP-2014-KampmannGZ #execution #named #performance #verification: JTACO: Test Execution for Faster Bounded Verification (AK, JPG, AZ), pp. 134–141.
DocEng-2013-VielMPT: Go beyond boundaries of iTV applications (CCV, ELM, MdGCP, CACT), pp. 263–272.
ICDAR-2013-HePXSN #3d #re-engineering: A Book Dewarping System by Boundary-Based 3D Surface Reconstruction (YH, PP, SX, JS, SN), pp. 403–407.
PODS-2013-KazanaS #first-order #query: Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.
SIGMOD-2013-VlachouDNK #algorithm #query: Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.
SIGMOD-2013-YakoutBE #automation #scalability: Don’t be SCAREd: use SCalable Automatic REpairing with maximal likelihood and bounded changes (MY, LBE, AKE), pp. 553–564.
VLDB-2013-AfratiSSU #cost analysis: Upper and Lower Bounds on the Cost of a Map-Reduce Computation (FNA, ADS, SS, JDU), pp. 277–288.
ITiCSE-2013-QureshiEP #student: Students organizing against pollution: computational thinking across boundaries (SQ, FE, SMP), p. 356.
SCAM-2013-MattsenCS: Driving a sound static software analyzer with branch-and-bound (SM, PC, SS), pp. 63–68.
CIAA-2013-JirasekJ #on the #regular expression: On the Boundary of Regular Languages (JJ, GJ), pp. 208–219.
DLT-2013-Blanchet-SadriW #strict: Strict Bounds for Pattern Avoidance (FBS, BW), pp. 106–117.
ICALP-v1-2013-AndoniNPW #linear #sketching: Tight Lower Bound for Linear Sketches of Moments (AA, HLN, YP, YW), pp. 25–32.
ICALP-v1-2013-BunT #approximate: Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (MB, JT), pp. 303–314.
ICALP-v1-2013-CyganP #algorithm #graph #performance: Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.
ICALP-v1-2013-FilmusLMNV #calculus #comprehension #polynomial #towards: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (YF, ML, MM, JN, MV), pp. 437–448.
ICALP-v1-2013-KumarMN: Arithmetic Circuit Lower Bounds via MaxRank (MK, GM, JS), pp. 661–672.
ICALP-v1-2013-Lampis #graph #model checking: Model Checking Lower Bounds for Simple Graphs (ML), pp. 673–683.
ICALP-v1-2013-Leonardos #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 #random: Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (GM, AN), pp. 757–768.
ICALP-v2-2013-BecchettiBDKM #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 #evolution #network: Strong Bounds for Evolution in Networks (GBM, PGS), pp. 669–680.
LATA-2013-IbarraR #automaton #on the: On Bounded Languages and Reversal-Bounded Automata (OHI, BR), pp. 359–370.
LATA-2013-Smith: Infiniteness and Boundedness in 0L, DT0L, and T0L Systems (TS), pp. 535–546.
LATA-2013-Tveretina: A Conditional Superpolynomial Lower Bound for Extended Resolution (OT), pp. 559–569.
TLCA-2013-Clairambault #linear #reduction: Bounding Skeletons, Locally Scoped Terms and Exact Bounds for Linear Head Reduction (PC), pp. 109–124.
FDG-2013-CarterG #contest #game studies #online: eSports in EVE Online: Skullduggery, fair play and acceptability in an unbounded competition (MC, MRG), pp. 47–54.
FDG-2013-ConsalvoP #game studies: Welcome to the discourse of the real: Constituting the boundaries of games and players (MC, CAP), pp. 55–62.
CHI-2013-ShiXC #network #social #using: Using contextual integrity to examine interpersonal information boundary on social network sites (PS, HX, YC), pp. 35–38.
CSCW-2013-HalpernEFG #collaboration #design: Designing collaboration: comparing cases exploring cultural probes as boundary-negotiating objects (MKH, IE, LF, GKG), pp. 1093–1102.
CSCW-2013-HuangDLLG: Meanings and boundaries of scientific software sharing (XH, XD, CPL, TL, NG), pp. 423–434.
HCI-IMT-2013-BraunFMSM #gesture: Context-Based Bounding Volume Morphing in Pointing Gesture Application (AB, AF, AM, CS, MM), pp. 147–156.
ICML-c1-2013-GiguereLMS #algorithm #approach #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 #graph #learning: Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs (KSSK, FRB), pp. 525–533.
ICML-c1-2013-KumarLVV: Near-Optimal Bounds for Cross-Validation via Loss Stability (RK, DL, SV, AV), pp. 27–35.
ICML-c1-2013-MaillardNOR #learning #representation: Optimal Regret Bounds for Selecting the State Representation in Reinforcement Learning (OAM, PN, RO, DR), pp. 543–551.
ICML-c1-2013-MehtaG #predict: Sparsity-Based Generalization Bounds for Predictive Sparse Coding (NAM, AGG), pp. 36–44.
ICML-c3-2013-DurrantK #classification #fault: Sharp Generalization Error Bounds for Randomly-projected Classifiers (RJD, AK), pp. 693–701.
ICML-c3-2013-HonorioJ #exponential #fault: Two-Sided Exponential Concentration Bounds for Bayes Error Rate and Shannon Entropy (JH, TSJ), pp. 459–467.
ICML-c3-2013-PiresSG #classification #multi: Cost-sensitive Multiclass Classification Risk Bounds (BAP, CS, MG), pp. 1391–1399.
ICML-c3-2013-ZhangYJLH #kernel #learning #online: Online Kernel Learning with a Near Optimal Sparsity Bound (LZ, JY, RJ, ML, XH), pp. 621–629.
KDD-2013-NarasimhanA #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 #classification #performance #problem #using: When Classification becomes a Problem: Using Branch-and-Bound to Improve Classification Efficiency (AP, ML), pp. 466–480.
SIGIR-2013-KatoSYI #evaluation #robust: Report from the NTCIR-10 1CLICK-2 Japanese subtask: baselines, upperbounds and evaluation robustness (MPK, TS, TY, MI), pp. 753–756.
SIGIR-2013-TakumaY #performance: Faster upper bounding of intersection sizes (DT, HY), pp. 703–712.
OOPSLA-2013-CoonsMM #partial order #reduction: Bounded partial-order reduction (KEC, MM, KSM), pp. 833–848.
HILT-2013-Chaki #model checking: Bounded model checking of high-integrity software (SC), pp. 9–10.
PLDI-2013-CohenP #towards: Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.
REFSQ-2013-RempelMKP #overview #requirements #taxonomy #traceability: Requirements Traceability across Organizational Boundaries — A Survey and Taxonomy (PR, PM, TK, IP), pp. 125–140.
ASE-2013-ChandramohanTBSP #approach #behaviour #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 #composition #model checking #named #source code: BLITZ: Compositional bounded model checking for real-world programs (CYC, VD, DS), pp. 136–146.
ASE-2013-FalkeMS #model checking: The bounded model checker LLBMC (SF, FM, CS), pp. 706–709.
SAC-2013-BrancoLR #protocol #scalability: Bounded gossip: a gossip protocol for large-scale datacenters (MB, JL, LR), pp. 591–596.
SAC-2013-LarrosaR #constraints #distributed #optimisation: Risk-neutral bounded max-sum for distributed constraint optimization (JL, ER), pp. 92–97.
CASE-2013-OFlahertyE #learning #sequence: Learning to locomote: Action sequences and switching boundaries (RO, ME), pp. 7–12.
CGO-2013-LaiS #analysis #optimisation #performance: Performance upper bound analysis and optimization of SGEMM on Fermi and Kepler GPUs (JL, AS), p. 10.
DATE-2013-CabodiLV #model checking #optimisation: Optimization techniques for craig interpolant compaction in unbounded model checking (GC, CL, DV), pp. 1417–1422.
DATE-2013-ShahKA #analysis: Bounding SDRAM interference: detailed analysis vs. latency-rate analysis (HS, AK, BA), pp. 308–313.
DATE-2013-TzouBHC #composition #using: Periodic jitter and bounded uncorrelated jitter decomposition using incoherent undersampling (NT, DB, SWH, AC), pp. 1667–1672.
FoSSaCS-2013-BonnetC: Bounded Context-Switching and Reentrant Locking (RB, RC), pp. 65–80.
STOC-2013-Ajtai #quantifier: Lower bounds for RAMs and quantifier elimination (MA), pp. 803–812.
STOC-2013-AzarCKS #online: Tight bounds for online vector bin packing (YA, IRC, SK, FBS), pp. 961–970.
STOC-2013-BhowmickDL #product line: New bounds for matching vector families (AB, ZD, SL), pp. 823–832.
STOC-2013-BurgisserI #complexity #geometry: Explicit lower bounds via geometric complexity theory (PB, CI), pp. 141–150.
STOC-2013-ChakrabartyS13a #testing: Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids (DC, CS), pp. 419–428.
STOC-2013-FeldmanGRVX #algorithm #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 #graph: Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
STOC-2013-GuruswamiX #algebra #geometry: List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound (VG, CX), pp. 843–852.
STOC-2013-KalaiRR: Delegation for bounded space (YTK, RR, RDR), pp. 565–574.
STOC-2013-KomargodskiR: Average-case lower bounds for formula size (IK, RR), pp. 171–180.
STOC-2013-NelsonN: Sparsity lower bounds for dimensionality reducing maps (JN, HLN), pp. 101–110.
STOC-2013-Sherstov #communication #using: Communication lower bounds using directional derivatives (AAS), pp. 921–930.
TACAS-2013-FalkeMS #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.
TACAS-2013-GangeNSSS #constraints #model checking #regular expression: Unbounded Model-Checking with Interpolation for Regular Language Constraints (GG, JAN, PJS, HS, PS), pp. 277–291.
TACAS-2013-MorseCNF #contest: Handling Unbounded Loops with ESBMC 1.20 — (Competition Contribution) (JM, LCC, DN, BF), pp. 619–622.
CAV-2013-AlglaveKT #concurrent #model checking #partial order #performance: Partial Orders for Efficient Bounded Model Checking of Concurrent Software (JA, DK, MT), pp. 141–157.
CAV-2013-FarzanK #named #parallel #static analysis: Duet: Static Analysis for Unbounded Parallelism (AF, ZK), pp. 191–196.
CAV-2013-KomuravelliGCC #abstraction #automation #model checking #smt: Automatic Abstraction in SMT-Based Unbounded Software Model Checking (AK, AG, SC, EMC), pp. 846–862.
CAV-2013-StewartEY #automaton #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 #logic #quantifier: Bounds for the quantifier depth in finite-variable logics: Alternation hierarchy (CB, AK, OV), pp. 61–80.
CSL-2013-GhasemlooC #proving: Theories for Subexponential-size Bounded-depth Frege Proofs (KG, SAC), pp. 296–315.
ICLP-J-2013-AzizCS #semantics: Stable model semantics for founded bounds (RAA, GC, PJS), pp. 517–532.
ICST-2013-AbadABCFGMMRV #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.
ICST-2013-HillTB #c++ #named: GrowthTracker: Diagnosing Unbounded Heap Growth in C++ Software (EH, DJT, SB), pp. 134–143.
ISSTA-2013-BindalBL #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 #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 #normalisation: An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.
LICS-2013-MogaveroMS #behaviour #on the: On the Boundary of Behavioral Strategies (FM, AM, LS), pp. 263–272.
SAT-2013-Atserias #algebra #problem #proving: The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.
SAT-2013-Lauria #proving #rank #theorem: A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (ML), pp. 351–364.
SAT-2013-MisraORS #detection #set: Upper and Lower Bounds for Weak Backdoor Set Detection (NM, SO, VR, SS), pp. 394–402.
SIGMOD-2012-FraternaliMT: Top-k bounded diversification (PF, DM, MT), pp. 421–432.
VLDB-2012-BailisVFHS: Probabilistically Bounded Staleness for Practical Partial Quorums (PB, SV, MJF, JMH, IS), pp. 776–787.
VLDB-2012-SelkeLB #database: Pushing the Boundaries of Crowd-enabled Databases with Query-driven Schema Expansion (JS, CL, WTB), pp. 538–549.
AFL-J-2011-IbarraS12 #linear: Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.
CIAA-2012-Gusev #automaton #rank: Synchronizing Automata of Bounded Rank (VVG), pp. 171–179.
CIAA-2012-HeamHK #constraints #on the: On Positive TAGED with a Bounded Number of Constraints (PCH, VH, OK), pp. 329–336.
CIAA-2012-ReidenbachS #automaton #nondeterminism: Automata with Modulo Counters and Nondeterministic Counter Bounds (DR, MLS), pp. 361–368.
DLT-2012-CaralpRT #automaton #multi: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness (MC, PAR, JMT), pp. 226–238.
DLT-2012-FazekasMS: Hairpin Completion with Bounded Stem-Loop (SZF, RM, KST), pp. 428–439.
ICALP-v1-2012-AchlioptasM #random #satisfiability: Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.
ICALP-v1-2012-ChanLN #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: Max-Cut Parameterized above the Edwards-Erdős Bound (RC, MJ, MM), pp. 242–253.
ICALP-v1-2012-KapralovP #metric: NNS Lower Bounds via Metric Expansion for l ∞ and EMD (MK, RP), pp. 545–556.
ICALP-v1-2012-Kimmel #quantum: Quantum Adversary (Upper) Bound (SK), pp. 557–568.
ICALP-v1-2012-LaplanteLR #detection #quantum: Classical and Quantum Partition Bound and Detector Inefficiency (SL, VL, JR), pp. 617–628.
ICALP-v1-2012-Marx #multi: A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals (DM), pp. 677–688.
ICALP-v2-2012-AtseriasD #approximate #quantifier: Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.
ICALP-v2-2012-FearnleyS #game studies: Time and Parallelizability Results for Parity Games with Bounded Treewidth (JF, SS), pp. 189–200.
ICALP-v2-2012-KikotKPZ #exponential #query: Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.
LATA-2012-ReidenbachS: Patterns with Bounded Treewidth (DR, MLS), pp. 468–479.
IFM-2012-RochaBCN #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.
SEFM-2012-ColomboFMP #configuration management #monitoring #named #resource management #runtime #verification: polyLarva: Runtime Verification with Configurable Resource-Aware Monitoring Boundaries (CC, AF, RM, GJP), pp. 218–232.
CHI-2012-WisniewskiLW: Fighting for my space: coping mechanisms for sns boundary regulation (PJW, HRL, DW), pp. 609–618.
CSCW-2012-FredericW #social #social media: Boundary regulation in social media (SF, HW), pp. 769–778.
ICML-2012-FoxT: Bounded Planning in Passive POMDPs (RF, NT), p. 15.
ICML-2012-FreitasSZ #exponential #process: Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations (NdF, AJS, MZ), p. 125.
ICML-2012-HoiWZJW #algorithm #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 #fault #learning: A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound (MJ, TY, BL, RJ, JH), p. 110.
ICML-2012-MorvantKR #classification #matrix #multi: PAC-Bayesian Generalization Bound on Confusion Matrix for Multi-Class Classification (EM, SK, LR), p. 158.
ICML-2012-Petrik #approximate #programming #robust: Approximate Dynamic Programming By Minimizing Distributionally Robust Bounds (MP), p. 207.
ICPR-2012-ChenYZZ #detection #network: Detecting occlusion boundaries via saliency network (DC, ZY, GZ, NZ), pp. 2569–2572.
ICPR-2012-LiuSZWBCT #detection: Joint shot boundary detection and key frame extraction (XL, MS, LZ, SW, JB, CC, DT), pp. 2565–2568.
ICPR-2012-SongZJB #robust #video: Robust video stabilization based on bounded path planning (CS, HZ, WJ, YB), pp. 3684–3687.
ICPR-2012-SuYLW #classification #editing #using: Local color editing using color classification and boundary inpainting (ZS, XY, XL, DW), pp. 3196–3199.
ICPR-2012-WangHB #locality: Glass object localization by joint inference of boundary and depth (TW, XH, NB), pp. 3783–3786.
ICPR-2012-ZhangXY #detection #modelling: An improved surround suppression model based on orientation contrast for boundary detection (HZ, BX, JY), pp. 3086–3089.
KDD-2012-ZhangY #community #detection #matrix: Overlapping community detection via bounded nonnegative matrix tri-factorization (YZ, DYY), pp. 606–614.
KR-2012-GiacomoLP #calculus #decidability #verification: Bounded Situation Calculus Action Theories and Decidable Verification (GDG, YL, FP).
KR-2012-GiordanoMD #model checking: Achieving Completeness in Bounded Model Checking of Action Theories in ASP (LG, AM, DTD).
POPL-2012-KrishnaswamiBH #functional #higher-order #programming: Higher-order functional reactive programming in bounded space (NRK, NB, JH), pp. 45–58.
QAPL-2012-PalamidessiS #algebra #constraints #difference #privacy #relational: Differential Privacy for Relational Algebra: Improving the Sensitivity Bounds via Constraint Systems (CP, MS), pp. 92–105.
ASE-2012-NijjarB #smt #using #verification: Unbounded data model verification using SMT solvers (JN, TB), pp. 210–219.
FSE-2012-NearJ #named #verification #web: Rubicon: bounded verification of web applications (JPN, DJ), p. 60.
ICSE-2012-ZhouXZ #named #polynomial #search-based: Stride: Search-based deterministic replay in polynomial time via bounded linkage (JZ, XX, CZ), pp. 892–902.
SAC-2012-El-ShambakeyR #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 #on the #using: On using adversary simulators to obtain tight lower bounds for response times (RSdO, AC, RAS), pp. 1573–1579.
SAC-2012-ShahidPO: Minimum bounding boxes for regular cross-polytopes (SS, SP, CBO), pp. 879–884.
CASE-2012-KehoeBG #adaptation: Estimating part tolerance bounds based on adaptive Cloud-based grasp planning with slip (BK, DB, KG), pp. 1106–1113.
CASE-2012-ParkM #behaviour #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.
CC-2012-ShirakoSFPRSS: Analytical Bounds for Optimal Tile Size Selection (JS, KS, NF, LNP, JR, PS, VS), pp. 101–121.
CGO-2012-HasabnisMS: Light-weight bounds checking (NH, AM, RS), pp. 135–144.
DAC-2012-El-ShambakeyR #concurrent #embedded #realtime: STM concurrency control for embedded real-time software with tighter time bounds (MES, BR), pp. 437–446.
DATE-2012-AxerSE #probability: Probabilistic response time bound for CAN messages with arbitrary deadlines (PA, MS, RE), pp. 1114–1117.
DATE-2012-ShahRK #scheduling #using: Bounding WCET of applications using SDRAM with Priority Based Budget Scheduling in MPSoCs (HS, AR, AK), pp. 665–670.
PDP-2012-BoukedjarLB #branch #cpu #gpu #parallel: Parallel Branch and Bound on a CPU-GPU System (AB, MEL, DEB), pp. 392–398.
STOC-2012-AgrawalSSS: 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 #trade-off: Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space (PB, CB, RI), pp. 213–232.
STOC-2012-BulanekKS #online #problem: Tight lower bounds for the online labeling problem (JB, MK, MES), pp. 1185–1198.
STOC-2012-ChanP #analysis #fourier #network: Tight bounds for monotone switching networks via fourier analysis (SMC, AP), pp. 495–504.
STOC-2012-FioriniMPTW #exponential #linear: Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
STOC-2012-GalHKPV: 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 #random: A tight RMR lower bound for randomized mutual exclusion (GG, PW), pp. 983–1002.
STOC-2012-WoodruffZ #distributed #functional #monitoring: Tight bounds for distributed functional monitoring (DPW, QZ), pp. 941–960.
TACAS-2012-BouajjaniE #analysis #message passing #source code: Bounded Phase Analysis of Message-Passing Programs (AB, ME), pp. 451–465.
TACAS-2012-CordeiroMNF #contest #model checking: Context-Bounded Model Checking with ESBMC 1.17 — (Competition Contribution) (LCC, JM, DN, BF), pp. 534–537.
TACAS-2012-CoxSC #precise #verification: A Bit Too Precise? Bounded Verification of Quantized Digital Filters (AC, SS, BYEC), pp. 33–47.
TACAS-2012-DSilvaHKT #analysis #learning: Numeric Bounds Analysis with Conflict-Driven Learning (VD, LH, DK, MT), pp. 48–63.
TACAS-2012-SinzMF #contest #model checking #named #representation: LLBMC: A Bounded Model Checker for LLVM’s Intermediate Representation — (Competition Contribution) (CS, FM, SF), pp. 542–544.
CAV-2012-HagueL #analysis #parallel #source code #thread: Synchronisation- and Reversal-Bounded Analysis of Multithreaded Programs with Counters (MH, AWL), pp. 260–276.
CAV-2012-Moskal #c #infinity #verification: From C to Infinity and Back: Unbounded Auto-active Verification with VCC (MM), p. 6.
CSL-2012-BertrandFS #satisfiability: Bounded Satisfiability for PCTL (NB, JF, SS), pp. 92–106.
CSL-2012-DudderMRU #combinator #logic: Bounded Combinatory Logic (BD, MM, JR, PU), pp. 243–258.
CSL-2012-Kuroda #axiom #concept #proving: Axiomatizing proof tree concepts in Bounded Arithmetic (SK), pp. 440–454.
ICST-2012-CadavidBS #metamodelling #modelling: Searching the Boundaries of a Modeling Space to Test Metamodels (JJC, BB, HAS), pp. 131–140.
ICST-2012-LiuNT #case study #smt #using #verification: Bounded Program Verification Using an SMT Solver: A Case Study (TL, MN, MT), pp. 101–110.
IJCAR-2012-EmmerKKSV #model checking #word: EPR-Based Bounded Model Checking at Word Level (ME, ZK, KK, CS, AV), pp. 210–224.
IJCAR-2012-SpielmannK #synthesis: Synthesis for Unbounded Bit-Vector Arithmetic (AS, VK), pp. 499–513.
LICS-2012-BartoKW #constraints: Near Unanimity Constraints Have Bounded Pathwidth Duality (LB, MK, RW), pp. 125–134.
LICS-2012-Berkholz #game studies #testing: Lower Bounds for Existential Pebble Games and k-Consistency Tests (CB), pp. 25–34.
LICS-2012-BundalaOW #model checking #on the: On the Magnitude of Completeness Thresholds in Bounded Model Checking (DB, JO, JW), pp. 155–164.
LICS-2012-EsparzaGM #verification: A Perfect Model for Bounded Verification (JE, PG, RM), pp. 285–294.
LICS-2012-GrigorieffV #algorithm #using: Functionals Using Bounded Information and the Dynamics of Algorithms (SG, PV), pp. 345–354.
SAT-2012-AchlioptasM #algorithm #exponential #random #satisfiability: Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
TAP-2012-BengoleaAMF #test coverage #testing #using: Using Coverage Criteria on RepOK to Reduce Bounded-Exhaustive Test Suites (VSB, NA, DM, MFF), pp. 19–34.
PODS-2011-JowhariST #problem: Tight bounds for Lp samplers, finding duplicates in streams, and related problems (HJ, MS, GT), pp. 49–58.
ITiCSE-2011-MarkhamB #twitter #using: Collaborating across international boundaries: using twitter as a tool in the classroom (SM, SB), p. 382.
ICSM-2011-YazdanshenasM #component: Crossing the boundaries while analyzing heterogeneous component-based software systems (ARY, LM), pp. 193–202.
DLT-J-2009-BealBP11 #automaton #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 #simulation: Simulations by Time-Bounded Counter Machines (HP), pp. 395–409.
AFL-2011-IbarraS #linear: Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.
DLT-2011-KortelainenS #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 #graph: Tight Bounds for Linkages in Planar Graphs (IA, SGK, PKK, DL, SS, DMT), pp. 110–121.
ICALP-v1-2011-BeyersdorffGLR: Parameterized Bounded-Depth Frege Is Not Optimal (OB, NG, ML, AAR), pp. 630–641.
ICALP-v1-2011-BordewichK #agile #graph #set: Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width (MB, RJK), pp. 533–544.
ICALP-v1-2011-CliffordJ #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 #exponential: Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (YF, TP, RS), pp. 618–629.
ICALP-v1-2011-HarkinsH #algorithm #game studies #learning: Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (RCH, JMH), pp. 416–423.
ICALP-v1-2011-KawarabayashiKS #approximate #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 #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 #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-BrazdilKKV #analysis #probability #recursion #runtime #source code: Runtime Analysis of Probabilistic Programs with Unbounded Recursion (TB, SK, AK, IHV), pp. 319–331.
ICALP-v2-2011-BrihayeDGORW #automaton #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 #distributed #scheduling: Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model (MMH, PM), pp. 625–636.
ICALP-v2-2011-SchmitzS #multi #recursion: Multiply-Recursive Upper Bounds with Higman’s Lemma (SS, PS), pp. 441–452.
LATA-2011-Quaas #automaton #on the #problem: On the Interval-Bound Problem for Weighted Timed Automata (KQ), pp. 452–464.
FM-2011-AlbertGGJST #behaviour #concurrent #simulation #worst-case: Simulating Concurrent Behaviors with Worst-Case Cost Bounds (EA, SG, MGZ, EBJ, RS, SLTT), pp. 353–368.
FM-2011-DiosP #certification #memory management #polynomial: Certification of Safe Polynomial Memory Bounds (JdD, RP), pp. 184–199.
RTA-2011-DurandS #linear: Left-linear Bounded TRSs are Inverse Recognizability Preserving (ID, MS), pp. 361–376.
SEFM-2011-MorseCNF #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 #data flow #satisfiability #verification: A Dataflow Analysis to Improve SAT-Based Bounded Program Verification (BCP, JPG, DG, MFF), pp. 138–154.
ICFP-2011-WeirichYS: Binders unbound (SW, BAY, TS), pp. 333–345.
CHI-2011-KuznetsovTKHPS: Breaking boundaries: strategies for mentoring through textile computing workshops (SK, LCT, CK, IH, EP, DPS), pp. 2957–2966.
CHI-2011-ZhouAZ: CPOE workarounds, boundary objects, and assemblages (XZ, MSA, KZ), pp. 3353–3362.
CAiSE-2011-Finkelstein #challenge #information management #re-engineering: Ten Open Challenges at the Boundaries of Software Engineering and Information Systems (AF), p. 1.
ICEIS-v1-2011-ChenZ #analysis: Analysis on the Spatial Variation of the Center of Gravity of Inbound Tourism in China (YC, HZ), pp. 441–447.
CIKM-2011-LiuLH #fault #kernel #learning: Learning kernels with upper bounds of leave-one-out error (YL, SL, YH), pp. 2205–2208.
CIKM-2011-LvZ #normalisation: Lower-bounding term frequency normalization (YL, CZ), pp. 7–16.
ICML-2011-JegelkaB11a #approximate #using: Approximation Bounds for Inference using Cooperative Cuts (SJ, JAB), pp. 577–584.
ICML-2011-LiuI #difference #using: Bounding the Partition Function using Holder’s Inequality (QL, ATI), pp. 849–856.
ICML-2011-MarlinKM #modelling: Piecewise Bounds for Estimating Bernoulli-Logistic Latent Gaussian Models (BMM, MEK, KPM), pp. 633–640.
ICML-2011-RoyLM #polynomial #source code: From PAC-Bayes Bounds to Quadratic Programs for Majority Votes (JFR, FL, MM), pp. 649–656.
ICML-2011-Scott #classification: Surrogate losses and regret bounds for cost-sensitive classification with example-dependent costs (CS), pp. 153–160.
KDD-2011-IfrimW #biology #classification #coordination #predict #sequence: Bounded coordinate-descent for biological sequence classification in high dimensional predictor space (GI, CW), pp. 708–716.
KDD-2011-RaissiP #towards: Towards bounding sequential patterns (CR, JP), pp. 1379–1387.
MLDM-2011-AlshukriCZ #detection #incremental #random #using: Incremental Web-Site Boundary Detection Using Random Walks (AA, FC, MZ), pp. 414–427.
PEPM-2011-Rinard #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.
POPL-2011-BenderskyP #memory management: Space overhead bounds for dynamic memory management with partial compaction (AB, EP), pp. 475–486.
POPL-2011-EmmiQR #scheduling: Delay-bounded scheduling (ME, SQ, ZR), pp. 411–422.
SAS-2011-MonniauxG #fixpoint #model checking #using: Using Bounded Model Checking to Focus Fixpoint Iterations (DM, LG), pp. 369–385.
SAS-2011-ZulegerGSV #abstraction #analysis #imperative #source code: Bound Analysis of Imperative Programs with the Size-Change Abstraction (FZ, SG, MS, HV), pp. 280–297.
RE-2011-UbayashiKHT #analysis #embedded: A context analysis method for embedded systems — Exploring a requirement boundary between a system and its context (NU, YK, MH, TT), pp. 143–152.
ASE-2011-IvancicBGSMTIM #framework #named #scalability #verification: DC2: A framework for scalable, scope-bounded software verification (FI, GB, AG, SS, NM, HT, TI, YM), pp. 133–142.
ICSE-2011-CordeiroF #concurrent #model checking #multi #smt #thread #using #verification: Verifying multi-threaded software using smt-based context-bounded model checking (LC, BF), pp. 331–340.
CASE-2011-WuS #multi #problem: A lower and upper bound guided nested partitions method for solving capacitated multi-level production planning problems (TW, LS), pp. 78–83.
CC-2011-JoynerBS #analysis #array: Subregion Analysis and Bounds Check Elimination for High Level Arrays (MJ, ZB, VS), pp. 246–265.
DAC-2011-HaoTSS #analysis #performance #process: Performance bound analysis of analog circuits considering process variations (ZH, SXDT, RS, GS), pp. 310–315.
DAC-2011-HsiaoD #parallel #scalability: A highly scalable parallel boundary element method for capacitance extraction (YCH, LD), pp. 552–557.
DATE-2011-LuHCT: Steiner tree based rotary clock routing with bounded skew and capacitive load balancing (JL, VH, XC, BT), pp. 455–460.
DATE-2011-ShahRK #latency #performance: Priority division: A high-speed shared-memory bus arbitration with bounded latency (HS, AR, AK), pp. 1497–1500.
DATE-2011-TsaiLCKCK #on the: On routing fixed escaped boundary pins for high speed boards (TYT, RJL, CYC, CYK, HMC, YK), pp. 461–466.
STOC-2011-AdamaszekCER #order: Almost tight bounds for reordering buffer management (AA, AC, ME, HR), pp. 607–616.
STOC-2011-BarakDYW #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 #communication #complexity: An optimal lower bound on the communication complexity of gap-hamming-distance (AC, OR), pp. 51–60.
STOC-2011-FriedmannHZ #algorithm #random: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
STOC-2011-LeeS: Near-optimal distortion bounds for embedding doubling spaces into L1 (JRL, AS), pp. 765–772.
STOC-2011-LenzenW #parallel #random: Tight bounds for parallel randomized load balancing: extended abstract (CL, RW), pp. 11–20.
STOC-2011-SaxenaS #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 #csp: Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
TACAS-2011-Ehlers #named #synthesis: Unbeast: Symbolic Bounded Synthesis (RE), pp. 272–275.
CADE-2011-KorovinV #linear: Solving Systems of Linear Inequalities by Bound Propagation (KK, AV), pp. 369–383.
CAV-2011-BrazdilKK #analysis #performance #probability #source code: Efficient Analysis of Probabilistic Programs with an Unbounded Counter (TB, SK, AK), pp. 208–224.
CAV-2011-KroeningOSWW #linear #model checking: Linear Completeness Thresholds for Bounded Model Checking (DK, JO, OS, TW, JW), pp. 557–572.
CSL-2011-CaiZ: Tight Upper Bounds for Streett and Parity Complementation (YC, TZ), pp. 112–128.
ISSTA-2011-NijjarB #modelling #ruby #verification: Bounded verification of Ruby on Rails data models (JN, TB), pp. 67–77.
LICS-2011-FigueiraFSS #recursion: Ackermannian and Primitive-Recursive Bounds with Dickson’s Lemma (DF, SF, SS, PS), pp. 269–278.
SAT-2011-Williams #algorithm #complexity #satisfiability: Connecting SAT Algorithms and Complexity Lower Bounds (RW), pp. 1–2.
TAP-2011-AguirreBFG #black box #generative #test coverage #testing: Incorporating Coverage Criteria in Bounded Exhaustive Black Box Test Generation of Structural Inputs (NA, VSB, MFF, JPG), pp. 15–32.
AFL-J-2008-MalcherMP10 #array: Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 843–858.
DLT-2010-BremerF #problem: Inclusion Problems for Patterns with a Bounded Number of Variables (JB, DDF), pp. 100–111.
DLT-2010-DrosteV #automaton #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: Cell Probe Lower Bounds and Approximations for Range Mode (MG, AGJ, KDL, JT), pp. 605–616.
ICALP-v2-2010-Fearnley #exponential #policy: Exponential Lower Bounds for Policy Iteration (JF), pp. 551–562.
ICALP-v2-2010-OuaknineW #formal method #towards #verification: Towards a Theory of Time-Bounded Verification (JO, JW), pp. 22–37.
LATA-2010-FlorencioF #approach #consistency: Finding Consistent Categorial Grammars of Bounded Value: A Parameterized Approach (CCF, HF), pp. 202–213.
LATA-2010-Neary: A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems (TN), pp. 475–487.
RTA-2010-DurandSS #linear #term rewriting #termination: Termination of linear bounded term rewriting systems (ID, GS, MS), pp. 341–356.
RTA-2010-Waldmann #matrix: Polynomially Bounded Matrix Interpretations (JW), pp. 357–372.
FLOPS-2010-KetemaS #diagrams #term rewriting #λ-calculus: Least Upper Bounds on the Size of Church-Rosser Diagrams in Term Rewriting and λ-Calculus (JK, JGS), pp. 272–287.
CHI-2010-AarhusB: Negotiating boundaries: managing disease at home (RA, SAB), pp. 1223–1232.
CHI-2010-AssogbaD #named #programming: Share: a programming environment for loosely bound cooperation (YA, JSD), pp. 961–970.
CHI-2010-DantecE #information management #multi: Across boundaries of influence and accountability: the multiple scales of public sector information systems (CALD, WKE), pp. 113–122.
CIKM-2010-XiaoLC #concept: K-farthest-neighbors-based concept boundary determination for support vector data description (YX, BL, LC), pp. 1701–1704.
ECIR-2010-AnderkaSP #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 #kernel #learning: Generalization Bounds for Learning Kernels (CC, MM, AR), pp. 247–254.
ICML-2010-SorgSL: Internal Rewards Mitigate Agent Boundedness (JS, SPS, RLL), pp. 1007–1014.
ICML-2010-SzitaS #complexity #learning #modelling: Model-based reinforcement learning with nearly tight exploration complexity bounds (IS, CS), pp. 1031–1038.
ICPR-2010-BaldacciBD #3d #algorithm #design #framework #graph #segmentation: Oriented Boundary Graph: A Framework to Design and Implement 3D Segmentation Algorithms (FB, AJPB, JPD), pp. 1116–1119.
ICPR-2010-BauerEOBKFHN #approach #estimation #graph #performance #robust: A Fast and Robust Graph-Based Approach for Boundary Estimation of Fiber Bundles Relying on Fractional Anisotropy Maps (MHAB, JE, TO, SB, JK, BF, HKH, CN), pp. 4016–4019.
ICPR-2010-DurrantK #performance: A Bound on the Performance of LDA in Randomly Projected Data Spaces (RJD, AK), pp. 4044–4047.
ICPR-2010-KhosrowabadiQWA #detection #recognition #self #using: EEG-based Emotion Recognition Using Self-Organizing Map for Boundary Detection (RK, HCQ, AW, KKA), pp. 4242–4245.
ICPR-2010-PhamTN #segmentation #similarity #using: Bounding-Box Based Segmentation with Single Min-cut Using Distant Pixel Similarity (VQP, KT, TN), pp. 4420–4423.
ICPR-2010-ZhangK #analysis: Weighted Boundary Points for Shape Analysis (JZ, RK), pp. 1598–1601.
KDD-2010-PrengerLVCH #classification #fault: Class-specific error bounds for ensemble classifiers (RJP, TDL, KRV, BYC, WGH), pp. 843–852.
KR-2010-PichlerRSW #constraints #programming: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).
KR-2010-ZhangZ #on the #semantics #set #source code: On the Progression Semantics and Boundedness of Answer Set Programs (YZ, YZ).
SIGIR-2010-WangLC #detection #query: Intent boundary detection in search query logs (CJW, KHYL, HHC), pp. 749–750.
MoDELS-v2-2010-ParetoEE #architecture #design: Architectural Descriptions as Boundary Objects in System and Design Work (LP, PE, SE), pp. 406–419.
SPLC-2010-ElsnerULS #consistency #product line: Consistent Product Line Configuration across File Type and Product Line Boundaries (CE, PU, DL, WSP), pp. 181–195.
PEPM-2010-AndersonK #approximate #termination: Regular approximation and bounded domains for size-change termination (HA, SCK), pp. 53–62.
PLDI-2010-GulwaniZ #problem: The reachability-bound problem (SG, FZ), pp. 292–304.
SAS-2010-AliasDFG #complexity #multi #ranking #source code #termination: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs (CA, AD, PF, LG), pp. 117–133.
ASE-2010-HeJBGW #approach #model checking #statistics: A bounded statistical approach for model checking of unbounded until properties (RH, PJ, SB, APG, HW), pp. 225–234.
ICSE-2010-Cordeiro #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 #verification: A cut-off approach for bounded verification of parameterized systems (QY, ML), pp. 345–354.
SAC-2010-CampanTC: User-controlled generalization boundaries for p-sensitive k-anonymity (AC, TMT, NC), pp. 1103–1104.
CASE-2010-Hsu #markov #safety: Control of continuous-time Markov chains with safety upper bounds (SPH), pp. 990–993.
CASE-2010-MacwanNB #approach #multi #novel #online #predict #probability: On-line target-motion prediction for autonomous multirobot search in realistic terrains with time-expanding boundaries: A novel probabilistic approach (AM, GN, BB), pp. 662–667.
CASE-2010-WuZ #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 #hardware: Hardware that produces bounded rather than exact results (MAB), pp. 871–876.
DAC-2010-LinLHC #constraints: Performance-driven analog placement considering boundary constraint (CWL, JML, CPH, SJC), pp. 292–297.
DAC-2010-LiuKLC #concurrent #multi #thread: Multi-threaded collision-aware global routing with bounded-length maze routing (WHL, WCK, YLL, KYC), pp. 200–205.
DATE-2010-BuLWCL #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 #multi #performance: Bounding the shared resource load for the performance analysis of multiprocessor systems (SS, MN, RE), pp. 759–764.
LCTES-2010-AltmeyerMR #analysis: Resilience analysis: tightening the CRPD bound for set-associative caches (SA, CM, JR), pp. 153–162.
ESOP-2010-NaumannB #first-order #higher-order #information management: Dynamic Boundaries: Information Hiding by Second Order Framing with First Order Assertions (DAN, AB), pp. 2–22.
FoSSaCS-2010-WiesZH #analysis #process: Forward Analysis of Depth-Bounded Processes (TW, DZ, TAH), pp. 94–108.
STOC-2010-BateniHM #approximate #graph: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
STOC-2010-ChierichettiLP: Almost tight bounds for rumour spreading with conductance (FC, SL, AP), pp. 399–408.
STOC-2010-DiakonikolasHKMRST #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 #multi #problem: The maximum multiflow problems with bounded fractionality (HH), pp. 115–120.
STOC-2010-KarninMSV #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 #polynomial #problem #towards: Towards polynomial lower bounds for dynamic problems (MP), pp. 603–610.
STOC-2010-Raz: Tensor-rank and lower bounds for arithmetic formulas (RR), pp. 659–666.
STOC-2010-Sherstov: Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (AAS), pp. 523–532.
STOC-2010-VerbinZ #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: Improving exhaustive search implies superpolynomial lower bounds (RW), pp. 231–240.
TACAS-2010-MalinowskiN #automaton #model checking #partial order #satisfiability #semantics: SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata (JM, PN), pp. 405–419.
CAV-2010-BouajjaniDERS #invariant #source code #synthesis: Invariant Synthesis for Programs Manipulating Lists with Unbounded Data (AB, CD, CE, AR, MS), pp. 72–88.
CAV-2010-Ehlers #synthesis: Symbolic Bounded Synthesis (RE), pp. 365–379.
CAV-2010-GantyMM #approximate: Bounded Underapproximations (PG, RM, BM), pp. 600–614.
CAV-2010-Seth #automaton #multi #reachability: Global Reachability in Bounded Phase Multi-stack Pushdown Systems (AS), pp. 615–628.
CAV-2010-ZhouHWG #array #on the: On Array Theory of Bounded Elements (MZ, FH, BYW, MG), pp. 570–584.
ISSTA-2010-GaleottiRPF #analysis #invariant #performance #verification: Analysis of invariants for efficient bounded verification (JPG, NR, CLP, MFF), pp. 25–36.
LICS-2010-JenkinsORW #automaton: Alternating Timed Automata over Bounded Time (MJ, JO, AR, JW), pp. 60–69.
LICS-2010-KreutzerT #complexity #higher-order #logic #monad: Lower Bounds for the Complexity of Monadic Second-Order Logic (SK, ST), pp. 189–198.
SAT-2010-Ben-SassonJ #learning #strict: Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.
SAT-2010-BoufkhadH #satisfiability: Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold (YB, TH), pp. 99–112.
SAT-2010-MillerKLB #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 #random #satisfiability: Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.
VMCAI-2010-ChadhaLPV #complexity #realtime #verification: Complexity Bounds for the Verification of Real-Time Software (RC, AL, PP, MV), pp. 95–111.
VMCAI-2010-Dubrovin #reachability: Checking Bounded Reachability in Asynchronous Systems by Symbolic Event Tracing (JD), pp. 146–162.
DRR-2009-TaghvaC #analysis #documentation #using: Document boundary determination using structural and lexical analysis (KT, MAC), pp. 1–10.
ICDAR-2009-LiuBMG #detection #fault #sequence: Improving the Table Boundary Detection in PDFs by Fixing the Sequence Error of the Sparse Lines (YL, KB, PM, CLG), pp. 1006–1010.
ICDAR-2009-SharmaL: Form Field Frame Boundary Removal for Form Processing System in Gurmukhi Script (DVS, GSL), pp. 256–260.
ICDAR-2009-WangC #detection #documentation #image: Logo Detection in Document Images Based on Boundary Extension of Feature Rectangles (HW, YC), pp. 1335–1339.
PODS-2009-BerindeCIS #fault: Space-optimal heavy hitters with strong error bounds (RB, GC, PI, MJS), pp. 157–166.
PODS-2009-GottlobLV #query: Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.
PODS-2009-Yi #query: Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes (KY), pp. 187–196.
VLDB-2009-MoerkotteNS #estimation #fault: Preventing Bad Plans by Bounding the Impact of Cardinality Estimation Errors (GM, TN, GS), pp. 982–993.
WCRE-1999-PassingSLP99a #named: NTrace: Function Boundary Tracing for Windows on IA-32 (JP, AS, MvL, AP), pp. 43–52.
DLT-2009-BealP #automaton #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 #complexity #regular expression: Tight Bounds on the Descriptional Complexity of Regular Expressions (HG, MH), pp. 276–287.
DLT-2009-Petersen #simulation: Simulations by Time-Bounded Counter Machines (HP), pp. 410–418.
DLT-2009-Shur: Two-Sided Bounds for the Growth Rates of Power-Free Languages (AMS), pp. 466–477.
ICALP-v1-2009-Amano #approximate: Bounds on the Size of Small Depth Circuits for Approximating Majority (KA), pp. 59–70.
ICALP-v1-2009-BansalCPK #scalability: Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule (NB, HLC, KP, DK), pp. 144–155.
ICALP-v1-2009-BuhrmanFS: Unconditional Lower Bounds against Advice (HB, LF, RS), pp. 195–209.
ICALP-v1-2009-ElsasserS #multi #random: Tight Bounds for the Cover Time of Multiple Random Walks (RE, TS), pp. 415–426.
ICALP-v1-2009-GuhaH #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 #scheduling: Improved Bounds for Flow Shop Scheduling (MM, OS), pp. 677–688.
ICALP-v2-2009-BlumensathOW #finite #higher-order #monad #word: Boundedness of Monadic Second-Order Formulae over Finite Words (AB, MO, MW), pp. 67–78.
ICALP-v2-2009-ColcombetZ #automaton: A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata (TC, KZ), pp. 151–162.
LATA-2009-Bollig #complexity #integer #multi: Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.
LATA-2009-GauwinNT #concurrent #query: Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
LATA-2009-ItoLM: Bounded Hairpin Completion (MI, PL, VM), pp. 434–445.
FM-2009-BonakdarpourK #complexity #on the: On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery (BB, SSK), pp. 660–675.
FM-2009-HarrisKCJR #data flow #process #verification: Verifying Information Flow Control over Unbounded Processes (WRH, NK, SC, SJ, TWR), pp. 773–789.
FM-2009-JostLHSH #analysis #using: “Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis (SJ, HWL, KH, NS, MH), pp. 354–369.
FM-2009-PradellaMP #encoding #metric #model checking: A Metric Encoding for Bounded Model Checking (MP, AM, PSP), pp. 741–756.
FM-2009-ShaoKP #approach #formal method #incremental #lightweight #using: An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method (DS, SK, DEP), pp. 757–772.
IFM-2009-Cook #hardware #synthesis: Taming the Unbounded for Hardware Synthesis (BC), p. 39.
RTA-2009-BursucC #algebra #protocol #security: Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (SB, HCL), pp. 133–147.
TLCA-2009-LagoH #linear #logic #revisited: Bounded Linear Logic, Revisited (UDL, MH), pp. 80–94.
DiGRA-2009-IhamakiT #comprehension #game studies #mobile: Understanding 21st Century's Mobile Device-Based Games within Boundaries (PI, PT).
HIMI-DIE-2009-ShinPC #detection: Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs (IS, NDP, HC), pp. 619–627.
ICML-2009-Cesa-BianchiGO #classification #robust: Robust bounds for classification via selective sampling (NCB, CG, FO), pp. 121–128.
ICML-2009-ReidW: Surrogate regret bounds for proper losses (MDR, RCW), pp. 897–904.
PLDI-2009-GulwaniJK #analysis #control flow #invariant #refinement: Control-flow refinement and progress invariants for bound analysis (SG, SJ, EK), pp. 375–385.
PLDI-2009-NagarakatteZMZ #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 #parallel #source code: Progress guarantee for parallel programs via bounded lock-freedom (EP, MM, BS), pp. 144–154.
SAS-2009-NiedzielskiRGP #constraints #control flow: A Verifiable, Control Flow Aware Constraint Analyzer for Bounds Check Elimination (DN, JvR, AG, KP), pp. 137–153.
ASE-2009-CordeiroFM #embedded #model checking #smt: SMT-Based Bounded Model Checking for Embedded ANSI-C Software (LCC, BF, JMS), pp. 137–148.
SAC-2009-ManuchSS #self: Two lower bounds for self-assemblies at temperature 1 (JM, LS, CS), pp. 808–809.
SAC-2009-YipH #consistency #constraints: Length-lex bound consistency for knapsack constraints (JY, PVH), pp. 1397–1401.
DAC-2009-FeySD #fault tolerance #using: Computing bounds for fault tolerance using formal techniques (GF, AS, RD), pp. 190–195.
DATE-2009-FahmyRJ #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-GuoS #design #distributed #optimisation #using: Optimizing the HW/SW boundary of an ECC SoC design using control hierarchy and distributed storage (XG, PS), pp. 454–459.
DATE-2009-PollexKAS #worst-case: Improved worst-case response-time calculations by upper-bound conditions (VP, SK, KA, FS), pp. 105–110.
FASE-2009-JagannathLDM #cost analysis #testing: Reducing the Costs of Bounded-Exhaustive Testing (VJ, YYL, BD, DM), pp. 171–185.
FoSSaCS-2009-KupfermanP #automaton: Lower Bounds on Witnesses for Nonemptiness of Universal Co-Büchi Automata (OK, NP), pp. 182–196.
FoSSaCS-2009-Schewe #automaton #nondeterminism: Tighter Bounds for the Determinisation of Büchi Automata (SS), pp. 167–181.
STOC-2009-BateniCG: MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.
STOC-2009-DietzfelbingerW: Tight lower bounds for greedy routing in uniform small world rings (MD, PW), pp. 591–600.
STOC-2009-Viola #data type: Bit-probe lower bounds for succinct data structures (EV), pp. 475–482.
TACAS-2009-AtigBQ #analysis #concurrent #source code #thread: Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads (MFA, AB, SQ), pp. 107–123.
TACAS-2009-NaumovichBG #named #performance #petri net: ITPN-PerfBound: A Performance Bound Tool for Interval Time Petri Nets (EPN, SB, MG), pp. 50–53.
CAV-2009-FuhrmannH #induction #on the #proving: On Extending Bounded Proofs to Inductive Proofs (OF, SH), pp. 278–290.
CAV-2009-Gulwani #analysis #complexity #named: SPEED: Symbolic Complexity Bound Analysis (SG), pp. 51–62.
CAV-2009-TorreMP #concurrent #reachability: Reducing Context-Bounded Concurrent Reachability to Sequential Reachability (SLT, PM, GP), pp. 477–492.
CSL-2009-GaboardiP #semantics #using: Upper Bounds on Stream I/O Using Semantic Interpretations (MG, RP), pp. 271–286.
CSL-2009-KuskeL #automation #revisited: Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.
ICST-2009-PostS #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: An Improved Lower Bound for the Complementation of Rabin Automata (YC, TZ, HL), pp. 167–176.
LICS-2009-Friedmann #algorithm #exponential #game studies: An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it (OF), pp. 145–156.
LICS-2009-Kahlon #communication #decidability #thread: Boundedness vs. Unboundedness of Lock Chains: Characterizing Decidability of Pairwise CFL-Reachability for Threads Communicating via Locks (VK), pp. 27–36.
SAT-2009-AtseriasFT #algorithm: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (AA, JKF, MT), pp. 114–127.
SAT-2009-Goldberg: Boundary Points and Resolution (EG), pp. 147–160.
SAT-2009-Johannsen #exponential #learning #strict: An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.
SAT-2009-LarrosaNOR #branch #generative #optimisation: Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (JL, RN, AO, ERC), pp. 453–466.
TAP-2009-Rapin #execution #model checking #symbolic computation: Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables (NR), pp. 137–152.
VMCAI-2009-Oshman #model checking: An Automata-Theoretic Dynamic Completeness Criterion for Bounded Model-Checking (RO), pp. 275–289.
VMCAI-2009-WimmerBB #generative #markov #model checking #using: Counterexample Generation for Discrete-Time Markov Chains Using Bounded Model Checking (RW, BB, BB), pp. 366–380.
WICSA-2008-LagoACK #architecture #community: Wishes and Boundaries for a Software Architecture Knowledge Community (PL, PA, RC, PK), pp. 271–274.
SIGMOD-2008-GemullaL: Sampling time-based sliding windows in bounded space (RG, WL), pp. 379–392.
SIGMOD-2008-NavlakhaRS #fault #graph #summary: Graph summarization with bounded error (SN, RR, NS), pp. 419–432.
AFL-2008-MalcherMP #array: Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 292–301.
DLT-2008-CrochemoreFIJ #string: Bounds on Powers in Strings (MC, SZF, CSI, IJ), pp. 206–215.
DLT-2008-HromkovicS #automaton #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 #scheduling: Scheduling for Speed Bounded Processors (NB, HLC, TWL, LKL), pp. 409–420.
ICALP-A-2008-BjorklundHKK #graph #problem: The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.
ICALP-A-2008-ChildsL #order #quantum: Optimal Quantum Adversary Lower Bounds for Ordered Search (AMC, TL), pp. 869–880.
ICALP-A-2008-GuhaM #multi: Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination (SG, AM), pp. 760–772.
ICALP-A-2008-KaleS #graph: An Expansion Tester for Bounded Degree Graphs (SK, CS), pp. 527–538.
ICALP-A-2008-KempeRUW #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 #testing: Diagonal Circuit Identity Testing and Lower Bounds (NS), pp. 60–71.
ICALP-C-2008-GoyalJPS #encryption #policy: Bounded Ciphertext Policy Attribute Based Encryption (VG, AJ, OP, AS), pp. 579–591.
ICALP-C-2008-WehnerW #composition #security: Composable Security in the Bounded-Quantum-Storage Model (SW, JW), pp. 604–615.
LATA-2008-ArrighiNW #automaton #finite #quantum: One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.
LATA-2008-KorpM #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 #finite #quantum: Lower Bounds for Generalized Quantum Finite Automata (MM), pp. 373–384.
LATA-2008-Perekrestenko #np-hard: Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.
FM-2008-BonakdarpourK #fault: Masking Faults While Providing Bounded-Time Phased Recovery (BB, SSK), pp. 374–389.
SEFM-2008-PhamTTC #algorithm #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 #branch: Maximizing the Business Value of Software Projects — A Branch & Bound Approach (AJA, EAS, EPdA, MCF, ALF), pp. 162–169.
CIKM-2008-LiuMG #detection #documentation #identification: Identifying table boundaries in digital documents via sparse line detection (YL, PM, CLG), pp. 1311–1320.
ICML-2008-GomesWP #memory management #modelling #topic: Memory bounded inference in topic models (RG, MW, PP), pp. 344–351.
ICML-2008-OrabonaKC #kernel: The projectron: a bounded kernel-based Perceptron (FO, JK, BC), pp. 720–727.
ICPR-2008-AlliliZ #approach #segmentation: An approach for dynamic combination of region and boundary information in segmentation (MSA, DZ), pp. 1–4.
ICPR-2008-KadarBS #detection #evolution #image #programming #search-based: Evolving boundary detectors for natural images via Genetic Programming (IK, OBS, MS), pp. 1–4.
ICPR-2008-MuraiF #detection #using #video: Shot boundary detection using co-occurrence of global motion in video stream (YM, HF), pp. 1–4.
ICPR-2008-PohK #authentication #fault #multimodal #on the #using: On using error bounds to optimize cost-sensitive multimodal biometric authentication (NP, JK), pp. 1–4.
ICPR-2008-WangTHW #using: Object boundary extraction using Active B-Snake Model (YW, EKT, ZH, JGW), pp. 1–4.
ICPR-2008-WimmerHS #classification: Implicit active shape model employing boundary classifier (AW, JH, GS), pp. 1–4.
SEKE-2008-ParkK #automaton #constraints #lts #model checking #using: Using Boolean Cardinality Constraint for LTS Bounded Model Checking (SP, GK), pp. 537–542.
SEKE-2008-PatroneR #logic #programming language: Sharing Application Logic Across Programming Language Boundaries (DSP, BR), pp. 227–231.
SIGIR-2008-Diaz08b #empirical #metric #robust #similarity: Theoretical bounds on and empirical robustness of score regularization to different similarity measures (FDD), pp. 809–810.
ECOOP-2008-HuangHBR #hardware #object-oriented #programming: Liquid Metal: Object-Oriented Programming Across the Hardware/Software Boundary (SSH, AH, DFB, RMR), pp. 76–103.
PEPM-2008-Mu #algorithm #problem: Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths (SCM), pp. 31–39.
PEPM-2008-PopeeaXC #array #precise: A practical and precise inference and specializer for array bound checks elimination (CP, DNX, WNC), pp. 177–187.
PEPM-2008-PuchingerS #automation #source code: Automating branch-and-bound for dynamic programs (JP, PJS), pp. 81–89.
SAS-2008-AlbertAGP #automation #cost analysis: Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (EA, PA, SG, GP), pp. 221–237.
ASE-2008-PostSKG #abstract interpretation #model checking: Reducing False Positives by Combining Abstract Interpretation and Bounded Model Checking (HP, CS, AK, TG), pp. 188–197.
ASE-2008-PradellaMP #realtime #satisfiability #specification: Refining Real-Time System Specifications through Bounded Model- and Satisfiability-Checking (MP, AM, PSP), pp. 119–127.
FSE-2008-LivshitsK #named #web: Doloto: code splitting for network-bound web 2.0 applications (VBL, EK), pp. 350–360.
ICSE-2008-FritschSSC #adaptation: Time-bounded adaptation for automotive system software (SF, AS, DCS, SC), pp. 571–580.
SAC-2008-Andersson #scheduling: The utilization bound of uniprocessor preemptive slack-monotonic scheduling is 50% (BA), pp. 281–283.
ASPLOS-2008-DeviettiBMZ #architecture #c #named #programming language #safety: Hardbound: architectural support for spatial safety of the C programming language (JD, CB, MMKM, SZ), pp. 103–114.
DAC-2008-GuptaK: Bounded-lifetime integrated circuits (PG, ABK), pp. 347–348.
ISMM-2008-ChinNPQ #low level #memory management #source code: Analysing memory resource bounds for low-level programs (WNC, HHN, CP, SQ), pp. 151–160.
ESOP-2008-TerauchiM #linear #programming: Inferring Channel Buffer Bounds Via Linear Programming (TT, AM), pp. 284–298.
FoSSaCS-2008-GruberJ #communication #complexity #regular expression #using: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
STOC-2008-AttiyaHW #problem: Tight rmr lower bounds for mutual exclusion and other problems (HA, DH, PW), pp. 217–226.
STOC-2008-BansalKN #design #network: Additive guarantees for degree bounded directed network design (NB, RK, VN), pp. 769–778.
STOC-2008-CaiCL #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 #communication #robust: Robust lower bounds for communication and stream computation (AC, GC, AM), pp. 641–650.
STOC-2008-ChoiK #complexity #graph #query: Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
STOC-2008-DinurGKS #morphism: Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
STOC-2008-DvirSY #trade-off: Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.
STOC-2008-JainKN #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 #design #network: Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.
STOC-2008-Rao #game studies #parallel: Parallel repetition in projection games and a concentration bound (AR), pp. 1–10.
STOC-2008-Raz: Elusive functions and lower bounds for arithmetic circuits (RR), pp. 711–720.
STOC-2008-Sherstov #communication #matrix #quantum: The pattern matrix method for lower bounds on quantum communication (AAS), pp. 85–94.
TACAS-2008-LalTKR #analysis #concurrent #interprocedural #source code: Interprocedural Analysis of Concurrent Programs Under a Context Bound (AL, TT, NK, TWR), pp. 282–298.
TACAS-2008-TorreMP #analysis #concurrent #queue: Context-Bounded Analysis of Concurrent Queue Systems (SLT, PM, GP), pp. 299–314.
CAV-2008-LalR #analysis #concurrent: Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis (AL, TWR), pp. 37–51.
CSL-2008-BeyersdorffM: A Tight Karp-Lipton Collapse Result in Bounded Arithmetic (OB, SM), pp. 199–214.
CSL-2008-Eisinger #automaton #integer #linear: Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (JE), pp. 431–445.
CSL-2008-PiskacK #linear: Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with Stars (RP, VK), pp. 124–138.
ICLP-2008-SchulteS #dynamic analysis: Dynamic Analysis of Bounds Versus Domain Propagation (CS, PJS), pp. 332–346.
IJCAR-2008-Melquiond #proving: Proving Bounds on Real-Valued Functions with Computations (GM), pp. 2–17.
LICS-2008-Moschovakis #axiom: The Axiomatic Derivation of Absolute Lower Bounds (YNM), p. 405.
SAT-2008-KottlerKS08a #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 #data type #relational: Bounded Relational Analysis of Free Data Types (AD, GS, WR), pp. 99–115.
PODS-2007-GottlobPW #datalog #finite #monad: Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
PODS-2007-Schweikardt #modelling #query: Machine models and lower bounds for query processing (NS), pp. 41–52.
VLDB-2007-RastogiHS #privacy: The Boundary Between Privacy and Utility in Data Publishing (VR, SH, DS), pp. 531–542.
DLT-2007-MalcherP #complexity #context-free grammar: Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.
ICALP-2007-BjorklundB: Bounded Depth Data Trees (HB, MB), pp. 862–874.
ICALP-2007-BozzelliT #automaton #parametricity #problem: Decision Problems for Lower/Upper Bound Parametric Timed Automata (LB, SLT), pp. 925–936.
ICALP-2007-GuhaM #estimation #multi #streaming: Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (SG, AM), pp. 704–715.
ICALP-2007-IwamaNRY #communication #complexity #quantum: Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
ICALP-2007-KreutzerOS #monad: Boundedness of Monadic FO over Acyclic Structures (SK, MO, NS), pp. 571–582.
ICALP-2007-MontanaroW #communication #complexity #quantum: A Lower Bound on Entanglement-Assisted Quantum Communication Complexity (AM, AJW), pp. 122–133.
LATA-2007-Thorne #finite: Categorial Module Grammars of Bounded Size have Finite Bounded Density (CT), pp. 577–588.
RTA-2007-KorpM #proving #term rewriting #termination #using: Proving Termination of Rewrite Systems Using Bounds (MK, AM), pp. 273–287.
CIG-2007-OommenGP #finite #game studies #probability #using: Using Stochastic AI Techniques to Achieve Unbounded Resolution in Finite Player Goore Games and its Applications (BJO, OCG, AP), pp. 161–167.
DiGRA-2007-StromE #case study #industrial #interactive #network: The unbound network of product and service interaction of the MMOG industry: with a case study of China (PS, ME).
HCI-MIE-2007-DerakhshiK #fuzzy #network #predict #sequence #using #word: Using Recurrent Fuzzy Neural Networks for Predicting Word Boundaries in a Phoneme Sequence in Persian Language (MRFD, MRK), pp. 50–59.
ICML-2007-Hanneke #complexity #learning: A bound on the label complexity of agnostic active learning (SH), pp. 353–360.
ICML-2007-Shah: Sample compression bounds for decision trees (MS), pp. 799–806.
MLDM-2007-SaittaRS #clustering: A Bounded Index for Cluster Validity (SS, BR, IFCS), pp. 174–187.
PLDI-2007-MusuvathiQ #parallel #source code #testing #thread: Iterative context bounding for systematic testing of multithreaded programs (MM, SQ), pp. 446–455.
SAC-2007-Armendariz-InigoJMDM #database #flexibility #protocol #replication: k-bound GSI: a flexible database replication protocol (JEAI, JRJR, JRGdM, HD, FDME), pp. 556–560.
SAC-2007-SausenSLP #multi #network: Bounded-distance multi-coverage backbones in wireless sensor networks (PSS, MAS, AMNdL, AP), pp. 203–208.
DAC-2007-ZhouLS #embedded #hybrid #multi #performance #using: Fast Capacitance Extraction in Multilayer, Conformal and Embedded Dielectric using Hybrid Boundary Element Method (NYZ, ZL, WS), pp. 835–840.
DATE-2007-GrosseKD #functional #model checking: Estimating functional coverage in bounded model checking (DG, UK, RD), pp. 1176–1181.
DATE-2007-SathanurCBMMP #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.
PDP-2007-MezmazMT #approach #branch #parallel: A Grid-based Parallel Approach of the Multi-Objective Branch and Bound (MSM, NM, EGT), pp. 23–30.
FoSSaCS-2007-MarnetteKR #constraints #polynomial #set: Polynomial Constraints for Sets with Cardinality Bounds (BM, VK, MCR), pp. 258–273.
FoSSaCS-2007-MuschollW #composition #web #web service: A Lower Bound on Web Services Composition (AM, IW), pp. 274–286.
STOC-2007-AttiyaC #random: Tight bounds for asynchronous randomized consensus (HA, KC), pp. 155–164.
STOC-2007-BeameJR #algorithm #random: Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
STOC-2007-LinialS #communication #complexity: Lower bounds in communication complexity based on factorization norms (NL, AS), pp. 699–708.
STOC-2007-Patrascu #2d: Lower bounds for 2-dimensional range counting (MP), pp. 40–46.
STOC-2007-Santhanam: Circuit lower bounds for Merlin-Arthur classes (RS), pp. 275–283.
STOC-2007-SinghL #approximate: Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
TACAS-2007-YuCL #diagrams #reachability #using: Bounded Reachability Checking of Asynchronous Systems Using Decision Diagrams (AJY, GC, GL), pp. 648–663.
CADE-2007-GieslTSS #proving #termination: Proving Termination by Bounded Increase (JG, RT, SS, PSK), pp. 443–459.
CADE-2007-PerezV #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 #parallel #source code #thread: Context-Bounded Analysis of Multithreaded Programs with Dynamic Linked Structures (AB, SF, SQ), pp. 207–220.
CAV-2007-ChakiSV #verification: Verification Across Intellectual Property Boundaries (SC, CS, HV), pp. 82–94.
CAV-2007-MalerNP #on the: On Synthesizing Controllers from Bounded-Response Properties (OM, DN, AP), pp. 95–107.
CSL-2007-Burel #deduction: Unbounded Proof-Length Speed-Up in Deduction Modulo (GB), pp. 496–511.
ICLP-2007-NavasMLH #analysis #logic programming #source code: User-Definable Resource Bounds Analysis for Logic Programs (JAN, EM, PLG, MVH), pp. 348–363.
LICS-2007-Schopp #logic: Stratified Bounded Affine Logic for Logarithmic Space (US), pp. 411–420.
SAT-2007-BubeckB #preprocessor: Bounded Universal Expansion for Preprocessing QBF (UB, HKB), pp. 244–257.
SAT-2007-Kojevnikov #linear: Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities (AK), pp. 70–79.
SAT-2007-LangloisST: Horn Upper Bounds and Renaming (ML, RHS, GT), pp. 80–93.
TestCom-FATES-2007-PapSKN #algorithm #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 #constraints #matrix: An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (MP, NH), pp. 268–282.
ECDL-2006-Butterworth #design #library #network #social: Designing Digital Library Resources for Users in Sparse, Unbounded Social Networks (RB), pp. 184–195.
PODS-2006-GottlobPW #database #design: Tractable database design through bounded treewidth (GG, RP, FW), pp. 124–133.
PODS-2006-GroheHS #random #scalability #set: Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
ICSM-2006-GoldHLM #approach #concept #source code #using: Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding (NG, MH, ZL, KM), pp. 310–319.
CIAA-2006-GalvezSF #linear #lookahead #parsing: Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
DLT-2006-BellP #matrix: Lowering Undecidability Bounds for Decision Questions in Matrices (PB, IP), pp. 375–385.
DLT-2006-GruberH #complexity #nondeterminism: Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.
DLT-2006-ItoLS: Closure of Language Classes Under Bounded Duplication (MI, PL, KST), pp. 238–247.
ICALP-v1-2006-BaierEHKSS: Length-Bounded Cuts and Flows (GB, TE, AH, EK, HS, MS), pp. 679–690.
ICALP-v1-2006-CaragiannisFKKM: Tight Bounds for Selfish and Greedy Load Balancing (IC, MF, CK, PK, LM), pp. 311–322.
ICALP-v1-2006-CarrollGM #graph: Embedding Bounded Bandwidth Graphs into l1 (DEC, AG, AM), pp. 27–37.
ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate: A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.
ICALP-v1-2006-Golynski #rank: Optimal Lower Bounds for Rank and Select Indexes (AG), pp. 370–381.
ICALP-v1-2006-KojevnikovI #calculus #proving: Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies (AK, DI), pp. 323–334.
ICALP-v1-2006-Wolf #matrix #quantum: Lower Bounds on Matrix Rigidity Via a Quantum Argument (RdW), pp. 62–71.
ICALP-v2-2006-HarnikN #hybrid #on the #security: On Everlasting Security in the Hybrid Bounded Storage Model (DH, MN), pp. 192–203.
ICALP-v2-2006-Pietrzak: A Tight Bound for EMAC (KP), pp. 168–179.
ICALP-v2-2006-Yan #automaton: Lower Bounds for Complementation of ω-Automata Via the Full Automata Technique (QY), pp. 589–600.
FM-2006-BouquetDL #automation #generative #ml #specification #testing: Automated Boundary Test Generation from JML Specifications (FB, FD, BL), pp. 428–443.
RTA-2006-LevySV #higher-order #unification: Bounded Second-Order Unification Is NP-Complete (JL, MSS, MV), pp. 400–414.
FLOPS-2006-Avery #analysis #termination: Size-Change Termination and Bound Analysis (JA), pp. 192–207.
ICML-2006-Banerjee #on the: On Bayesian bounds (AB), pp. 81–88.
ICML-2006-MoghaddamWA: Generalized spectral bounds for sparse LDA (BM, YW, SA), pp. 641–648.
ICML-2006-PandaCW #concept #detection: Concept boundary detection for speeding up SVMs (NP, EYC, GW), pp. 681–688.
ICPR-v1-2006-KatsoulasK #image: Box-like Superquadric Recovery in Range Images by Fusing Region and Boundary Information (DK, DIK), pp. 719–722.
ICPR-v1-2006-LiHS #approach #image #machine learning: A Machine Learning Approach for Locating Boundaries of Liver Tumors in CT Images (YL, SH, KS), pp. 400–403.
ICPR-v2-2006-ChenH #composition #image #segmentation: Boundary correction for total variation regularized L^1 function with applications to image decomposition and segmentation (TC, TSH), pp. 316–319.
ICPR-v2-2006-SaragihG #fault: Iterative Error Bound Minimisation for AAM Alignment (JS, RG), pp. 1192–1195.
SEKE-2006-OgataKF: Falsification of OTSs by Searches of Bounded Reachable State Spaces (KO, WK, KF), pp. 440–445.
ASE-2006-DengLR #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.
ICSE-2006-DhurjatiA #array #c: Backwards-compatible array bounds checking for C with very low overhead (DD, VSA), pp. 162–171.
SAC-2006-Capron #static analysis: Static analysis of time bounded reactive properties of Boolean symbols (GC), pp. 1827–1834.
SAC-2006-FangG #dataset: Boundary surface extraction and rendering for volume datasets (SF, PG), pp. 1356–1360.
SAC-2006-MeerWA #composition #interactive #performance: Efficient interactive configuration of unbounded modular systems (ERvdM, AW, HRA), pp. 409–414.
SAC-2006-WuRJ #embedded #energy #on the #realtime: On bounding energy consumption in dynamic, embedded real-time systems (HW, BR, EDJ), pp. 933–934.
ASPLOS-2006-ChuangNVSBPCC #memory management #transaction: Unbounded page-based transactional memory (WC, SN, GV, JS, MVB, GP, BC, OC), pp. 347–358.
DAC-2006-AwedhS #automation #invariant #model checking: Automatic invariant strengthening to prove properties in bounded model checking (MA, FS), pp. 1073–1076.
DAC-2006-PeranandamNRWKR #performance: Fast falsification based on symbolic bounded property checking (PMP, PKN, JR, RJW, TK, WR), pp. 1077–1082.
DAC-2006-WangZ: Optimal jumper insertion for antenna avoidance under ratio upper-bound (JW, HZ), pp. 761–766.
DAC-2006-WuH #constraints #equivalence #mining: Mining global constraints for improving bounded sequential equivalence checking (WW, MSH), pp. 743–748.
DATE-2006-ChakrabortySDMMP #optimisation: Thermal resilient bounded-skew clock tree optimization methodology (AC, PS, KD, AM, EM, MP), pp. 832–837.
HPDC-2006-DjerrahCCR #framework #optimisation #problem: Bob++: Framework for Solving Optimization Problems with Branch-and-Bound methods (AD, BLC, VDC, CR), pp. 369–370.
PDP-2006-DortaLR #analysis #performance: Performance Analysis of Branch-and-Bound Skeletons (ID, CL, CR), pp. 75–82.
PPoPP-2006-BrevikNW #parallel #predict: Predicting bounds on queuing delay for batch-scheduled parallel machines (JB, DN, RW), pp. 110–118.
STOC-2006-AmbainisSW #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 #performance #protocol: Fast leader-election protocols with bounded cheaters’ edge (SA), pp. 187–196.
STOC-2006-ColeG #set: Searching dynamic point sets in spaces with bounded doubling dimension (RC, LAG), pp. 574–583.
STOC-2006-DinurFKO #fourier #on the: On the fourier tails of bounded functions over the discrete cube (ID, EF, GK, RO), pp. 437–446.
STOC-2006-GavinskyKRW #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 #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 #quantum #random: New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.
TACAS-2006-LiS #abstraction #model checking #performance #refinement: Efficient Abstraction Refinement in Interpolation-Based Unbounded Model Checking (BL, FS), pp. 227–241.
CAV-2006-BurckhardtAM #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 #model checking: Bounded Model Checking for Weak Alternating Büchi Automata (KH, TAJ, MK, ML, TL), pp. 95–108.
IJCAR-2006-DyckhoffKL #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: Bounds in w-Regularity (MB, TC), pp. 285–296.
LICS-2006-LaurentF #clique #complexity #semantics: Obsessional Cliques: A Semantic Characterization of Bounded Time Complexity (OL, LTdF), pp. 179–188.
LICS-2006-MacielP #composition #proving: Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.
LICS-2006-Otto #first-order #logic #monad #problem: The Boundedness Problem for Monadic Universal First-Order Logic (MO), pp. 37–48.
LICS-2006-SchroderP #logic: PSPACE Bounds for Rank-1 Modal Logics (LS, DP), pp. 231–242.
SAT-2006-ZabiyakaD #complexity #dependence #functional: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (YZ, AD), pp. 116–129.
TestCom-2006-BerradaCFS #realtime #testing #using: Test Case Minimization for Real-Time Systems Using Timed Bound Traces (IB, RC, PF, AS), pp. 289–305.
TestCom-2006-Ipate #finite #nondeterminism #sequence #state machine #testing: Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.
PODS-2005-GroheS #memory management #random #sorting: Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.
SIGMOD-2005-PolJ #relational: Relational Confidence Bounds Are Easy With The Bootstrap (AP, CJ), pp. 587–598.
CIAA-2005-CanoG #automaton #constant #finite: Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.
ICALP-2005-Ambuhl #algorithm #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 #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 #composition #symmetry: Lower Bounds for Circuits with Few Modular and Symmetric Gates (AC, KAH), pp. 994–1005.
ICALP-2005-CzeizlerK #automaton #linear: A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.
ICALP-2005-DiehlM #polynomial #random: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines (SD, DvM), pp. 982–993.
ICALP-2005-FialaGK #distance #graph: Distance Constrained Labelings of Graphs of Bounded Treewidth (JF, PAG, JK), pp. 360–372.
ICALP-2005-FordG #communication #complexity #multi: Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity (JF, AG), pp. 1163–1175.
ICALP-2005-GroheKS #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 #performance: Bounds on the Efficiency of “Black-Box” Commitment Schemes (OH, JK), pp. 128–139.
ICALP-2005-KoiranNP #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 #security: Computational Bounds on Hierarchical Data Processing with Applications to Information Security (RT, NT), pp. 153–165.
ICALP-2005-WehnerW #information retrieval: Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval (SW, RdW), pp. 1424–1436.
RTA-2005-BonfanteMM: Quasi-interpretations and Small Space Bounds (GB, JYM, JYM), pp. 150–164.
CEFP-2005-Hammond #approach #behaviour #functional #programming: Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach (KH), pp. 100–134.
DiGRA-2005-LeeL #transaction: An Irrational Black Market? Boundary work perspective on the stigma of in-game asset transaction (YHL, HL).
CIKM-2005-Yeh: An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription (JhY), pp. 285–286.
ICML-2005-JoachimsH #clustering #correlation #fault: Error bounds for correlation clustering (TJ, JEH), pp. 385–392.
ICML-2005-KaariainenL #comparison #fault: A comparison of tight generalization error bounds (MK, JL), pp. 409–416.
ICML-2005-LavioletteM #classification: PAC-Bayes risk bounds for sample-compressed Gibbs classifiers (FL, MM), pp. 481–488.
ICML-2005-McMahanLG #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 #finite: Finite time bounds for sampling based fitted value iteration (CS, RM), pp. 880–887.
SAC-2005-ReddyC #using: Finding saddle points using stability boundaries (CKR, HDC), pp. 212–213.
CASE-2005-ChengY #using: Virtual object deformations using attributed boundary model (TMC, CCY), pp. 295–300.
CGO-2005-BrueningA #capacity #consistency #maintenance: Maintaining Consistency and Bounding Capacity of Software Code Caches (DB, SPA), pp. 74–85.
DAC-2005-LiSB #effectiveness #problem: Effective bounding techniques for solving unate and binate covering problems (XYL, MFMS, FB), pp. 385–390.
DATE-2005-CabodiCNQ #model checking #quantifier #set: Circuit Based Quantification: Back to State Set Manipulation within Unbounded Model Checking (GC, MC, SN, SQ), pp. 688–689.
DATE-2005-KatzHD #model checking: Space-Efficient Bounded Model Checking (JK, ZH, ND), pp. 686–687.
DATE-2005-ManquinhoM #effectiveness #optimisation #pseudo: Effective Lower Bounding Techniques for Pseudo-Boolean Optimization (VMM, JPMS), pp. 660–665.
DATE-2005-Marculescu #design #energy #fault tolerance: Energy Bounds for Fault-Tolerant Nanoscale Designs (DM), pp. 74–79.
DATE-2005-MartinelliD #composition #set: Bound Set Selection and Circuit Re-Synthesis for Area/Delay Driven Decomposition (AM, ED), pp. 430–431.
HPCA-2005-AnanianAKLL #memory management #transaction: Unbounded Transactional Memory (CSA, KA, BCK, CEL, SL), pp. 316–327.
LCTES-2005-DefoeCC: Upper bound for defragmenting buddy heaps (DCD, SRC, RC), pp. 222–229.
ESOP-2005-ChanderEILN #dynamic analysis #verification: Enforcing Resource Bounds via Static Verification of Dynamic Checks (AC, DE, NI, PL, GCN), pp. 311–325.
STOC-2005-Alekhnovich #random: Lower bounds for k-DNF resolution on random 3-CNFs (MA), pp. 251–256.
STOC-2005-CryanDR #approximate: Approximately counting integral flows and cell-bounded contingency tables (MC, MED, DR), pp. 413–422.
STOC-2005-GafniGP #adaptation #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: Bounded-depth circuits: separating wires from gates (MK, PP, DT), pp. 257–265.
TACAS-2005-QadeerR #concurrent #model checking: Context-Bounded Model Checking of Concurrent Software (SQ, JR), pp. 93–107.
TACAS-2005-SharmaPC #logic: Bounded Validity Checking of Interval Duration Logic (BS, PKP, SC), pp. 301–316.
SAT-J-2004-PorschenS05 #problem: Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.
CAV-2005-GuptaS #abstraction #model checking #refinement: Abstraction Refinement for Bounded Model Checking (AG, OS), pp. 112–124.
CAV-2005-HeljankoJL #incremental #model checking: Incremental and Complete Bounded Model Checking for Full PLTL (KH, TAJ, TL), pp. 98–111.
CAV-2005-RabinovitzG #concurrent #model checking #source code: Bounded Model Checking of Concurrent Programs (IR, OG), pp. 82–97.
CSL-2005-CharatonikGM #model checking #pointer #source code: Bounded Model Checking of Pointer Programs (WC, LG, PM), pp. 397–412.
CSL-2005-Kolokolova: Closure Properties of Weak Systems of Bounded Arithmetic (AK), pp. 369–383.
ICLP-2005-Saidi #mining #process #using: Using CLP to Characterise Linguistic Lattice Boundaries in a Text Mining Process (ASS), pp. 418–420.
SAT-2005-DantsinW #satisfiability: An Improved Upper Bound for SAT (ED, AW), pp. 400–407.
SAT-2005-DershowitzHK #model checking: Bounded Model Checking with QBF (ND, ZH, JK), pp. 408–414.
SAT-2005-Gelder #distance #proving: Input Distance and Lower Bounds for Propositional Resolution Proof Length (AVG), pp. 282–293.
SAT-2005-HeuleM #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 #satisfiability: A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
SAT-2005-Zarpas #benchmark #metric #model checking #satisfiability: Benchmarking SAT Solvers for Bounded Model Checking (EZ), pp. 340–354.
VMCAI-2005-AbrahamBKS #hybrid #linear #model checking #optimisation: Optimizing Bounded Model Checking for Linear Hybrid Systems (EÁ, BB, FK, MS), pp. 396–412.
VMCAI-2005-LatvalaBHJ #ltl #model checking #performance: Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.
VLDB-2004-KoudasOT0 #approximate #fault #performance #query: Approximate NN queries on Streams with Guaranteed Error/performance Bounds (NK, BCO, KLT, RZ), pp. 804–815.
VLDB-2004-RossS #database #multi #symmetry: Symmetric Relations and Cardinality-Bounded Multisets in Database Systems (KAR, JS), pp. 912–923.
ITiCSE-WGR-2004-RolfeP #backtracking #problem: An alternative problem for backtracking and bounding (TJR, PWP), pp. 83–84.
CIAA-2004-CampeanuP #automaton #nondeterminism: Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.
ICALP-2004-AlekhnovichHI #algorithm #exponential #satisfiability: Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas (MA, EAH, DI), pp. 84–96.
ICALP-2004-BlundoDS #self: Definitions and Bounds for Self-Healing Key Distribution Schemes (CB, PD, ADS), pp. 234–245.
ICALP-2004-Fleischer #algorithm #linear #network: Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks (LF), pp. 544–554.
ICALP-2004-FlumGW #nondeterminism #parametricity: Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits (JF, MG, MW), pp. 555–567.
ICALP-2004-MelkebeekR #satisfiability: A Time Lower Bound for Satisfiability (DvM, RR), pp. 971–982.
ICALP-2004-Midrijanis #polynomial #problem #quantum #query #set #similarity: A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
ICALP-2004-SandersSS #migration #online #scheduling: Online Scheduling with Bounded Migration (PS, NS, MS), pp. 1111–1122.
ICALP-2004-Zhang #on the #power of: On the Power of Ambainis’s Lower Bounds (SZ), pp. 1238–1250.
RTA-2004-Waldmann #named #string: Matchbox: A Tool for Match-Bounded String Rewriting (JW), pp. 85–94.
SEFM-2004-FlakeM #ocl: Past- and Future-Oriented Time-Bounded Temporal Properties with OCL (SF, WM), pp. 154–163.
ICML-2004-ConitzerS #communication #complexity #game studies #learning: Communication complexity as a lower bound for learning in games (VC, TS).
ICML-2004-RuckertK #learning #towards: Towards tight bounds for rule learning (UR, SK).
ICPR-v1-2004-GokcenJD #learning: Comparing Optimal Bounding Ellipsoid and Support Vector Machine Active Learning (IG, DJ, JRD), pp. 172–175.
ICPR-v1-2004-KangD #approximate #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 #graph #memory management #polynomial #worst-case: Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort (FWD), pp. 379–382.
ICPR-v3-2004-ZhuHT: Comparing Decision Boundary Curvature (HZ, JH, XT), pp. 450–453.
ICPR-v4-2004-FarenzenaBFB #re-engineering: Rigorous Accuracy Bounds for Calibrated Stereo Reconstruction (MF, AB, AF, AB), pp. 288–292.
ICPR-v4-2004-KimPL #using: Object Boundary Edge Selection Using Normal Direction Derivatives of a Contour in a Complex Scene (TYK, JP, SWL), pp. 755–758.
ICPR-v4-2004-ShihKG #analysis #fault #image: An Error Bound of Relative Image Blur Analysis (SWS, PSK, WSG), pp. 100–103.
ICPR-v4-2004-SungLPL #locality #recognition #using: Iris Recognition Using Collarette Boundary Localization (HS, JL, JhP, YL), pp. 857–860.
KDD-2004-XiongSTK #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 #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.
PLDI-2004-VenetB #array #c #embedded #performance #precise #scalability #source code: Precise and efficient static array bound checking for large embedded C programs (AV, GPB), pp. 231–242.
RE-2004-LinNIJ #problem #security #using: Using Abuse Frames to Bound the Scope of Security Problems (LL, BN, DCI, MJ), pp. 354–355.
SAC-2004-MichaelsonHS #automaton #named #programming #using: FSM-Hume: programming resource-limited systems using bounded automata (GM, KH, JS), pp. 1455–1461.
SAC-2004-ZhouLA #image: Boundary extraction in thermal images by edge map (QZ, ZL, JKA), pp. 254–258.
ASPLOS-2004-SmolensGKFHN #detection #latency #named: Fingerprinting: bounding soft-error detection latency and bandwidth (JCS, BTG, JK, BF, JCH, AN), pp. 224–234.
CGO-2004-TallamZG #profiling: Extending Path Profiling across Loop Backedges and Procedure Boundaries (ST, XZ, RG), pp. 251–264.
DAC-2004-WangJHS #model checking #satisfiability: Refining the SAT decision ordering for bounded model checking (CW, HJ, GDH, FS), pp. 535–538.
DATE-v1-2004-AlmukhaizimDM #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: Enhanced Diameter Bounding via Structural (JB, AK), pp. 36–41.
FoSSaCS-2004-LuttgenV #bisimulation: Bisimulation on Speed: Lower Time Bounds (GL, WV), pp. 333–347.
STOC-2004-Aaronson04a #quantum: Lower bounds for local search by quantum arguments (SA), pp. 465–474.
STOC-2004-AilonC #linear #testing: Lower bounds for linear degeneracy testing (NA, BC), pp. 554–560.
STOC-2004-ChenHKX #linear #reduction: Linear FPT reductions and computational lower bounds (JC, XH, IAK, GX), pp. 212–221.
STOC-2004-ChenKLRSV #confluence #theorem: (Almost) tight bounds and existence theorems for confluent flows (JC, RDK, LL, RR, RS, AV), pp. 529–538.
STOC-2004-Elkin #approximate #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-Feige #graph #independence #on the #random: On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.
STOC-2004-Kelner #clustering #graph: Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus (JAK), pp. 455–464.
STOC-2004-Pass #multi: Bounded-concurrent secure multi-party computation with a dishonest majority (RP), pp. 232–241.
STOC-2004-PatrascuD: Lower bounds for dynamic connectivity (MP, EDD), pp. 546–553.
TACAS-2004-BaierHHK #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: Lower and Upper Bounds in Zone Based Abstractions of Timed Automata (GB, PB, KGL, RP), pp. 312–326.
TACAS-2004-LeueMW #modelling #scalability #uml: A Scalable Incomplete Test for the Boundedness of UML RT Models (SL, RM, WW), pp. 327–341.
TACAS-2004-RaviS #model checking: Minimal Assignments for Bounded Model Checking (KR, FS), pp. 31–45.
CAV-2004-AwedhS #model checking #proving: Proving More Properties with Bounded Model Checking (MA, FS), pp. 96–108.
CAV-2004-BinghamCHQZ #automation #consistency #verification: Automatic Verification of Sequential Consistency for Unbounded Addresses and Data Values (JDB, AC, AJH, SQ, ZZ), pp. 427–439.
CAV-2004-GanaiGA #embedded #model checking #modelling #performance: Efficient Modeling of Embedded Memories in Bounded Model Checking (MKG, AG, PA), pp. 440–452.
CAV-2004-JinAS #model checking #named #satisfiability #towards: CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking (HJ, MA, FS), pp. 519–522.
CAV-2004-LahiriB #verification: Indexed Predicate Discovery for Unbounded System Verification (SKL, REB), pp. 135–147.
CSL-2004-AmadioCDJ #bytecode #functional #verification: A Functional Scenario for Bytecode Verification of Resource Bounds (RMA, SCG, SDZ, LJ), pp. 265–279.
CSL-2004-Bojanczyk #quantifier: A Bounding Quantifier (MB), pp. 41–55.
CSL-2004-ImmermanRRSY #decidability #logic #transitive: The Boundary Between Decidability and Undecidability for Transitive-Closure Logics (NI, AMR, TWR, SS, GY), pp. 160–174.
CSL-2004-Skelley #higher-order: A Third-Order Bounded Arithmetic Theory for PSPACE (AS), pp. 340–354.
LICS-2004-SeshiaB #quantifier #using: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.
SAT-2004-ManquinhoM #optimisation #pseudo #satisfiability #using: Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (VMM, JPMS), pp. 120–126.
VMCAI-2004-ClarkeKOS #complexity #model checking: Completeness and Complexity of Bounded Model Checking (EMC, DK, JO, OS), pp. 85–96.
DRR-2003-Fan #parametricity: Text extraction via an edge-bounded averaging and a parametric character model (JF), pp. 8–19.
ICDAR-2003-CaoDL #approach #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 #complexity #documentation #query #type system #xml: Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.
DLT-2003-Giammarresi #set: Computing Languages by (Bounded) Local Sets (DG), pp. 304–315.
ICALP-2003-AmirACLP #algorithm: Function Matching: Algorithms, Applications, and a Lower Bound (AA, YA, RC, ML, EP), pp. 929–942.
ICALP-2003-HoyerMW #quantum: Quantum Search on Bounded-Error Inputs (PH, MM, RdW), pp. 291–299.
ICALP-2003-RybinaV #formal method: Upper Bounds for a Theory of Queues (TR, AV), pp. 714–724.
ICFP-2003-Simonet #data type: An extension of HM(X) with bounded existential and universal data-types (VS), pp. 39–50.
DiGRA-2003-Copier #game studies #research: The other game researcher: participating in and watching the costruction of boundaries in game studies (MC).
ICEIS-v3-2003-GustasG #approach #enterprise #information management #modelling #towards: Towards the Enterprise Engineering Approach for Information System Modelling Across Organisational and Technical Boundaries (RG, PG), pp. 77–88.
ICML-2003-ConitzerS03a #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 #fault #policy: Error Bounds for Approximate Policy Iteration (RM), pp. 560–567.
ICML-2003-SalakhutdinovR #adaptation #optimisation: Adaptive Overrelaxed Bound Optimization Methods (RS, STR), pp. 664–671.
MLDM-2003-ImiyaTOH #detection #random #set: Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.
MLDM-2003-MiteranBB #approximate #classification #image #realtime #segmentation #using: Classification Boundary Approximation by Using Combination of Training Steps for Real-Time Image Segmentation (JM, SB, EBB), pp. 141–155.
PPDP-2003-GrecoZ #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 #heuristic #problem: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
DAC-2003-AgarwalBZV #refinement #statistics: Computation and Refinement of Statistical Bounds on Circuit Delay (AA, DB, VZ, SBKV), pp. 348–353.
DAC-2003-ClarkeKY #behaviour #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 #learning #model checking #satisfiability: Learning from BDDs in SAT-based bounded model checking (AG, MKG, CW, ZY, PA), pp. 824–829.
DAC-2003-KangP #model checking #satisfiability: SAT-based unbounded symbolic model checking (HJK, ICP), pp. 840–843.
DAC-2003-StehrGA #analysis #performance #trade-off: Performance trade-off analysis of analog circuits by normal-boundary intersection (GS, HEG, KA), pp. 958–963.
DATE-2003-AgarwalBZV #analysis #statistics #using: Statistical Timing Analysis Using Bounds (AA, DB, VZ, SBKV), pp. 10062–10067.
DATE-2003-CabodiNQ #approximate #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: Combination of Lower Bounds in Exact BDD Minimization (RE, WG, RD), pp. 10758–10763.
DATE-2003-SmedtG #design #named: HOLMES: Capturing the Yield-Optimized Design Space Boundaries of Analog and RF Integrated Circuits (BDS, GGEG), pp. 10256–10263.
PDP-2003-DortaLRR #divide and conquer #parallel: Parallel Skeletons for Divide-and-Conquer and Branch-and-Bound techniques (ID, CL, CR, AR), pp. 292–298.
STOC-2003-Bar-Yossef: Sampling lower bounds via information theory (ZBY), pp. 335–344.
STOC-2003-FakcharoenpholRT #approximate #metric: A tight bound on approximating arbitrary metrics by tree metrics (JF, SR, KT), pp. 448–455.
STOC-2003-FatourouFR #implementation #multi: A tight time lower bound for space-optimal implementations of multi-writer snapshots (PF, FEF, ER), pp. 259–268.
STOC-2003-GalR: Lower bounds on the amount of randomness in private computation (AG, AR), pp. 659–666.
STOC-2003-GennaroGK #encryption #performance: Lower bounds on the efficiency of encryption and digital signature schemes (RG, YG, JK), pp. 417–425.
STOC-2003-JayramKKR #problem: Cell-probe lower bounds for the partial match problem (TSJ, SK, RK, YR), pp. 667–672.
STOC-2003-KabanetsI #polynomial #proving #testing: Derandomizing polynomial identity tests means proving circuit lower bounds (VK, RI), pp. 355–364.
STOC-2003-KerenidisW #exponential #quantum: Exponential lower bound for 2-query locally decodable codes via a quantum argument (IK, RdW), pp. 106–115.
STOC-2003-KonemannR #approximate: Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.
STOC-2003-Lindell: Bounded-concurrent secure two-party computation without setup assumptions (YL), pp. 683–692.
STOC-2003-ODonnellS #polynomial: New degree bounds for polynomial threshold functions (RO, RAS), pp. 325–334.
STOC-2003-SauerhoffW #graph #integer #multi #trade-off: Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (MS, PW), pp. 186–195.
TACAS-2003-AmlaKMM #analysis #model checking: Experimental Analysis of Different Techniques for Bounded Model Checking (NA, RPK, KLM, RM), pp. 34–48.
TACAS-2003-BartzisB #constraints #performance: Construction of Efficient BDDs for Bounded Arithmetic Constraints (CB, TB), pp. 394–408.
TACAS-2003-BenedettiC #ltl #model checking: Bounded Model Checking for Past LTL (MB, AC), pp. 18–33.
TACAS-2003-BraghinCFFLP #analysis #named: BANANA — A Tool for Boundary Ambients Nesting ANAlysis (CB, AC, SF, RF, FLL, CP), pp. 437–441.
TACAS-2003-CiardoMS: Saturation Unbound (GC, RMM, RS), pp. 379–393.
CADE-2003-Schmidt-Schauss #decidability #higher-order: Decidability of Arity-Bounded Higher-Order Matching (MSS), pp. 488–502.
CAV-2003-MouraRS #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 #calculus #model checking #performance #μ-calculus: Fast μ-Calculus Model Checking when Tree-Width Is Bounded (JO), pp. 80–92.
CAV-2003-SeshiaB #automaton #model checking #using: Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods (SAS, REB), pp. 154–166.
CSL-2003-ChevalierKRTV: Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (YC, RK, MR, MT, LV), pp. 128–141.
VMCAI-2003-UnnikrishnanSL #analysis: Optimized Live Heap Bound Analysis (LU, SDS, YAL), pp. 70–85.
PODS-2002-Chirkova #problem #query: The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views (RC), pp. 159–168.
DLT-2002-DoL #on the #product line: On a Family of Codes with Bounded Deciphering Delay (DLV, IL), pp. 369–380.
DLT-2002-Domaratzki #automaton #finite: Improved Bounds on the Number of Automata Accepting Finite Languages (MD), pp. 209–219.
DLT-2002-SasakiIIW #2d #probability #turing machine: A Space Lower Bound of Two-Dimensional Probabilistic Turing Machines (YS, KI, AI, YW), pp. 185–196.
ICALP-2002-AblayevMP #branch #probability #quantum #source code: Quantum and Stochastic Branching Programs of Bounded Width (FMA, CM, CP), pp. 343–354.
ICALP-2002-BermanK #approximate: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.
ICALP-2002-ChristerssonGL #ad hoc #network: Gossiping with Bounded Size Messages in ad hoc Radio Networks (MC, LG, AL), pp. 377–389.
ICALP-2002-DemetrescuI #trade-off: Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.
ICALP-2002-EpsteinSS #online: New Bounds for Variable-Sized and Resource Augmented Online Bin Packing (LE, SSS, RvS), pp. 306–317.
ICALP-2002-EstebanGM #complexity #on the: On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.
ICALP-2002-GarganoHSV #branch: Spanning Trees with Bounded Number of Branch Vertices (LG, PH, LS, UV), pp. 355–365.
ICALP-2002-GrigorievHP #algebra #exponential #proving: Exponential Lower Bound for Static Semi-algebraic Proofs (DG, EAH, DVP), pp. 257–268.
ICALP-2002-ImpagliazzoS #axiom #simulation: Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations (RI, NS), pp. 208–219.
ICALP-2002-Radzik #network: Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network (TR), pp. 611–622.
FME-2002-LegeardPU #automation #testing: Automated Boundary Testing from Z and B (BL, FP, MU), pp. 21–40.
RTA-2002-Tahhan-Bittar #confluence #recursion #term rewriting: Recursive Derivational Length Bounds for Confluent Term Rewrite Systems (ETB), pp. 281–295.
CSCW-2002-LuttersA #case study #safety: Achieving safety: a field study of boundary objects in aircraft technical support (WGL, MSA), pp. 266–275.
CSCW-2002-StevensW #data access #maintenance: A new dimension in access control: studying maintenance engineering across organizational boundaries (GS, VW), pp. 196–205.
ICML-2002-GargHR #on the: On generalization bounds, projection profile, and margin distribution (AG, SHP, DR), pp. 171–178.
ICML-2002-Langford #testing: Combining Trainig Set and Test Set Bounds (JL), pp. 331–338.
ICML-2002-ZhangL #network: Representational Upper Bounds of Bayesian Networks (HZ, CXL), pp. 674–681.
ICPR-v1-2002-WechslerDLC #predict #using: Motion Prediction Using VC-Generalization Bounds (HW, ZD, FL, VC), pp. 151–154.
ICPR-v2-2002-EcabertT #image #segmentation: Variational Image Segmentation by Unifying Region and Boundary Information (OE, JPT), pp. 885–888.
ICPR-v2-2002-FrantiVK #clustering: Branch-and-Bound Technique for Solving Optimal Clustering (PF, OV, TK), pp. 232–235.
ICPR-v3-2002-Ishii #design #people: Tangible Bits: Designing the Boundary between People, Bits, and Atoms (HI), p. 277.
ICPR-v3-2002-KimKKK #sequence: Usefulness of Boundary Sequences in Computing Shape Features for Arbitrary Shaped Regions (SK, SK, JK, MK), pp. 355–358.
ICPR-v3-2002-SilvestreL #classification #optimisation: Optimization of Neural Classifiers Based on Bayesian Decision Boundaries and Idle Neurons Pruning (MRS, LLL), pp. 387–390.
PEPM-2002-GomezL #analysis #automation #higher-order: Automatic time-bound analysis for a higher-order language (GG, YAL), pp. 75–86.
POPL-2002-Boehm #garbage collection: Bounding space usage of conservative garbage collectors (HJB), pp. 93–100.
CC-2002-QianHV #approach #array #java: A Comprehensive Approach to Array Bounds Check Elimination for Java (FQ, LJH, CV), pp. 325–342.
DAC-2002-CabodiCQ #model checking #question #satisfiability: Can BDDs compete with SAT solvers on bounded model checking? (GC, PC, SQ), pp. 117–122.
FoSSaCS-2002-JancarKMS #automaton #proving: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.
FoSSaCS-2002-LohreyM #communication: Bounded MSC Communication (ML, AM), pp. 295–309.
STOC-2002-Aaronson #problem #quantum: Quantum lower bound for the collision problem (SA), pp. 635–642.
STOC-2002-Ben-Sasson02a: Hard examples for bounded depth frege (EBS), pp. 563–572.
STOC-2002-DziembowskiM #proving #security: Tight security proofs for the bounded-storage model (SD, UMM), pp. 341–350.
STOC-2002-Kontogiannis #algorithm #online #scheduling: Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines (SCK), pp. 124–133.
STOC-2002-Raz02a #principle: Resolution lower bounds for the weak pigeonhole principle (RR), pp. 553–562.
STOC-2002-SaksS #approximate #data type #distance: Space lower bounds for distance approximation in the data stream model (MES, XS), pp. 360–369.
CADE-2002-MouraRS #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 #model checking: Semi-formal Bounded Model Checking (JDB, AJH), pp. 280–294.
CAV-2002-ChevalierV #automation #protocol #security #verification: Automated Unbounded Verification of Security Protocols (YC, LV), pp. 324–337.
CAV-2002-McMillan #model checking #satisfiability: Applying SAT Methods in Unbounded Symbolic Model Checking (KLM), pp. 250–264.
CSL-2002-MarcinkowskiT #complexity #game studies #ltl: Optimal Complexity Bounds for Positive LTL Games (JM, TT), pp. 262–275.
CSL-2002-Nipkow #hoare #logic #nondeterminism #recursion: Hoare Logics for Recursive Procedures and Unbounded Nondeterminism (TN), pp. 103–119.
CSL-2002-Schmidt-SchaussS #decidability #higher-order #unification: Decidability of Bounded Higher-Order Unification (MSS, KUS), pp. 522–536.
ISSTA-2002-Bishop #reliability: Rescaling reliability bounds for a new operational profile (PGB), pp. 180–190.
SAT-2002-Schoening #satisfiability: New worst case bounds on k-SAT (US), p. 1.
WICSA-2001-Shaw #architecture #communication #research #ubiquitous: When System Boundaries Dissolve: Research Opportunities in Software Architectures for Ubiquitous Computing and Communication (MS), p. 99–?.
ICDAR-2001-ZhangT #documentation #image: Recovery of Distorted Document Images from Bound Volumes (ZZ, CLT), pp. 429–433.
CIAA-2001-FarreG #parsing: Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers (JF, JFG), pp. 101–114.
ICALP-2001-AtseriasBE: Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution (AA, MLB, JLE), pp. 1005–1016.
ICALP-2001-Blaser #algebra: Improvements of the Alder-Strassen Bound: Algebras with Nonzero Radical (MB), pp. 79–91.
ICALP-2001-BuhrmanTV #simulation: Time and Space Bounds for Reversible Simulation (HB, JT, PMBV), pp. 1017–1027.
ICALP-2001-ChakrabartiK #complexity #graph #random: Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.
ICALP-2001-EngebretsenK #approximate #metric: Approximation Hardness of TSP with Bounded Metrics (LE, MK), pp. 201–212.
ICALP-2001-SenV #quantum: Lower Bounds in the Quantum Cell Probe Model (PS, SV), pp. 358–369.
TLCA-2001-Hofmann #behaviour #complexity #memory management #type system #using: From Bounded Arithmetic to Memory Management: Use of Type Theory to Capture Complexity Classes and Space Behaviour (MH0), pp. 2–3.
ICML-2001-Geibel #learning: Reinforcement Learning with Bounded Risk (PG), pp. 162–169.
ICML-2001-Hutter #predict #sequence: General Loss Bounds for Universal Sequence Prediction (MH), pp. 210–217.
ICML-2001-LangfordSM #classification #predict: An Improved Predictive Accuracy Bound for Averaging Classifiers (JL, MWS, NM), pp. 290–297.
ICML-2001-Zhang #approximate #problem: Some Sparse Approximation Bounds for Regression Problems (TZ0), pp. 624–631.
LOPSTR-2001-FerrariFO #logic #proving: Extracting Exact Time Bounds from Logical Proofs (MF, CF, MO), pp. 245–266.
PPDP-2001-SchulteS #question: When Do Bounds and Domain Propagation Lead to the Same Search Space? (CS, PJS), pp. 115–126.
CC-2001-FarreG #parsing: A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.
DAC-2001-YangPT: Improving Bus Test Via IDDT and Boundary Scan (SYY, CAP, MTA), pp. 307–312.
STOC-2001-Ambainis #protocol #quantum: A new protocol and lower bounds for quantum coin flipping (AA), pp. 134–142.
STOC-2001-Bar-YossefKS #algorithm: Sampling algorithms: lower bounds and applications (ZBY, RK, DS), pp. 266–275.
STOC-2001-BolligW #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: Lower bounds for intersection searching and fractional cascading in higher dimension (BC, DL), pp. 322–329.
STOC-2001-IckingM #3d #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: Explicit lower bound of 4.5n — o(n) for boolena circuits (OL, RR), pp. 399–408.
STOC-2001-PitassiR #principle: Regular resolution lower bounds for the weak pigeonhole principle (TP, RR), pp. 347–355.
STOC-2001-RazS #matrix: Lower bounds for matrix product, in bounded depth circuits with arbitrary gates (RR, AS), pp. 409–418.
STOC-2001-Trevisan #optimisation #problem: Non-approximability results for optimization problems on bounded degree instances (LT), pp. 453–461.
TACAS-2001-Carvajal-SchiaffinoDC #petri net #validation: Combining Structural and Enumerative Techniques for the Validation of Bounded Petri Nets (RCS, GD, GC), pp. 435–449.
CAV-2001-CoptyFFGKTV #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 #exclamation: An n! Lower Bound on Formula Size (MA, NI), pp. 197–206.
LICS-2001-Stoller #protocol: A Bound on Attacks on Payment Protocols (SDS), pp. 61–70.
VLDB-2000-YuV #fault #network #performance: Efficient Numerical Error Bounding for Replicated Network Services (HY, AV), pp. 123–133.
ICALP-2000-AdlerFGP: Tight Size Bounds for Packet Headers in Narrow Meshes (MA, FEF, LAG, MP), pp. 756–767.
ICALP-2000-BolligW #problem: Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.
ICALP-2000-CsirikW #online: Resource Augmentation for Online Bounded Space Bin Packing (JC, GJW), pp. 296–304.
ICALP-2000-FournierK: Lower Bounds Are Not Easier over the Reals: Inside PH (HF, PK), pp. 832–843.
ICALP-2000-GoldbergJKP #capacity #protocol: A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols (LAG, MJ, SK, MP), pp. 705–716.
ICALP-2000-Seiden #algorithm #online: An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing (SSS), pp. 283–295.
IFL-2000-GustavssonS #analysis #morphism #polymorphism #type system: A Usage Analysis with Bounded Usage Polymorphism and Subtyping (JG, JS), pp. 140–157.
IFL-2000-Hammond #behaviour #concurrent: The Dynamic Properties of Hume: A Functionally-Based Concurrent Language with Bounded Time and Space Behaviour (KH), pp. 122–139.
ICML-2000-EvgeniouPPP #kernel #performance: Bounds on the Generalization Performance of Kernel Machine Ensembles (TE, LPB, MP, TP), pp. 271–278.
ICML-2000-ForsterW #learning: Relative Loss Bounds for Temporal-Difference Learning (JF, MKW), pp. 295–302.
ICML-2000-Reynolds #adaptation #clustering #learning: Adaptive Resolution Model-Free Reinforcement Learning: Decision Boundary Partitioning (SIR), pp. 783–790.
ICPR-v1-2000-HoogsM #approach: An Integrated Boundary and Region Approach to Perceptual Grouping (AH, JLM), pp. 1284–1290.
ICPR-v1-2000-SappaG #fault #image #modelling #optimisation: Modeling Range Images with Bounded Error Triangular Meshes without Optimization (ADS, MAG), pp. 1392–1395.
ICPR-v1-2000-TasdizenC #algebra #estimation #image #modelling: Boundary Estimation from Intensity/Color Images with Algebraic Curve Models (TT, DBC), pp. 1225–1228.
ICPR-v2-2000-LingC #feature model #performance: Fast and Efficient Feature Extraction Based on Bayesian Decision Boundaries (LLL, HMC), pp. 2390–2393.
ICPR-v3-2000-CamilleriP #refinement: Spectral Unmixing of Mixed Pixels for Texture Boundary Refinement (KPC, MP), pp. 7096–7099.
ICPR-v3-2000-KletteZ #fault #multi #order: Multigrid Error Bounds for Moments of Arbitrary Order (RK, JDZ), pp. 3790–3793.
ICPR-v3-2000-KwanCG #approach #automation #using: Automatic Extraction of Bone Boundaries from CT Scans Using an Intelligence-Based Approach (FYK, KCC, IG), pp. 3441–3444.
ICPR-v3-2000-RittscherS #detection: An Integral Criterion for Detecting Boundary Edges and Textured Regions (JR, JS), pp. 7076–7079.
ICPR-v4-2000-LeungCKC #detection #fuzzy: Thyroid Cancer Cells Boundary Location by a Fuzzy Edge Detection Method (CCL, FHYC, PCKK, WFC), pp. 4360–4363.
PLDI-2000-BodikGS #array #named: ABCD: eliminating array bounds checks on demand (RB, RG, VS), pp. 321–333.
PLDI-2000-RuginaR #analysis #array #memory management #pointer: Symbolic bounds analysis of pointers, array indices, and accessed memory regions (RR, MCR), pp. 182–195.
POPL-2000-CraryW #certification: Resource Bound Certification (KC, SW), pp. 184–198.
DAC-2000-GaurdianiSMSC #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 #using: Critical path analysis using a dynamically bounded delay model (SH), pp. 260–265.
DAC-2000-NarasimhanR #on the #problem #scheduling #synthesis: On lower bounds for scheduling problems in high-level synthesis (MN, JR), pp. 546–551.
DATE-2000-KruseSJSN #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.
DATE-2000-ParkK #design #detection #fault: A New IEEE 1149.1 Boundary Scan Design for the Detection of Delay Defects (SP, TK), pp. 458–462.
DATE-2000-SchwenckerSGA #automation #design: The Generalized Boundary Curve-A Common Method for Automatic Nominal Design and Design Centering of Analog Circuits (RS, FS, HEG, KA), pp. 42–47.
ESOP-2000-Hofmann #functional #type system: A Type System for Bounded Space and Functional In-Place Update--Extended Abstract (MH0), pp. 165–179.
STOC-2000-Achlioptas #random #satisfiability: Setting 2 variables at a time yields a new lower bound for random 3-SAT (DA), pp. 28–37.
STOC-2000-Ambainis #quantum: Quantum lower bounds by quantum arguments (AA), pp. 636–643.
STOC-2000-AnderssonT #worst-case: Tight(er) worst-case bounds on dynamic searching and priority queues (AA, MT), pp. 335–342.
STOC-2000-BarkolR #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: Higher lower bounds on monotone size (DH, RR), pp. 378–387.
STOC-2000-KonemannR #algorithm #approximate #matter: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.
CAV-2000-AbdullaIN #petri net: Unfoldings of Unbounded Petri Nets (PAA, SPI, AN), pp. 495–507.
CAV-2000-AyariB #higher-order #logic #monad: Bounded Model Construction for Monadic Second-Order Logics (AA, DAB), pp. 99–112.
CAV-2000-Shtrichman #model checking #satisfiability: Tuning SAT Checkers for Bounded Model Checking (OS), pp. 480–494.
CL-2000-ChirkovaG #database: Linearly Bounded Reformulations of Conjunctive Databases (RC, MRG), pp. 987–1001.
CSL-2000-Atserias #complexity #fixpoint: The Descriptive Complexity of the Fixed-Points of Bounded Formulas (AA), pp. 172–186.
CSL-2000-Blumensath #complexity: Bounded Arithmetic and Descriptive Complexity (AB), pp. 232–246.
LICS-2000-BussK: Resource-Bounded Continuity and Sequentiality for Type-Two Functionals (SRB, BMK), pp. 77–83.
SIGMOD-1999-EmbleyJN #documentation #web: Record-Boundary Discovery in Web Documents (DWE, YSJ, YKN), pp. 467–478.
DLT-1999-AndreBC #decidability #on the #query: On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
ICALP-1999-AllenderABDL: Bounded Depth Arithmetic Circuits: Counting and Closure (EA, AA, DAMB, SD, HL), pp. 149–158.
ICALP-1999-AndreevBCR #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-DufordJS: Boundedness of Reset P/T Nets (CD, PJ, PS), pp. 301–310.
ICALP-1999-GavoilleH #graph: Compact Routing Tables for Graphs of Bounded Genus (CG, NH), pp. 351–360.
ICALP-1999-NiedermeierR #satisfiability: New Upper Bounds for MaxSat (RN, PR), pp. 575–584.
ICFP-1999-HughesP #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 #component #protocol: Bounding Component Behavior via Protocols (FP, MB, SV), pp. 387–398.
PLDI-1999-BlellochC #garbage collection #multi #on the: On Bounding Time and Space for Multiprocessor Garbage Collection (GEB, PC), pp. 104–117.
Best-of-PLDI-1999-BlellochC99a #garbage collection #multi #on the: On bounding time and space for multiprocessor garbage collection (with retrospective) (GEB, PC), pp. 626–641.
DAC-1999-ChenW #approximate #fault: Error Bounded Padé Approximation via Bilinear Conformal Transformation (CPC, DFW), pp. 7–12.
DAC-1999-DrechslerG #using: Using Lower Bounds During Dynamic BDD Minimization (RD, WG), pp. 29–32.
DATE-1999-ShinKK #multi #testing: At-Speed Boundary-Scan Interconnect Testing in a Board with Multiple System Clocks (JS, HK, SK), p. 473–?.
PDP-1999-CasadoG #algorithm #branch #distributed: Work load balance approaches for branch and bound algorithms on distributed systems (LGC, IG), pp. 155–162.
PDP-1999-Gennaro #clustering #modelling #performance: Performance models for I/O bound SPMD applications on clusters of workstations (CG), pp. 263–270.
STOC-1999-AmbainisNTV #automaton #quantum: Dense Quantum Coding and a Lower Bound for 1-Way Quantum Automata (AA, AN, ATS, UVV), pp. 376–383.
STOC-1999-BeameF #problem: Optimal Bounds for the Predecessor Problem (PB, FEF), pp. 295–304.
STOC-1999-BorodinOR #nearest neighbour #problem: Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems (AB, RO, YR), pp. 312–321.
STOC-1999-ChakrabartiCGL #approximate #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: Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns (GHC, MYK, YDL, HKW), pp. 119–128.
STOC-1999-DodisK #design #distance #network: Design Networks with Bounded Pairwise Distance (YD, SK), pp. 750–759.
STOC-1999-IshaiK #information retrieval: Improved Upper Bounds on Information-Theoretic Private Information Retrieval (YI, EK), pp. 79–88.
STOC-1999-RazR #on the: On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.
STOC-1999-RussellSZ: Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (AR, MES, DZ), pp. 339–347.
TACAS-1999-AbdullaAB #protocol #verification: Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol (PAA, AA, AB), pp. 208–222.
CSL-1999-Beklemishev #query: Open Least Element Principle and Bounded Query Computation (LDB), pp. 389–404.
CSL-1999-Toran: Lower Bounds for Space in Resolution (JT), pp. 362–373.
ICLP-1999-PedreschiR #logic programming #nondeterminism #source code: Bounded Nondeterminism of Logic Programs (DP, SR), pp. 350–364.
IWTCS-1999-BaumgartenH #testing: Testability with Unbounded Testing Strategies (BB, OH), pp. 43–60.
LICS-1999-Johannsen #problem: Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable’s Class K (JJ), pp. 268–274.
LICS-1999-Libkin #invariant #logic #query: Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.
PODS-1998-KoutsoupiasT #2d: Tight Bounds for 2-Dimensional Indexing Schemes (EK, DST), pp. 52–58.
PODS-1998-SamoladasM #multi #query #theorem: A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries (VS, DPM), pp. 44–51.
ICALP-1998-JuknaZ #branch #nondeterminism #on the #source code: On Branching Programs With Bounded Uncertainty (SJ, SZ), pp. 259–270.
ICML-1998-Cesa-BianchiF #finite #multi #problem: Finite-Time Regret Bounds for the Multiarmed Bandit Problem (NCB, PF), pp. 100–108.
ICPR-1998-Claridge #algorithm #consistency #locality #visual notation: A boundary localisation algorithm consistent with human visual perception (EC), pp. 300–304.
ICPR-1998-FlorebySS #fourier #image #order #using: Boundary finding using Fourier surfaces of increasing order [simulated medical images] (LF, LS, KS), pp. 465–467.
ICPR-1998-Heikkila #detection: Moment and curvature preserving technique for accurate ellipse boundary detection (JH), pp. 734–737.
ICPR-1998-LeeHSL #analysis #automation #detection #parsing #using #video: Automatic video parsing using shot boundary detection and camera operation analysis (MSL, BWH, SS, SWL), pp. 1481–1483.
ICPR-1998-SuriHS #automation #classification #polynomial: Automatic quadratic calibration for correction of pixel classification boundaries to an accuracy of 2.5 millimeters: an application in cardiac imaging (JSS, RMH, FHS), pp. 30–33.
PLDI-1998-XiP #array #dependent type: Eliminating Array Bound Checking Through Dependent Types (HX, FP), pp. 249–257.
DAC-1998-DengiR #2d #megamodelling: Boundary Element Method Macromodels for 2-D Hierachical Capacitance Extraction (EAD, RAR), pp. 218–223.
DATE-1998-HelvigRZ #approximate #problem: Improved Approximation Bounds for the Group Steiner Problem (CSH, GR, AZ), pp. 406–413.
LCTES-1998-LiuG #analysis #automation: Automatic Accurate Time-Bound Analysis for High-Level Languages (YAL, GG), pp. 31–40.
PDP-1998-JimenezLF #multi: Loop bounds computation for multilevel tiling (MJ, JML, AF), pp. 445–452.
STOC-1998-FeigeS #scheduling: Improved Bounds for Acyclic Job Shop Scheduling (UF, CS), pp. 624–633.
STOC-1998-FournierK #question: Are Lower Bounds Easier over the Reals? (HF, PK), pp. 507–513.
STOC-1998-Gal #source code: A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs (AG), pp. 429–437.
STOC-1998-Grigoriev #complexity #random: Randomized Complexity Lower Bounds (DG), pp. 219–223.
STOC-1998-GrigorievK #exponential: An Exponential Lower Bound for Depth 3 Arithmetic Circuits (DG, MK), pp. 577–582.
STOC-1998-ShokrollahiW #algebra #geometry: Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound (MAS, HW), pp. 241–248.
CAV-1998-AbdullaBJ #analysis #on the fly: On-the-Fly Analysis of Systems with Unbounded, Lossy FIFO Channels (PAA, AB, BJ), pp. 305–318.
CSL-1998-Buning: An Upper Bound for Minimal Resolution Refutations (HKB), pp. 171–178.
CSL-1998-Schwentick #complexity #linear: Descriptive Complexity, Lower Bounds and Linear Time (TS), pp. 9–28.
LICS-1998-KolaitisO #first-order #logic #on the #problem: On the Boundedness Problem for Two-Variable First-Order Logic (PGK, MO), pp. 513–524.
ICDAR-1997-Nishida #documentation #feature model #image: Boundary Feature Extraction from Gray-Scale Document Images (HN), pp. 132–141.
ICDAR-1997-Szmurlo #normalisation #recognition: Boundary Normalization for Recognition of Non-Touching Non-Degraded Characters (MS), pp. 463–466.
DLT-1997-BuchholzK #on the #power of: On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.
DLT-1997-FernauHF #distributed: Bounding resources in Cooperating Distributed Grammar Systems (HF, MH, RF), pp. 261–272.
DLT-1997-IwamaT #automaton #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 #constant: A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.
ICALP-1997-Ambainis #communication #complexity #information retrieval: Upper Bound on Communication Complexity of Private Information Retrieval (AA), pp. 401–407.
ICALP-1997-BeigelF #nondeterminism #performance #recursion: Molecular Computing, Bounded Nondeterminism, and Efficient Recursion (RB, BF), pp. 816–826.
ICALP-1997-Bournez #constant #power of: Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (OB), pp. 143–153.
ICALP-1997-Bruyere #algorithm: A Completion Algorithm for Codes with Bounded Synchronization Delay (VB), pp. 87–97.
ICALP-1997-BuhrmanFF: Results on Resource-Bounded Measure (HB, SAF, LF), pp. 188–194.
ICALP-1997-Hagerup #algorithm #graph: Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.
ICFP-1997-ChinH: A Bounds Inference Method for Vector-Based Memoisation (WNC, MH), pp. 176–187.
ICML-1997-Fiechter #learning #online: Expected Mistake Bound Model for On-Line Reinforcement Learning (CNF), pp. 116–124.
PEPM-1997-Debray #partial evaluation: Resource-Bounded Partial Evaluation (SKD), pp. 179–192.
DAC-1997-BeattieP: Bounds for BEM Capacitance Extraction (MWB, LTP), pp. 133–136.
DAC-1997-KahngT: More Practical Bounded-Skew Clock Routing (ABK, CWAT), pp. 594–599.
DAC-1997-LiaoD #problem #using: Solving Covering Problems Using LPR-Based Lower Bounds (SYL, SD), pp. 117–120.
EDTC-1997-ChakrabortyM #functional #parallel #programmable #testing: A programmable boundary scan technique for board-level, parallel functional duplex march testing of word-oriented multiport static RAMs (KC, PM), pp. 330–334.
EDTC-1997-Kristof #architecture #effectiveness #idea #self #testing: Extension of the boundary-scan architecture and new idea of BIST for more effective testing and self-testing of interconnections (AK), p. 630.
STOC-1997-Albers #online #scheduling: Better Bounds for Online Scheduling (SA), pp. 130–139.
STOC-1997-Aspnes #distributed #random: Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.
STOC-1997-GoldreichR #graph #testing: Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.
STOC-1997-GrigorievK #random: Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.
STOC-1997-PaturiSZ #exponential: Exponential Lower Bounds for Depth 3 Boolean Circuits (RP, MES, FZ), pp. 86–91.
TACAS-1997-DArgenioKRT #exclamation #protocol: The Bounded Retransmission Protocol Must Be on Time! (PRD, JPK, TCR, JT), pp. 416–431.
TAPSOFT-1997-AndreB #difference #transducer: Word-into-Tree Transducers with Bounded Difference (YA, FB), pp. 177–188.
CSL-1997-BonetG #linear #simulation: Linear Lower Bounds and Simulations in Frege Systems with Substitutions (MLB, NG), pp. 115–128.
ILPS-1997-DebrayLHL #estimation #logic programming #source code: Lower Bound Cost Estimation for Logic Programs (SKD, PLG, MVH, NWL), pp. 291–305.
ILPS-1997-KingSB #analysis #logic programming #source code: Lower-bound Time-complexity Analysis of Logic Programs (AK, KS, FB), pp. 261–275.
ADL-1996-ChingJW #enterprise #library: Authorization in the Digital Library: Secure Access to Services Across Enterprise Boundaries (NC, VEJ, MW), pp. 110–119.
ICALP-1996-AtenieseBSS #encryption #visual notation: Constructions and Bounds for Visual Cryptography (GA, CB, ADS, DRS), pp. 416–428.
ICALP-1996-BradfordR: Lower Bounds for Row Minima Searching (PGB, KR), pp. 454–465.
ICALP-1996-Hashiguchi #automaton #distance: New Upper Bounds to the Limitedness of Distance Automata (KH), pp. 324–335.
ICALP-1996-Miltersen #multi: Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication (PBM), pp. 442–453.
ICALP-1996-Razborov #independence #proving: Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (AAR), pp. 48–62.
CSCW-1996-RandallR #development: Ethnography and Systems Development: Bounding the Intersection (DR, MR), p. 5.
CIKM-1996-Greco #set #unification: Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.
ICPR-1996-GunnN #energy #using: Snake head boundary extraction using global and local energy minimisation (SRG, MSN), pp. 581–585.
ICPR-1996-LakshmananW #detection #image: Detection of bounded weak echo regions in meteorological radar images (VL, AW), pp. 895–899.
ICPR-1996-SuriHS #automation #fault: Correction of systematic errors in automatically produced boundaries from low-contrast ventriculograms (JSS, RMH, FHS), pp. 361–365.
ICPR-1996-SzeL #algorithm #branch #classification: Branch and bound algorithm for the Bayes classifier (LS, CHL), pp. 705–709.
KR-1996-Hendler #implementation #research: Implementations and Research: Discussions at the Boundary (JAH), pp. 659–660.
KR-1996-MacGregor #implementation #research: Implementations and Research: Discussions at the Boundary (RMM), pp. 657–658.
KR-1996-Schubert #implementation #research: Implementations and Research: Discussions at the Boundary (LKS), pp. 661–662.
KR-1996-Shapiro #implementation #research: Implementations and Research: Discussions at the Boundary (SCS), pp. 663–664.
DAC-1996-OhPP #linear #programming #using: Constructing Lower and Upper Bounded Delay Routing Trees Using Linear Programming (JO, IP, MP), pp. 401–404.
DAC-1996-ParulkarGB #data flow #graph: Lower Bounds on Test Resources for Scheduled Data Flow Graphs (IP, SKG, MAB), pp. 143–148.
STOC-1996-BabaiGKRSW #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 #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 #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 #learning: Noise-Tolerant Learning Near the Information-Theoretic Bound (NCB, ED, PF, HUS), pp. 141–150.
STOC-1996-EvansP: Lower Bounds for Noisy Boolean Decision Trees (WSE, NP), pp. 620–628.
STOC-1996-GrigorievKHS #algebra #random: A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
CADE-1996-Vorobyov: An Improved Lower Bound for the Elementary Theories of Trees (SGV), pp. 275–287.
CAV-1996-ClarkeBLXS #analysis #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 #fixpoint #query: Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.
CSL-1996-Merkle: Exact Pairs for Abstract Bounded Reducibilities (WM), pp. 349–368.
LICS-1996-Marcinkowski #datalog #decidability: DATALOG SIRUPs Uniform Boundedness is Undecidable (JM), pp. 13–24.
ICDAR-v2-1995-HaHP #component #recursion #using: Recursive X-Y cut using bounding boxes of connected components (JH, RMH, ITP), pp. 952–955.
ICDAR-v2-1995-HaHP95a #composition #documentation: Document page decomposition by the bounding-box project (JH, RMH, ITP), pp. 1119–1122.
PODS-1995-DongS: Space-Bounded FOIES (GD, JS), pp. 139–150.
PODS-1995-Vardi #complexity #on the #query: On the Complexity of Bounded-Variable Queries (MYV), pp. 266–276.
SIGMOD-1995-PapadiasTSE #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 #object-oriented #query: Processing Object-Oriented Queries with Invertible Late Bound Functions (SF, TR), pp. 335–344.
DLT-1995-Dorr #abstract interpretation: Computing an Upper Bound for SVS(gg) by Abstract Interpretation (HD), pp. 279–288.
DLT-1995-GvozdjakR #parallel: Time-Bounded Parallel Rewriting (PG, BR), pp. 79–87.
ICALP-1995-Ben-AmramG #algebra #random: Lower Bounds on Algebraic Random Access Machines (AMBA, ZG), pp. 360–371.
ICALP-1995-BodlaenderH #algorithm #parallel: Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
ICALP-1995-BozanisKMT #problem: New Upper Bounds for Generalized Intersection Searching Problems (PB, NK, CM, AKT), pp. 464–474.
ICALP-1995-FreivaldsK #random: Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.
ICML-1995-Drakopoulos #classification #fault #nearest neighbour: Bounds on the Classification Error of the Nearest Neighbor Rule (JAD), pp. 203–208.
PLDI-1995-BarrettZ #garbage collection #using: Garbage Collection Using a Dynamic Threatening Boundary (DAB, BGZ), pp. 301–314.
POPL-1995-CastagnaP #decidability #named #quantifier: Corrigendum: Decidable Bounded Quantification (GC, BCP), p. 408.
POPL-1995-HoangM #type inference #type system: Lower Bounds on Type Inference with Subtypes (MH, JCM), pp. 176–185.
POPL-1995-Vorobyov #decidability #quantifier: Structural Decidable Extensions of Bounded Quantification (SGV), pp. 164–175.
DAC-1995-GuptaKTWP: The Elmore Delay as a Bound for RC Trees with Generalized Input Signals (RG, BK, BT, JW, LTP), pp. 364–369.
DAC-1995-HuangKT #on the #problem: On the Bounded-Skew Clock and Steiner Routing Problems (DJHH, ABK, CWAT), pp. 508–513.
STOC-1995-AnderssonHP #array: A tight lower bound for searching a sorted array (AA, JH, OP), pp. 417–426.
STOC-1995-BonetPR #proving: Lower bounds for cutting planes proofs with small coefficients (MLB, TP, RR), pp. 575–584.
STOC-1995-CanettiI #power of #random #scheduling: Bounding the power of preemption in randomized scheduling (RC, SI), pp. 606–615.
STOC-1995-Chazelle: Lower bounds for off-line range searching (BC), pp. 733–740.
STOC-1995-EdmondsP: A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model (JE, CKP), pp. 147–156.
STOC-1995-Eppstein #geometry #optimisation #parametricity: Geometric lower bounds for parametric matroid optimization (DE), pp. 662–671.
STOC-1995-Harchol-BalterW #network: Bounding delays in packet-routing networks (MHB, DW), pp. 248–257.
STOC-1995-KahaleLMPSS #network #sorting: Lower bounds for sorting networks (NK, FTL, YM, CGP, TS, ES), pp. 437–446.
STOC-1995-KarpinskiM #network #polynomial: Polynomial bounds for VC dimension of sigmoidal neural networks (MK, AM), pp. 200–208.
STOC-1995-Ponzio #branch #integer #multi #source code: A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.
TAPSOFT-1995-BadouelBD #algorithm #polynomial #synthesis: Polynomial Algorithms for the Synthesis of Bounded Nets (EB, LB, PD), pp. 364–378.
PODS-1994-Afrati #datalog #exclamation #graph #query: Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.
ICALP-1994-AumannBF #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: A Tight Lower Bound for Primitivity in k-Structures (PB), pp. 556–567.
ICALP-1994-BuhrmanT #on the: On the Cutting Edge of Relativization: The Resource Bounded Injury Method (HB, LT), pp. 263–273.
ICALP-1994-FreivaldsK #random: Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.
ICALP-1994-PlaxtonS #network #sorting: A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks (CGP, TS), pp. 618–629.
ICALP-1994-Pudlak #communication #complexity #game studies: Unexpected Upper Bounds on the Complexity of Some Communication Games (PP), pp. 1–10.
TAGT-1994-ArnborgP #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 #graph grammar #problem: The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars (KS, EW), pp. 211–224.
POPL-1994-CastagnaP #decidability #quantifier: Decidable Bounded Quantification (GC, BCP), pp. 151–162.
ICRE-1994-DrakeT #analysis: System bounding issues for analysis (JMD, WTT), pp. 24–31.
DAC-1994-ZhuW: Switch Bound Allocation for Maximizing Routability in Timing-Driven Routing of FPGAs (KZ, DFW), pp. 165–170.
EDAC-1994-DalkilicP #scheduling #using: Optimal Operation Scheduling Using Resource Lower Bound Estimations (MED, VP), pp. 319–324.
EDAC-1994-KarkkainenTW #monitoring #power management #testing: Boundary Scan Testing Combined with Power Supply Current Monitoring (MK, KT, MW), pp. 232–235.
EDAC-1994-Su #random testing #testing: Random Testing of Interconnects in A Boundary Scan Environment (CS), pp. 226–231.
HPDC-1994-Benslimane #communication #finite #state machine: Deciding Boundedness for Systems of Two Communicating Finite State Machines (AB), pp. 262–269.
PDP-1994-DiersteinHR #algorithm #array: A Branch-and-bound Algorithm For Array Distributions (AD, RH, TR), pp. 528–535.
STOC-1994-BodlaenderFH #problem: Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (HLB, MRF, MTH), pp. 449–458.
STOC-1994-FortnowW #game studies: Optimality and domination in repeated games with bounded players (LF, DW), pp. 741–749.
STOC-1994-GrigorievKV #algebra #testing: Lower bounds on testing membership to a polyhedron by algebraic decision trees (DG, MK, NV), pp. 635–644.
STOC-1994-HalldorssonR #approximate #graph #independence #set: Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.
STOC-1994-Miltersen #problem #random: Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.
STOC-1994-Mulmuley #linear #parallel #problem #programming: Lower bounds for parallel linear programming and other problems (KM), pp. 603–614.
STOC-1994-PapadimitriouY #complexity #on the: On complexity as bounded rationality (CHP, MY), pp. 726–733.
STOC-1994-YangA #problem: Time bounds for mutual exclusion and related problems (JHY, JHA), pp. 224–233.
ISSTA-1994-BertolinoM #branch #testing: A Meaningful Bound for Branch Testing (AB, MM), p. 202.
LICS-1994-ImpagliazzoPU #proving: Upper and Lower Bounds for Tree-Like Cutting Planes Proofs (RI, TP, AU), pp. 220–228.
ICDAR-1993-Breul #fault #recognition #using: Recognition of handprinted digits using optimal bounded error matching (TMB), pp. 493–496.
ICALP-1993-Ablayev #communication #complexity #probability: Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.
ICALP-1993-Kann #approximate #problem: Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.
ICALP-1993-KozenZ #problem: Optimal Bounds for the Change-Making Problem (DK, SZ), pp. 150–161.
ICALP-1993-Yamamoto #nondeterminism #trade-off #turing machine: Reversal-Space Trade-offs For Simultaneous Resource-Bounded Nondeterministic Turing Machines (HY), pp. 203–214.
TLCA-1993-Pierce #morphism #polymorphism: Intersection Types and Bounded Polymorphism (BCP), pp. 346–360.
TLCA-1993-Springintveld #reduction: Lower and Upper Bounds for Reductions of Types in λω and λP (JS), pp. 391–405.
CIKM-1993-CosarLS #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 #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 #memory management #multi: Executing Bounded Quantifications on Shared Memory Multiprocessors (JB, JB), pp. 302–317.
KBSE-1993-Feather #implementation: An Implementation of Bounded Obligations (MSF), p. 18.
SAC-1993-VaidyanathanL #analysis #learning: Analysis of Upper Bound in Valiant’s Model for Learning Bounded CNF Expressions (SV, SL), pp. 754–761.
SAC-1993-VeezhinathanKT #branch #hybrid: A Hybrid of Neural Net and Branch and Bound Techniques for Seismic Horizon Tracking (JV, FK, JT), pp. 173–178.
DAC-1993-Lee #2d #algorithm #design: A Bounded 2D Contour Searching Algorithm for Floorplan Design with Arbitrarily Shaped Rectilinear and Soft Modules (TcL), pp. 525–530.
STOC-1993-ChazelleEGGSW #set: Improved bounds on weak epsilon-nets for convex sets (BC, HE, MG, LJG, MS, EW), pp. 495–504.
STOC-1993-KushilevitzMRZ #random: Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.
STOC-1993-Maass #complexity #learning: Bounds for the computational power and learning complexity of analog neural nets (WM), pp. 335–344.
STOC-1993-PlotkinT #multi: Improved bounds on the max-flow min-cut ratio for multicommodity flows (SAP, ÉT), pp. 691–697.
STOC-1993-WigdersonZ: Expanders that beat the eigenvalue bound: explicit construction and applications (AW, DZ), pp. 245–251.
CSL-1993-Grohe #fixpoint #logic: Bounded-Arity Hierarchies in Fixed-Point Logics (MG), pp. 150–164.
ICLP-1993-Brzoska #logic programming: Temporal Logic Programming with Bounded Universal Modality Goals (CB), pp. 239–256.
ISSTA-1993-CorbettA #concurrent #realtime: A Practical Technique for Bounding the Time Between Events in Concurrent Real-Time Systems (JCC, GSA), pp. 110–116.
PODS-1992-WongA #concurrent #consistency #database #nondeterminism: Tolerating Bounded Inconsistency for Increasing Concurrency in Database Systems (MHW, DA), pp. 236–245.
ICALP-1992-ChazelleR #complexity #pointer: Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine (BC, BR), pp. 439–449.
ICALP-1992-SantisPY #proving #statistics #verification: One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier (ADS, GP, MY), pp. 28–40.
KR-1992-Schwarz #logic: Bounding Introspection in Nonmonotonic Logic (GS), pp. 581–590.
POPL-1992-NielsonN #fixpoint: Bounded Fixed Point Iteration (HRN, FN), pp. 71–82.
POPL-1992-Pierce #decidability #quantifier: Bounded Quantification is Undecidable (BCP), pp. 305–315.
DAC-1992-LingKW #3d #approach #simulation: A Boundary-Element Approach to Transient simulation of Three-Dimensional Integrated Circuit Interconnect (DDL, SK, JW), pp. 93–98.
HPDC-1992-ClaytonDMW #latency: Determining Update Latency Bounds in Galactica Net (SC, RJD, WM, AW), pp. 104–111.
STOC-1992-BeameIKPPW #exponential #principle: Exponential Lower Bounds for the Pigeonhole Principle (PB, RI, JK, TP, PP, ARW), pp. 200–220.
STOC-1992-BjornerLY #linear: Linear Decision Trees: Volume Estimates and Topological Bounds (AB, LL, ACCY), pp. 170–177.
STOC-1992-DworkW #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 #network: Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (BMM, RKS), pp. 150–161.
CSL-1992-Stewart #logic #polynomial #query: Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines (IAS), pp. 410–424.
PODS-1991-HillebrandKMV #datalog #tool support: Tools for Datalog Boundedness (GGH, PCK, HGM, MYV), pp. 1–12.
PODS-1991-JohnsonR #consistency #protocol #replication: A Tight Upper Bound on the Benefits of Replication and Consistency Control Protocols (DBJ, LR), pp. 75–81.
PODS-1991-KrishnakumarB: Bounded Ignorance in Replicated Systems (NK, AJB), pp. 63–74.
PODS-1991-MumickP #linear #query: Overbound and Right-Linear Queries (ISM, HP), pp. 127–141.
ICALP-1991-HonkalaS #ambiguity #morphism: L Morphisms: Bounded Delay and Regularity of Ambiguity (JH, AS), pp. 566–574.
RTA-1991-Baader #problem #unification: Unification, Weak Unification, Upper Bound, Lower Bound, and Generalization Problems (FB), pp. 86–97.
RTA-1991-Brandenburg #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 #proving #term rewriting #termination: Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding (DH), pp. 62–73.
RTA-1991-Pottier #algorithm #linear: Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms (LP), pp. 162–173.
ML-1991-YooF #effectiveness #identification: Identifying Cost Effective Boundaries of Operationality (JPY, DHF), pp. 569–573.
DAC-1991-OnoderaTT #layout: Branch-and-Bound Placement for Building Block Layout (HO, YT, KT), pp. 433–439.
PPoPP-1991-NicolauW #parallel: Optimal Schedules for Parallel Prefix Computation with Bounded Resources (AN, HW), pp. 1–10.
CAAP-1991-Caron #automaton #linear #term rewriting: Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties (ACC), pp. 74–89.
STOC-1991-AslamD #fault: Searching in the Presence of Linearly Bounded Errors (JAA, AD), pp. 486–493.
STOC-1991-AttiyaDLS #nondeterminism: Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty (HA, CD, NAL, LJS), pp. 359–369.
STOC-1991-BreslauerG #parallel #string: A Lower Bound for Parallel String Matching (DB, ZG), pp. 439–443.
STOC-1991-KarloffRR #algorithm #random: Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.
STOC-1991-Nisan #commutative: Lower Bounds for Non-Commutative Computation (NN), pp. 410–418.
CAV-1991-JardJ #algorithm #on the fly #verification: Bounded-memory Algorithms for Verification On-the-fly (CJ, TJ), pp. 192–202.
CSL-1991-Flum #on the: On Bounded Theories (JF), pp. 111–118.
CSL-1991-Goerdt #proving: The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.
LICS-1991-Hungar #complexity #hoare #proving: Complexity Bounds of Hoare-style Proof Systems (HH), pp. 120–126.
ML-1990-Hirsh #consistency #learning #nondeterminism: Learning from Data with Bounded Inconsistency (HH), pp. 32–39.
PLDI-1990-Gupta #array #fresh look #optimisation: A Fresh Look at Optimizing Array Bound Checking (RG), pp. 272–282.
PLDI-1990-SanthanamO: Register Allocation Across Procedure and Module Boundaries (VS, DO), pp. 28–39.
STOC-1990-Cleve #simulation #source code #towards: Towards Optimal Simulations of Formulas by Bounded-Width Programs (RC), pp. 271–277.
STOC-1990-Frederickson: The Information Theory Bound Is Tight for Selection in a Heap (GNF), pp. 26–33.
STOC-1990-Nisan #generative: Psuedorandom Generators for Space-Bounded Computation (NN), pp. 204–212.
STOC-1990-OgiwaraW #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 #pointer #problem: Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines (JALP), pp. 34–44.
STOC-1990-Szegedy #communication #complexity #symmetry: Functions with Bounded Symmetric Communication Complexity and Circuits with mod m Gates (MS), pp. 278–286.
STOC-1990-Zuckerman: A Technique for Lower Bounding the Cover Time (DZ), pp. 254–259.
CSL-1990-HertrampfW #fault #interactive #proving: Interactive Proof Systems: Provers, Rounds, and Error Bounds (UH, KWW), pp. 261–273.
CSL-1990-Pudlak #theorem: Ramsey’s Theorem in Bounded Arithmetic (PP), pp. 308–317.
CSL-1990-Ranaivoson #graph #problem: Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.
LICS-1990-HarelRV #concurrent #on the #power of #reasoning #source code: On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
PODS-1989-DublishM #fixpoint #query: Expressibility of Bounded-Arity Fixed-Point Query Hierarchies (PD, SNM), pp. 324–335.
ICALP-1989-AllenderH: Lower Bounds for the Low Hierarchy (EA, LAH), pp. 31–45.
ICALP-1989-BilardiM: Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions (GB, AM), pp. 95–107.
ICALP-1989-BrassardC: 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 #quantifier #recursion #relational #semantics: Relational Semantics for Recursive Types and Bounded Quantification (FC), pp. 164–178.
ICALP-1989-MansourST: Lower Bounds for Computations with the Floor Operation (YM, BS, PT), pp. 559–573.
FPCA-1989-CanningCHOM #morphism #object-oriented #polymorphism #programming: F-Bounded Polymorphism for Object-Oriented Programming (PSC, WRC, WLH, WGO, JCM), pp. 273–280.
DAC-1989-PatilB #algorithm #branch #generative #parallel #testing: A Parallel Branch and Bound Algorithm for Test Generation (SP, PB), pp. 339–343.
SOSP-1989-BarkleyL #lazy evaluation: A Lazy Buddy System Bounded by Two Coalescing Delays per Class (REB, TPL), pp. 167–176.
CAAP-1989-BeauquierCPV: Syntactical Properties of Unbounded Nets of Processors (JB, AC, AP0, GVN), pp. 119–133.
CAAP-1989-HabelKV #decidability #graph grammar #problem: Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar (AH, HJK, WV), pp. 275–289.
STOC-1989-BorodinRT #sequence #traversal: Lower Bounds on the Length of Universal Traversal Sequences (AB, WLR, MT), pp. 562–573.
STOC-1989-DolevS #concurrent: Bounded Concurrent Time-Stamp Systems Are Constructible (DD, NS), pp. 454–466.
CSL-1989-Meinel #source code: Ω-Branching Programs of Bounded Width (CM), pp. 242–253.
LICS-1989-Stolboushkin #complexity #logic: Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.
PODS-1988-RamakrishnaM #analysis: Analysis of Bounded Disorder File Organization (MVR, PM), pp. 117–125.
PODS-1988-Vardi #decidability #linear #query #recursion: Decidability and Undecidability Results for Boundedness of Linear Recursive Queries (MYV), pp. 341–351.
ICALP-1988-Bodlaender #graph #programming: Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.
ICALP-1988-ChangIP #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 #modelling #quantifier: Bounded Quantifiers Have Interval Models (SM), pp. 164–173.
ML-1988-BravermanR: Boundaries of Operationality (MSB, SJR), pp. 221–234.
STOC-1988-KarpZ #parallel #random: A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.
STOC-1988-King #complexity #graph: Lower Bounds on the Complexity of Graph Properties (VK), pp. 468–476.
CADE-1988-VermaR #parallel: Optimal Time Bounds for Parallel Term Matching (RMV, IVR), pp. 694–703.
CADE-1988-Walther #algorithm #automation #proving #termination: Argument-Bounded Algorithms as a Basis for Automated Termination Proofs (CW), pp. 602–621.
LICS-1988-BruceL #inheritance #quantifier: A Modest Model of Records, Inheritance and Bounded Quantification (KBB, GL), pp. 38–50.
PODS-1987-BeeriKBR #logic programming #source code: Bounds on the Propagation of Selection into Logic Programs (CB, PCK, FB, RR), pp. 214–226.
PODS-1987-ChanH #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 #decidability #recursion: A Decidable Class of Bounded Recursions (JFN, YS), pp. 227–236.
ICALP-1987-Dietzfelbinger #sorting: Lower Bounds for Sorting of Sums (MD), pp. 457–466.
ICALP-1987-MehlhornNA #complexity #problem: A Lower Bound for the Complexity of the Union-Split-Find Problem (KM, SN, HA), pp. 479–488.
STOC-1987-BeameH #problem: Optimal Bounds for Decision Problems on the CRCW PRAM (PB, JH), pp. 83–93.
STOC-1987-Smolensky #algebra #complexity #formal method: Algebraic Methods in the Theory of Lower Bounds for Boolean Circuit Complexity (RS), pp. 77–82.
LICS-1987-ImmermanK: Definability with Bounded Number of Bound Variables (NI, DK), pp. 236–244.
ICALP-1986-Schoning #recursion: Lower Bounds by Recursion Theoretic Arguments (US), pp. 370–375.
ICALP-1986-Willard #problem #query: Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (DEW), pp. 444–453.
GG-1986-Welzl #graph grammar: Boundary NlC and partition controlled graph grammars (EW), pp. 593–609.
OOPSLA-1986-MittalBK: Virtual Copies — At the Boundary Between Classes and Instances (SM, DGB, KMK), pp. 159–166.
DAC-1986-LinA #layout #named: Minplex — a compactor that minimizes the bounding rectangle and individual rectangles in a layout (SLL, JA), pp. 123–130.
STOC-1986-AjtaiBHKPRST #branch #source code: Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.
STOC-1986-Barrington #branch #source code: Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ (DAMB), pp. 1–5.
STOC-1986-DworkPPU #fault tolerance #network: Fault Tolerance in Networks of Bounded Degree (CD, DP, NP, EU), pp. 370–379.
STOC-1986-Hastad: Almost Optimal Lower Bounds for Small Depth Circuits (JH), pp. 6–20.
STOC-1986-LeightonS #algorithm #analysis #grid: Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms (FTL, PWS), pp. 91–103.
STOC-1986-LiY #parallel: New Lower Bounds for Parallel Computation (ML, YY), pp. 177–187.
VLDB-1985-Ioannidis #recursion: A Time Bound on the Materialization of some Recursively Defined Views (YEI), pp. 219–226.
ICALP-1985-KarlssonMR #nearest neighbour #problem: The Nearest Neighbor Problem on Bounded Domains (RGK, JIM, ELR), pp. 318–327.
ICALP-1985-Li: Lower Bounds by Kolmogorov-Complexity (ML0), pp. 383–393.
STOC-1985-Buss #polynomial: The Polynomial Hierarchy and Fragments of Bounded Arithmetic (SRB), pp. 285–290.
STOC-1985-FichHRW #infinity #parallel: One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.
STOC-1985-VardiS #logic #source code: Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report (MYV, LJS), pp. 240–251.
DAC-1984-LewandowskiL #algorithm #branch: A branch and bound algorithm for optimal pla folding (JLL, CLL), pp. 426–433.
STOC-1984-AdlerM #algorithm #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: Threshold Functions and Bounded Depth Monotone Circuits (RBB), pp. 475–479.
STOC-1984-DurisGS #communication #complexity: Lower Bounds on Communication Complexity (PD, ZG, GS), pp. 81–91.
STOC-1984-HartS #finite #logic #modelling #probability: Probabilistic Temporal Logics for Finite and Bounded Models (SH, MS), pp. 1–13.
STOC-1984-Leighton #complexity #parallel #sorting: Tight Bounds on the Complexity of Parallel Sorting (FTL), pp. 71–80.
STOC-1984-Maass #nondeterminism #polynomial #turing machine: Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (WM), pp. 401–408.
ILPC-1984-Sintzoff84 #source code #strict: Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.
ICALP-1983-ChandraFL #constant #problem: Lower Bounds for Constant Depth Circuits for Prefix Problems (AKC, SF, RJL), pp. 109–117.
ICALP-1983-ChoffrutK #morphism #testing: Test Sets for Morphisms with Bounded Delay (CC, JK), pp. 118–127.
ICALP-1983-HambruschS #graph #problem: Lower Bounds for Solving Undirected Graph Problems on VLSI (SEH, JS), pp. 292–303.
DAC-1983-LiuA: Bounds on the saved area ratio due to PLA folding (WL, DEA), pp. 538–544.
STOC-1983-Ben-Or #algebra: Lower Bounds for Algebraic Computation Trees (MBO), pp. 80–86.
STOC-1983-BorodinDFP #branch #source code: Bounds for Width Two Branching Programs (AB, DD, FEF, WJP), pp. 87–93.
STOC-1983-ChandraFL83a: Unbounded Fan-in Circuits and Associative Functions (AKC, SF, RJL), pp. 52–60.
STOC-1983-DurisGPR: Two Nonlinear Lower Bounds (PD, ZG, WJP, RR), pp. 127–132.
STOC-1983-Fich #parallel: New Bounds for Parallel Prefix Circuits (FEF), pp. 100–109.
STOC-1983-FurerSS #graph #normalisation: Normal Forms for Trivalent Graphs and Graphs of Bounded Valence (MF, WS, ES), pp. 161–170.
STOC-1983-Valiant #exponential #strict: Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.
ICALP-1982-DurisG #automaton #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-GoralcikovaGK #morphism #pseudo: A Boundary of Isomorphism Completeness in the Lattice of Semigroup Pseudovarieties (AG, PG, VK), pp. 292–299.
ICALP-1982-Kalorkoti: A Lower Bound for the Formula Size of Rational Functions (KK), pp. 330–338.
LFP-1982-White #constant: Constant Time Interpretation for Shallow-bound Variables in the Presence of Mixed SPECIAL/LOCAL Declarations (JLW), pp. 196–200.
POPL-1982-ReifS #communication #distributed #variability: Unbounded Speed Variability in Distributed Communication Systems (JHR, PGS), pp. 46–56.
DAC-1982-Grass #algorithm: A depth-first branch-and-bound algorithm for optimal PLA folding (WG), pp. 133–140.
DAC-1982-Kalay #modelling #multi #parametricity: Modeling polyhedral solids bounded by multi-curved parametric surfaces (YEK), pp. 501–507.
STOC-1982-BabaiGM #graph #morphism #multi: Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.
STOC-1982-CookD #parallel #ram: Bounds on the Time for Parallel RAM’s to Compute Simple Functions (SAC, CD), pp. 231–233.
STOC-1982-PachlKR #algorithm #distributed #proving: A Technique for Proving Lower Bounds for Distributed Maximum-Finding Algorithms (JKP, EK, DR), pp. 378–382.
STOC-1982-RuzzoST #probability: Space-Bounded Hierarchies and Probabilistic Computations (WLR, JS, MT), pp. 215–223.
ICALP-1981-BlattnerL: Parikh-Bounded Languages (MB, ML), pp. 316–323.
ICALP-1981-Snir #proving: Proving Lower Bounds for Linar Decision Trees (MS), pp. 305–315.
ICALP-1981-Ukkonen #on the #parsing: On Size Bounds for Deterministic Parsers (EU), pp. 218–228.
SIGIR-1981-SmeatonR #algorithm #information retrieval #nearest neighbour #problem #using: The Nearest Neighbour Problem in Information Retrieval: An Algorithm Using Upperbounds (AFS, CJvR), pp. 83–87.
DAC-1981-Goldstein: Defining the bounding edges of a SynthaVision solid model (RCG), pp. 457–461.
STOC-1981-Fich #detection #problem: Lower Bounds for the Cycle Detection Problem (FEF), pp. 96–105.
STOC-1981-LiptonS: Lower Bounds for VLSI (RJL, RS), pp. 300–307.
STOC-1981-PatersonRS: Bounds on Minimax Edge Length for Complete Binary Trees (MP, WLR, LS), pp. 293–299.
STOC-1981-Simon #complexity #probability #turing machine: Space-Bounded Probabilistic Turing Machine Complexity Classes Are Closed under Complement (JS), pp. 158–167.
ICALP-1980-Back #nondeterminism #semantics: Semantics of Unbounded Nondeterminism (RJB), pp. 51–63.
ICALP-1980-LewisP #symmetry: Symmetric Space-Bounded Computation (HRL, CHP), pp. 374–384.
ICALP-1980-RaoultV #semiparsing: Optimal Unbounded Search Strategies (JCR, JV), pp. 512–530.
STOC-1980-Miller #graph #morphism #testing: Isomorphism Testing for Graphs of Bounded Genus (GLM), pp. 225–235.
STOC-1980-Mirkowska #algorithm #axiom #nondeterminism: Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations (GM), pp. 14–21.
STOC-1980-PaulSS #approach #online: An Information-Theoretic Approach to Time Bounds for On-Line Computation (WJP, JIS, JS), pp. 357–367.
DAC-1979-DysartK #automation #branch: An application of branch and bound method to automatic printed circuit board routing (LD, MK), pp. 494–499.
STOC-1979-LengauerT #trade-off: Upper and Lower Bounds on Time-Space Tradeoffs (TL, RET), pp. 262–277.
STOC-1979-Ruzzo: Tree-Size Bounded Alternation (WLR), pp. 352–359.
STOC-1979-Sipser #automaton: Lower Bounds on the Size of Sweeping Automata (MS), pp. 360–364.
VLDB-1978-ChenLT #performance #scalability: The Rebound Sorter: An Efficient Sort Engine for Large Files (TCC, VYL, CT), pp. 312–318.
ICALP-1978-DobkinM #problem: Time and Space Bounds for Selection Problems (DPD, JIM), pp. 192–204.
STOC-1978-ReddyL #quantifier: Presburger Arithmetic with Bounded Quantifier Alternation (CRR, DWL), pp. 320–325.
ICALP-1977-BookY #on the #power of: On the Computational Power of Reversal-Bounded Machines (RVB, CKY), pp. 111–119.
ICALP-1977-Brandenburg #context-sensitive grammar: The Contextsensitivity Bounds of Contextsensitive Grammars and Languages (FJB), pp. 120–134.
POPL-1977-SuzukiI #array #implementation: Implementation of an Array Bound Checker (NS, KI), pp. 132–143.
STOC-1977-Sudborough #automaton: Separating Tape Bounded Auxiliary Pushdown Automata Classes (IHS), pp. 208–217.
STOC-1977-YaoAR #problem: An Ω(n² log n) Lower Bound to the Shortest Paths Problem (ACCY, DA, RLR), pp. 11–17.
ICALP-1976-AltM #complexity #recognition: Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.
STOC-1976-PaulTC #game studies #graph: Space Bounds for a Game of Graphs (WJP, RET, JRC), pp. 149–160.
STOC-1975-FischerMP: Lower Bounds on the Size of Boolean Formulas: Preliminary Report (MJF, ARM, MP), pp. 37–44.
STOC-1975-Galil #complexity #on the: On the Validity and Complexity of Bounded Resolution (ZG), pp. 72–82.
STOC-1975-Paul #combinator #complexity: A 2.5 n-lower Bound on the Combinatorial Complexity of Boolean Functions (WJP), pp. 27–36.
STOC-1975-Valiant #complexity #on the: On Non-linear Lower Bounds in Computational Complexity (LGV), pp. 45–53.
ICALP-1974-Monien #recursion: Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.
STOC-1974-BookNP #context-free grammar #linear #multi: Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (RVB, MN, MP), pp. 290–296.
STOC-1974-Kedem #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 #evaluation #parallel: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions (HTK), pp. 323–333.
SOSP-1973-GareyG #scheduling: Bounds on Scheduling with Limited Resources (MRG, RLG), pp. 104–111.
STOC-1973-Oppen: Elementary Bounds for Presburger Arithmetic (DCO), pp. 34–37.
ICALP-1972-Monien #automaton #turing machine: Relationship between Pushdown Automata and Tape-Bounded Turing Machines (BM), pp. 575–583.
DAC-1972-Lewis #detection #logic #simulation: Hazard detection by a quinary simulation of logic devices with bounded propagation delays (DWL), pp. 157–164.
STOC-1972-BlumFPRT #linear: Linear Time Bounds for Median Computations (MB, RWF, VRP, RLR, RET), pp. 119–124.
STOC-1972-CookR #random: Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.
STOC-1972-Kung #multi #performance: A Bound on the Multiplication Efficiency of Iteration (HTK), pp. 102–107.
STOC-1972-NievergeltR: Binary Search Trees of Bounded Balance (JN, EMR), pp. 137–142.
STOC-1970-Ausiello #on the: On Bounds on the Number of Steps to Compute Functions (GA), pp. 41–47.
STOC-1970-BookGW: Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.
STOC-1969-McCreightM: Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report (EMM, ARM), pp. 79–88.