Stem hard$ (all stems)

292 papers:

DATE-2015-BiewerAGSH #approach #coordination #realtime #synthesis

A symbolic system synthesis approach for hard real-time systems based on coordinated SMT-solving (AB, BA, JG, TS, CH), pp. 357–362.

PODS-2015-PraveenS #graph #how #question

Defining Relations on Graphs: How Hard is it in the Presence of Node Partitions? (MP, BS), pp. 159–172.

SANER-2015-AmmerlaanVZ #refactoring #why

Old habits die hard: Why refactoring for understandability does not give immediate benefits (EA, WV, AZ), pp. 504–507.

STOC-2015-AbboudWY

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (AA, VVW, HY), pp. 41–50.

STOC-2015-AlwenS #complexity #graph #parallel

High Parallel Complexity Graphs and Memory-Hard Functions (JA, VS), pp. 595–603.

STOC-2015-HenzingerKNS #multi #online #problem

Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture (MH, SK, DN, TS), pp. 21–30.

STOC-2015-Lee #graph

Hardness of Graph Pricing Through Generalized Max-Dicut (EL), pp. 391–399.

ICALP-v1-2015-BunT #approximate

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (MB, JT), pp. 268–280.

ICALP-v1-2015-GalanisGJ #approximate

Approximately Counting H-Colourings is BIS-Hard (AG, LAG, MJ), pp. 529–541.

ICALP-v1-2015-KariKMPS #np-hard #set #synthesis

Binary Pattern Tile Set Synthesis Is NP-hard (LK, SK, PÉM, MJP, SS), pp. 1022–1034.

CHI-2015-JainFGHDZVF #artificial reality #visualisation

Head-Mounted Display Visualizations to Support Sound Awareness for the Deaf and Hard of Hearing (DJ, LF, JG, BH, RD, DNZ, CV, JEF), pp. 241–250.

CHI-2015-ZezschwitzLJH

Easy to Draw, but Hard to Trace?: On the Observability of Grid-based (Un)lock Patterns (EvZ, ADL, PJ, HH), pp. 2339–2342.

CSCW-2015-MatthiesenB #development #framework #legacy #perspective #why

Why Replacing Legacy Systems Is So Hard in Global Software Development: An Information Infrastructure Perspective (SM, PB), pp. 876–890.

ICML-2015-GiguereRLM #algorithm #kernel #predict #problem #string

Algorithms for the Hard Pre-Image Problem of String Kernels and the General Problem of String Prediction (SG, AR, FL, MM), pp. 2021–2029.

ICML-2015-GlobersonRSY #how #predict #question

How Hard is Inference for Structured Prediction? (AG, TR, DS, CY), pp. 2181–2190.

DATE-2014-DongZ #manycore #memory management #realtime #stack

Minimizing stack memory for hard real-time applications on multicore platforms (CD, HZ), pp. 1–6.

ITiCSE-2014-BainB #programming #question #why

Why is programming so hard to learn? (GB, IB), p. 356.

FoSSaCS-2014-Jancar #automaton

Equivalences of Pushdown Systems Are Hard (PJ), pp. 1–28.

STOC-2014-GuruswamiHHSV

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.

STOC-2014-Mehta #constant #game studies #rank

Constant rank bimatrix games are PPAD-hard (RM), pp. 545–554.

ICALP-v1-2014-AmirCLL #on the

On Hardness of Jumbled Indexing (AA, TMC, ML, NL), pp. 114–125.

ICALP-v1-2014-GolovnevKM #approach #problem #product line

Families with Infants: A General Approach to Solve Hard Partition Problems (AG, ASK, IM), pp. 551–562.

ICALP-v2-2014-Wehar

Hardness Results for Intersection Non-Emptiness (MW), pp. 354–362.

ICML-c2-2014-KarninH #linear

Hard-Margin Active Linear Regression (ZSK, EH), pp. 883–891.

ICML-c2-2014-YuanLZ #optimisation

Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization (XY, PL, TZ), pp. 127–135.

KDD-2014-XiangYY

Simultaneous feature and feature group selection through hard thresholding (SX, TY, JY), pp. 532–541.

KR-2014-IanovskiO #game studies

EGuaranteeNash for Boolean Games Is NEXP-Hard (EI, LO).

FSE-2014-Zimmermann

Data hard with a vengeance (invited talk) (TZ), p. 6.

SAT-2014-BeyersdorffK #metric

Unified Characterisations of Resolution Hardness Measures (OB, OK), pp. 170–187.

DAC-2013-ZhaiBS #parallel #realtime #streaming

Exploiting just-enough parallelism when mapping streaming applications in hard real-time systems (JTZ, MB, TS), p. 8.

DATE-2013-LorenteVSPCLD #power management #ram

Combining RAM technologies for hard-error recovery in L1 data caches working at very-low power modes (VL, AV, JS, SP, RC, PL, JD), pp. 83–88.

ICDAR-2013-PantkeMF #evaluation #on the #word

On Evaluation of Segmentation-Free Word Spotting Approaches without Hard Decisions (WP, VM, TF), pp. 1300–1304.

CSEET-2013-ChimalakondaN #adaptation #education #learning #personalisation #re-engineering #what

What makes it hard to teach software engineering to end users? some directions from adaptive and personalized learning (SC, KVN), pp. 324–328.

STOC-2013-BrakerskiLPRS #fault #learning

Classical hardness of learning with errors (ZB, AL, CP, OR, DS), pp. 575–584.

STOC-2013-GuptaTW #algorithm #bound #graph

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

STOC-2013-Ullman #difference #privacy #query

