Stem constant$ (all stems)

147 papers:

DLT-2015-Yamakami #bound #complexity #quantum

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

ICALP-v1-2015-BunT #approximate

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

POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine

Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.

ICSE-v1-2015-OcteauLDJM #analysis #android #communication #component #constant

Composite Constant Propagation: Application to Android Inter-Component Communication Analysis (DO, DL, MD, SJ, PM), pp. 77–88.

CAV-2015-ChatterjeeIP #algorithm #constant #graph #performance #verification

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.

DATE-2014-AksoyFM #complexity #constant #design #multi #optimisation

Optimization of design complexity in time-multiplexed constant multiplications (LA, PFF, JCM), pp. 1–4.

STOC-2014-BermanHT #bias #constant

Coin flipping of any constant bias implies one-way functions (IB, IH, AT), pp. 398–407.

STOC-2014-Chechik #approximate #constant #distance #query

Approximate distance oracles with constant query time (SC), pp. 654–663.

STOC-2014-CoudronY #constant #infinity

Infinite randomness expansion with a constant number of devices (MC, HY), pp. 427–436.

STOC-2014-MakarychevMV #approximate #constant

Constant factor approximation for balanced cut in the PIE model (KM, YM, AV), pp. 41–49.

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

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

STOC-2014-Sherstov

Breaking the minsky-papert barrier for constant-depth circuits (AAS), pp. 223–232.

ICALP-v1-2014-IaconoO #why

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (JI, ÖÖ), pp. 637–649.

CHI-2014-MazmanianE #comprehension #constant

The product of availability: understanding the economic underpinnings of constant connectivity (MM, IE), pp. 763–772.

CHI-2014-WinklerSDR #constant #mobile #pervasive

Pervasive information through constant personal projection: the ambient mobile pervasive display (AMP-D) (CW, JS, DD, ER), pp. 4117–4126.

DATE-2013-PollexFSMMW #analysis #constant #realtime

Sufficient real-time analysis for an engine control unit with constant angular velocities (VP, TF, FS, UM, RM, GW), pp. 1335–1338.

STOC-2013-GuGK #maintenance #online #power of

The power of deferral: maintaining a constant-competitive steiner tree online (AG, AG, AK), pp. 525–534.

ICALP-v1-2013-DeDS #algorithm #analysis #difference #fourier #geometry #robust

A Robust Khintchine Inequality, and Algorithms for Computing Optimal Constants in Fourier Analysis and High-Dimensional Geometry (AD, ID, RAS), pp. 376–387.

ICALP-v1-2013-KucherovN #constant #realtime

Full-Fledged Real-Time Indexing for Constant Size Alphabets (GK, YN), pp. 650–660.

DATE-2012-KwongG #architecture #constant #geometry #performance

A high performance split-radix FFT with constant geometry architecture (JK, MG), pp. 1537–1542.

DATE-2012-LiuJL #constant #parallel

Parallel probing: Dynamic and constant time setup procedure in circuit switching NoC (SL, AJ, ZL), pp. 1289–1294.

PODS-2012-Tao #2d #constant

Indexability of 2D range search revisited: constant redundancy and weak indivisibility (YT), pp. 131–142.

STOC-2012-Belovs #source code

Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.

STOC-2012-Chuzhoy12a #constant #graph

Routing in undirected graphs with constant congestion (JC), pp. 855–874.

ICALP-v1-2012-ItoTY #algorithm

Constant-Time Algorithms for Sparsity Matroids (HI, SiT, YY), pp. 498–509.

LATA-2012-ArvindV #morphism #testing

Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (VA, YV), pp. 83–94.

STOC-2011-Goyal #constant #protocol #using

Constant round non-malleable protocols using one way functions (VG), pp. 695–704.

STOC-2011-LinP

Constant-round non-malleable commitments from any one-way function (HL, RP), pp. 705–714.

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

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

DLT-2011-BonizzoniJ #constant

Regular Splicing Languages Must Have a Constant (PB, NJ), pp. 82–92.

ICALP-v1-2011-DurocherHMNS #constant #linear

Range Majority in Constant Time and Linear Space (SD, MH, JIM, PKN, MS), pp. 244–255.

ICALP-v1-2011-JansenS #constant #polynomial

Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (MJJ, RS), pp. 724–735.

