Stem binari$ (all stems)

462 papers:

CASE-2015-AmriBARF #multi #robust #using

Robust indoor location tracking of multiple inhabitants using only binary sensors (MHA, YB, DA, NR, MF), pp. 194–199.

CASE-2015-MaedaK #algorithm #hybrid

Inverse kinematics solution algorithm for continuous/binary hybrid manipulator (KM, EK), pp. 483–488.

DATE-2015-DamschenRVP

Transparent offloading of computational hotspots from binary code to Xeon Phi (MD, HR, GV, CP), pp. 1078–1083.

DATE-2015-FuggerNNS #modelling #physics #towards

Towards binary circuit models that faithfully capture physical solvability (MF, RN, TN, US), pp. 1455–1460.

TACAS-2015-DjoudiB #analysis #low level #named

BINSEC: Binary Code Analysis with Low-Level Regions (AD, SB), pp. 212–217.

TACAS-2015-FleuryLPV #analysis #framework #named

Insight: An Open Binary Analysis Framework (EF, OL, GP, AV), pp. 218–224.

SANER-2015-MattsenWS #abstract domain #analysis

A non-convex abstract domain for the value analysis of binaries (SM, AW, SS), pp. 271–280.

SANER-2015-QiuSM #graph #identification #library #morphism #using

Library functions identification in binary code by using graph isomorphism testings (JQ, XS, PM), pp. 261–270.

PLDI-2015-MendisBWKRPZA #domain-specific language #kernel #named

Helium: lifting high-performance stencil kernels from stripped x86 binaries to halide DSL code (CM, JB, KW, SK, JRK, SP, QZ, SPA), pp. 391–402.

SAS-2015-ChenC #abstract domain

A Binary Decision Tree Abstract Domain Functor (JC, PC), pp. 36–53.

STOC-2015-ChenJL #capacity #online

A Characterization of the Capacity of Online (causal) Binary Channels (ZC, SJ, ML), pp. 287–296.

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.

LATA-2015-Yoshinaka #boolean grammar #grammar inference #learning

Learning Conjunctive Grammars and Contextual Binary Feature Grammars (RY), pp. 623–635.

ICML-2015-MenonROW #estimation #learning

Learning from Corrupted Binary Labels via Class-Probability Estimation (AKM, BvR, CSO, BW), pp. 125–134.

ICML-2015-YiCP #algorithm #performance

Binary Embedding: Fundamental Limits and Fast Algorithm (XY, CC, EP), pp. 2162–2170.

SEKE-2015-SaberE #algorithm #array #clustering #novel

BiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data (HBS, ME), pp. 178–181.

SIGIR-2015-VolkovsY #effectiveness #feedback #modelling #recommendation

Effective Latent Models for Binary Feedback in Recommender Systems (MV, GWY), pp. 313–322.

SAC-2015-BurkhardtK #classification #multi #on the

On the spectrum between binary relevance and classifier chains in multi-label classification (SB, SK), pp. 885–892.

SAC-2015-OkkaliogluKP #on the

On the discovery of fake binary ratings (MO, MK, HP), pp. 901–907.

ESEC-FSE-2015-FuLB #analysis #automation #memory dump #memory management #pointer

Automatically deriving pointer reference expressions from binary code for memory dump analysis (YF, ZL, DB), pp. 614–624.

ESEC-FSE-2015-KargenS #slicing #source code #using

Turning programs against each other: high coverage fuzz-testing using binary-code mutation and dynamic slicing (UK, NS), pp. 782–792.

ICSE-v1-2015-GopanDNNLM

Data-Delineation in Software Binaries and its Application to Buffer-Overrun Discovery (DG, ED, DN, DN, AL, DM), pp. 145–155.

ICSE-v1-2015-PhamNRR #named

Hercules: Reproducing Crashes in Real-World Application Binaries (VTP, WBN, KR, AR), pp. 891–901.

CGO-2015-HawkinsDBZ #optimisation

Optimizing binary translation of dynamically generated code (BH, BD, DB, QZ), pp. 68–78.

CGO-2015-ZhangGCCH #named #performance

HERMES: a fast cross-ISA binary translator with post-optimization (XZ, QG, YC, TC, WH), pp. 246–256.

PPoPP-2015-RamachandranM #concurrent #named #performance #using

CASTLE: fast concurrent internal binary search tree using edge-based locking (AR, NM), pp. 281–282.

CAV-2015-LahiriSH #automation #equivalence

Automatic Rootcausing for Program Equivalence Failures in Binaries (SKL, RS, CH), pp. 362–379.

ICLP-2015-Charwat #diagrams #programming #research #summary #using

Dynamic Programming on Tree Decompositions using Binary Decision Diagrams: Research Summary (GC).

TLCA-2015-Bagnol #diagrams #equivalence #proving

MALL Proof Equivalence is Logspace-Complete, via Binary Decision Diagrams (MB), pp. 60–75.

CASE-2014-ShiWS #approximate #matrix

Approximation method to rank-one binary matrix factorization (ZS, LW, LS), pp. 800–805.

DAC-2014-LinHL

Parasitic-aware Sizing and Detailed Routing for Binary-weighted Capacitors in Charge-scaling DAC (MPHL, VWHH, CYL), p. 6.

DATE-2014-AmaruGM #diagrams #performance

An efficient manipulation package for Biconditional Binary Decision Diagrams (LGA, PEG, GDM), pp. 1–6.

DATE-2014-GuoWWH #automation #effectiveness #named #test coverage

EATBit: Effective automated test for binary translation with high code coverage (HG, ZW, CW, RH), pp. 1–6.

TFPIE-2014-Ragde

Simple Balanced Binary Search Trees (PR), pp. 78–87.

ESOP-2014-KothaACESB #bound #parallel #runtime

Affine Parallelization of Loops with Run-Time Dependent Bounds from Binaries (AK, KA, TC, KE, MS, RB), pp. 554–574.

CSMR-WCRE-2014-Bos #lightweight #reverse engineering #runtime

Lightweight runtime reverse engineering of binary file format variants (JvdB), pp. 367–370.

AFL-2014-DuS #infinity #similarity #word

Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.

ICALP-v1-2014-CleveM #constraints #game studies

Characterization of Binary Constraint System Games (RC, RM), pp. 320–331.

LATA-2014-Vorel #automaton #complexity #problem #word

Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (VV), pp. 576–587.

SEFM-2014-LovatoMS #diagrams #library #thread

A Thread-Safe Library for Binary Decision Diagrams (AL, DM, FS), pp. 35–49.

ICML-c1-2014-ChenLL #multi #online #problem

Boosting with Online Binary Learners for the Multiclass Bandit Problem (STC, HTL, CJL), pp. 342–350.

ICML-c2-2014-0001NKA #estimation #probability

GEV-Canonical Regression for Accurate Binary Class Probability Estimation when One Class is Rare (AA, HN, SK, SA), pp. 1989–1997.

ICML-c2-2014-Hernandez-LobatoHG #matrix #modelling #probability #scalability

Stochastic Inference for Scalable Probabilistic Modeling of Binary Matrices (JMHL, NH, ZG), pp. 379–387.

ICML-c2-2014-YuKGC

Circulant Binary Embedding (FXY, SK, YG, SFC), pp. 946–954.

ICPR-2014-DavarzaniM #adaptation #image #robust

Robust Image Description with Weighted and Adaptive Local Binary Pattern Features (RD, SM), pp. 1097–1102.

ICPR-2014-DuZCW #flexibility #learning #linear #random

Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest (SD, WZ, SC, YW), pp. 2685–2690.

ICPR-2014-EikvilH #automation #evaluation #identification #performance

Evaluation of Binary Descriptors for Fast and Fully Automatic Identification (LE, MH), pp. 154–159.

ICPR-2014-FuKGYZ #ranking

Binary Code Reranking Method Based on Bit Importance (HF, XK, YG, XY, LZ), pp. 2679–2684.

ICPR-2014-HafianePS #adaptation #classification

Adaptive Median Binary Patterns for Texture Classification (AH, KP, GS), pp. 1138–1143.

ICPR-2014-HegenbartU #adaptation

An Orientation-Adaptive Extension to Scale-Adaptive Local Binary Patterns (SH, AU), pp. 1120–1125.

ICPR-2014-JainCL #image

Local Binary Patterns Calculated over Gaussian Derivative Images (VJ, JLC, AL), pp. 3987–3992.

ICPR-2014-LuoJ #encoding #image #learning #retrieval #semantics

Learning Semantic Binary Codes by Encoding Attributes for Image Retrieval (JL, ZJ), pp. 279–284.

ICPR-2014-MasiFBM #component #independence #recognition

Pose Independent Face Recognition by Localizing Local Binary Patterns via Deformation Components (IM, CF, ADB, GGM), pp. 4477–4482.

ICPR-2014-MuddamsettySTM #detection #using

Spatio-temporal Saliency Detection in Dynamic Scenes Using Local Binary Patterns (SMM, DS, AT, FM), pp. 2353–2358.

ICPR-2014-NagyM #approach #grid #search-based

Binary Tomography on the Triangular Grid with 3 Alternative Directions — A Genetic Approach (BN, EVM), pp. 1079–1084.

ICPR-2014-OzkanEA #detection #video #visual notation