Answering n{2+o(1)} counting queries with differential privacy is hard (JU), pp. 361–370.

ICALP-v1-2013-Blaser #commutative

Noncommutativity Makes Determinants Hard (MB), pp. 172–183.

ICALP-v1-2013-BravermanOV #how #question #streaming

How Hard Is Counting Triangles in the Streaming Model? (VB, RO, DV), pp. 244–254.

ICALP-v1-2013-Curticapean

Counting Matchings of Size k Is W[1]-Hard (RC), pp. 352–363.

ICALP-v1-2013-MuchaS #problem #scheduling #symmetry

No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (MM, MS), pp. 769–779.

SIGIR-2013-VillaH

Is relevance hard work?: evaluating the effort of making relevant assessments (RV, MH), pp. 765–768.

PLEASE-2013-ChimalakondaN #education #product line #question #what

What makes it hard to apply software product lines to educational technologies? (SC, KVN), pp. 17–20.

LICS-2013-Fontaine #consistency #query #question #why

Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (GF), pp. 550–559.

SAT-2013-FingerLGS #constraints #probability #satisfiability #using

Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (MF, RL, CPG, BS), pp. 233–249.

DAC-2012-HuangCBK #consistency #embedded #realtime #runtime

Conforming the runtime inputs for hard real-time embedded systems (KH, GC, CB, AK), pp. 430–436.

DAC-2012-WangDX #architecture

Point and discard: a hard-error-tolerant architecture for non-volatile last level caches (JW, XD, YX), pp. 253–258.

DATE-2012-BamakhramaZNS #automation #design #embedded #realtime #streaming

A methodology for automated design of hard-real-time embedded streaming systems (MB, JTZ, HN, TS), pp. 941–946.

DATE-2012-GerdesKURS #realtime

Time analysable synchronisation techniques for parallelised hard real-time applications (MG, FK, TU, CR, PS), pp. 671–676.

FoSSaCS-2012-GorinS

Narcissists Are Easy, Stepmothers Are Hard (DG, LS), pp. 240–254.

STOC-2012-ChalermsookCEL #algorithm #approximate #concurrent

Approximation algorithms and hardness of integral concurrent flow (PC, JC, AE, SL), pp. 689–708.

STOC-2012-HuynhN #communication #complexity #on the #proving #trade-off

On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity (TH, JN), pp. 233–248.

STOC-2012-KhotPV #preprocessor #problem

2log1-ε n hardness for the closest vector problem with preprocessing (SK, PP, NKV), pp. 277–288.

STOC-2012-ODonnellW #game studies #np-hard

A new point of NP-hardness for unique games (RO, JW), pp. 289–306.

ICALP-v1-2012-DinitzKR #approximate #scalability

Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner (MD, GK, RR), pp. 290–301.

ICALP-v1-2012-GharibianK #approximate #problem #quantum

Hardness of Approximation for Quantum Problems (SG, JK), pp. 387–398.

ICALP-v1-2012-GoldbergJ #approximate #complexity #polynomial

The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) (LAG, MJ), pp. 399–410.

ICALP-v1-2012-SahaK #set

Set Cover Revisited: Hypergraph Cover with Hard Capacities (BS, SK), pp. 762–773.

ICPR-2012-LeiWPMY #robust

Robust tracking by accounting for hard negatives explicitly (PL, TW, MP, AM, ZY), pp. 2112–2115.

KDD-2012-Li #problem

Nine real hard problems we’d like you to solve (RL), p. 1.

SMT-2012-AzizWD #estimation #machine learning #problem #smt

A Machine Learning Technique for Hardness Estimation of QFBV SMT Problems (MAA, AGW, NMD), pp. 57–66.

DATE-2011-HanumaiahV #manycore #realtime

Reliability-aware thermal management for hard real-time applications on multi-core processors (VH, SBKV), pp. 137–142.

DATE-2011-Niu #embedded #energy #realtime #scheduling

System-level energy-efficient scheduling for hard real-time embedded systems (LN), pp. 281–284.

DATE-2011-PavlenkoWSKDSG #algebra #named #problem #reasoning #smt #verification

STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra (EP, MW, DS, WK, AD, FS, GMG), pp. 155–160.

CSEET-2011-BrownNOKL #game studies

Hard choice: A game for balancing strategy for agility (NB, RLN, IO, PK, EL), p. 553.

STOC-2011-ChienHSS #commutative

Almost settling the hardness of noncommutative determinant (SC, PH, AS, SS), pp. 499–508.

STOC-2011-KhotM #approximate #equation #linear #np-hard

NP-hardness of approximately solving linear equations over reals (SK, DM), pp. 413–420.

STOC-2011-SarmaHKKNPPW #approximate #distributed #verification

Distributed verification and hardness of distributed approximation (ADS, SH, LK, AK, DN, GP, DP, RW), pp. 363–372.

CIAA-2011-ChengJBK #on the #synthesis

On the Hardness of Priority Synthesis (CHC, BJ, CB, AK), pp. 110–117.

ICALP-v2-2011-BovaCV #comparison

Generic Expression Hardness Results for Primitive Positive Formula Comparison (SB, HC, MV), pp. 344–355.

HPCA-2011-YoonMCRJE #fault #memory management #named

FREE-p: Protecting non-volatile memory against both hard and soft errors (DHY, NM, JC, PR, NPJ, ME), pp. 466–477.

SOSP-2011-ColpNZACDLW #security

Breaking up is hard to do: security and functionality in a commodity hypervisor (PC, MN, JZ, WA, GC, TD, PL, AW), pp. 189–202.

CSL-2011-SchnablS #complexity #runtime