ASE-2010-KhatchadourianM #automation #java #refactoring

Enumeration refactoring: a tool for automatically converting Java constants to enumerated types (RK, BM), pp. 181–182.

ASE-2010-LawallL #approach #automation #debugging

An automated approach for finding variable-constant pairing bugs (JLL, DL), pp. 103–112.

DAC-2010-ThongN #algorithm #constant #multi #novel

A novel optimal single constant multiplication algorithm (JT, NN), pp. 613–616.

DATE-2010-MasrurCF

Constant-time admission control for Deadline Monotonic tasks (AM, SC, GF), pp. 220–225.

PASTE-2010-MizushimaMY #constant #parsing

Packrat parsers can handle practical grammars in mostly constant space (KM, AM, YY), pp. 29–36.

ICML-2010-BartlettPW #constant #memory management #process

Forgetting Counts: Constant Memory Inference for a Dependent Hierarchical Pitman-Yor Process (NB, DP, FW), pp. 63–70.

ICPR-2010-Alsam #constant #image

Colour Constant Image Sharpening (AA), pp. 4545–4548.

ICPR-2010-MicoO #algorithm #constant #nearest neighbour #performance

A Constant Average Time Algorithm to Allow Insertions in the LAESA Fast Nearest Neighbour Search Index (LM, JO), pp. 3911–3914.

SAC-2010-ReisS #constant #programming language

General constant expressions for system programming languages (GDR, BS), pp. 2131–2136.

FSE-2010-WangZXMS #constant #string #web

Locating need-to-translate constant strings in web applications (XW, LZ, TX, HM, JS), pp. 87–96.

DATE-2009-IqbalH #performance

Efficient constant-time entropy decoding for H.264 (NI, JH), pp. 1440–1445.

ICDAR-2009-KonyaSEG #adaptation

Constant-Time Locally Optimal Adaptive Binarization (IVK, CS, SE, SG), pp. 738–742.

STOC-2009-GuptaK #approximate #probability

A constant-factor approximation for stochastic Steiner forest (AG, AK), pp. 659–668.

STOC-2009-YoshidaYI #algorithm #approximate

An improved constant-time approximation algorithm for maximum~matchings (YY, MY, HI), pp. 225–234.

ICALP-v1-2009-Jansen #constant #scheduling #using

An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables (KJ), pp. 562–573.

KDD-2009-TantipathananandhB #algorithm #approximate #community #identification

Constant-factor approximation algorithms for identifying dynamic communities (CT, TYBW), pp. 827–836.

ESEC-FSE-2009-VarmaSS #memory management

Backward-compatible constant-time exception-protected memory (PV, RKS, HJS), pp. 71–80.

ICSE-2009-WangZXMS #constant #string

Locating need-to-translate constant strings for software internationalization (XW, LZ, TX, HM, JS), pp. 353–363.

DATE-2008-LaiHK #identification #multi #verification

Improving Constant-Coefficient Multiplier Verification by Partial Product Identification (CYL, CYH, KYK), pp. 813–818.

STOC-2008-IshaiKOS #constant #encryption

Cryptography with constant computational overhead (YI, EK, RO, AS), pp. 433–442.

STOC-2008-Rossman #clique #complexity #on the

On the constant-depth complexity of k-clique (BR), pp. 721–730.

ICALP-A-2008-BaswanaGSU #constant #distance #fault #graph #polynomial

Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error (SB, AG, SS, JU), pp. 609–621.

ICALP-C-2008-OstrovskyPV #concurrent

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (RO, GP, IV), pp. 548–559.

DATE-2007-JangKL #fault #profiling #reduction #self

Error rate reduction in DNA self-assembly by non-constant monomer concentrations and profiling (BJ, YBK, FL), pp. 847–852.

STOC-2007-GoldwasserGHKR #constant #verification

Verifying and decoding in constant depth (SG, DG, AH, TK, GNR), pp. 440–449.

STOC-2007-PaghPR #constant #independence #linear

Linear probing with constant independence (AP, RP, MR), pp. 318–327.

ICALP-2007-DedicM #database #query

Constant-Round Private Database Queries (ND, PM), pp. 255–266.

ICALP-2007-KontogiannisS #algorithm #approximate #constant #game studies #performance

Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games (SCK, PGS), pp. 595–606.

