BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
worst-case
Google worst-case

Tag #worst-case

85 papers:

POPLPOPL-2019-WangH #generative
Type-guided worst-case input generation (DW, JH0), p. 30.
ICSTICST-2019-KooS0B #automation #generative #learning #named #testing
PySE: Automatic Worst-Case Test Generation by Reinforcement Learning (JK, CS, MK0, SB), pp. 136–147.
ICSTICST-2019-SaumyaK0B #automation #generative #scalability #testing
XSTRESSOR : Automatic Generation of Large-Scale Worst-Case Test Inputs by Inferring Path Conditions (CS, JK, MK0, SB), pp. 1–12.
CASECASE-2018-RohL #clustering
Characterizing the Worst-Case Wafer Delay in a Cluster Tool Operated in a $K$-Cyclic Schedule (DHR, TEL), pp. 1562–1567.
AdaEuropeAdaEurope-2017-DaiB #execution #predict #realtime #roadmap
Predicting Worst-Case Execution Time Trends in Long-Lived Real-Time Systems (XD, AB), pp. 87–101.
CAVCAV-2017-ChatterjeeFG #analysis #recursion #source code
Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
PODSPODS-2015-KhamisNRR #geometry
Joins via Geometric Resolutions: Worst-case and Beyond (MAK, HQN, CR, AR), pp. 213–228.
SIGMODSIGMOD-2015-PerelmanR #compilation #named #query
DunceCap: Compiling Worst-Case Optimal Query Plans (AP, CR), pp. 2075–2076.
DACDAC-2015-IsmailLS #performance
Improving worst-case cache performance through selective bypassing and register-indexed cache (MI, DL, GES), p. 6.
DATEDATE-2015-RamboE #analysis #communication
Worst-case communication time analysis of networks-on-chip with shared virtual channels (EAR, RE), pp. 537–542.
ESOPESOP-2015-CernyHKRZ #abstraction #analysis #execution
Segment Abstraction for Worst-Case Execution Time Analysis (PC, TAH, LK, AR, JZ), pp. 105–131.
ICSTICST-2015-YuC #embedded #generative #stack #testing
Guided Test Generation for Finding Worst-Case Stack Usage in Embedded Systems (TY, MBC), pp. 1–10.
LICSLICS-2015-ClementeR #multi #problem
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
PODSPODS-2014-NgoNRR #analysis
Beyond worst-case analysis for joins with minesweeper (HQN, DTN, CR, AR), pp. 234–245.
ICALPICALP-v2-2014-0002HKSV #independence #online #set
Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods (OG, MH, TK, TS, BV), pp. 508–519.
ICALPICALP-v2-2014-KopelowitzKPS #bound #graph
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.
LCTESLCTES-2014-HenryAMM #encoding #execution #how #modulo theories #optimisation #semantics
How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics (JH, MA, DM, CM), pp. 43–52.
ICSTICST-2014-YuSCR #embedded #framework #named #testing
SimLatte: A Framework to Support Testing for Worst-Case Interrupt Latencies in Embedded Software (TY, WSa, MBC, GR), pp. 313–322.
CBSECBSE-2013-LednickiCS #analysis #execution
Model level worst-case execution time analysis for IEC 61499 (LL, JC, KS), pp. 169–178.
SIGMODSIGMOD-2013-LongWYJ #on the
On optimal worst-case matching (CL, RCWW, PSY, MJ), pp. 845–856.
ICALPICALP-v1-2013-BringmannDNS #online
Online Checkpointing with Improved Worst-Case Guarantees (KB, BD, AN, JS), pp. 255–266.
AdaEuropeAdaEurope-2013-AsensioLCN #analysis #approach #execution #safety
Worst-Case Execution Time Analysis Approach for Safety-Critical Airborne Software (EA, IL, AC, JN), pp. 161–176.
DATEDATE-2013-ChenHBK #energy #multi #optimisation #pipes and filters
Energy optimization with worst-case deadline guarantee for pipelined multiprocessor systems (GC, KH, CB, AK), pp. 45–50.
STOCSTOC-2013-HardtR #analysis
Beyond worst-case analysis in private singular vector computation (MH, AR), pp. 331–340.
PODSPODS-2012-NgoPRR #algorithm
Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
KRKR-2012-Feier #logic programming #reasoning #source code
Worst-Case Optimal Reasoning with Forest Logic Programs (CF).
DACDAC-2012-LoS #analysis #execution #monitoring #parallel #runtime
Worst-case execution time analysis for parallel run-time monitoring (DL, GES), pp. 421–429.
DATEDATE-2012-JafariJL #analysis #scheduling
Worst-case delay analysis of Variable Bit-Rate flows in network-on-chip with aggregate scheduling (FJ, AJ, ZL), pp. 538–541.
FMFM-2011-AlbertGGJST #behaviour #bound #concurrent #simulation
Simulating Concurrent Behaviors with Worst-Case Cost Bounds (EA, SG, MGZ, EBJ, RS, SLTT), pp. 353–368.
SACSAC-2011-LiuZ11a #analysis #distance #performance #stack
Stack distance based worst-case instruction cache performance analysis (YL, WZ), pp. 723–728.
DATEDATE-2011-RaiYBCT #analysis #realtime
Worst-case temperature analysis for real-time systems (DR, HY, IB, JJC, LT), pp. 631–636.
KRKR-2010-OrtizRS #owl #reasoning
Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 (MO, SR, MS).
DACDAC-2010-SchranzhoferPCTC #analysis #manycore #modelling #resource management
Worst-case response time analysis of resource access models in multi-core systems (AS, RP, JJC, LT, MC), pp. 332–337.
DATEDATE-2010-BauerSF #analysis #network
Worst-case end-to-end delay analysis of an avionics AFDX network (HB, JLS, CF), pp. 1220–1224.
PODSPODS-2009-Arge #performance #tutorial
Worst-case efficient range search indexing: invited tutorial (LA), pp. 175–176.
ICALPICALP-v1-2009-ArbitmanNS #performance
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results (YA, MN, GS), pp. 107–118.
ICALPICALP-v2-2009-Mosk-AoyamaR #analysis #performance
Worst-Case Efficiency Analysis of Queueing Disciplines (DMA, TR), pp. 546–557.
AdaEuropeAdaEurope-2009-MarrefB #analysis
Predicated Worst-Case Execution-Time Analysis (AM, GB), pp. 134–148.
ICSEICSE-2009-BurnimJS #automation #complexity #generative #named #testing
WISE: Automated test generation for worst-case complexity (JB, SJ, KS), pp. 463–473.
SACSAC-2009-LiuZ #distance #performance #stack
Exploiting stack distance to estimate worst-case data cache performance (YL, WZ), pp. 1979–1983.
DACDAC-2009-GandikotaDTB #modelling
Worst-case aggressor-victim alignment with current-source driver models (RG, LD, PT, DB), pp. 13–18.
DACDAC-2009-ZhangCTL #performance
Efficient design-specific worst-case corner extraction for integrated circuits (HZ, THC, MYT, XL), pp. 386–389.
DATEDATE-2009-MillbergJ
Priority based forced requeue to reduce worst-case latencies for bursty traffic (MM, AJ), pp. 1070–1075.
DATEDATE-2009-PollexKAS #bound
Improved worst-case response-time calculations by upper-bound conditions (VP, SK, KA, FS), pp. 105–110.
STOCSTOC-2009-Peikert #problem
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (CP), pp. 333–342.
ICMLICML-2008-Li #approximate #comparison #difference #linear
A worst-case comparison between temporal difference and residual gradient with linear function approximation (LL), pp. 560–567.
DATEDATE-2008-SamiiREP #distributed #estimation #realtime #simulation
A Simulation Methodology for Worst-Case Response Time Estimation of Distributed Real-Time Systems (SS, SR, PE, ZP), pp. 556–561.
DACDAC-2007-KirnerS #analysis #execution #modelling
Modeling the Function Cache for Worst-Case Execution Time Analysis (RK, MS), pp. 471–476.
DATEDATE-2007-AitkenI #design #embedded
Worst-case design and margin for embedded SRAM (RCA, SI), pp. 1289–1294.
LCTESLCTES-2007-Kastner #abstract interpretation #analysis #execution
Safe worst-case execution time analysis by abstract interpretation of executable code (DK), p. 135.
STOCSTOC-2007-PeikertR
Lattices that admit logarithmic worst-case to average-case connection factors (CP, AR), pp. 478–487.
IFLIFL-2006-BonenfantFHH #execution #functional
Worst-Case Execution Times for a Purely Functional Language (AB, CF, KH, RH), pp. 235–252.
DATEDATE-2005-PomeranzR #analysis #detection #testing
Worst-Case and Average-Case Analysis of n-Detection Test Sets (IP, SMR), pp. 444–449.
STOCSTOC-2005-Thorup
Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.
SIGMODSIGMOD-2004-ArgeBHY #performance
The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree (LA, MdB, HJH, KY), pp. 347–358.
ICPRICPR-v3-2004-DePiero #bound #graph #memory management #polynomial
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort (FWD), pp. 379–382.
DACDAC-2004-KouroussisAN #power management
Worst-case circuit delay taking into account power supply variations (DK, RA, FNN), pp. 652–657.
STOCSTOC-2004-ChlebusKS
Collective asynchronous reading with polylogarithmic worst-case overhead (BSC, DRK, AAS), pp. 321–330.
STOCSTOC-2003-Ajtai #algorithm #approximate #behaviour
The worst-case behavior of schnorr’s algorithm approximating the shortest nonzero vector in a lattice (MA), pp. 396–406.
DATEDATE-2002-SchwenckerSPG #adaptation #parametricity #set #using
Analog Circuit Sizing Using Adaptive Worst-Case Parameter Sets (RS, FS, MP, HEG), pp. 581–585.
STOCSTOC-2002-Micciancio #encryption
Improved cryptographic hash functions with worst-case/average-case connection (DM), pp. 609–618.
ICLPICLP-2002-LoncT #modelling #performance
Computing Stable Models: Worst-Case Performance Estimates (ZL, MT), pp. 347–362.
DACDAC-2001-SirichotiyakulBOLZZ #modelling
Driver Modeling and Alignment for Worst-Case Delay Noise (SS, DB, CO, RL, VZ, JZ), pp. 720–725.
AdaEuropeAdaEurope-2000-Ringler #analysis #execution #source code
Static Worst-Case Execution Time Analysis of Synchronous Programs (TR), pp. 56–68.
DATEDATE-2000-Balarin #abstraction #analysis #automation
Automatic Abstraction for Worst-Case Analysis of Discrete Systems (FB), pp. 494–501.
LCTESLCTES-2000-CortiBG #approximate #execution #multi
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems (MC, RB, TRG), pp. 178–198.
STOCSTOC-2000-AnderssonT #bound
Tight(er) worst-case bounds on dynamic searching and priority queues (AA, MT), pp. 335–342.
STOCSTOC-1999-AlstrupBR
Worst-Case and Amortised Optimality in Union-Find (SA, AMBA, TR), pp. 499–506.
ICALPICALP-1997-AndreevCR #trade-off
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs (AEA, AEFC, JDPR), pp. 177–187.
DACDAC-1997-DartuP
Calculating Worst-Case Gate Delays Due to Dominant Capacitance Coupling (FD, LTP), pp. 46–51.
STOCSTOC-1997-AjtaiD #equivalence
A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence (MA, CD), pp. 284–293.
DACDAC-1995-FabbroFCG #modelling #probability #standard
An Assigned Probability Technique to Derive Realistic Worst-Case Timing Models of Digital Standard Cells (ADF, BF, LC, CG), pp. 702–706.
DACDAC-1995-NajmZ #process
Extreme Delay Sensitivity and the Worst-Case Switching Activity in VLSI Circuits (FNN, MYZ), pp. 623–627.
LCTESLCT-RTS-1995-HuangL #concurrent #execution #predict
Predicting the Worst-Case Execution Time of the Concurrent Execution of Instructions and Cycle-Stealing DMA I/O Operations (TYH, JWSL), pp. 1–6.
LCTESLCT-RTS-1995-NilsenR #analysis #execution
Worst-Case Execution Time Analysis on Modern Processors (KDN, BR), pp. 20–30.
ICMLICML-1994-SchapireW #algorithm #analysis #learning #on the
On the Worst-Case Analysis of Temporal-Difference Learning Algorithms (RES, MKW), pp. 266–274.
DACDAC-1993-DharchoudhuryK #variability
Performance-Constrained Worst-Case Variability Minimization of VLSI Circuits (AD, SMK), pp. 154–158.
DACDAC-1993-GraebWA #analysis #optimisation
Improved Methods for Worst-Case Analysis and Optimization Incorporating Operating Tolerances (HEG, CUW, KA), pp. 142–147.
DACDAC-1992-DharchoudhuryK #approach #design #optimisation
An Integrated Approach to Realistic Worst-Case Design Optimization of MOS Analog Circuits (AD, SMK), pp. 704–709.
DACDAC-1989-GaiottiDR #estimation
Worst-case Delay Estimation of Transistor Groups (SG, MD, NCR), pp. 491–495.
PODSPODS-1987-Marchetti-SpaccamelaPS #analysis #complexity #implementation #logic #query
Worst-case Complexity Analysis of Methods for Logic Query Implementation (AMS, AP, DS), pp. 294–301.
SIGMODSIGMOD-1986-Willard #algorithm
Good Worst-Case Algorithms for Inserting and Deleting Records in Dense Sequential Files (DEW), pp. 251–260.
ICALPICALP-1980-PapadimitriouB #analysis #nearest neighbour
A Worst-Case Analysis of Nearest Neighbor Searching by Projection (CHP, JLB), pp. 470–482.
STOCSTOC-1972-GareyGU #algorithm #analysis #memory management
Worst-Case Analysis of Memory Allocation Algorithms (MRG, RLG, JDU), pp. 143–150.
DACDAC-1968-GarrettV #analysis
Circuit frequency response analysis program with worst-case capabilities (FRWC) (SJG, THV).

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