The Exact Hardness of Deciding Derivational and Runtime Complexity (AS, JGS), pp. 481–495.

ASE-2010-GibiecCC #mining #query #towards

Towards mining replacement queries for hard-to-retrieve traces (MG, AC, JCH), pp. 245–254.

DATE-2010-LiuLW #energy #fault tolerance #performance #realtime #scheduling

Scheduling for energy efficiency and fault tolerance in hard real-time systems (YL, HL, KW), pp. 1444–1449.

VLDB-2010-BeskalesIG #constraints #dependence #functional

Sampling the Repairs of Functional Dependency Violations under Hard Constraints (GB, IFI, LG), pp. 197–207.

STOC-2010-AkaviaGGM #np-hard

Erratum for: on basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 795–796.

STOC-2010-ArvindS #commutative #on the

On the hardness of the noncommutative determinant (VA, SS), pp. 677–686.

STOC-2010-BeameHP #complexity #proving

Hardness amplification in proof complexity (PB, TH, TP), pp. 87–96.

STOC-2010-Svensson #precedence #scheduling

Conditional hardness of precedence constrained scheduling on identical machines (OS), pp. 745–754.

ICALP-v1-2010-EisenbrandHNSVW #realtime #scheduling

Scheduling Periodic Tasks in a Hard Real-Time Environment (FE, NH, MN, MS, JV, AW), pp. 299–311.

LATA-2010-ManeaT #problem #word

Hard Counting Problems for Partial Words (FM, CT), pp. 426–438.

CHI-2010-CramerESGW #mobile #social #trust

Trying too hard: effects of mobile agents’ (Inappropriate) social expressiveness on trust, affect and compliance (HSMC, VE, TvS, MG, BJW), pp. 1471–1474.

ICML-2010-LongS #approximate #simulation #strict

Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate (PML, RAS), pp. 703–710.

SAC-2010-Niu #energy #realtime #scalability

Energy-aware dual-mode voltage scaling for weakly hard real-time systems (LN), pp. 321–325.

SPLC-2010-BagheriNRG #configuration management #feature model #modelling #product line #requirements

Configuring Software Product Line Feature Models Based on Stakeholders’ Soft and Hard Requirements (EB, TDN, AR, DG), pp. 16–31.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.

SAT-2010-NamasivayamT

Simple but Hard Mixed Horn Formulas (GN, MT), pp. 382–387.

VMCAI-2010-WilhelmABGHRWW #analysis #realtime

Static Timing Analysis for Hard Real-Time Systems (RW, SA, CB, DG, JH, JR, BW, SW), pp. 3–22.

CASE-2009-KamarthiZB #health

Assessement of current health of hard disk drives (SK, AZ, YB), pp. 246–249.

DATE-2009-LombardiMB #clustering #manycore #realtime #robust #scheduling

Robust non-preemptive hard real-time scheduling for clustered multicore platforms (ML, MM, LB), pp. 803–808.

STOC-2009-DworkNRRV #algorithm #complexity #on the #performance

On the complexity of differentially private data release: efficient algorithms and hardness results (CD, MN, OR, GNR, SPV), pp. 381–390.

STOC-2009-ODonnellW #satisfiability

Conditional hardness for satisfiable 3-CSPs (RO, YW), pp. 493–502.

LATA-2009-GlasserPT #fault tolerance #np-hard #problem

The Fault Tolerance of NP-Hard Problems (CG, AP, SDT), pp. 374–385.

SIGAda-2009-Rogers #ada #embedded #realtime

Embedded, hard, real-time systems with Ada (PR), pp. 17–18.

SAC-2009-WeiCM #design #energy #manycore #metric #realtime

Designing a multi-core hard real-time test bed for energy measurement experiments (TW, XC, PM), pp. 1998–1999.

DAC-2008-HoTDDGS #identification #logic #verification

Early formal verification of conditional coverage points to identify intrinsically hard-to-verify logic (RCH, MT, MMD, ROD, JG, DES), pp. 268–271.

DATE-2008-ChantemDH #realtime #scheduling

Temperature-Aware Scheduling and Assignment for Hard Real-Time Applications on MPSoCs (TC, RPD, XSH), pp. 288–293.

DATE-2008-CruzBCM #embedded #modelling #named #realtime #synthesis

ezRealtime: A Domain-Specific Modeling Tool for Embedded Hard Real-Time Software Synthesis (FC, RSB, LCC, PRMM), pp. 1510–1515.

DATE-2008-IzosimovPEP #constraints #embedded #fault tolerance #scheduling

Scheduling of Fault-Tolerant Embedded Systems with Soft and Hard Timing Constraints (VI, PP, PE, ZP), pp. 915–920.

DATE-2008-NagpalGK #approach #design #using

A Delay-efficient Radiation-hard Digital Design Approach Using CWSP Elements (CN, RG, SPK), pp. 354–359.

VLDB-2008-ShangZLY #algorithm #morphism #performance #testing #verification

Taming verification hardness: an efficient algorithm for testing subgraph isomorphism (HS, YZ, XL, JXY), pp. 364–375.

WCRE-2008-Blasband

Hard Facts vs Soft Facts (DB), pp. 301–304.

STOC-2008-DvirSY #bound #trade-off

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

STOC-2008-GentryPV #encryption

Trapdoors for hard lattices and new cryptographic constructions (CG, CP, VV), pp. 197–206.

STOC-2008-KhotS #learning #on the

On hardness of learning intersection of two halfspaces (SK, RS), pp. 345–354.

STOC-2008-ManokaranNRS #metric #multi

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling (RM, JN, PR, RS), pp. 11–20.