Visual Group Binary Signature for Video Copy Detection (SÖ, EE, GBA), pp. 3945–3950.

ICPR-2014-RodriguesPPW #approach #feature model

A Binary Krill Herd Approach for Feature Selection (DR, LAMP, JPP, SATW), pp. 1407–1412.

ICPR-2014-SaleemBS #image #robust #symmetry

A Gradient Extension of Center Symmetric Local Binary Patterns for Robust RGB-NIR Image Matching (SS, AB, RS), pp. 815–820.

ICPR-2014-Shirakawa #multi #performance #similarity #using

Fast Similarity Search Using Multiple Binary Codes (SS), pp. 3714–3719.

ICPR-2014-WangWCY #geometry

Fingerprint Geometric Hashing Based on Binary Minutiae Cylinder Codes (YW, LW, YmC, PCY), pp. 690–695.

ICPR-2014-WerghiBB

Computing Local Binary Patterns on Discrete Manifolds (NW, SB, ADB), pp. 2430–2435.

ICPR-2014-YiS #recognition #representation

Principal Local Binary Patterns for Face Representation and Recognition (JY, FS), pp. 4554–4559.

ICPR-2014-YlioinasHKP #recognition

An In-depth Examination of Local Binary Descriptors in Unconstrained Face Recognition (JY, AH, JK, MP), pp. 4471–4476.

ICPR-2014-YuncuHB #automation #modelling #recognition #speech #using

Automatic Speech Emotion Recognition Using Auditory Models with Binary Decision Tree and SVM (EY, HH, CB), pp. 773–778.

MLDM-2014-BugaychenkoZ #diagrams #learning #multi #pattern matching #pattern recognition #performance #recognition #using

Fast Pattern Recognition and Deep Learning Using Multi-Rooted Binary Decision Diagrams (DB, DZ), pp. 73–77.

SIGIR-2014-LengCL #image #learning #random #retrieval #scalability

Random subspace for binary codes learning in large scale image retrieval (CL, JC, HL), pp. 1031–1034.

PPDP-2014-Tarau #encoding

Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers (PT), pp. 31–42.

SAC-2014-CaetanoAGA #recognition #representation #visual notation

Representing local binary descriptors with BossaNova for visual recognition (CC, SEFdA, SJFG, AdAA), pp. 49–54.

SAC-2014-ChenZW #detection #named #testing

Crashmaker: an improved binary concolic testing tool for vulnerability detection (BC, QZ, WW), pp. 1257–1263.

SAC-2014-KangI #dynamic analysis

Analysis of binary code topology for dynamic analysis (BK, EGI), pp. 1731–1732.

SAC-2014-TarauB #algorithm

Arithmetic algorithms for hereditarily binary natural numbers (PT, BPB), pp. 1593–1600.

FSE-2014-LuoMW0Z #comparison #detection #obfuscation #semantics #similarity

Semantics-based obfuscation-resilient binary code similarity comparison with applications to software plagiarism detection (LL, JM, DW, PL, SZ), pp. 389–400.

ICSE-2014-KimSZXA #component #functional #reuse #reverse engineering

Reuse-oriented reverse engineering of functional components from x86 binaries (DK, WNS, XZ, DX, HA), pp. 1128–1139.

LCTES-2014-SpinkWFT #code generation #performance

Efficient code generation in a region-based dynamic binary translator (TS, HW, BF, NPT), pp. 3–12.

PPoPP-2014-DrachslerVY #concurrent #logic

Practical concurrent binary search trees via logical ordering (DD, MTV, EY), pp. 343–356.

PPoPP-2014-NatarajanM #concurrent #performance

Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.

ISSTA-2014-HendersonPYHWZY #analysis #framework #performance

Make it work, make it right, make it fast: building a platform-neutral whole-system dynamic binary analysis platform (AH, AP, LKY, XH, XW, RZ, HY), pp. 248–258.

DAC-2013-OnizawaG #clustering #network #power management #scalability

Low-power area-efficient large-scale IP lookup engine based on binary-weighted clustered networks (NO, WJG), p. 6.

DATE-2013-BrandonW #using

Support for dynamic issue width in VLIW processors using generic binaries (AB, SW), pp. 827–832.

DATE-2013-ElbayoumiHE #concurrent #diagrams #manycore #novel

A novel concurrent cache-friendly binary decision diagram construction for multi-core platforms (ME, MSH, MYE), pp. 1427–1430.

VLDB-2013-KolaitisPT #consistency #database #integer #performance #programming #query

Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.

MSR-2013-KhooMA #named

Rendezvous: a search engine for binary code (WMK, AM, RJA), pp. 329–338.

WCRE-2013-ChenSB #c #detection #memory management

Who allocated my memory? Detecting custom memory allocators in C binaries (XC, AS, HB), pp. 22–31.

WCRE-2013-ChenSB13a #c #detection #memory management #named

MemBrush: A practical tool to detect custom memory allocators in C binaries (XC, AS, HB), pp. 477–478.

WCRE-2013-HallerSB #c #c++ #data type #detection #named

MemPick: High-level data structure detection in C/C++ binaries (IH, AS, HB), pp. 32–41.

WCRE-2013-SmithsonEAKB #correctness #trade-off

Static binary rewriting without supplemental information: Overcoming the tradeoff between coverage and correctness (MS, KE, KA, AK, RB), pp. 52–61.

PLDI-2013-ElwazeerAKSB #data type #detection #scalability

Scalable variable and data type detection in a binary rewriter (KE, KA, AK, MS, RB), pp. 51–60.

DLT-2013-MercasS

3-Abelian Cubes Are Avoidable on Binary Alphabets (RM, AS), pp. 374–383.

ICALP-v1-2013-DemaineILO

Combining Binary Search Trees (EDD, JI, SL, ÖÖ), pp. 388–399.

ECIR-2013-ZhangZBC #categorisation #distance #encoding #visual notation

Encoding Local Binary Descriptors by Bag-of-Features with Hamming Distance for Visual Object Categorization (YZ, CZ, SB, LC), pp. 630–641.

ICML-c1-2013-KrauseFGI #approximate

Approximation properties of DBNs with binary hidden units and real-valued visible units (OK, AF, TG, CI), pp. 419–426.

ICML-c3-2013-MenonNAC #algorithm #classification #consistency #on the #statistics

On the Statistical Consistency of Algorithms for Binary Classification under Class Imbalance (AKM, HN, SA, SC), pp. 603–611.

ICML-c3-2013-NguyenS #algorithm #classification #optimisation

Algorithms for Direct 0-1 Loss Optimization in Binary Classification (TN, SS), pp. 1085–1093.

ICML-c3-2013-TeschSC #optimisation #probability

Expensive Function Optimization with Stochastic Binary Outcomes (MT, JGS, HC), pp. 1283–1291.

RecSys-2013-Aiolli #dataset #performance #recommendation #scalability

Efficient top-n recommendation for very large scale binary rated datasets (FA), pp. 273–280.

SAC-PL-J-2012-HaraburdaT13 #framework

Binary trees as a computational framework (DH, PT), pp. 163–181.

ASPLOS-2013-SchulteDWF #assembly #automation #embedded #source code

Automated repair of binary and assembly programs for cooperating embedded devices (EMS, JD, WW, SF), pp. 317–328.

PLOS-2013-AryaDVC #automation #debugging #process

Semi-automated debugging via binary search through a process lifetime (KA, TD, AMV, GC), p. 7.

SOSP-2013-KediaB #kernel #performance

Fast dynamic binary translation for the kernel (PK, SB), pp. 101–115.

DATE-2012-KotiyalTR #design

Mach-Zehnder interferometer based design of all optical reversible binary adder (SK, HT, NR), pp. 721–726.

DATE-2012-PomataMTRL #design #performance

Exploiting binary translation for fast ASIP design space exploration on FPGAs (SP, PM, GT, LR, ML), pp. 566–569.

DRR-2012-ChengWAST #algorithm #classification #image #optimisation #visual notation

Graphical image classification combining an evolutionary algorithm and binary particle swarm optimization (BC, RW, SA, RJS, GRT).

ITiCSE-2012-FeasterAH #education

Serious toys: teaching the binary number system (YF, FA, JOH), pp. 262–267.

SCAM-2012-AliSGA #debugging #using

Improving Bug Location Using Binary Class Relationships (NA, AS, YGG, GA), pp. 174–183.

SCAM-2012-KargenS #analysis #comprehension #data flow #named

InputTracer: A Data-Flow Analysis Tool for Manual Program Comprehension of x86 Binaries (UK, NS), pp. 138–143.

WCRE-2012-BernatM #algebra #context-free grammar #editing

Structured Binary Editing with a CFG Transformation Algebra (ARB, BPM), pp. 9–18.

WCRE-2012-Kinder #obfuscation #static analysis #towards

Towards Static Analysis of Virtualization-Obfuscated Binaries (JK), pp. 61–70.

SAS-2012-Ledesma-GarzaR #analysis #functional #higher-order #reachability #source code

Binary Reachability Analysis of Higher Order Functional Programs (RLG, AR), pp. 388–404.

DLT-2012-Blanchet-SadriJM #word

Squares in Binary Partial Words (FBS, YJ, JMM), pp. 404–415.

ICALP-v1-2012-BoseCFL

De-amortizing Binary Search Trees (PB, SC, RF, SL), pp. 121–132.

