BibSLEIGH — integer tag

integer

integer

Tag #integer

197 papers:

PADL-2020-ErikssonP #diagrams #domain-specific language #reasoning: A DSL for Integer Range Reasoning: Partition, Interval and Mapping Diagrams (JE, MP), pp. 196–212.
ASPLOS-2020-HildebrandKTLA #automation #linear #memory management #named #programming #using: AutoTM: Automatic Tensor Movement in Heterogeneous Memory Systems using Integer Linear Programming (MH, JK, ST, JLP, VA), pp. 875–890.
CIKM-2019-MalliaSSZ: GPU-Accelerated Decoding of Integer Lists (AM, MS, TS, MZ), pp. 2193–2196.
ICML-2019-NockW: Lossless or Quantized Boosting with Integer Arithmetic (RN, RCW), pp. 4829–4838.
CAV-2019-FrohnG #decidability #termination: Termination of Triangular Integer Loops is Decidable (FF, JG), pp. 426–444.
TAP-2019-KapusNC #constraints #execution #question #symbolic computation: Constraints in Dynamic Symbolic Execution: Bitvectors or Integers? (TK, MN, CC), pp. 41–54.
DLT-2018-KoNP #nondeterminism #polynomial #problem #reachability: Reachability Problems in Nondeterministic Polynomial Maps on the Integers (SKK, RN, IP), pp. 465–477.
ICML-2018-KuhnleSCT #performance: Fast Maximization of Non-Submodular, Monotonic Functions on the Integer Lattice (AK, JDS, VGC, MTT), pp. 2791–2800.
ICML-2018-SheldonWS #automation #difference #learning #modelling: Learning in Integer Latent Variable Models with Nested Automatic Differentiation (DS, KW, DS), pp. 4622–4630.
ICPR-2018-ZhaoSJ #linear #locality #programming #using: Temporal Pattern Localization using Mixed Integer Linear Programming (RZ, GS, QJ), pp. 1361–1365.
PLDI-2018-AcharyaB0 #linear #programming: Polyhedral auto-transformation with no integer linear programming (AA, UB, AC0), pp. 529–542.
ICSE-2018-LinJGM #multi #named #programming #testing: Nemo: multi-criteria test-suite minimization with integer nonlinear programming (JWL, RJ, JG, SM), pp. 1039–1049.
ICSE-2018-XueL #feature model #multi #optimisation #problem #programming: Multi-objective integer programming approaches for solving optimal feature selection problem: a new perspective on multi-objective optimization problems in SBSE (YX, YFL), pp. 1231–1242.
CASE-2018-VijayaraghavanK #evaluation #linear #programming #recursion #reduction #reliability: A Mixed Integer Programming Based Recursive Variance Reduction Method for Reliability Evaluation of Linear Sensor Systems (VV, KK, YD, HP), pp. 836–842.
CASE-2018-ZhangLFL #linear #programming #sequence #using: Shortest Legal Firing Sequence of Net Condition/Event Systems Using Integer Linear Programming (JZ, HL, GF, ZL), pp. 1556–1561.
ICML-2017-WinnerSS #modelling: Exact Inference for Integer Latent-Variable Models (KW, DS, DS), pp. 3761–3770.
KDD-2017-FuLTA #programming #recommendation: Unsupervised P2P Rental Recommendations via Integer Programming (YF, GL, MT, CCA), pp. 165–173.
ASE-2017-ChengZS0S #automation #fault #named #type inference: IntPTI: automatic integer error repair with proper-type inference (XC, MZ0, XS, MG0, JS), pp. 996–1001.
CADE-2017-BrockschmidtJT0 #proving #safety #termination: Certifying Safety and Termination Proofs for Integer Transition Systems (MB, SJCJ, RT, AY0), pp. 454–471.
CADE-2017-HorbachVW #linear #on the: On the Combination of the Bernays-Schönfinkel-Ramsey Fragment with Simple Linear Integer Arithmetic (MH, MV, CW), pp. 77–94.
CAV-2017-BeameL #towards #verification: Towards Verifying Nonlinear Integer Arithmetic (PB, VL), pp. 238–258.
VMCAI-2017-Jovanovic: Solving Nonlinear Integer Arithmetic with MCSAT (DJ), pp. 330–346.
ICPR-2016-NieGJ #feature model #framework #programming: An information theoretic feature selection framework based on integer programming (SN, TG, QJ), pp. 3584–3589.
ASE-2016-Mougouei #dependence #graph #programming #requirements #using: Factoring requirement dependencies in software requirement selection using graphs and integer programming (DM), pp. 884–887.
FSE-2016-Cheng #analysis #fault #named: RABIEF: range analysis based integer error fixing (XC), pp. 1094–1096.
ICSE-2016-SunZZZ #equivalence #multi #named: IntEQ: recognizing benign integer overflows via equivalence checking across multiple precisions (HS, XZ0, YZ, QZ), pp. 1051–1062.
IJCAR-2016-FrohnNHBG #bound #runtime #source code: Lower Runtime Bounds for Integer Programs (FF, MN, JH, MB, JG), pp. 550–567.
ICALP-v1-2015-BodirskyMM #constraints #problem: Constraint Satisfaction Problems over the Integers with Successor (MB, BM, AM), pp. 256–267.
SEKE-2015-SunSWZ #analysis #data flow #detection #fault #using: Improving the Accuracy of Integer Signedness Error Detection Using Data Flow Analysis (HS, CS, YW, QZ), pp. 601–606.
SAS-2015-GargR #linear #programming: Synthesizing Heap Manipulations via Integer Linear Programming (AG, SR), pp. 109–127.
ASPLOS-2015-Sidiroglou-Douskos #automation #branch #using: Targeted Automatic Integer Overflow Discovery Using Goal-Directed Conditional Branch Enforcement (SSD, EL, NR, PP, FL, DK, MCR), pp. 473–486.
CASE-2015-KamraA #multi #programming: A mixed integer programming model for timed deliveries in multirobot systems (NK, NA), pp. 612–617.
CASE-2015-KouiderHOO #approach #graph #linear #scheduling #source code: Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling (AK, HAH, SO, AO), pp. 1177–1181.
CASE-2015-LyuWC #algorithm #heuristic #programming: Mixed integer programming model and heuristic algorithm for production planning of continuous casting and hot rolling (ML, ZW, FTSC), pp. 1503–1508.
CASE-2015-ProdelAXJL #database #linear #mining #process #programming #using: Discovery of patient pathways from a national hospital database using process mining and integer linear programming (MP, VA, XX, BJ, LL), pp. 1409–1414.
DAC-2015-TziantzioulisGF #correlation #fault #float #named: b-HiVE: a bit-level history-based error model with value correlation for voltage-scaled integer and floating point units (GT, AMG, SMF, NH, SOM, SP), p. 6.
DAC-2015-ZolotovF #linear #programming: Variation aware cross-talk aggressor alignment by mixed integer linear programming (VZ, PF), p. 6.
STOC-2015-ChanL #clustering #combinator: Clustered Integer 3SUM via Additive Combinatorics (TMC, ML), pp. 31–40.
CADE-2015-Bromberger0W #linear #revisited: Linear Integer Arithmetic Revisited (MB, TS, CW), pp. 623–637.
CADE-2015-Passmore #algebra #decidability: Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers (GOP), pp. 181–196.
FLOPS-2014-HoffmannS #analysis #array #type system: Type-Based Amortized Resource Analysis with Integers and Arrays (JH, ZS), pp. 152–168.
POPL-2014-LongSKR #fault #generative: Sound input filter generation for integer overflow errors (FL, SSD, DK, MCR), pp. 439–452.
CASE-2014-XuLYM #probability #programming: A mixed integer programming model for Bed planning considering stochastic length of stay (LX, NL, XY, FM), pp. 1069–1074.
TACAS-2014-BrockschmidtEFFG #analysis #complexity #runtime #source code: Alternating Runtime and Size Complexity Analysis of Integer Programs (MB, FE, SF, CF, JG), pp. 140–155.
SMT-2014-KingBT #linear #programming #smt: Leveraging Linear and Mixed Integer Programming for SMT (TK, CB, CT), p. 65.
VMCAI-2014-BozgaIK #problem #safety #source code: Safety Problems Are NP-complete for Flat Integer Programs with Octagonal Loops (MB, RI, FK), pp. 242–261.
VMCAI-2014-Romano #float #testing: Practical Floating-Point Tests with Integer Code (AR), pp. 337–356.
VLDB-2013-KolaitisPT #consistency #database #performance #programming #query: Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.
POPL-2013-Ben-AmramG #constraints #linear #on the #problem #ranking: On the linear ranking problem for integer linear-constraint loops (AMBA, SG), pp. 51–62.
QAPL-2013-ArulR #complexity #game studies: The Complexity of Robot Games on the Integer Line (AA, JR), pp. 132–148.
ICSE-2013-CokerH #c #program transformation: Program transformations to fix C integers (ZC, MH), pp. 792–801.
CASE-2013-LiF #approach #linear #multi #problem #programming #scheduling: A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping (XL, RYKF), pp. 274–279.
CGO-2013-RodriguesCP #performance #source code: A fast and low-overhead technique to secure programs against integer overflows (RER, VHSC, FMQP), p. 11.
TACAS-2013-GantyIK #approximate #source code #summary: Underapproximation of Procedure Summaries for Integer Programs (PG, RI, FK), pp. 245–259.
TACAS-2013-JovanovicLR #automaton #parametricity #synthesis: Integer Parameter Synthesis for Timed Automata (AJ, DL, OHR), pp. 401–415.
ICALP-v1-2012-GuptaN #approximate #online #source code: Approximating Sparse Covering Integer Programs Online (AG, VN), pp. 436–448.
FLOPS-2012-MartinFS #eclipse #set: Extending the TOY System with the ECLiPSe Solver over Sets of Integers (SEM, JCF, FSP), pp. 120–135.
CIKM-2012-ZhangWH #linear #programming #set: Selecting expansion terms as a set via integer linear programming (QZ, YW, XH), pp. 2399–2402.
ICPR-2012-GuiLY #novel #performance: A novel integer transform for efficient reversible watermarking (XG, XL, BY), pp. 947–950.
KR-2012-LiuJN #programming #set: Answer Set Programming via Mixed Integer Programming (GL, TJ, IN).
SAS-2012-AbdullaACLR #abstraction #automation #source code: Automatic Fence Insertion in Integer Programs via Predicate Abstraction (PAA, MFA, YFC, CL, AR), pp. 164–180.
ICSE-2012-DietzLRA #c #c++ #comprehension: Understanding integer overflow in C/C++ (WD, PL, JR, VSA), pp. 760–770.
SAC-2012-OSullivanWL #design #using: Designing data storage tier using Integer Programing (MJO, CGW, DL), pp. 426–433.
DAC-2012-ShojaeiDR #programming: Confidentiality preserving integer programming for global routing (HS, AD, PR), pp. 709–716.
OSDI-2012-WangCJZK #security: Improving Integer Security for Systems with KINT (XW, HC, ZJ, NZ, MFK), pp. 163–177.
IJCAR-2012-BobotCCIMMM #linear: A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic (FB, SC, EC, MI, AM, AM, GM), pp. 67–81.
VMCAI-2012-Ben-AmramGM #on the #termination: On the Termination of Integer Loops (AMBA, SG, ANM), pp. 72–87.
ICALP-v1-2011-CliffordJ #bound #multi #online: Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model (RC, MJ), pp. 593–604.
LATA-2011-RigoV #complexity #set: Syntactic Complexity of Ultimately Periodic Sets of Integers (MR, ÉV), pp. 477–488.
ICEIS-v2-2011-Moghadampour11a #adaptation #algorithm #search-based #self: Self-adaptive Integer and Decimal Mutation Operators for Genetic Algorithms (GM), pp. 184–191.
SAS-2011-VerdoolaegeCB #approximate #transitive #tuple: Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations (SV, AC, AB), pp. 216–232.
CASE-2011-AnghinolfiPSS #optimisation #programming: Integer programming and ant colony optimization for planning intermodal freight transportation operations (DA, MP, SS, SS), pp. 214–219.
TACAS-2011-GriggioLS #generative #linear #performance #satisfiability: Efficient Interpolant Generation in Satisfiability Modulo Linear Integer Arithmetic (AG, TTHL, RS), pp. 143–157.
CADE-2011-JovanovicM #linear: Cutting to the Chase Solving Linear Integer Arithmetic (DJ, LMdM), pp. 338–353.
ICLP-J-2011-CodishGBFG #analysis #constraints #satisfiability #termination #using: SAT-based termination analysis using monotonicity constraints over the integers (MC, IG, AMBA, CF, JG), pp. 503–520.
ICLP-J-2011-VoetsS #analysis #logic programming #source code: Non-termination analysis of logic programs with integer arithmetics (DV, DDS), pp. 521–536.
RTA-2010-NeurauterM #polynomial: Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers (FN, AM), pp. 243–258.
SEFM-2010-BersaniCFPR #constraints #ltl #runtime #smt #specification #verification: SMT-based Verification of LTL Specification with Integer Constraints and its Application to Runtime Checking of Service Substitutability (MMB, LC, AF, MP, MR), pp. 244–254.
CIKM-2010-SilvestriV #encoding #named #performance #programming: VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming (FS, RV), pp. 1219–1228.
ICPR-2010-Yanagisawa #programming: An Offline Map Matching via Integer Programming (HY), pp. 4206–4209.
PLDI-2010-Loitsch #float: Printing floating-point numbers quickly and accurately with integers (FL), pp. 233–243.
RE-2010-SalinesiMDD #constraints #requirements #reuse #theorem proving #using: Using Integer Constraint Solving in Reuse Based Requirements Engineering (CS, RM, DD, OD), pp. 243–251.
DAC-2010-WuDL #approach #parallel #programming: A parallel integer programming approach to global routing (THW, AD, JTL), pp. 194–199.
IJCAR-2010-BensaidCP #graph: Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.
ICDAR-2009-BodicLAHLK #detection #graph #linear #programming #using: Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming (PLB, HL, SA, PH, YL, AK), pp. 1320–1324.
LATA-2009-Bollig #bound #complexity #multi: Larger Lower Bounds on the OBDD Complexity of Integer Multiplication (BB), pp. 212–223.
LATA-2009-SumanP #automaton: Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions (PVS, PKP), pp. 728–739.
RTA-2009-FuhsGPSF #proving #term rewriting #termination: Proving Termination of Integer Term Rewriting (CF, JG, MP, PSK, SF), pp. 32–47.
SEFM-2009-BresolinGMS #constraints #logic: Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths (DB, VG, AM, GS), pp. 240–249.
DAC-2009-WuDL #3d #named #programming #scalability #using: GRIP: scalable 3D global routing using integer programming (THW, AD, JTL), pp. 320–325.
TACAS-2009-NicoliniRR #satisfiability: Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (EN, CR, MR), pp. 428–442.
CADE-2009-BensaidCP #named #proving #theorem proving: Dei: A Theorem Prover for Terms with Integer Exponents (HB, RC, NP), pp. 146–150.
CAV-2009-BozgaHIKV #array #automation #source code #verification: Automatic Verification of Integer Array Programs (MB, PH, RI, FK, TV), pp. 157–172.
CAV-2009-DilligDA #linear #proving: Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers (ID, TD, AA), pp. 233–247.
CAV-2009-KitchenK #constraints #markov #monte carlo: A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints (NK, AK), pp. 446–461.
ICLP-2009-Li #algorithm #constraints #difference #functional #research #summary: Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.
ISSTA-2009-ZhangHGXM #linear #programming #testing #using: Time-aware test-case prioritization using integer linear programming (LZ, SSH, CG, TX, HM), pp. 213–224.
ICALP-A-2008-AzarG #framework #source code #unification: Truthful Unification Framework for Packing Integer Programs with Choices (YA, IG), pp. 833–844.
ICALP-C-2008-AltmannJR #black box #on the: On Black-Box Ring Extraction and Integer Factorization (KA, TJ, AR), pp. 437–448.
FLOPS-2008-Julien #induction #using: Certified Exact Real Arithmetic Using Co-induction in Arbitrary Integer Base (NJ), pp. 48–63.
DATE-2008-Parandeh-AfsharBI #linear #programming #synthesis: Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming (HPA, PB, PI), pp. 1256–1261.
FoSSaCS-2008-HabermehlIV #array #decidability #question #what: What Else Is Decidable about Integer Arrays? (PH, RI, TV), pp. 474–489.
STOC-2008-DeKSS #composition #multi #performance #using: Fast integer multiplication using modular arithmetic (AD, PPK, CS, RS), pp. 499–506.
CSL-2008-Eisinger #automaton #bound #linear: Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (JE), pp. 431–445.
VMCAI-2008-BagnaraHZ #algorithm #constraints: An Improved Tight Closure Algorithm for Integer Octagonal Constraints (RB, PMH, EZ), pp. 8–21.
ICDAR-2007-GaoWHD #documentation #image #linear #programming #using: Decompose Document Image Using Integer Linear Programming (DG, YW, HH, MD), pp. 397–401.
SAS-2007-SimonK: Taming the Wrapping of Integer Arithmetic (AS, AK), pp. 121–136.
SAC-2007-FeydyS #equation #linear: Propagating dense systems of integer linear equations (TF, PJS), pp. 306–310.
CASE-2007-ZuHT #coordination #generative #linear #programming #using: Trajectory Generation in Relative Velocity Coordinates Using Mixed Integer Linear Programming with IHDR Guidance (DZ, JH, DT), pp. 1125–1130.
CC-2007-NagarakatteG #linear #pipes and filters #programming #scheduling #using: Register Allocation and Optimal Spill Code Scheduling in Software Pipelined Loops Using 0-1 Integer Linear Programming Formulation (SGN, RG), pp. 126–140.
DAC-2007-FangHC #algorithm #design #linear #programming: An Integer Linear Programming Based Routing Algorithm for Flip-Chip Design (JWF, CHH, YWC), pp. 606–611.
STOC-2007-Furer #multi #performance: Faster integer multiplication (MF), pp. 57–66.
STOC-2007-GuruswamiR: A 3-query PCP over integers (VG, PR), pp. 198–206.
SMT-J-2006-KimJS #difference #finite #logic: Disequality Management in Integer Difference Logic via Finite Instantiations (HK, HJ, FS), pp. 47–66.
CAV-2007-BeckerDEK #constraints #linear #named: LIRA: Handling Constraints of Linear Arithmetics over the Integers and the Reals (BB, CD, JE, FK), pp. 307–310.
CIAA-2006-Luttenberger #analysis #reachability #source code: Reachability Analysis of Procedural Programs with Affine Integer Arithmetic (ML), pp. 281–282.
CIKM-2006-Gkoulalas-DivanisV #approach #programming: An integer programming approach for frequent itemset hiding (AGD, VSV), pp. 748–757.
DAC-2006-AksoyCFM #constraints #linear #optimisation #programming #satisfiability #synthesis #using: Optimization of area under a delay constraint in digital filter synthesis using SAT-based integer linear programming (LA, EACdC, PFF, JM), pp. 669–674.
CAV-2006-Braverman #linear #source code #termination: Termination of Integer Linear Programs (MB), pp. 372–385.
SAT-2006-MorgadoMMM #modelling: Counting Models in Integer Domains (AM, PJM, VMM, JPMS), pp. 410–423.
ICALP-2005-Wikstrom #on the: On the l-Ary GCD-Algorithm in Rings of Integers (DW), pp. 1189–1201.
ICML-2005-RothY #linear #programming #random: Integer linear programming inference for conditional random fields (DR, WtY), pp. 736–743.
CC-2005-VerdoolaegeBBC #case study #experience #parametricity: Experiences with Enumeration of Integer Projections of Parametric Polytopes (SV, KB, MB, FC), pp. 91–105.
SAT-2005-SheiniS #linear #logic #satisfiability #scalability: A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic (HMS, KAS), pp. 241–256.
IFM-2004-BeckertS #data type #refinement #verification: Software Verification with Integrated Data Type Refinement for Integer Arithmetic (BB, SS), pp. 207–226.
KR-2004-ZhangZ #problem #scheduling: An Improved Integer Local Search for Complex Scheduling Problems (WZ, XZ), pp. 692–700.
CC-2004-RedwineR: Widening Integer Arithmetic (KR, NR), pp. 232–249.
DAC-2004-DeleganesBGKSW #logic: Low voltage swing logic circuits for a Pentium 4 processor integer core (DJD, MB, GG, KK, APS, SW), pp. 678–680.
FoSSaCS-2004-Demri #constraints #ltl: LTL over Integer Periodicity Constraints: (SD), pp. 121–135.
IJCAR-2004-Subramani #quantifier #source code: Analyzing Selected Quantified Integer Programs (KS), pp. 342–356.
IJCAR-2004-ZhangSM #constraints #data type #recursion: Decision Procedures for Recursive Data Structures with Integer Constraints (TZ, HBS, ZM), pp. 152–167.
LICS-2004-Latour #automaton: From Automata to Formulas: Convex Integer Polyhedra (LL), pp. 120–129.
DAC-2003-BozorgzadehGTS #graph: Optimal integer delay budgeting on directed acyclic graphs (EB, SG, AT, MS), pp. 920–925.
STOC-2003-SauerhoffW #bound #graph #multi #trade-off: Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions (MS, PW), pp. 186–195.
STOC-2003-Thorup #constant #problem: Integer priority queues with decrease key in constant time and the single source shortest paths problem (MT), pp. 149–158.
ICPR-v2-2002-MielikainenK #image #multi: Improved Back End for Integer PCA and Wavelet Transforms for Lossless Compression of Multispectral Images (JM, AK), pp. 257–260.
DAC-2002-KadayifKS #approach #linear #multi #programming: An integer linear programming based approach for parallelizing applications in On-chip multiprocessors (IK, MTK, US), pp. 703–708.
DAC-2002-MegerianDP #linear #programming: Watermarking integer linear programming solutions (SM, MD, MP), pp. 8–13.
DATE-2002-KhomenkoKY #detection #programming #using: Detecting State Coding Conflicts in STGs Using Integer Programming (VK, MK, AY), pp. 338–345.
CADE-2002-Zarba #multi: Combining Multisets with Integers (CGZ), pp. 363–376.
TestCom-2002-WilliamsP #interactive #problem #test coverage: Formulation of the Interaction Test Coverage Problem as an Integer Program (AWW, RLP), p. 283–?.
DLT-2001-Harju #matrix: Decision Questions on Integer Matrices (TH), pp. 57–68.
ICALP-2001-BorosEGKM #generative #linear #on the: On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.
CIKM-2001-ChoHLP #using: Dynamic and Hierarchical Spatial Access Method using Integer Searching (KC, YH, YL, EKP), pp. 341–348.
SAS-2001-DorRS #analysis #c #source code #string: Cleanness Checking of String Manipulations in C Programs via Integer Analysis (ND, MR, SS), pp. 194–212.
ASE-2001-SyD #automation #float #generative #source code #testing: Automatic Test Data Generation for Programs with Integer and Float Variables (NTS, YD), pp. 13–21.
DATE-2001-YildizSV #bias #float #linear #programming: Minimizing the number of floating bias voltage sources with integer linear programming (EY, AvS, CJMV), p. 816.
STOC-2001-BolligW #bound #branch #multi #using: A read-once branching program lower bound of Ω(2n/4) for integer multiplication using universal (BB, PW), pp. 419–424.
STOC-2001-BorgsCP #clustering #problem #scalability: Sharp threshold and scaling window for the integer partitioning problem (CB, JTC, BP), pp. 330–336.
IJCAR-2001-BoigelotJW #automaton #linear #on the #using: On the Use of Weak Automata for Deciding Linear Arithmetic with Integer and Real Variables (BB, SJ, PW), pp. 611–625.
ICPR-v3-2000-HaoS #case study #comparative #image: Comparative Study of Color Transforms for Image Coding and Derivation of Integer Reversible Color Transform (PH, QYS), pp. 3228–3231.
PLDI-2000-WilkenLH #programming #scheduling #using: Optimal instruction scheduling using integer programming (KDW, JL, MH), pp. 121–133.
STOC-2000-Boneh #using: Finding smooth integers in short intervals using CRT decoding (DB), pp. 265–272.
STOC-2000-Fortune #matrix #symmetry: Exact computations of the inertia symmetric integer matrices (SF), pp. 556–564.
CC-1999-KastnerL #linear #optimisation #programming: Code Optimization by Integer Linear Programming (DK, ML), pp. 122–136.
ICALP-1998-BoigelotRW #automaton #on the: On the Expressiveness of Real and Integer Arithmetic Automata (BB, SR, PW), pp. 152–163.
PLDI-1998-AdveM #optimisation #program analysis #set #using: Using Integer Sets for Data-Parallel Program Analysis and Optimization (VSA, JMMC), pp. 186–198.
PLDI-1998-SastryPS #execution #float: Exploiting Idle Floating-Point Resources for Integer Execution (SSS, SP, JES), pp. 118–129.
FoSSaCS-1998-Heckmann #linear: The Appearance of Big Integers in Exact Real Arithmetic Based on Linear Fractional Transformations (RH), pp. 172–188.
ISSTA-1998-BultanGL #approach #constraints #verification: Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach (TB, RG, CL), pp. 113–123.
STOC-1997-BuhlerSS #fourier #performance #precise #using: Fast and Precise Computations of Discrete Fourier Transforms Using Cyclotomic Integers (JB, MAS, VS), pp. 40–47.
ICALP-1996-AlonS #approximate #parallel #problem #programming: Improved Parallel Approximation of a Class of Integer Programming Programming Problems (NA, AS), pp. 562–573.
RTA-1996-Stuber #proving #theorem proving: Superposition Theorem Proving for Albelian Groups Represented as Integer Modules (JS), pp. 33–47.
KR-1996-SmirnovV #contest #performance #programming #representation: Efficiency Competition through Representation Changes: Pigeonhole Principle vs. Integer Programming Methods (YVS, MMV), pp. 124–134.
ESOP-1996-MelzerE #programming: Checking System Properties via Integer Programming (SM, JE), pp. 250–264.
ESOP-1996-Seidl #constraints #deforestation: Integer Constraints to Stop Deforestation (HS), pp. 326–340.
RTA-1995-WaltersZ #term rewriting: Rewrite Systems for Integer Arithmetic (HRW, HZ), pp. 324–338.
STOC-1995-Ponzio #bound #branch #multi #source code: A lower bound for integer multiplication with read-once branching programs (SP), pp. 130–139.
PLDI-1994-GranlundM #invariant #multi #using: Division by Invariant Integers using Multiplication (TG, PLM), pp. 61–72.
CADE-1994-Hines: Str+ve and Integers (LMH), pp. 416–430.
ILPS-1994-TomanCR #constraints #datalog: Datalog with Integer Periodicity Constraints (DT, JC, DSR), pp. 189–203.
ICALP-1992-Hagerup #performance: Fast Integer Merging on the EREW PRAM (TH), pp. 318–329.
CAV-1992-Corbett #liveness #programming #safety #verification: Verifying General Safety and Liveness Propterties with Integer Programming (JCC), pp. 357–369.
STOC-1991-Adleman #using: Factoring Numbers Using Singular Integers (LMA), pp. 64–71.
STOC-1991-Hagerup #parallel #sorting: Constant-Time Parallel Integer Sorting (TH), pp. 299–306.
CAV-1991-AvruninBC #analysis #concurrent #programming: Integer Programming in the Analysis of Concurrent Systems (GSA, UAB, JCC), pp. 92–102.
ICALP-1990-MatiasV #on the #parallel #sorting: On Parallel Hashing and Integer Sorting (YM, UV), pp. 729–743.
STOC-1989-ReifT: Optimal Size Integer Division Circuits (JHR, SRT), pp. 264–273.
STOC-1989-Vallee #performance #polynomial: Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues (BV), pp. 98–106.
LICS-1989-Lubarsky #set: μ-Definable Sets of Integers (RSL), pp. 343–352.
ICALP-1987-PazS #approximate: Approximating Integer Lattices by Lattices with Cyclic Factor Groups (AP, CPS), pp. 386–393.
ASPLOS-1987-MagenheimerPPZ #architecture #multi #precise: Integer Multiplication and Division on the HP Precision Architecture (DJM, LP, KP, DZ), pp. 90–99.
LICS-1986-PerrinS #automaton #decidability #equivalence #monad: Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
STOC-1985-AharoniEL #linear #source code: Dual Integer Linear Programs and the Relationship between their Optima (RA, PE, NL), pp. 476–483.
ICALP-1984-MehlhornP #multi: Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time (KM, FPP), pp. 347–357.
ICALP-1984-Schonhage #algorithm #reduction: Factorization of Univariate Integer Polynomials by Diophantine Aproximation and an Improved Basis Reduction Algorithm (AS), pp. 436–447.
STOC-1983-Bach #how #random: How to Generate Random Integers with Known Factorization (EB), pp. 184–188.
STOC-1983-Kannan #algorithm #problem #programming: Improved Algorithms for Integer Programming and Related Lattice Problems (RK), pp. 193–206.
ICALP-1981-PreparataV #fourier #multi #network: Area-Time Optimal VLSI Networks for Computing Integer Multiplications and Discrete Fourier Transform (FPP, JV), pp. 29–40.
ICALP-1980-Alt #multi: Functions Equivalent to Integer Multiplication (HA), pp. 30–37.
ICALP-1979-SavageS #multi #trade-off: Space-Time Tradeoffs for Oblivious Integer Multiplications (JES, SS), pp. 498–504.
ICALP-1976-Galil #on the #programming #proving #theorem proving: On Enumeration Procedures for Theorem Proving and for Integer Programming (ZG), pp. 355–381.
STOC-1975-LiptonD #complexity #evaluation #metric: Complexity Measures and Hierarchies for the Evaluation of Integers, Polynomials, and n-linear Forms (RJL, DPD), pp. 1–5.
DAC-1974-WeberS #algorithm: An integer arithmetic path expansion algorithm (TAW, DGS), pp. 62–69.
STOC-1973-FischerS #multi #online #performance: Fast On-Line Integer Multiplication (MJF, LJS), pp. 67–72.
STOC-1970-KingF #proving #theorem proving: An Interpretation Oriented Theorem Prover over Integers (JCK, RWF), pp. 169–179.
SHARE-1966-Breuer #automation #design #programming: The application of integer programming in design automation (MAB).