STOC-2008-ShaltielV #proving

Hardness amplification proofs require majority (RS, EV), pp. 589–598.

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

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

ICALP-A-2008-Dachman-SoledLMSWW #encryption #learning

Optimal Cryptographic Hardness of Learning Monotone Functions (DDS, HKL, TM, RAS, AW, HW), pp. 36–47.

ICALP-A-2008-KrokhinM #on the

On the Hardness of Losing Weight (AAK, DM), pp. 662–673.

LATA-2008-Perekrestenko #bound #np-hard

Minimalist Grammars with Unbounded Scrambling and Nondiscriminating Barriers Are NP-Hard (AP), pp. 421–432.

ICML-2008-NarayanamurthyR #markov #on the #process #symmetry

On the hardness of finding symmetries in Markov decision processes (SMN, BR), pp. 688–695.

SAC-2008-CruzBC #approach #embedded #modelling #realtime #towards

Towards a model-driven engineering approach for developing embedded hard real-time software (FC, RSB, LC), pp. 308–314.

ASPLOS-2008-LiRSAAZ #comprehension #design #fault

Understanding the propagation of hard errors to software and implications for resilient system design (MLL, PR, SKS, SVA, VSA, YZ), pp. 265–276.

HPCA-2008-GaoMDZ #branch #correlation #locality #novel #predict

Address-branch correlation: A novel locality for long-latency hard-to-predict branches (HG, YM, MD, HZ), pp. 74–85.

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

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

ASE-2007-Hall #infinity #modelling #named #realtime #validation

Rteq: modeling and validating infinite-state hard-real-time systems (RJH), pp. 481–484.

DAC-2007-DavareZNPKS #distributed #optimisation #realtime

Period Optimization for Hard Real-time Distributed Automotive Systems (AD, QZ, MDN, CP, SK, ALSV), pp. 278–283.

DATE-2007-DittmannF #configuration management #realtime #scheduling

Hard real-time reconfiguration port scheduling (FD, SF), pp. 123–128.

DATE-2007-NiuQ #energy #interactive #realtime #scheduling

Interactive presentation: Peripheral-conscious scheduling on energy minimization for weakly hard real-time systems (LN, GQ), pp. 791–796.

DATE-2007-PuautP #comparison #realtime

Scratchpad memories vs locked caches in hard real-time systems: a quantitative comparison (IP, CP), pp. 1484–1489.

DATE-2007-SauerGD #composition #framework #interactive

Interactive presentation: Hard- and software modularity of the NOVA MPSoC platform (CS, MG, SD), pp. 1102–1107.

PODS-2007-ChakaravarthyPRAM #algorithm #approximate #identification

Decision trees for entity identification: approximation algorithms and hardness results (VTC, VP, SR, PA, MKM), pp. 53–62.

PODS-2007-GottlobMS #np-hard

Generalized hypertree decompositions: np-hardness and tractable variants (GG, ZM, TS), pp. 13–22.

ITiCSE-2007-LevyB #education #tool support

We work so hard and they don’t use it: acceptance of software tools by teachers (RBBL, MBA), pp. 246–250.

STOC-2007-ChuzhoyGKT #graph

Hardness of routing with congestion in directed graphs (JC, VG, SK, KT), pp. 165–178.

STOC-2007-ChuzhoyK #polynomial #problem

Polynomial flow-cut gaps and hardness of directed cut problems (JC, SK), pp. 179–188.

STOC-2007-HavivR #polynomial #problem

Tensor-based hardness of the shortest vector problem to within almost polynomial factors (IH, OR), pp. 469–477.

STOC-2007-ShaltielU #trade-off

Low-end uniform hardness vs. randomness tradeoffs for AM (RS, CU), pp. 430–439.

ICALP-2007-CaryRS #finite #metric

Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), p. 949.

ICALP-2007-GuoN #graph #kernel #linear #np-hard #problem

Linear Problem Kernels for NP-Hard Problems on Planar Graphs (JG, RN), pp. 375–386.

ICALP-2007-LaroseT #algebra #constraints #problem

Universal Algebra and Hardness Results for Constraint Satisfaction Problems (BL, PT), pp. 267–278.

ICALP-2007-LuTW #complexity #on the #set

On the Complexity of Hard-Core Set Constructions (CJL, SCT, HLW), pp. 183–194.

SEFM-2007-RungtaM #benchmark #metric #model checking

Hardness for Explicit State Software Model Checking Benchmarks (NR, EGM), pp. 247–256.

CHI-2007-CockburnKAZ #interface #learning

Hard lessons: effort-inducing interfaces benefit spatial learning (AC, POK, JA, SZ), pp. 1571–1580.

ECIR-2007-AslamP #estimation #multi #query #using

Query Hardness Estimation Using Jensen-Shannon Divergence Among Multiple Scoring Functions (JAA, VP), pp. 198–209.

SAC-2007-KimKK #energy #mobile

Energy-efficient disk replacement and file placement techniques for mobile systems with hard disks (YJK, KTK, JK), pp. 693–698.

HPCA-2007-ZhouTZ #concurrent #detection #named

HARD: Hardware-Assisted Lockset-based Race Detection (PZ, RT, YZ), pp. 121–132.

CAV-2007-BruttomessoCFGHNPS #industrial #lazy evaluation #problem #smt #verification

A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems (RB, AC, AF, AG, ZH, AN, AP, RS), pp. 547–560.

DAC-2006-GargJKC #approach #design

A design approach for radiation-hard digital electronics (RG, NJ, SPK, GC), pp. 773–778.

DATE-2006-ChengG #energy #online #realtime #scheduling