ICML-2012-KumarNKD #classification #framework #kernel #learning #multi

A Binary Classification Framework for Two-Stage Multiple Kernel Learning (AK, ANM, KK, HDI), p. 173.

ICPR-2012-dAngeloAV #image

Beyond bits: Reconstructing images from Local Binary Descriptors (Ed, AA, PV), pp. 935–938.

ICPR-2012-DornellesH #algorithm #approach #image #search-based

A genetic algorithm based approach for combining binary image operators (MMD, NSTH), pp. 3184–3187.

ICPR-2012-DoshiS #algorithm #benchmark #metric #retrieval

A comprehensive benchmark of local binary pattern algorithms for texture retrieval (NPD, GS), pp. 2760–2763.

ICPR-2012-HuangH #invariant #using

Binary invariant cross color descriptor using galaxy sampling (GHH, CRH), pp. 2610–2613.

ICPR-2012-LeeLCY #lightweight #random #representation #using

Lightweight Random Ferns using binary representation (SL, SWL, YNC, HSY), pp. 1342–1345.

ICPR-2012-NafchiK #dataset #image #representation

Rectangular based binary image representation: Theory, applications, and dataset introduction (HZN, HRK), pp. 190–193.

ICPR-2012-NguyenVC #multi #recognition #using

Face recognition using Multi-modal Binary Patterns (TPN, NSV, AC), pp. 2343–2346.

ICPR-2012-ParisHG #analysis #categorisation #image #towards

Sparse coding for histograms of local binary patterns applied for image categorization: Toward a Bag-of-Scenes analysis (SP, XH, HG), pp. 2817–2820.

ICPR-2012-SchaeferD #analysis #multi

Multi-dimensional local binary pattern descriptors for improved texture analysis (GS, NPD), pp. 2500–2503.

ICPR-2012-TaoKNT #process #recognition

Camera view usage of binary infrared sensors for activity recognition (ST, MK, HN, JT), pp. 1759–1762.

ICPR-2012-WangGFC #analysis #segmentation

Curvature-driven volumetric segmentation of binary shapes: An application to snow microstructure analysis (XW, LG, FF, DC), pp. 742–745.

ICPR-2012-ZhangLLHSY

Binary stereo matching (KZ, JL, YL, WH, LS, SY), pp. 356–359.

KDD-2012-ZhouZ #collaboration #learning

Learning binary codes for collaborative filtering (KZ, HZ), pp. 498–506.

KDIR-2012-DubeyBP #named

BINGR: Binary Search based Gaussian Regression (HD, SB, VP), pp. 258–263.

OOPSLA-2012-KlingMCR #infinity #named #on-demand

Bolt: on-demand infinite loop escape in unmodified binaries (MK, SM, MC, MCR), pp. 431–450.

RE-2012-Yi0ZJM #constraints #feature model #mining #modelling

Mining binary constraints in the construction of feature models (LY, WZ, HZ, ZJ, HM), pp. 141–150.

ICSE-2012-Rodes #layout #source code #stack #towards

Stack layout transformation: Towards diversity for securing binary programs (BR), pp. 1543–1546.

ASPLOS-2012-FeinerBG #kernel

Comprehensive kernel instrumentation via dynamic binary translation (PF, ADB, AG), pp. 135–146.

CGO-2012-HongHYWHLWC #concurrent #multi #named #thread

HQEMU: a multi-threaded and retargetable dynamic binary translator on multicores (DYH, CCH, PCY, JJW, WCH, PL, CMW, YCC), pp. 104–113.

HPDC-2012-GeorgakoudisLN #manycore #migration #summary #symmetry

Dynamic binary rewriting and migration for shared-ISA asymmetric, multicore processors: summary (GG, SL, DSN), pp. 127–128.

LCTES-2012-KyleBFLT #embedded #manycore #set #simulation #using

Efficiently parallelizing instruction set simulation of embedded multi-core processors using region-based just-in-time dynamic binary translation (SCK, IB, BF, HL, NPT), pp. 21–30.

PPoPP-2012-CrainGR

A speculation-friendly binary search tree (TC, VG, MR), pp. 161–170.

SAT-2012-MorgadoHM #satisfiability

Improvements to Core-Guided Binary Search for MaxSAT (AM, FH, JMS), pp. 284–297.

SMT-2012-KovasznaiFB #complexity #logic #on the

On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width (GK, AF, AB), pp. 44–56.

VMCAI-2012-Bugaychenko #diagrams #model checking #multi #on the #probability

On Application of Multi-Rooted Binary Decision Diagrams to Probabilistic Model Checking (DB), pp. 104–118.

CASE-2011-LeH #analysis #random

Marginal analysis on binary pairwise Gibbs random fields (TL, CNH), pp. 316–321.

DAC-2011-KinsmanN #configuration management #on the fly

Dynamic binary translation to a reconfigurable target for on-the-fly acceleration (PK, NN), pp. 286–287.

DAC-2011-Stergiou #diagrams #network #order #permutation

Implicit permutation enumeration networks and binary decision diagrams reordering (SS), pp. 615–620.

DATE-2011-MichelFP #embedded #simulation

Speeding-up SIMD instructions dynamic binary translation in embedded processor simulation (LM, NF, FP), pp. 277–280.

ICDAR-2011-AgrawalD #documentation #image

Stroke-Like Pattern Noise Removal in Binary Document Images (MA, DSD), pp. 17–21.

ICDAR-2011-ShiSG #documentation #image

Image Enhancement for Degraded Binary Document Images (ZS, SS, VG), pp. 895–899.

MSR-2011-HemelKVD #clone detection #detection

Finding software license violations through binary code clone detection (AH, KTK, RV, ED), pp. 63–72.

PASTE-2011-BernatM

Anywhere, any-time binary instrumentation (ARB, BPM), pp. 9–16.

PASTE-2011-JacobsonRM #library

Labeling library functions in stripped binaries (ERJ, NER, BPM), pp. 1–8.

WCRE-2011-CheathamR

Function Insight: Highlighting Suspicious Sections in Binary Run Traces (MC, JR), pp. 433–434.

WCRE-2011-SeppMS #precise #relational #static analysis

Precise Static Analysis of Binaries by Extracting Relational Information (AS, BM, AS), pp. 357–366.

PLDI-2011-BohmKKFT #compilation #parallel #using

Generalized just-in-time trace compilation using a parallel task farm in a dynamic binary translator (IB, TJKEvK, SCK, BF, NPT), pp. 74–85.

DLT-J-2009-HalavaH11 #problem #reduction

Reduction Tree of the Binary Generalized Post Correspondence Problem (VH, SH), pp. 473–490.

ICML-2011-Gould #learning #linear #markov #random

Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields (SG), pp. 193–200.

ICML-2011-NorouziF

Minimal Loss Hashing for Compact Binary Codes (MN, DJF), pp. 353–360.

KDD-2011-ChakiCG #learning

Supervised learning for provenance-similarity of binaries (SC, CC, AG), pp. 15–23.

MLDM-2011-YokotaY #classification #estimation

Quadratically Constrained Maximum a Posteriori Estimation for Binary Classifier (TY, YY), pp. 1–15.

SAC-2011-KuoLC #algorithm #clustering #testing

Testing a binary space partitioning algorithm with metamorphic testing (FCK, SL, TYC), pp. 1482–1489.

CAV-2011-BardinHLLTV #analysis #framework

The BINCOA Framework for Binary Code Analysis (SB, PH, JL, OL, RT, AV), pp. 165–170.

CAV-2011-BrumleyJAS #analysis #framework #named

BAP: A Binary Analysis Platform (DB, IJ, TA, EJS), pp. 463–469.

ISSTA-2011-BernatRM #performance

Efficient, sensitivity resistant binary instrumentation (ARB, KAR, BPM), pp. 89–99.

ISSTA-2011-RosenblumMZ

Recovering the toolchain provenance of binary code (NER, BPM, XZ), pp. 100–110.

ISSTA-2011-SegallTF #combinator #design #diagrams #using

Using binary decision diagrams for combinatorial test design (IS, RTB, EF), pp. 254–264.

SAT-2011-HeuleJB #graph #performance

Efficient CNF Simplification Based on Binary Implication Graphs (MH, MJ, AB), pp. 201–215.

DATE-2010-FuHLL

Accelerating Lightpath setup via broadcasting in binary-tree waveguide in Optical NoCs (BF, YH, HL, XL), pp. 933–936.

PASTE-2010-RosenblumMZ #compilation

Extracting compiler provenance from program binaries (NER, BPM, XZ), pp. 21–28.

LATA-2010-Blanchet-SadriMSW #word

Avoidable Binary Patterns in Partial Words (FBS, RM, SS, EW), pp. 106–117.

LATA-2010-ChamparnaudDJ #geometry #regular expression

Geometricity of Binary Regular Languages (JMC, JPD, HJ), pp. 178–189.

ICPR-2010-BauckhageT #adaptation #clustering #image

Adapting Information Theoretic Clustering to Binary Images (CB, CT), pp. 910–913.

ICPR-2010-BenvenisteU #invariant

A Color Invariant Based Binary Coded Structured Light Range Scanner for Shiny Objects (RB, CÜ), pp. 798–801.

ICPR-2010-CardosoR #distance #estimation #music #robust