RecSys-2007-NathansonBG #adaptation #clustering #recommendation #using

Eigentaste 5.0: constant-time adaptability in a recommender system using item clustering (TN, EB, KYG), pp. 149–152.

CSL-2007-BaganDG #constant #on the #query

On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.

STOC-2006-ChekuriKS #constant #graph

Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.

STOC-2006-MoshkovitzR #fault

Sub-constant error low degree test of almost-linear size (DM, RR), pp. 21–30.

STOC-2006-Rao #constant #independence

Extractors for a constant number of polynomially small min-entropy independent sources (AR), pp. 497–506.

ICGT-2006-DoddsP #constant #graph transformation

Graph Transformation in Constant Time (MD, DP), pp. 367–382.

ICPR-v1-2006-CaoXF #constant #self #using

Self-Calibration Using Constant Camera Motion (XC, JX, HF), pp. 595–598.

LICS-2006-MacielP #bound #composition #proving

Conditional Lower Bound for a System of Constant-Depth Proofs with Modular Connectives (AM, TP), pp. 189–200.

SAT-2006-DantsinW #constant #performance #satisfiability

MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in O(s2) Time (ED, AW), pp. 266–276.

DATE-2005-TiriV #constant #design #difference #logic #power management

Design Method for Constant Power Consumption of Differential Logic Circuits (KT, IV), pp. 628–633.

VLDB-2005-ChengSP #database #named

U-DBMS: A Database System for Managing Constantly-Evolving Data (RC, SS, SP), pp. 1271–1274.

CIAA-2005-CanoG #automaton #bound #constant #finite

Finite Automata and Unions of Regular Patterns with Bounded Constant Segments (AC, PG), pp. 104–115.

ICALP-2005-AlstrupGRTZ #constant

Union-Find with Constant Time Deletions (SA, ILG, TR, MT, UZ), pp. 78–89.

ICALP-2005-DietzfelbingerW #constant

Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins (MD, CW), pp. 166–178.

ICALP-2005-GentryR #communication #constant #information retrieval

Single-Database Private Information Retrieval with Constant Communication Rate (CG, ZR), pp. 803–815.

ICALP-2005-PersianoV #concurrent #constant

Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds (GP, IV), pp. 228–240.

RTA-2005-Yoshinaka #higher-order #linear #λ-calculus

Higher-Order Matching in the Linear λ Calculus in the Absence of Constants Is NP-Complete (RY), pp. 235–249.

DAC-2004-TummeltshammerHP #constant #multi

Multiple constant multiplication by time-multiplexed mapping of addition chains (PT, JCH, MP), pp. 826–829.

CHI-2004-GonzalezM #constant #multi #quote

“Constant, constant, multi-tasking craziness”: managing multiple working spheres (VMG, GM), pp. 113–120.

PODS-2003-Lechtenborger #approach #constant #towards

The impact of the constant complement approach towards view updating (JL), pp. 49–55.

STOC-2003-AmirKR #approximate #constant #graph

Constant factor approximation of vertex-cuts in planar graphs (EA, RK, SR), pp. 90–99.

STOC-2003-KowalikK #constant #graph #query

Short path queries in planar graphs in constant time (LK, MK), pp. 143–148.

STOC-2003-LuRVW #constant #named

Extractors: optimal up to constant factors (CJL, OR, SPV, AW), pp. 602–611.

STOC-2003-OstlinP #constant #linear

Uniform hashing in constant time and linear space (AÖ, RP), pp. 622–628.

STOC-2003-Thorup #constant #integer #problem

Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.

DATE-2002-SulimmaKNV #constant

Improving Placement under the Constant Delay Model (KS, WK, IN, LPPPvG), pp. 677–682.

SAS-2002-Muller-OlmS #decidability #polynomial

Polynomial Constants Are Decidable (MMO, HS), pp. 4–19.

STOC-2002-CapalboRVW

Randomness conductors and constant-degree lossless expanders (MRC, OR, SPV, AW), pp. 659–668.

STOC-2002-CryanD #algorithm #approximate #constant #polynomial

A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant (MC, MED), pp. 240–249.

ICALP-2002-IshaiK

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.

KDD-2002-HultenD #constant #database #mining #modelling #scalability

Mining complex models from arbitrarily large databases in constant time (GH, PMD), pp. 525–531.