Online energy-aware I/O device scheduling for hard real-time systems (HC, SG), pp. 1055–1060.

DATE-2006-HsuCK #constraints #energy #multi #realtime #synthesis

Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint (HRH, JJC, TWK), pp. 1061–1066.

PLDI-2006-BergerZ #memory management #named #probability #safety

DieHard: probabilistic memory safety for unsafe languages (EDB, BGZ), pp. 158–168.

PLDI-2006-SpoonhowerABCG #named #programming #realtime

Eventrons: a safe programming construct for high-frequency hard real-time applications (DS, JSA, DFB, PC, DG), pp. 283–294.

STOC-2006-AkaviaGGM #np-hard #on the

On basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 701–710.

STOC-2006-AndrewsZ #problem

Logarithmic hardness of the directed congestion minimization problem (MA, LZ), pp. 517–526.

STOC-2006-ChuzhoyK #graph #problem

Hardness of cut problems in directed graphs (JC, SK), pp. 527–536.

STOC-2006-DinurMR #approximate

Conditional hardness for approximate coloring (ID, EM, OR), pp. 344–353.

STOC-2006-Feldman #approximate #learning #logic #query

Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.

STOC-2006-FellowsRRS #clique #np-hard

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

DLT-2006-GruberH #bound #complexity #nondeterminism

Finding Lower Bounds for Nondeterministic State Complexity Is Hard (HG, MH), pp. 363–374.

ICALP-v2-2006-FouquePSZ

Hardness of Distinguishing the MSB or LSB of Secret Keys in Diffie-Hellman Schemes (PAF, DP, JS, SZ), pp. 240–251.

ICALP-v2-2006-HaitnerHR #generative #performance #pseudo

Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (IH, DH, OR), pp. 228–239.

SIGIR-2006-BaillieR

Examining assessor attributes at HARD 2005 (MB, IR), pp. 609–610.

ISSTA-2006-CobleighAC #composition #reasoning

Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning (JMC, GSA, LAC), pp. 97–108.

DAC-2005-ZhangLLSS #realtime #scheduling

Optimal procrastinating voltage scheduling for hard real-time systems (YZ, ZL, JL, KS, MRS), pp. 905–908.

ICDAR-2005-BairdMW #named

ScatterType: A Legible but Hard-to-Segment CAPTCHA (HSB, MAM, SYW), pp. 935–939.

STOC-2005-Ajtai #representation

Representing hard lattices with O(n log n) bits (MA), pp. 94–103.

STOC-2005-AndrewsZ #problem

Hardness of the undirected edge-disjoint paths problem (MA, LZ), pp. 276–283.

STOC-2005-AndrewsZ05a #problem

Hardness of the undirected congestion minimization problem (MA, LZ), pp. 284–293.

STOC-2005-Trevisan #on the

On uniform amplification of hardness in NP (LT), pp. 31–38.

ICALP-2005-CaryRS #finite #metric #on the

On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), pp. 1412–1423.

ECMDA-FA-2005-BurmesterGS #architecture #framework #independence #modelling #realtime

Model-Driven Architecture for Hard Real-Time Systems: From Platform Independent Models to Code (SB, HG, WS), pp. 25–40.

SAC-2005-KoshelevaKMN #matrix #np-hard

Computing the cube of an interval matrix is NP-Hard (OK, VK, GM, HTN), pp. 1449–1453.

SAT-J-2004-JiaMS05 #satisfiability

From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 199–210.

ASE-2004-Kloukinas #realtime

Data-Mining Synthesised Schedulers for Hard Real-Time Systems (CK), pp. 14–23.

DAC-2004-SeoKC #realtime #scheduling

Profile-based optimal intra-task voltage scheduling for hard real-time applications (JS, TK, KSC), pp. 87–92.

DATE-v2-2004-CortesEP #realtime #scheduling

Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks (LAC, PE, ZP), pp. 1176–1183.

VLDB-2004-Campbell #database

Production Database Systems: Making Them Easy is Hard Work (DC), pp. 1196–1197.

STOC-2004-ChuzhoyGHKKN #approximate #symmetry

Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.

STOC-2004-ChuzhoyN #scheduling

New hardness results for congestion minimization and machine scheduling (JC, JN), pp. 28–34.

STOC-2004-HealyVV #nondeterminism #using

Using nondeterminism to amplify hardness (AH, SPV, EV), pp. 192–201.

ICALP-2004-SahinalpU #problem #similarity #string

Hardness of String Similarity Search and Other Indexing Problems (SCS, AU), pp. 1080–1098.

LICS-2004-IntrigilaS #calculus

The ω-Rule is Π⁰₂-Hard in the λβ-Calculus (BI, RS), pp. 202–210.

SAT-2004-Connamacher #constraints #problem #random

A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.

SAT-2004-JiaMS #satisfiability

From Spin Glasses to Hard Satisfiable Formulas (HJ, CM, BS), pp. 12–19.

DAC-2003-MantheLS #analysis

Symbolic analysis of analog circuits with hard nonlinearity (AM, ZL, CJRS), pp. 542–545.

DATE-2003-LaurentK #validation

A System to Validate and Certify Soft and Hard IP (BL, TK), pp. 20208–20213.

DATE-2003-PomeranzRK #detection #fault #on the

On the Characterization of Hard-to-Detect Bridging Faults (IP, SMR, SK), pp. 11012–11019.

FoSSaCS-2003-Kieronski #transitive

The Two-Variable Guarded Fragment with Transitive Guards Is 2EXPTIME-Hard (EK), pp. 299–312.

STOC-2003-Ben-SassonHR