Robust Staffline Thickness and Distance Estimation in Binary and Gray-Level Music Scores (JSC, AR), pp. 1856–1859.

ICPR-2010-DuYXGT #identification

Wavelet Domain Local Binary Pattern Features For Writer Identification (LD, XY, HX, ZG, YYT), pp. 3691–3694.

ICPR-2010-FengY #analysis

Binary Discriminant Analysis for Face Template Protection (YCF, PCY), pp. 874–877.

ICPR-2010-GuoZ #authentication #capacity #image

High Capacity Data Hiding for Binary Image Authentication (MG, HZ), pp. 1441–1444.

ICPR-2010-JungO #identification #image #web

Local Binary Pattern-Based Features for Text Identification of Web Images (IJ, ISO), pp. 4320–4323.

ICPR-2010-ShiSG #documentation #image #using

Removing Rule-Lines from Binary Handwritten Arabic Document Images Using Directional Local Profile (ZS, SS, VG), pp. 1916–1919.

ICPR-2010-XuV

Binary Representations of Fingerprint Spectral Minutiae Features (HX, RNJV), pp. 1212–1216.

ICPR-2010-YangZZZ #feature model #novel #recognition #representation

Monogenic Binary Pattern (MBP): A Novel Feature Extraction and Representation Model for Face Recognition (MY, LZ, LZ, DZ), pp. 2680–2683.

ICPR-2010-ZhuBC #multi #recognition #visual notation

Multi-scale Color Local Binary Patterns for Visual Object Classes Recognition (CZ, CEB, LC), pp. 3065–3068.

REFSQ-2010-BebenseeWB #requirements

Binary Priority List for Prioritizing Software Requirements (TB, IvdW, SB), pp. 67–78.

SAC-2010-ColantonioPOV #adaptation #approach #clustering #matrix #named

ABBA: adaptive bicluster-based approach to impute missing values in binary matrices (AC, RDP, AO, NVV), pp. 1026–1033.

SAC-2010-LuccheseOP #dataset #generative #mining

A generative pattern model for mining binary datasets (CL, SO, RP), pp. 1109–1110.

CGO-2010-BorinWWLBHNRR #named #optimisation

TAO: two-level atomicity for dynamic binary optimizations (EB, YW, CW, WL, MBJ, SH, EN, SR, RR), pp. 12–21.

HPDC-2010-GuanYCGLC #distributed #named

DistriBit: a distributed dynamic binary translator system for thin client computing (HG, YY, KC, YG, LL, YC), pp. 684–691.

PPoPP-2010-BronsonCCO #concurrent

A practical concurrent binary search tree (NGB, JC, HC, KO), pp. 257–268.

PPoPP-2010-TzannesCBV #adaptation #lazy evaluation #runtime

Lazy binary-splitting: a run-time adaptive work-stealing scheduler (AT, GCC, RB, UV), pp. 179–190.

CSL-2010-BiancoMM #logic

Graded Computation Tree Logic with Binary Coding (AB, FM, AM), pp. 125–139.

DAC-2009-BaiocchiC #in memory #memory management #using

Heterogeneous code cache: using scratchpad and main memory in dynamic binary translators (JB, BRC), pp. 744–749.

ICDAR-2009-AgrawalD #documentation #image

Clutter Noise Removal in Binary Document Images (MA, DSD), pp. 556–560.

VLDB-2009-ZhangACIMPS #query #xml

Binary XML Storage and Query Processing in Oracle 11g (NZ, NA, SC, SI, VM, SP, BS), pp. 1354–1365.

WCRE-1999-CooganDKT99a #automation

Automatic Static Unpacking of Malware Binaries (KC, SKD, TK, GMT), pp. 167–176.

PLDI-2009-TallentMF #analysis #metric #performance

Binary analysis for measurement and attribution of program performance (NRT, JMMC, MWF), pp. 441–452.

CIAA-J-2008-ChamparnaudDJ09 #algorithm #geometry #performance #regular expression

An Efficient Algorithm to Test Whether a Binary and Prolongeable Regular Language is Geometrical (JMC, JPD, HJ), pp. 763–774.

LATA-2009-IIBT #array

Counting Parameterized Border Arrays for a Binary Alphabet (TI, SI, HB, MT), pp. 422–433.

CIKM-2009-MartineauFJP #classification #difference #problem #using #word

Improving binary classification on text problems using differential word features (JM, TF, AJ, SP), pp. 2019–2024.

ECIR-2009-EsuliS09a #classification #encoding

Encoding Ordinal Features into Binary Features for Text Classification (AE, FS), pp. 771–775.

ICML-2009-PazisL #learning #policy

Binary action search for learning continuous-action control policies (JP, MGL), pp. 793–800.

KDD-2009-ShenJY #matrix #mining

Mining discrete patterns via binary matrix factorization (BHS, SJ, JY), pp. 757–766.

SAC-2009-HuangCZLT #java #testing

An optimized change-driven regression testing selection strategy for binary Java applications (SH, YC, JZ, ZJL, HT), pp. 558–565.

SAC-2009-OwensMR #dataset #mining

Capturing truthiness: mining truth tables in binary datasets (CCOI, TMM, NR), pp. 1467–1474.

CGO-2009-LiWH #data access #evaluation

An Evaluation of Misaligned Data Access Handling Mechanisms in Dynamic Binary Translation Systems (JL, CW, WCH), pp. 180–189.

ISMM-2009-HazelwoodLC #parallel #scalability #thread

Scalable support for multithreaded applications on dynamic binary instrumentation systems (KMH, GL, RC), pp. 20–29.

ISSTA-2009-SaebjornsenWPQS #bytecode #detection

Detecting code clones in binary executables (AS, JW, TP, DJQ, ZS), pp. 117–128.

ISSTA-2009-SaxenaPMS #execution #source code #symbolic computation

Loop-extended symbolic execution on binary programs (PS, PP, SM, DS), pp. 225–236.

SAT-2009-ChebiryakWKH #agile

Finding Lean Induced Cycles in Binary Hypercubes (YC, TW, DK, LH), pp. 18–31.

VMCAI-2009-KinderZV #abstract interpretation #control flow #framework #re-engineering

An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries (JK, FZ, HV), pp. 214–228.

DAC-2008-MoussaBJ #flexibility #multi #network

Binary de Bruijn on-chip network for a flexible multiprocessor LDPC decoder (HM, AB, MJ), pp. 429–434.

DocEng-2008-Nguyen #algorithm #documentation #image #using

A rotation method for binary document images using DDA algorithm (DTN), pp. 267–270.

VLDB-2008-ZhangPWN #correlation #higher-order #mining

Mining non-redundant high order correlations in binary data (XZ, FP, WW, ABN), pp. 1178–1188.

ITiCSE-2008-PatersonHC #education #semantics

Drawing the line: teaching the semantics of binary class associations (JHP, JH, KFC), p. 362.

STOC-2008-CoteMP #random

Randomized k-server on hierarchical binary trees (AC, AM, LJP), pp. 227–234.

CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing

Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.

DLT-2008-HadravovaH #scalability #similarity #word

Large Simple Binary Equality Words (JH, SH), pp. 396–407.

ICALP-A-2008-LaberM #algorithm #approximate

An Approximation Algorithm for Binary Searching in Trees (ESL, MM), pp. 459–471.

SOFTVIS-2008-Panas #visualisation

Signature visualization of software binaries (TP), pp. 185–188.

ICEIS-J-2008-KangasharjuK08a #mobile

Binary Serialization for Mobile XForms Services (JK, OK), pp. 241–252.

ICPR-2008-Al-KhaffafTS #image

Removing salt-and-pepper noise from binary images of engineering drawings (HSMAK, AZT, RAS), pp. 1–4.

ICPR-2008-FehrB #3d #invariant

3D rotation invariant local binary patterns (JF, HB), pp. 1–4.

ICPR-2008-HeAP

A Bayesian Local Binary Pattern texture descriptor (CH, TA, MP), pp. 1–4.

ICPR-2008-NorellL #distance #image

Spatially-variant morphological operations on binary images based on the polar distance transform (KN, JL), pp. 1–4.

ICPR-2008-XieSCG #named #recognition #representation

V-LGBP: Volume based local Gabor binary patterns for face representation and recognition (SX, SS, XC, WG), pp. 1–4.

ICPR-2008-XuanSCTTL #image

Reversible binary image data hiding by run-length histogram modification (GX, YQS, PC, XT, JT, JL), pp. 1–4.

ICPR-2008-ZhaoG #multi #recognition #using

Establishing point correspondence using multidirectional binary pattern for face recognition (SZ, YG), pp. 1–4.

KDD-2008-GarrigaJM #matrix

Banded structure in binary matrices (GCG, EJ, HM), pp. 292–300.

CC-2008-WangYW #compilation #legacy #optimisation #transaction

Supporting Legacy Binary Code in a Software Transaction Compiler with Dynamic Binary Translation and Optimization (CW, VY, YW), pp. 291–306.

CGO-2008-SaxenaSP #fine-grained #performance

Efficient fine-grained binary instrumentationwith applications to taint-tracking (PS, RS, VP), pp. 74–83.

HPCA-2008-ChungDKK #memory management #thread #transaction #using

Thread-safe dynamic binary translation using transactional memory (JC, MD, HK, CK), pp. 279–289.

OSDI-2008-BansalA #using