ESOP-2001-Muller-OlmR #complexity #constant #on the

On the Complexity of Constant Propagation (MMO, OR), pp. 190–205.

STOC-2001-GuhaMM #approximate #constant #problem

A constant factor approximation for the single sink edge installation problems (SG, AM, KM), pp. 383–388.

CC-2001-Siebert #garbage collection

Constant-Time Root Scanning for Deterministic Garbage Collection (FS), pp. 304–318.

IJCAR-2001-CerritoM #logic #quantifier

Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation (SC, MCM), pp. 137–151.

IJCAR-2001-LutzSWZ #constant #logic

Tableaux for Temporal Description Logic with Constant Domains (CL, HS, FW, MZ), pp. 121–136.

DAC-2000-GaurdianiSMSC #bound #component #constant #simulation #statistics

An asymptotically constant, linearly bounded methodology for the statistical simulation of analog circuits including component mismatch effects (CG, SS, PM, PS, DC), pp. 15–18.

STOC-2000-GuptaT #algorithm #approximate #classification #constant #problem

A constant factor approximation algorithm for a class of classification problems (AG, ÉT), pp. 652–658.

SAC-2000-LenartSG #analysis #constant

SSA-based Flow-sensitive Type Analysis: Combining Constant and Type Propagation (AL, CS, SKSG), pp. 813–817.

CC-2000-KnoopR #constant #graph

Constant Propagation on the Value Graph: Simple Constants and Beyond (JK, OR), pp. 94–109.

STOC-1999-CharikarGTS #algorithm #approximate #problem

A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract) (MC, SG, ÉT, DBS), pp. 1–10.

STOC-1999-Plandowski #equation #satisfiability #word

Satisfiability of Word Equations with Constants is in NEXPTIME (WP), pp. 721–725.

SAS-1998-SarkarK #array #constant

Enabling Sparse Constant Propagation of Array Elements via Array SSA Form (VS, KK), pp. 33–56.

ICPR-1998-MokhtariB #constant #multi #using

Multiscale compression of planar curves using constant curvature segments (MM, RB), pp. 744–746.

HPDC-1998-FryNS #approach #constant #distributed

Computing Twin Primes and Brun’s Constant: A Distributed Approach (PHF, JN, BKS), pp. 42–49.

STOC-1997-AharonovB #constant #fault tolerance #quantum

Fault-Tolerant Quantum Computation With Constant Error (DA, MBO), pp. 176–188.

STOC-1997-RazS

A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (RR, SS), pp. 475–484.

STOC-1997-Reif #approximate #constant #evaluation #polynomial

Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.

STOC-1997-SrinivasanT #algorithm #approximate

A Constant-Factor Approximation Algorithm for Packet Routing, and Balancing Local vs. Global Criteria (AS, CPT), pp. 636–643.

DLT-1997-KarhumakiPM #bound #constant

A lower bound for a constant in Shallit’s conjecture (JK, WP, FM), pp. 103–118.

ICALP-1997-Bournez #bound #constant #power of

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract) (OB), pp. 143–153.

ICML-1997-Decatur #classification #induction #learning

PAC Learning with Constant-Partition Classification Noise and Applications to Decision Tree Induction (SED), pp. 83–91.

SIGIR-1997-SilversteinP #clustering #corpus #set

Almost-Constant-Time Clustering of Arbitrary Corpus Subsets (CS, JOP), pp. 60–66.

WCRE-1996-GravleyL #identification

Identifying Enumeration Types Modeled with Symbolic Constants (JMG, AL), p. 227–?.

STOC-1996-BlumRV #algorithm #approximate #problem

A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract) (AB, RR, SV), pp. 442–448.

ICPR-1996-HeydenA #constant #parametricity #re-engineering

Euclidean reconstruction from constant intrinsic parameters (AH, KÅ), pp. 339–343.

CC-1996-VerbruggeCH #c #case study #constant

Generalized Constant Propagation: A Study in C (CV, PC, LJH), pp. 74–90.

CSL-1996-Yashin #logic #problem

New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem (ADY), pp. 460–471.

PLDI-1995-CariniH #constant #interprocedural

Flow-Sensitive Interprocedural Constant Propagation (PRC, MH), pp. 23–31.

STOC-1995-BlumCV #approximate #problem