Some 3CNF properties are hard to test (EBS, PH, SR), pp. 345–354.

STOC-2003-DinurGKR #multi

A new multilayered PCP and the hardness of hypergraph vertex cover (ID, VG, SK, OR), pp. 595–601.

DLT-2003-Malcher #automaton #finite

Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.

ICALP-2003-GandhiHKKS #algorithm #approximate

An Improved Approximation Algorithm for Vertex Cover with Hard Capacities (RG, EH, SK, GK, AS), pp. 164–175.

DAC-2002-ChenMB #configuration management #generative

A reconfigurable FPGA-based readback signal generator for hard-drive read channel simulator (JC, JM, KB), pp. 349–354.

DATE-2002-KimKM #algorithm #analysis #realtime #scalability #using

A Dynamic Voltage Scaling Algorithm for Dynamic-Priority Hard Real-Time Systems Using Slack Time Analysis (WK, JK, SLM), pp. 788–794.

DATE-2002-LechugaMMB #detection #fault

Built-In Dynamic Current Sensor for Hard-to-Detect Faults in Mixed-Signal Ics (YL, RM, MM, SB), pp. 205–211.

STOC-2002-Ben-Sasson02a #bound

Hard examples for bounded depth frege (EBS), pp. 563–572.

STOC-2002-Holmerin #approximate

Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-epsilon (JH), pp. 544–552.

STOC-2002-Khot #approximate

Hardness results for approximate hypergraph coloring (SK), pp. 351–359.

STOC-2002-ODonnell

Hardness amplification within NP (RO), pp. 751–760.

STOC-2002-Umans #generative #pseudo

Pseudo-random generators for all hardnesses (CU), pp. 627–634.

CIAA-2002-LargeteauG #distributed #realtime #validation

Term Validation of Distributed Hard Real-Time Applications (GL, DG), pp. 262–269.

ICALP-2002-BermanK #approximate #bound

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.

ICALP-2002-KiayiasY #encryption

Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes (AK, MY), pp. 232–243.

ICALP-2002-Srba #algebra #process #similarity

Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard (JS), pp. 716–727.

AdaEurope-2002-MedinaGDH #ada #analysis #component #distributed #modelling #realtime #scheduling

Modeling and Schedulability Analysis of Hard Real-Time Distributed Systems Based on Ada Components (JLM, JJG, JMD, MGH), pp. 282–296.

POPL-2002-PetrankR

The hardness of cache conscious data placement (EP, DR), pp. 101–112.

LICS-2002-Atserias #random #satisfiability

Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.

ICDAR-2001-HuKLWN #why

Why Table Ground-Truthing is Hard (JH, RSK, DPL, GTW, GN), pp. 129–133.

FoSSaCS-2001-LaroussinieMS #model checking

Model Checking CTL+ and FCTL is Hard (FL, NM, PS), pp. 318–331.

STOC-2001-HaleviKKN #approximate #np-hard

Private approximation of NP-hard functions (SH, RK, EK, KN), pp. 550–559.

CIAA-2001-DubernardG #automaton #finite #generative #scheduling

Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.

ICALP-2001-EngebretsenK #approximate #bound #metric

Approximation Hardness of TSP with Bounded Metrics (LE, MK), pp. 201–212.

SAT-2001-HorvitzRGKSC #approach #problem

A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report) (EH, YR, CPG, HAK, BS, DMC), pp. 376–391.

DATE-2000-SimunicBGM #power management

Dynamic Power Management of Laptop Hard Disk (TS, LB, PWG, GDM), p. 736.

DATE-2000-WegenerK #modelling #testing

Incorporation of Hard-Fault-Coverage in Model-Based Testing of Mixed-Signal ICs (CW, MPK), p. 765.

SIGMOD-2000-WattezCBFF #benchmark #learning #metric #query

Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way (FW, SC, VB, GF, CF), pp. 510–511.

STOC-2000-BuschHW

Hard-Potato routing (CB, MH, RW), pp. 278–285.

ICALP-2000-EngebretsenH #approximate #clique

Clique Is Hard to Approximate within n1-o(1) (LE, JH), pp. 2–12.

ICALP-2000-Hastad #algorithm #approximate #np-hard #optimisation #performance #problem #question

Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? (JH), p. 235.

ICALP-2000-KumarAR #set

Hardness of Set Cover with Intersection 1 (VSAK, SA, HR), pp. 624–635.

CIKM-2000-AllanLJ #detection

First Story Detection In TDT Is Hard (JA, VL, HJ), pp. 374–381.

ICPR-v3-2000-Verges-LlahiSC #algorithm #clustering #constraints #graph #image #segmentation

Color Image Segmentation Solving Hard-Constraints on Graph Partitioning Greedy Algorithms (JVL, AS, JC), pp. 3629–3632.

KR-2000-DimopoulosNT

Finding Admissible and Preferred Arguments Can be Very Hard (YD, BN, FT), pp. 53–61.

DAC-1999-ShinC #realtime #scheduling

Power Conscious Fixed Priority Scheduling for Hard Real-Time Systems (YS, KC), pp. 134–139.

DATE-1999-VercauterenSV #constraints #generative #hardware #interface #realtime #synthesis

Combining Software Synthesis and Hardware/Software Interface Generation to Meet Hard Real-Time Constraints (SV, JvdS, DV), pp. 556–561.

STOC-1999-CaiNS #probability #theorem

Hardness and Hierarchy Theorems for Probabilistic Quasi-Polynomial Time (JyC, AN, DS), pp. 726–735.

STOC-1999-CrescenzoI

Security-Preserving Hardness-Amplification for Any Regular One-Way Function (GDC, RI), pp. 169–178.