Binary Translation Using Peephole Superoptimizers (SB, AA), pp. 177–192.

CAV-2008-KinderV #framework #named #static analysis

Jakstab: A Static Analysis Platform for Binaries (JK, HV), pp. 423–427.

CBSE-2007-Storm #composition #set

Binary Change Set Composition (TvdS), pp. 17–32.

PLDI-2007-NethercoteS #framework #named

Valgrind: a framework for heavyweight dynamic binary instrumentation (NN, JS), pp. 89–100.

CIAA-2007-KleinB07a

Accelerating Boyer Moore Searches on Binary Texts (STK, MBN), pp. 130–143.

DLT-2007-Frid

Commutation of Binary Factorial Languages (AEF), pp. 193–204.

ILC-2007-MehnertB #domain-specific language

A domain-specific language for manipulation of binary data in Dylan (HM, AB), p. 22.

KDD-2007-HeikinheimoSHMM #set

Finding low-entropy sets and trees from binary data (HH, JKS, EH, HM, TM), pp. 350–359.

SIGIR-2007-BordognaGMP #flexibility #image #retrieval

A flexible retrieval system of shapes in binary images (GB, LG, SM, MP), pp. 745–746.

MoDELS-2007-ChakiILWZ #modelling

Model-Driven Construction of Certified Binaries (SC, JI, PL, KCW, NZ), pp. 666–681.

MoDELS-2007-ChakiILWZ #modelling

Model-Driven Construction of Certified Binaries (SC, JI, PL, KCW, NZ), pp. 666–681.

GPCE-2007-SavgaR #evolution #framework

Refactoring-based support for binary compatibility in evolving frameworks (IS, MR), pp. 175–184.

SAC-2007-FernandesRR #optimisation

Stigmergic optimization in dynamic binary landscapes (CMF, VR, ACR), pp. 747–748.

CSL-2007-CarayolL #infinity #order

MSO on the Infinite Binary Tree: Choice and Order (AC, CL), pp. 161–176.

RTA-2007-HaemmerleF #confluence

Abstract Critical Pairs and Confluence of Arbitrary Binary Relations (RH, FF), pp. 214–228.

CASE-2006-SchiffG #automation #network #using

Automated Intruder Tracking using Particle Filtering and a Network of Binary Motion Sensors (JS, KG), pp. 580–587.

DATE-2006-MullerBJ #design #multi

ASIP-based multiprocessor SoC design for simple and double binary turbo decoding (OM, AB, MJ), pp. 1330–1335.

DRR-2006-WangZXWG #feature model #image #recognition #robust

Robust feature extraction for character recognition based on binary images (LW, LZ, YX, ZW, HG).

ITiCSE-2006-SchreyerW #automaton #finite #modelling #problem

Finite automata models for CS problem with binary semaphore (BS, WW), p. 330.

ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.

ICPR-v2-2006-ChengCLF

Bit-pairing Codification for Binary Pattern Projection System (JC, RC, EYL, KSMF), pp. 263–266.

ICPR-v2-2006-DhandraMHH #approach #detection #documentation #image

Skew Detection in Binary Image Documents Based on Image Dilation and Region labeling Approach (BVD, VSM, MH, RH), pp. 954–957.

ICPR-v2-2006-TangT #analysis #linear #performance #using

Fast Linear Discriminant Analysis Using Binary Bases (FT, HT), pp. 52–55.

ICPR-v2-2006-ZhangQSW #assessment #image #quality

Euclidean Quality Assessment for Binary Images (CZ, ZQ, DS, JW), pp. 300–303.

ICPR-v2-2006-ZhaoP #recognition

Local Binary Pattern Descriptors for Dynamic Texture Recognition (GZ, MP), pp. 211–214.

ICPR-v3-2006-BaudrierMNR #comparison #performance #quantifier

A fast binary-image comparison method with local-dissimilarity quantification (EB, GM, FN, SR), pp. 216–219.

ICPR-v3-2006-WangGZLZ #identification #using

Palmprint Identification using Boosting Local Binary Pattern (XW, HG, HZ, BL, ZZ), pp. 503–506.

ICPR-v4-2006-ShanZSCG06a #recognition

Ensemble of Piecewise FDA Based on Spatial Histograms of Local (Gabor) Binary Patterns for Face Recognition (SS, WZ, YS, XC, WG), pp. 606–609.

KDD-2006-LoekitoB #diagrams #mining #performance #using

Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams (EL, JB), pp. 307–316.

CC-2006-GuoWWBOVCA #ambiguity #memory management #runtime

Selective Runtime Memory Disambiguation in a Dynamic Binary Translator (BG, YW, CW, MJB, GO, NV, JC, DIA), pp. 65–79.

CGO-2006-LiZXH #optimisation

Optimizing Dynamic Binary Translation for SIMD Instructions (JL, QZ, SX, BH), pp. 269–280.

CGO-2006-NandaLLC #named #runtime #using

BIRD: Binary Interpretation using Runtime Disassembly (SN, WL, LCL, TcC), pp. 358–370.

HPDC-2006-LuCG #framework #xml

Building a Generic SOAP Framework over Binary XML (WL, KC, DG), pp. 195–204.

SAT-2006-SamulowitzB #reasoning

Binary Clause Reasoning in QBF (HS, FB), pp. 353–367.

ASE-2005-Dolstra #deployment

Secure sharing between untrusted users in a transparent source/binary deployment model (ED), pp. 154–163.

DAC-2005-BeckC #configuration management

Dynamic reconfiguration with binary translation: breaking the ILP barrier with software compatibility (ACSB, LC), pp. 732–737.

DATE-2005-SchnerrBR #agile #prototype #simulation

Cycle Accurate Binary Translation for Simulation Acceleration in Rapid Prototyping of SoCs (JS, OB, WR), pp. 792–797.

DATE-2005-YangHSP #logic #multi #quantum #synthesis #using

Exact Synthesis of 3-Qubit Quantum Circuits from Non-Binary Quantum Gates Using Multiple-Valued Logic and Group Theory (GY, WNNH, XS, MAP), pp. 434–435.

DocEng-2005-SimskeLA #classification #image #statistics

A statistical method for binary classification of images (SJS, DL, JSA), pp. 127–129.

ICDAR-2005-ChaYT #metric #on the #recognition #similarity

On Binary Similarity Measures for Handwritten Character Recognition (SHC, SY, CCT), pp. 4–8.

ICDAR-2005-ShivakumaraKVRN #documentation #estimation #image #using #word

A New Moments based Skew Estimation Technique using Pixels in the Word for Binary Document Images (PS, GHK, HSV, SR, MRRN), pp. 151–156.

ICDAR-2005-YosefBKD #image #using

Extraction of Specified Objects from Binary Images Using Object Based Erosion Transform: Application to Hebrew Calligraphic Manuscripts (IBY, IB, KK, ID), pp. 878–882.

PASTE-2005-ChristodorescuKG #analysis #string

String analysis for x86 binaries (MC, NK, WHG), pp. 88–95.

CIAA-2005-VielhaberC #infinity #on the #set #transducer

On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.

DLT-2005-Saari #on the #sequence

On the Frequency of Letters in Pure Binary Morphic Sequences (KS), pp. 397–408.

ICEIS-v1-2005-RisheBCVGSW #encoding #semantics

Object ID Distribution and Encoding in the Semantic Binary Engine (NR, AB, MC, DV, SG, SS, OW), pp. 279–284.

KDD-2005-Li #clustering

A general model for clustering binary data (TL), pp. 188–197.

MLDM-2005-KoK #classification #on the

On ECOC as Binary Ensemble Classifiers (JK, EK), pp. 1–10.

SEKE-2005-LoYT #algorithm #mining #predict

Weighted Binary Sequential Mining Algorithm with Application to the Next-Day Appearance Prediction (SL, JY, FCT), pp. 783–782.

SAC-2005-FurfaroMSS #multi

Hierarchical binary histograms for summarizing multi-dimensional data (FF, GMM, DS, CS), pp. 598–603.

ICSE-2005-TilevichS #refactoring

Binary refactoring: improving code behind the scenes (ET, YS), pp. 264–273.

DAC-2004-MittalZTB #automation

Automatic translation of software binaries onto FPGAs (GM, DZ, XT, PB), pp. 389–394.

DATE-v2-2004-JabirP #diagrams #multi #named #representation

MODD: A New Decision Diagram and Representation for Multiple Output Binary Functions (AMJ, DKP), pp. 1388–1389.

DATE-v2-2004-ShoganC

Compact Binaries with Code Compression in a Software Dynamic Translator (SS, BRC), pp. 1052–1059.

DRR-2004-ZhangSH #image #retrieval #using #word

Word image retrieval using binary features (BZ, SNS, CH), pp. 45–53.

ITiCSE-2004-Waraich #education #logic #using

Using narrative as a motivating device to teach binary arithmetic and logic gates (AW), pp. 97–101.

ESOP-2004-GustafssonS #adaptation #pattern matching

Adaptive Pattern Matching on Binary Data (PG, KFS), pp. 124–139.

SCAM-2004-LakhotiaK #detection #obfuscation #stack

Abstracting Stack to Detect Obfuscated Calls in Binaries (AL, EUK), pp. 17–26.

PLDI-2004-WhaleyL #alias #analysis #diagrams #pointer #using