A constant-factor approximation for the k-MST problem in the plane (AB, PC, SV), pp. 294–302.

DAC-1994-PotkonjakSC #constant #multi #performance #using

Efficient Substitution of Multiple Constant Multiplications by Shifts and Additions Using Iterative Pairwise Matching (MP, MBS, AC), pp. 189–194.

CSCW-1994-RouncefieldHRV #constant

Working with “Constant Interruption”: CSCW and the Small Office (MR, JAH, TR, SV), pp. 275–286.

SAC-1994-StoltzWG #constant

Constant propagation: a fresh, demand-driven look (ES, MW, MPG), pp. 400–404.

CC-1994-Binkley #constant #data flow #dependence #graph #interprocedural #using

Interprocedural Constant Propagation using Dependence Graphs and a Data-Flow Model (DB), pp. 374–388.

CADE-1994-JohannK #constant #order #unification #λ-calculus

Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading (PJ, MK), pp. 620–634.

CSM-1993-MerloGHM #constant #multi #re-engineering #user interface

Multi-Valued Constant Propagation for the Reengineering of User Interfaces (EM, JFG, LJH, RdM), pp. 120–129.

PLDI-1993-GroveT #case study #constant #implementation #interprocedural

Interprocedural Constant Propagation: A Study of Jump Function Implementations (DG, LT), pp. 90–99.

STOC-1993-Jones #constant #matter

Constant time factors do matter (NDJ), pp. 602–611.

SIGIR-1993-CuttingKP #constant #documentation #scalability

Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections (DRC, DRK, JOP), pp. 126–134.

STOC-1992-Galil #algorithm #parallel #string

A Constant-Time Optimal Parallel String-Matching Algorithm (ZG), pp. 69–76.

STOC-1992-MayerOOY #self #symmetry

Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract) (AJM, YO, RO, MY), pp. 667–678.

LICS-1992-Clote #constant #proving

Cutting Planes and constant depth Frege proofs (PC), pp. 296–307.

STOC-1991-Hagerup #integer #parallel #sorting

Constant-Time Parallel Integer Sorting (Extended Abstract) (TH), pp. 299–306.

STOC-1991-MatiasV #parallel #probability

Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) (YM, UV), pp. 307–316.

PPoPP-1991-KrothapalliS #constant #dependence

Removal of Redundant Dependences in DOACROSS Lops with Constant Dependences (VPK, PS), pp. 51–60.

STOC-1990-BellareMO #constant

Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.

STOC-1990-GilHW #constant

Not All Keys Can Be Hashed in Constant Time (Preliminary Version) (JYG, FMadH, AW), pp. 244–253.

PODS-1989-Wang #maintenance #question

Can Constant-time Maintainability Be More Practical? (KW), pp. 120–127.

SIGMOD-1988-HernandezC #database

A Characterization of Constant-time-mainteinability for BCNF Database Schemes (HJH, EPFC), pp. 209–217.

STOC-1988-Ben-OrC #algebra #constant #using

Computing Algebraic Formulas Using a Constant Number of Registers (MBO, RC), pp. 254–257.

PODS-1987-ChanH #bound #database #dependence #design #functional #on the

On Designing Database Schemes Bounded or Constant-time-maintainable with respect to Functional Dependencies (EPFC, HJH), pp. 48–57.

PODS-1986-GrahamW #constant #maintenance

Constant Time Maintenance or The Triumph of the fd (MHG, KW), pp. 202–216.

Best-of-PLDI-1986-CallahanCKT #constant #interprocedural

Interprocedural constant propagation (with retrospective) (DC, KDC, KK, LT), pp. 155–166.

POPL-1985-WegmanZ #branch #constant

Constant Propagation with Conditional Branches (MNW, FKZ), pp. 291–299.

STOC-1984-AjtaiB #constant #probability #theorem

A Theorem on Probabilistic Constant Depth Computations (MA, MBO), pp. 471–474.

ICALP-1983-ChandraFL #bound #constant #problem

Lower Bounds for Constant Depth Circuits for Prefix Problems (AKC, SF, RJL), pp. 109–117.

LFP-1982-White #bound #constant

Constant Time Interpretation for Shallow-bound Variables in the Presence of Mixed SPECIAL/LOCAL Declarations (JLW), pp. 196–200.