STOC-1999-GuruswamiKRSY #algorithm #approximate #problem

Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.

ICALP-1999-Ajtai #generative #problem

Generating Hard Instances of the Short Basis Problem (MA), pp. 1–9.

ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.

UML-1999-KabousN #modelling #realtime #uml

Modeling Hard Real Time Systems with UML (LK, WN), pp. 339–355.

SAC-1999-Haynes #adaptation #combinator #distributed #optimisation #problem

Distributed Collective Adaptation Applied to Hard Combinatorial Optimization Problem (TH), pp. 339–343.

DATE-1998-DaveJ #architecture #concurrent #embedded #named #realtime #specification

CASPER: Concurrent Hardware-Software Co-Synthesis of Hard Real-Time Aperiodic and Periodic Specifications of Embedded System Architectures (BPD, NKJ), pp. 118–124.

STOC-1998-Ajtai #np-hard #problem #random #reduction

The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract) (MA), pp. 10–19.

STOC-1998-Arora #np-hard #problem

The Approximability of NP-hard Problems (SA), pp. 337–348.

ICALP-1998-HusfeldtR #problem

Hardness Results for Dynamic Problems by Extensions of Fredman and Saks’ Chronogram Method (TH, TR), pp. 67–78.

AdaEurope-1998-EspinosaJCTG #ada #component #programming #realtime

Programming Hard Real-Time Systems with Optional Components in Ada (AE, VJ, CC, AT, AGF), pp. 102–111.

AdaEurope-1998-HarbourRGG #ada #execution #implementation #realtime #using

Implementing and Using Execution Time Clocks in Ada Hard Real-Time Applications (MGH, MAR, JJGG, JCPG), pp. 90–101.

LCTES-1998-KollochF #case study #embedded #network #realtime #specification

Mapping an Embedded Hard Real-Time Systems SDL Specification to an Analyzable Task Network — A Case Study (TK, GF), pp. 156–165.

LCTES-1998-TerrasaEG #component #flexibility #realtime

Extending RT-Linux to Support Flexible Hard Real-Time Systems with Optional Components (AT, AE, AGF), pp. 41–50.

DAC-1997-KirovskiP #power management #realtime #synthesis

System-Level Synthesis of Low-Power Hard Real-Time Systems (DK, MP), pp. 697–702.

ICDAR-1997-EigenmannN #evaluation #multi #network

Modification of Hard-Limiting Multilayer Neural Networks for Confidence Evaluation (RE, JAN), pp. 1087–1091.

ICALP-1997-AndreevCR #trade-off #worst-case

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs (AEA, AEFC, JDPR), pp. 177–187.

AdaEurope-1997-PierceAWSCG #performance #realtime #requirements #verification

Capturing and Verifying Performance Requirements for Hard Real Time Systems (RHP, SA, RW, JS, HC, JG), pp. 137–148.

OOPSLA-1997-HarrisonLS #design #performance #realtime

The Design and Performance of a Hard Real-Time Object Event Service (THH, DLL, DCS), pp. 184–200.

CSL-1997-Grohe

Canonization for Lk-equivalence is Hard (MG), pp. 220–238.

STOC-1996-Ajtai #generative #problem

Generating Hard Instances of Lattice Problems (Extended Abstract) (MA), pp. 99–108.

STOC-1996-Fu #composition #proving

Modular Coloring Formulas Are Hard for Cutting Planes Proofs (XF), pp. 595–602.

STOC-1996-Hastad #clique #testing

Testing of the Long Code and Hardness for Clique (JH), pp. 11–19.

ICALP-1996-Lisovik #linear #set

Hard Sets Method and Semilinear Reservoir Method with Applications (LPL), pp. 219–231.

SAC-1996-GowerW #np-hard #problem

R-by-C Crozzle: an NP-hard problem (MG, RWW), pp. 73–76.

JICSLP-1996-BurgardCFKL #detection #logic programming #tool support

Logic Programming Tools Applied to Fire Detection in Hard-coal Mines (Poster Abstract) (WB, ABC, DF, AMK, SLK), p. 532.

STOC-1995-AroraKK #approximate #np-hard #polynomial #problem

Polynomial time approximation schemes for dense instances of NP-hard problems (SA, DRK, MK), pp. 284–293.

AdaEurope-1995-Bossard #ada #assessment #design #modelling #realtime

Periodic Processing in Hard Real-Time Systems: Assessment of Different Design Models in Ada (FB), pp. 355–364.

CIKM-1995-RaR #towards

Towards Supporting Hard Schema Changes in TSE (YGR, EAR), pp. 290–295.

ICSE-1995-GarlanAO #architecture #why

Architectural Mismatch or Why It’s Hard to Build Systems Out Of Existing Parts (DG, RA, JO), pp. 179–185.

LCT-RTS-1995-ChungD #realtime

Language Constructs and Transformation for Hard Real-time Systems (TMC, HGD), pp. 41–49.

LCT-RTS-1995-LeeLK #hybrid #scheduling

Scheduling of Hard Aperiodic Tasks in Hybrid Static/Dynamic Priority Systems (JL, SL, HK), pp. 7–19.

STOC-1994-BodlaenderFH #bound #problem

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

AdaEurope-1994-PitetteCGS #ada #named #realtime

Ex2: Intergrating Ada and Extra Support in a Doubly Portable Extended Executive Designed for Hard Real Time Systems (GMP, JYC, DG, JMS), pp. 406–420.

KR-1994-Konolige #algorithm #problem

Easy to be Hard: Difficult Problems for Greedy Algorithms (KK), pp. 374–378.