Cloning-based context-sensitive pointer alias analysis using binary decision diagrams (JW, MSL), pp. 131–144.

CIAA-2004-CampeanuP #automaton #bound #nondeterminism

Tight Bounds for NFA to DFCA Transformations for Binary Alphabets (CC, AP), pp. 306–307.

ICPR-v3-2004-JuanV #image #modelling

Bernoulli Mixture Models for Binary Images (AJ, EV), pp. 367–370.

ICPR-v4-2004-BelkhoucheQGJ #2d #image #using

Binary Image Transformation Using Two-Dimensional Chaotic Maps (FB, UQ, IG, DJ), pp. 823–826.

ICPR-v4-2004-LiuC #adaptation #image

An Adaptive Data Hiding Technique for Binary Images (THL, LWC), pp. 831–834.

ICPR-v4-2004-ViswanathMB #classification #nearest neighbour #pattern matching #pattern recognition #performance #recognition #synthesis

A Pattern Synthesis Technique with an Efficient Nearest Neighbor Classifier for Binary Pattern Recognition (PV, MNM, SB), pp. 416–419.

ICPR-v4-2004-YuWT04a #image

Steganalysis of Data Hiding in Binary Images (XY, YW, TT), pp. 877–880.

ICPR-v4-2004-ZhangS #difference #metric

Discovery of the Tri-Edge Inequality with Binary Vector Dissimilarity Measures (BZ, SNS), pp. 669–672.

OOPSLA-2004-GueheneucA #uml

Recovering binary class relationships: putting icing on the UML cake (YGG, HAA), pp. 301–314.

LOPSTR-2004-SerebrenikM #on the #source code #termination

On Termination of Binary CLP Programs (AS, FM), pp. 231–244.

ICSE-2004-ZhangGZ #diagrams #dynamic analysis #order #performance #slicing #using

Efficient Forward Computation of Dynamic Slices Using Reduced Ordered Binary Decision Diagrams (XZ, RG, YZ), pp. 502–511.

CGO-2004-HuS #using

Using Dynamic Binary Translation to Fuse Dependent Instructions (SH, JES), pp. 213–226.

CGO-2004-WuBQEF #predict

The Accuracy of Initial Prediction in Two-Phase Dynamic Binary Translators (YW, MBJ, JQ, OE, JF), pp. 227–238.

LCTES-2004-BusSPCB #optimisation

Link-time optimization of ARM binaries (BDB, BDS, LVP, DC, KDB), pp. 211–220.

LCTES-2004-LiX #compilation #energy #framework

A trace-based binary compilation framework for energy-aware computing (LL, JX), pp. 95–106.

SAT-2004-NishimuraRS #detection #set

Detecting Backdoor Sets with Respect to Horn and Binary Clauses (NN, PR, SS), pp. 96–103.

ASE-2003-GueheneucA

A Pragmatic Study of Binary Class Relationships (YGG, HAA), pp. 277–280.

DAC-2003-QinM #automation #performance #synthesis

Automated synthesis of efficient binary decoders for retargetable software toolkits (WQ, SM), pp. 764–769.

DATE-2003-JiangMB #algebra #multi

Reducing Multi-Valued Algebraic Operations to Binary (JHRJ, AM, RKB), pp. 10752–10757.

DATE-2003-LaiYC #evaluation #performance

A New and Efficient Congestion Evaluation Model in Floorplanning: Wire Density Control with Twin Binary Trees (STWL, EFYY, CCNC), pp. 10856–10861.

DRR-2003-ZhangS #difference #identification #metric

Binary vector dissimilarity measures for handwriting identification (BZ, SNS), pp. 28–38.

ICDAR-2003-ChaTS #algorithm #optimisation #recognition #search-based #similarity #using

Optimizing Binary Feature Vector Similarity Measure using Genetic Algorithm and Handwritten Character Recognition (SHC, CCT, SNS), pp. 662–665.

ICDAR-2003-LeeO #classification #multi #problem

Binary Classification Trees for Multi-class Classification Problems (JSL, ISO), pp. 770–774.

ITiCSE-2003-Kruse #approach #representation

“Magic numbers” approach to introducing binary number representation in CSO (GK), p. 272.

SCAM-2003-KissJLG #bytecode #interprocedural #slicing

Interprocedural Static Slicing of Binary Executables (ÁK, JJ, GL, TG), p. 118–?.

CIAA-2003-Zijl #regular expression

Succinct Descriptions of Regular Languages with Binary +-NFAs (LvZ), pp. 72–82.

ECIR-2003-DejunM #categorisation

Chinese Text Categorization Based on the Binary Weighting Model with Non-binary Smoothing (XD, MS), pp. 408–419.

SEKE-2003-LiWQ #algorithm #performance #recognition

A Fast Binary Tree Based Face Recognition Algorithm (HL, SW, FQ), pp. 594–598.

SAC-2003-TakeuchiIH #parallel

An Improvement on Binary-Swap Compositing for Sort-Last Parallel Rendering (AT, FI, KH), pp. 996–1002.

CC-2003-BurrowsFW #runtime #source code #type checking

Run-Time Type Checking for Binary Programs (MB, SNF, JLW), pp. 90–105.

CGO-2003-KimS #architecture

Dynamic Binary Translation for Accumulator-Oriented Architectures (HSK, JES), pp. 25–35.

CGO-2003-MaratheMMSMY #memory management #metric #named

METRIC: Tracking Down Inefficiencies in the Memory Hierarchy via Binary Rewriting (JM, FM, TM, BRdS, SAM, AY), pp. 289–300.

DAC-2002-AbbaspourZ

Retargetable binary utilities (MA, JZ), pp. 331–336.

DATE-2002-KapurWM #logic

Directed-Binary Search in Logic BIST Diagnostics (RK, TWW, MRM), p. 1121.

WCRE-2002-ProbstKS #analysis #liveness #optimisation

Register Liveness Analysis for Optimizing Dynamic Binary Translation (MP, AK, BS), pp. 35–44.

WCRE-2002-TrogerC #analysis

Analysis of Virtual Method Invocation for Binary Translation (JT, CC), p. 65–?.

PLDI-2002-LiaoWWSHL #adaptation

Post-Pass Binary Adaptation for Software-Based Speculative Precomputation (SWL, PHW, HW, JPS, GH, DML), pp. 117–128.

DLT-2002-Holub #set #similarity

A Unique Structure of Two-Generated Binary Equality Sets (SH), pp. 245–257.

ICPR-v2-2002-FrantiX #classification #using

Classification of Binary Vectors by Using ??SC-Distance (PF, MX), pp. 52–55.

ICPR-v3-2002-SongCLC02a #image #recognition

Graphics Recognition from Binary Images: One Step or Two Steps (JS, MC, MRL, SC), pp. 135–138.

ICPR-v4-2002-LuWKS #documentation #image #visual notation

An Objective Distortion Measure for Binary Document Images Based on Human Visual Perceptio (HL, JW, ACK, YQS), pp. 239–242.

GPCE-2002-Back #named #scripting language #specification

DataScript — A Specification and Scripting Language for Binary Data (GB), pp. 66–77.

POPL-2002-ShaoSTP #type system

A type system for certified binaries (ZS, BS, VT, NP), pp. 217–232.

SAC-2002-NascimentoC #image #retrieval #using

Color-based image retrieval using binary signatures (MAN, VC), pp. 687–692.

SAT-2002-Gelder #reasoning #satisfiability #towards

Toward leaner binary-clause reasoning in a satisfiability solver (AVG), p. 16.

DATE-2001-LiuWHL #diagrams

Binary decision diagram with minimum expected path length (YYL, KHW, TH, CLL), pp. 708–712.

DATE-2001-RedaS #diagrams #equivalence #satisfiability #using

Combinational equivalence checking using Boolean satisfiability and binary decision diagrams (SR, AS), pp. 122–126.

DATE-2001-UbarJP #diagrams #simulation

Timing simulation of digital circuits with binary decision diagrams (RU, AJ, ZP), pp. 460–466.

ICDAR-2001-BogushMAUK #correlation #image #matrix #performance

An Efficient Correlation Computation Method for Binary Images Based on Matrix Factorisation (RB, SM, SA, SU, SiK), pp. 312–316.

ICDAR-2001-GatosP #image #performance #segmentation #set

Applying Fast Segmentation Techniques at a Binary Image Represented by a Set of Non-Overlapping Blocks (BG, NP), pp. 1147–1153.

IWPC-J-1999-CifuentesE01

Recovery of jump table case statements from binary code (CC, MVE), pp. 171–188.

ICALP-2001-Roura

A New Method for Balancing Binary Search Trees (SR), pp. 469–480.

CIKM-2001-GohCC #classification #image

SVM Binary Classifier Ensembles for Image Classification (KG, EYC, KTC), pp. 395–402.

CIKM-2001-HuangPC #mobile #on-demand

Binary Interpolation Search for Solution Mapping on Broadcast and On-demand Channels in a Mobile Computing Environment (JLH, WCP, MSC), pp. 434–441.

SIGIR-2001-ArampatzisH #adaptation #classification #optimisation

The Score-Distributional Threshold Optimization for Adaptive Binary Classification Tasks (AA, AvH), pp. 285–293.

POPL-2001-Vouillon #calculus