SAC-1994-RosenG #network #using

Training hard to learn networks using advanced simulated annealing methods (BER, JMG), pp. 256–260.

ICSE-1994-Vardanega #ada #development #embedded #experience #realtime

Experience with the Development of Hard Real-Time Embedded Ada Software (TV), pp. 301–308.

CC-1994-FranzleM #code generation #programming language #realtime #towards

Towards Provably Correct Code Generation for a Hard Real-Time Programming Language (MF, MMO), pp. 294–308.

STOC-1993-CondonFLS #algorithm #approximate

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions (AC, JF, CL, PWS), pp. 305–314.

STOC-1993-Kharitonov #encryption #learning

Cryptographic hardness of distribution-specific learning (MK), pp. 372–381.

STOC-1993-LundY #approximate #on the #problem

On the hardness of approximating minimization problems (CL, MY), pp. 286–293.

STOC-1993-Shamir #generative #multi #on the

On the generation of multivariate polynomials which are hard to factor (AS), pp. 796–804.

ICALP-1993-Kann #approximate #bound #problem

Polynomially Bounded Minimization Problems which are Hard to Approximate (VK), pp. 52–63.

HCI-ACS-1993-Harkins #communication #people

Ergonomic Considerations for Communication Technologies for Deaf and Hard of Hearing People (JEH), pp. 504–509.

AdaEurope-1993-BurnsWBF #case study #design #implementation #realtime

The Olympus Attitude and Orbital Control System: A Case Study in Hard Real-Time System Design and Implementation (AB, AJW, CMB, EF), pp. 19–35.

AdaEurope-1993-KettaniC #ada #realtime #standard #towards

Toward a Secondary Standard for Hard Real-Time Ada: The Real-Time Rapporteur Group (ISO/JTC1/SC22/WG9/RRG) JTC 1.22.35 (NK, VC), pp. 330–351.

ICML-1993-RagavanR #concept #learning #lookahead

Lookahead Feature Construction for Learning Hard Concepts (HR, LAR), pp. 252–259.

TOOLS-USA-1993-CaseauSK #object-oriented #optimisation #problem #programming

Extending Object-Oriented Programming to Address Hard Optimization Problems (YC, GS, PK), pp. 351–361.

DAC-1992-ChungR #architecture #named

TEMPT: Technology Mapping for the Exploration of FPGA Architectures with Hard-Wired Connections (KC, JR), pp. 361–367.

STOC-1992-FeigeL #matrix #on the #random

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) (UF, CL), pp. 643–654.

AdaEurope-1992-BurnsW #design #realtime

Designing Hard Real-Time Systems (AB, AJW), pp. 116–127.

AdaEurope-1992-PuenteZAF #ada #realtime #reuse

Reusable Executives for Hard Real-Time Systems in Ada (JAdlP, JZ, AA, JLF), pp. 104–115.

POPL-1992-NirkheP #imperative #partial evaluation #programming language #realtime

Partial Evaluation of High-Level Imperative Programming Languages, with Applications in Hard Real-Time Systems (VN, WP), pp. 269–280.

SEI-1991-Shafer #physics

Keynote Address: Soft Ware for Hard Physics (SS), pp. 1–2.

PLDI-1991-JaffarMY #constraints

A Methodology for Managing Hard Constraints in CLP Systems (JJ, SM, RHCY), pp. 306–316.

ICALP-1991-Fouks

General Resolution of Tseitin Formulas is Hard (JDF), pp. 151–162.

ICALP-1991-JiangR #automaton #nondeterminism #problem

Minimal NFA Problems Are Hard (TJ, BR), pp. 629–640.

ICALP-1991-RanjanCR

Improving Known Solutions is Hard (DR, SC, PR), pp. 381–392.

ESEC-1991-KopetzZFKPS #approach #design #realtime

An Engineering Approach to Hard Real-Time System Design (HK, RZ, GF, HK, PPP, WS), pp. 166–188.

SIGMOD-1990-Saraiya #logic programming #problem #source code

Hard Problems for Simple Logic Programs (YPS), pp. 64–73.

CLP-1990-Harel90 #how #question #source code

How Hard Is It to Reason about Propositional Programs? (DH), pp. 772–773.

SIGMOD-1989-HouOT #constraints #query #relational

Processing Aggregate Relational Queries with Hard Time Constraints (WCH, GÖ, BKT), pp. 68–77.

STOC-1989-BabaiNS #multi #protocol #pseudo #sequence

Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) (LB, NN, MS), pp. 1–11.

STOC-1989-GoldreichL

A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.

KR-1989-KautzS #logic #problem

Hard Problems for Simple Default Logics (HAK, BS), pp. 189–197.

STOC-1988-Broder #approximate #how #random

Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.

STOC-1988-VenkatesanL #graph #problem #random

Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.

CSL-1987-Schoning #complexity

Complexity Cores and Hard-To-Prove Formulas (US), pp. 273–280.

STOC-1986-Broder #approximate #how #random

How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.

STOC-1985-Heide #algorithm #performance #problem #strict

Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.

STOC-1981-KrishnamurthyM #calculus

Examples of Hard Tautologies in the Propositional Calculus (BK, RNM), pp. 28–37.

ICALP-1977-AhoS #code generation #compilation #how #question

How Hard is Compiler Code Generation? (AVA, RS), pp. 1–15.

POPL-1975-JonesM #source code

Even Simple Programs are Hard to Analyze (NDJ, SSM), pp. 106–118.

ICALP-1974-FlajoletS #on the #set

On Sets Having Only Hard Subsets (PF, JMS), pp. 446–457.