Combining subsumption and binary methods: an object calculus with views (JV), pp. 290–303.

ICSE-2001-CampaillaCCJV #performance #using

Efficient Filtering in Publish-Subscribe Systems Using Binary Decision (AC, SC, EMC, SJ, HV), pp. 443–452.

LCTES-OM-2001-Theiling #generative

Generating Decision Trees for Decoding Binaries (HT), pp. 112–120.

CAV-2001-Dang #analysis #automaton #reachability

Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks (ZD), pp. 506–518.

LICS-2001-ArnoldLM #infinity #monad

The Hierarchy inside Closed Monadic Σ₁ Collapses on the Infinite Binary Tree (AA, GL, JM), pp. 157–166.

HT-2000-Calvi #hypermedia #question

Text and hypertext: always a binary relationship? (LC), pp. 218–219.

CSMR-2000-CifuentesS #abstraction

Procedure Abstraction Recovery from Binary Code (CC, DS), pp. 55–64.

WCRE-2000-UngC #re-engineering #runtime

Dynamic Re-engineering of Binary Code with Run-time Feedbacks (DU, CC), pp. 2–10.

ICML-2000-AllweinSS #approach #classification #multi

Reducing Multiclass to Binary: A Unifying Approach for Margin Classifiers (ELA, RES, YS), pp. 9–16.

ICPR-v1-2000-Wingbermuhle #modelling #robust

Robust Registration of Coarse Binary Volume Models (JW), p. 1999–?.

ICPR-v2-2000-BajaS #3d #distance #editing #image #using

Editing 3D Binary Images Using Distance Transforms (GSdB, SS), pp. 6030–6033.

ICPR-v2-2000-KabanG #clustering #documentation

Initialized and Guided EM-Clustering of Sparse Binary Data with Application to Text Based Documents (AK, MG), pp. 2744–2747.

ICPR-v3-2000-MaenpaaOPM #classification #robust #set

Robust Texture Classification by Subsets of Local Binary Patterns (TM, TO, MP, MS), pp. 3947–3950.

ICPR-v3-2000-MaenpaaPO #classification #multi

Texture Classification by Multi-Predicate Local Binary Pattern Operators (TM, MP, TO), pp. 3951–3954.

SAIG-2000-KaminCC #component #generative #lightweight

Lightweight and Generative Components 2: Binary-Level Components (SNK, MC, LC), pp. 28–50.

SAC-2000-MarchioriS #algorithm #constraints #problem #random #search-based

A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems (EM, AGS), pp. 458–462.

CAV-2000-DangIBKS #analysis #automaton #reachability

Binary Reachability Analysis of Discrete Pushdown Timed Automata (ZD, OHI, TB, RAK, JS), pp. 69–84.

CL-2000-HolldoblerS #calculus #diagrams #problem #using

Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.

CL-2000-HruzaS #logic programming #source code

Binary Speed Up for Logic Programs (JH, PS), pp. 116–130.

CSL-2000-Esik #axiom #fixpoint

Axiomatizing the Least Fixed Point Operation and Binary Supremum (ZÉ), pp. 302–316.

RTA-2000-DoughertyG #normalisation #reduction

Normal Forms and Reduction for Theories of Binary Relations (DJD, CG), pp. 95–109.

DATE-1999-ThorntonWDD #diagrams #order #using

Variable Reordering for Shared Binary Decision Diagrams Using Output Probabilities (MAT, JPW, RD, ND), pp. 758–759.

ICDAR-1999-MaY #documentation #estimation #image

An Enhanced Skew Angle Estimation Technique for Binary Document Images (HM, ZY), pp. 165–168.

IWPC-1999-CifuentesE

Recovery of Jump Table Case Statements from Binary Code (CC, MVE), pp. 192–199.

WCRE-1999-Cifuentes #development #reverse engineering

The Impact of Copyright on the Development of Cutting Edge Binary Reverse Engineering Technology (CC), pp. 66–76.

WCRE-1999-CifuentesER #design

The Design of a Resourceable and Retargetable Binary Translator (CC, MVE, NR), pp. 280–291.

SAS-1999-Mauborgne #graph

Binary Decision Graphs (LM), pp. 101–116.

WIA-1999-Eramian #image

Computing Entropy Maps of Finite-Automaton-Encoded Binary Images (MGE), pp. 81–90.

CIKM-1999-DelisH #information management #representation #string

Binary String Relations: A Foundation for Spatiotemporal Knowledge Representation (VD, TH), pp. 27–37.

MLDM-1999-AizenbergAK #algorithm #image #learning #multi #recognition

Multi-valued and Universal Binary Neurons: Learning Algorithms, Application to Image Processing and Recognition (INA, NNA, GAK), pp. 21–35.

TOOLS-USA-1999-MeziniPDB #detection #evolution #java

Detecting Evolution Incompatibilities by Analyzing Java Binaries (MM, JUP, TD, WB), pp. 126–135.

LICS-1999-DrossopoulouEW #calculus #compilation #towards

A Fragment Calculus — Towards a Model of Separate Compilation, Linking and Binary Compatibility (SD, SE, DW), pp. 147–156.

DAC-1998-RaviMSS #approximate #composition #diagrams

Approximation and Decomposition of Binary Decision Diagrams (KR, KLM, TRS, FS), pp. 445–450.

VLDB-1998-MorimotoFMTY #algorithm #category theory #database #mining

Algorithms for Mining Association Rules for Binary Segmentations of Huge Categorical Databases (YM, TF, HM, TT, KY), pp. 380–391.

WIA-1998-MichonC #automaton #diagrams

Automata and Binary Decision Diagrams (JFM, JMC), pp. 178–182.

ICFP-1998-FinneLMJ #haskell #interface #named

H/Direct: A Binary Foreign Language Interface for Haskell (SF, DL, EM, SLPJ), pp. 153–162.

ICPR-1998-ChenC #network #performance #recursion #representation

Recursive representation and progressive display of binary objects for efficient network browsing (IPC, ZC), pp. 395–399.

ICPR-1998-TakacsW #image #library #metric #performance #using

Fast searching of digital face libraries using binary image metrics (BT, HW), pp. 1235–1237.

ECOOP-1998-KellerH #adaptation #component

Binary Component Adaptation (RK, UH), pp. 307–329.

OOPSLA-1998-DrossopoulouWE #java #question #what

What is Java Binary Compatibility? (SD, DW, SE), pp. 341–361.

ASPLOS-1998-Le #execution #runtime

An Out-of-Order Execution Technique for Runtime Binary Translators (BCL), pp. 151–158.

ISMM-1998-WallaceR #functional #lazy evaluation

The Bits Between The Lambdas: Binary Data in a Lazy Functional Language (MW, CR), pp. 107–117.

CADE-1998-HortonS #canonical #named #process #rank

Rank/Activity: A Canonical Form for Binary Resolution (JDH, BS), pp. 412–426.

ICSM-1997-CifuentesF #bytecode #slicing

Intraprocedural Static Slicing of Binary Executables (CC, AF), p. 188–?.

PLDI-1997-Webber #program analysis #using

Program Analysis Using Binary Relations (ABW), pp. 249–260.

DLT-1997-LitovskyP #on the

On a Binary Zigzag Operation (IL, BP), pp. 273–289.

ICALP-1997-Robson #on the

On the Concentration of the Height of Binary Search Trees (JMR), pp. 441–448.

HCI-SEC-1997-MurraySKK #feedback

Getting a Grip: Touch Feedback with Binary Stimulators (AMM, KBS, RLK, PKK), pp. 913–916.

SAC-1997-KaiserLMGP #algorithm #hybrid #predict #search-based

Polypeptide structure prediction: real-value versus binary hybrid genetic algorithms (CEK, GBL, LDM, GHGJ, RP), pp. 279–286.

SAC-1997-Shen

The average diameter of binary tree structures (ZS), pp. 40–44.

RWLW-1996-Castro #csp #using

Solving binary CSP using computational systems (CC), pp. 246–265.

ICSM-1996-CifuentesM #question

Binary Translation: Static, Dynamic, Retargetable? (CC, VMM), pp. 340–349.

WCRE-1996-Cifuentes #automation #reverse engineering

Partial Automation of an Integrated Reverse Engineering Environment of Binary Code (CC), pp. 50–56.

IFL-1996-DoschM #functional

Calculating a Functional Module for Binary Search Trees (WD, BM), pp. 267–284.

ICPR-1996-AizenbergAK #image #learning #multi #network #pattern matching #pattern recognition #recognition

Multi-valued and universal binary neurons: mathematical model, learning, networks, application to image processing and pattern recognition (NNA, INA, GAK), pp. 185–189.

ICPR-1996-BorgeforsB #multi

Multiresolution skeletonization in binary pyramids (GB, GSdB), pp. 570–574.

ICPR-1996-ChaiZZS #algorithm #linear #search-based

Binary linear decision tree with genetic algorithm (BBC, XZ, YZ, JS), pp. 530–534.

ICPR-1996-ChenY #symmetry #using #visual notation

Thinning noisy binary patterns using human visual symmetry (YSC, YTY), pp. 146–150.

ICPR-1996-LeTW #adaptation #automation #detection #documentation #image #segmentation

Automated borders detection and adaptive segmentation for binary document images (DXL, GRT, HW), pp. 737–741.

ICPR-1996-RegazzoniF #statistics

Properties of binary statistical morphology (CSR, GLF), pp. 631–635.

ICPR-1996-Yoshii96a

Binary PACT (HY), pp. 606–610.

ICPR-1996-YuY #algorithm #image #performance

An efficient algorithm for smoothing binary image contours (DY, HY), pp. 403–407.

KDD-1996-KnobbeA

Analysing Binary Associations (AJK, PWA), pp. 311–314.

FSE-1996-DamonJJ #diagrams #relational #specification

Checking Relational Specifications With Binary Decision Diagrams (CD, DJ, SJ), pp. 70–80.

ICSE-1996-Kaindl #domain model #how #identification #modelling

How to Identify Binary Relations for Domain Models (HK), pp. 28–36.

DAC-1995-BryantC #diagrams #verification

Verification of Arithmetic Circuits with Binary Moment Diagrams (REB, YAC), pp. 535–541.

ICDAR-v2-1995-BraunCGM #image #preprocessor

Preprocessing raw binary images by means of contours (AB, TC, JMG, EM), pp. 640–643.

ICDAR-v2-1995-FanCW #approach #image

A new vectorization-based approach to the skeletonization of binary images (KCF, DFC, MGW), pp. 627–630.

DLT-1995-Mitrana #self #sequence

Binary Self-Adding Sequences (VM), pp. 64–70.

ICML-1995-AbeLN #2d #algorithm #learning #online #using

On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms (NA, HL, AN), pp. 3–11.

OOPSLA-1995-FormanCDR

Release-to-Release Binary Compatibility in SOM (IRF, MHC, SD, LKR), pp. 426–438.

SAC-1995-Sabin #generative #linear #parallel

The use of parallelization in the generation of binary linear codes (RES), pp. 215–220.

SAC-1995-TarauDB #empirical #power of #prolog

The power of partial tanslation: an experiment with the C-ification of binary Prolog (PT, BD, KDB), pp. 152–156.

CIKM-1994-ChenH #algorithm #graph #linear #source code #traversal

An Optimal Graph Traversal Algorithm for Evaluating Linear Binary-Chain Programs (YC, TH), pp. 34–41.

CADE-1994-Salzer #unification

Primal Grammars and Unification Modulo a Binary Clause (GS), pp. 282–295.

CIKM-1993-SongJ

Binary Relationship Imposition Rules on Ternary Relationships (IYS, THJ), pp. 57–66.

ILPS-1993-DevienneLR #decidability #horn clause #problem #recursion

The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable (PD, PL, JCR), pp. 250–265.

ILPS-1993-Tarau #continuation #performance #source code

An Efficient Specialization of the WAM for Continuation Passing Binary Programs (PT), p. 652.

DAC-1992-LaiS #diagrams #multi #verification

Edge-Valued Binary Decision Diagrams for Multi-Level Hierarchical Verification (YTL, SS), pp. 608–613.

DAC-1992-PixleyJH #diagrams #sequence

Exact Calculation of Synchronization Sequences Based on Binary Decision Diagrams (CP, SWJ, GDH), pp. 620–623.

LOPSTR-1992-Demoen #on the #performance #prolog

On the Transformation of a Prolog Program to a More Efficient Binary Program (BD), pp. 242–252.

LICS-1992-Pratt #calculus

Origins of the Calculus of Binary Relations (VRP), pp. 248–254.

DAC-1991-ButlerRKM #diagrams #heuristic #order #performance

Heuristics to Compute Variable Orderings for Efficient Manipulation of Ordered Binary Decision Diagrams (KMB, DER, RK, MRM), pp. 417–420.

PODS-1991-NurmiS

Uncoupling Updating and Rebalancing in Chromatic Binary Search Trees (ON, ESS), pp. 192–198.

CAiSE-1991-Troyer #concept #object-oriented

The OO-Binary Relationship Model: A Truly Object Oriented Conceptual Model (ODT), pp. 561–578.

DAC-1990-IshiuraDY #diagrams #simulation #using

Coded Time-Symbolic Simulation Using Shared Binary Decision Diagram (NI, YD, SY), pp. 130–135.

DAC-1990-MinatoIY #diagrams #performance

Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean function Manipulation (SiM, NI, SY), pp. 52–57.

DAC-1990-SatoYMF #diagrams

Boolean Resubstitution with Permissible Functions and Binary Decision Diagrams (HS, YY, YM, MF), pp. 284–289.

STOC-1990-SundarT #sequence #set

Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences (RS, RET), pp. 18–25.

ICALP-1990-Choffrut #decidability

Iterated Substitutions and Locally Catanative Systems: A Decidability Result in the Binary Case (CC), pp. 490–500.

ML-1989-CaruanaSE #algorithm #bias #induction #multi #search-based #using

Using Multiple Representations to Improve Inductive Bias: Gray and Binary Coding for Genetic Algorithms (RC, JDS, LJE), pp. 375–378.

ML-1988-CaruanaS #algorithm #bias #representation #search-based

Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms (RC, JDS), pp. 153–161.

ML-1988-Segen88a #concept

Conceptual Clumping of Binary Vectors with Occam’s Razor (JS), pp. 47–53.

CADE-1988-Rabinov #strict

A Restriction of Factoring in Binary Resolution (AR), pp. 582–591.

DAC-1987-FriedmanS #diagrams

Finding the Optimal Variable Ordering for Binary Decision Diagrams (SJF, KJS), pp. 358–356.

PODS-1987-Dechter

Decomposing an N-ary Relation into a Tree of Binary Relations (RD), pp. 185–189.

ICALP-1987-HaferT #logic #monad #quantifier

Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree (TH, WT), pp. 269–279.

ICALP-1987-LevcopoulosLS #geometry #heuristic

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract) (CL, AL, JRS), pp. 376–385.

ICALP-1986-BrzozowskiS #analysis #network #simulation #summary

Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary) (JAB, CJHS), pp. 69–78.

GG-1986-CarlyleGP #complexity #generative #parallel

Complexity of pattern generation via planar parallel binary fission/fusion grammars (JWC, SAG, AP), pp. 515–533.

SIGIR-1986-YuL #independence

Non-Binary Independence Model (CTY, TCL), pp. 265–268.

STOC-1985-Culberson

The Effect of Updates in Binary Search Trees (JCC), pp. 205–212.

ICALP-1985-Keranen #morphism #on the #word

On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.

SIGIR-1984-AzmoodehLS #semantics

The Semantic Binary Relationship Model of Information (MKA, SHL, MS), pp. 133–151.

DAC-1983-MetosO #diagrams #implementation #physics

Binary Decision Diagrams: From abstract representations to physical implementations (JSM, JVO), pp. 567–570.

PODS-1983-MunroP #reduction #robust

A Discipline for Robustness or Storage Reduction in Binary Search Trees (JIM, PVP), pp. 70–75.

STOC-1983-SleatorT #self

Self-Adjusting Binary Trees (DDS, RET), pp. 235–245.

ICALP-1983-LescanneS #case study #data type #on the

On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.

ICALP-1982-Karhumaki #equivalence #on the #problem

On the Equivalence Problem for Binary DOL Systems (JK), pp. 339–347.

STOC-1981-HawrusikVY

Classes of Functions for Computing on Binary Trees (Extended Abstract) (FMH, KNV, AY), pp. 19–27.

STOC-1981-HongR #graph

Graphs that Are Almost Binary Trees (Preliminary Version) (JWH, ALR), pp. 334–341.

STOC-1981-PatersonRS #bound

Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.

STOC-1980-BrentK #complexity

The Chip Complexity of Binary Arithmetic (RPB, HTK), pp. 190–200.

ICALP-1979-Kemp #distributed #on the #stack

On the Average Stack Size of Regularly Distributed Binary Trees (RK), pp. 340–355.

VLDB-1978-KungL #concurrent #database #problem

A Concurrent Database Manipulation Problem: Binary Search Trees (Abstract) (HTK, PLL), p. 498.

STOC-1978-RivestMKWS #fault

Coping with Errors in Binary Search Procedures (Preliminary Report) (RLR, ARM, DJK, KW, JS), pp. 227–232.

VLDB-1977-KambayashiTY #relational

A Relational Data Language with Simplified Binary Relation Handling Capability (YK, KT, SY), pp. 338–350.

ICALP-1977-Mehlhorn

Dynamic Binary Search (KM), pp. 323–336.

ICALP-1977-Takahashi

Rational relations of Binary Trees (MT), pp. 524–538.

ICALP-1976-Valiant #decidability #equivalence #problem

The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.

VLDB-1975-LienTDR #implementation #towards

Binary Search Tree Complex — Towards the Implementation of Relations (YEL, CET, JRD, MLR), pp. 540–542.

STOC-1974-DobkinL #on the

On Some Generalizations of Binary Search (DPD, RJL), pp. 310–316.

SIGFIDET-1972-Nievergelt

Binary Search Trees and File Organization (JN), pp. 165–187.

STOC-1972-NievergeltR #bound

Binary Search Trees of Bounded Balance (JN, EMR), pp. 137–142.

SIGFIDET-1971-Bayer #memory management

Binary B-Trees for Virtual Memory (RB), pp. 219–235.

SIGFIDET-1970-Martin

Information Compressing Procedures for Storing Binary Relations (JJM), pp. 142–173.