Stem simpl$ (all stems)

488 papers:

VLDB-2015-SchuhknechtKD #clustering #on the

On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning (FMS, PK, JD), pp. 934–937.

FASE-2015-KnappMRG #state machine #uml

An Institution for Simple UML State Machines (AK, TM, MR, MG), pp. 3–18.

TACAS-2015-UnnoT #horn clause #recursion

Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling (HU, TT), pp. 149–163.

ICPC-2015-MartinCAA #analysis #empirical #open source

Make it simple: an empirical analysis of GNU make feature use in open source projects (DHM, JRC, BA, GA), pp. 207–217.

SAS-2015-MonniauxA #abstraction #array

A Simple Abstraction of Arrays and Maps by Program Translation (DM, FA), pp. 217–234.

STOC-2015-KawarabayashiT #graph

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.

ICALP-v2-2015-DahlgaardKR

A Simple and Optimal Ancestry Labeling Scheme for Trees (SD, MBTK, NR), pp. 564–574.

ICFP-2015-SchererR #question

Which simple types have a unique inhabitant? (GS, DR), pp. 243–255.

CHI-2015-HongHIL #named

SplitBoard: A Simple Split Soft Keyboard for Wristwatch-sized Touch Screens (JH, SH, PI, GL), pp. 1233–1236.

HCI-IT-2015-EskerudSOH #approach #automation #design #interface

Controlling the Home — A User Participatory Approach to Designing a Simple Interface for a Complex Home Automation System (ME, AS, CSO, HH), pp. 717–728.

ICEIS-v3-2015-VolpentestaF #interactive #modelling #smarttech

Modeling NFC-triggered User Interactions with Simple Services in a Smart Environment (APV, NF), pp. 96–104.

ICML-2015-CarpentierV #infinity

Simple regret for infinitely many armed bandits (AC, MV), pp. 1133–1141.

ICML-2015-Romera-ParedesT #approach #learning

An embarrassingly simple approach to zero-shot learning (BRP, PHST), pp. 2152–2161.

SIGIR-2015-Al-Dhelaan #graph #multi #named #summary

StarSum: A Simple Star Graph for Multi-document Summarization (MAD), pp. 715–718.

ECOOP-2015-Chevalier-Boisvert #effectiveness #lazy evaluation #version control

Simple and Effective Type Check Removal through Lazy Basic Block Versioning (MCB, MF), pp. 101–123.

POPL-2015-Chlipala #named #programming #web

Ur/Web: A Simple Model for Programming the Web (AC), pp. 153–165.

ICSE-v1-2015-MechtaevYR #named #program repair

DirectFix: Looking for Simple Program Repairs (SM, JY, AR), pp. 448–458.

ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #performance #scalability

Trivial Compiler Equivalence: A Large Scale Empirical Study of a Simple, Fast and Effective Equivalent Mutant Detection Technique (MP, YJ, MH, YLT), pp. 936–946.

HPCA-2015-BeckmannS #named #performance

Talus: A simple way to remove cliffs in cache performance (NB, DS), pp. 64–75.

HPCA-2015-RosDK #classification #clustering #performance

Hierarchical private/shared classification: The key to simple and efficient coherence for clustered cache hierarchies (AR, MD, SK), pp. 186–197.

CSL-2015-Mazza

Simple Parsimonious Types and Logarithmic Space (DM), pp. 24–40.

RTA-2015-LepperW #performance #towards

A Simple and Efficient Step Towards Type-Correct XSLT Transformations (ML, BTyW), pp. 350–364.

SAT-2015-KullmannM #query

Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.

CASE-2014-LiCW #policy #robust

A robust (r, Q) policy for a simple VMI system with inventory inaccuracy and time-delay (ML, FTSC, ZW), pp. 652–657.

DAC-2014-GottschoBDNG #capacity #energy #fault tolerance #scalability

Power / Capacity Scaling: Energy Savings With Simple Fault-Tolerant Caches (MG, AB, ND, AN, PG), p. 6.

DATE-2014-KumarYBT #distributed #effectiveness #named

COOLIP: Simple yet effective job allocation for distributed thermally-throttled processors (PK, HY, IB, LT), pp. 1–4.

DATE-2014-SchollPDA #linear

Simple interpolants for linear arithmetic (CS, FP, SD, EA), pp. 1–6.

TFPIE-2014-Ragde

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

ICSME-2014-AsaduzzamanRSH #code completion #named #performance

CSCC: Simple, Efficient, Context Sensitive Code Completion (MA, CKR, KAS, DH), pp. 71–80.

STOC-2014-Goodrich #algorithm #sorting

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.

ICALP-v1-2014-TalwarW #proving

Balanced Allocations: A Simple Proof for the Heavily Loaded Case (KT, UW), pp. 979–990.

ICALP-v2-2014-OuaknineW #linear #on the #problem #sequence

On the Positivity Problem for Simple Linear Recurrence Sequences, (JO, JW), pp. 318–329.

ICALP-v2-2014-OuaknineW14a #decidability #linear #sequence

Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences (JO, JW), pp. 330–341.

HCI-AIMT-2014-VaidyanathanR #case study #comparative #gesture #interactive #using

“Will Use It, Because I Want to Look Cool” A Comparative Study of Simple Computer Interactions Using Touchscreen and In-Air Hand Gestures (VV, DR), pp. 170–181.

CIKM-2014-AlgarniMBN

Simple Arabic Stemmer (MA, BM, TB, KN), pp. 1803–1806.

ECIR-2014-BastH #information management

More Informative Open Information Extraction via Simple Inference (HB, EH), pp. 585–590.

ICML-c2-2014-AgarwalHKLLS #algorithm #performance

Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits (AA, DH, SK, JL, LL, RES), pp. 1638–1646.

ICPR-2014-HeDY0PJ #multi #random #using #visual notation

Visual Tracking Using Multi-stage Random Simple Features (YH, ZD, MY, LC, MP, YJ), pp. 4104–4109.

KDD-2014-ChengB0 #approach #dependence #effectiveness #named

FBLG: a simple and effective approach for temporal dependence discovery from time series data (DC, MTB, YL), pp. 382–391.

KDIR-2014-SatoNS #classification #kernel #using

A Simple Classification Method for Class Imbalanced Data using the Kernel Mean (YS, KN, AS), pp. 327–334.

SEKE-2014-SantosBSC #game studies #learning #programming #semantics #source code

A Semantic Analyzer for Simple Games Source Codes to Programming Learning (ECOdS, GBB, VHVdS, EC), pp. 522–527.

SIGIR-2014-YeH #effectiveness #feedback #pseudo

A simple term frequency transformation model for effective pseudo relevance feedback (ZY, JXH), pp. 323–332.

Onward-2014-UngarOK #named #programming #symmetry

Korz: Simple, Symmetric, Subjective, Context-Oriented Programming (DU, HO, DK), pp. 113–131.

SAC-2014-NabeezathP #algorithm #detection #performance

Global value numbering for redundancy detection: a simple and efficient algorithm (SN, VP), pp. 1609–1611.

SLE-2014-Ridge #combinator #context-free grammar #parsing #performance #using

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.

HPCA-2014-GopeL

Atomic SC for simple in-order processors (DG, MHL), pp. 404–415.

OSDI-2014-YuanLZRZZJS #analysis #data-driven #distributed #testing

Simple Testing Can Prevent Most Critical Failures: An Analysis of Production Failures in Distributed Data-Intensive Systems (DY, YL, XZ, GRR, XZ, YZ, PJ, MS), pp. 249–265.

CAV-2014-SinnZV #bound #complexity #scalability #static analysis

A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis (MS, FZ, HV), pp. 745–761.

SAT-2014-MiksaN #proving

Long Proofs of (Seemingly) Simple Formulas (MM, JN), pp. 121–137.

DocEng-2013-SrivastavaSM #graph #interactive #topic

A graph-based topic extraction method enabling simple interactive customization (AS, AJS, EEM), pp. 71–80.

ICDAR-2013-LiuS #detection #documentation #equation #image

A Simple Equation Region Detector for Printed Document Images in Tesseract (ZL, RS), pp. 245–249.

PODS-2013-BaganBG #graph #query

A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.

VLDB-2013-JinW #performance #reachability #scalability

Simple, Fast, and Scalable Reachability Oracle (RJ, GW), pp. 1978–1989.

ITiCSE-2013-EdwardsA #android #framework #named

Sofia: the simple open framework for inventive android applications (SHE, AA), p. 321.

MSR-2013-ShokripourAKZ #debugging #recommendation #why

Why so complicated? simple term filtering and weighting for location-based bug report assignment recommendation (RS, JA, ZMK, SZ), pp. 2–11.

STOC-2013-KelnerOSZ #algorithm #combinator

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.

STOC-2013-NeimanS #algorithm

Simple deterministic algorithms for fully dynamic maximal matching (ON, SS), pp. 745–754.

ICALP-v1-2013-Lampis #bound #graph #model checking

Model Checking Lower Bounds for Simple Graphs (ML), pp. 673–683.

ICFP-2013-SvenningssonS #composition #embedded #monad

Simple and compositional reification of monadic embedded languages (JS, BJS), pp. 299–304.

CHI-2013-HakanssonS #product line

Beyond being green: simple living families and ICT (MH, PS), pp. 2725–2734.

CHI-2013-JungBLK #design

Make it move: a movement design method of simple standing products based on systematic mapping of torso movements & product messages (JJ, SHB, JHL, MSK), pp. 1279–1288.

CHI-2013-PerraultLEG #gesture #interactive #named

Watchit: simple gestures and eyes-free interaction for wristwatches and bracelets (STP, EL, JE, YG), pp. 1451–1460.

HCI-AS-2013-NouriT #game studies #online

A Cross-Cultural Study of Playing Simple Economic Games Online with Humans and Virtual Humans (EN, DRT), pp. 266–275.

HILT-2013-LarsonHFD #fault #modelling #safety #using

Illustrating the AADL error modeling annex (v.2) using a simple safety-critical medical device (BRL, JH, KF, JD), pp. 65–84.

ICML-c3-2013-Cho #image

Simple Sparsification Improves Sparse Denoising Autoencoders in Denoising Highly Corrupted Images (KC), pp. 432–440.

ICML-c3-2013-Meng #random #scalability

Scalable Simple Random Sampling and Stratified Sampling (XM), pp. 531–539.

KDD-2013-Lacoste-JulienPDKGG #knowledge base #named #scalability

SIGMa: simple greedy matching for aligning large knowledge bases (SLJ, KP, AD, GK, TG, ZG), pp. 572–580.

KDD-2013-Liberty #matrix #sketching

Simple and deterministic matrix sketching (EL), pp. 581–588.

KDD-2013-NishimuraU #algorithm #clustering #graph

Restreaming graph partitioning: simple versatile algorithms for advanced balancing (JN, JU), pp. 1106–1114.

ICMT-2013-LepperT #performance #validation

Fragmented Validation: A Simple and Efficient Contribution to XSLT Checking (Extended Abstract) (ML, BTyW), pp. 54–55.

ECOOP-2013-WuZSGSY #fault #optimisation #statistics

Simple Profile Rectifications Go a Long Way — Statistically Exploring and Alleviating the Effects of Sampling Errors for Program Optimizations (BW, MZ, XS, YG, RS, GY), pp. 654–678.

SAC-2013-HapfelmeierSK #dataset #incremental #linear #performance

Incremental linear model trees on massive datasets: keep it simple, keep it fast (AH, JS, SK), pp. 129–135.

CC-2013-BraunBHLMZ #performance

Simple and Efficient Construction of Static Single Assignment Form (MB, SB, SH, RL, CM, AZ), pp. 102–122.

HPCA-2013-NereHLT #behaviour #biology #semantic gap

Bridging the semantic gap: Emulating biological neuronal behaviors with simple digital neurons (AN, AH, MHL, GT), pp. 472–483.

SAT-2013-SamulowitzRSS #algorithm #named

Snappy: A Simple Algorithm Portfolio (HS, CR, AS, MS), pp. 422–428.

DRR-2012-Obafemi-AjayiAX #classification #documentation

Ensemble methods with simple features for document zone classification (TOA, GA, BX).

FoSSaCS-2012-PreugschatW #automaton #effectiveness #logic #using

Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata (SP, TW), pp. 135–149.

ICSM-2012-BasitAHJ

Things structural clones tell that simple clones don’t (HAB, UA, SH, SJ), pp. 275–284.

ICSM-2012-GongLJZ #fault #feedback #interactive #locality

Interactive fault localization leveraging simple user feedback (LG, DL, LJ, HZ), pp. 67–76.

SCAM-2012-GauthierM #alias #php

Alias-Aware Propagation of Simple Pattern-Based Properties in PHP Applications (FG, EM), pp. 44–53.

SAS-2012-ChenFM #linear #proving #termination

Termination Proofs for Linear Simple Loops (HYC, SF, SM), pp. 422–438.

CHI-2012-CasiezRV #interactive

1 € filter: a simple speed-based low-pass filter for noisy input in interactive systems (GC, NR, DV), pp. 2527–2530.

HILT-2012-SchonbergP #ada #implementation

Implementation of a simple dimensionality checking system in Ada 2012 (ES, VP), pp. 35–42.

CIKM-2012-JatowtT12a #analysis #comparative #readability #wiki

Is wikipedia too difficult?: comparative analysis of readability of wikipedia, simple wikipedia and britannica (AJ, KT), pp. 2607–2610.

CIKM-2012-LiangZ #classification #performance

An efficient and simple under-sampling technique for imbalanced time series classification (GL, CZ), pp. 2339–2342.

CIKM-2012-LongGXK #approach #design #using

A simple approach to the design of site-level extractors using domain-centric principles (CL, XG, CX, SK), pp. 1517–1521.

ECIR-2012-NeumayerBN12a #effectiveness #semantics

When Simple is (more than) Good Enough: Effective Semantic Search with (almost) no Semantics (RN, KB, KN), pp. 540–543.

ICML-2012-JiYLJH #algorithm #bound #fault #learning

A Simple Algorithm for Semi-supervised Learning with Improved Generalization Error Bound (MJ, TY, BL, RJ, JH), p. 110.

ICML-2012-MnihT #algorithm #modelling #performance #probability

A fast and simple algorithm for training neural probabilistic language models (AM, YWT), p. 58.

ICPR-2012-AydemirEGK #summary #using #video

Video summarization using simple action patterns (MSA, UE, AG, MEK), pp. 2047–2050.

ICPR-2012-Berrar #classification #comparison #null #testing #visual notation

Null QQ plots: A simple graphical alternative to significance testing for the comparison of classifiers (DPB), pp. 1852–1855.

ICPR-2012-YangLP #effectiveness

A simple and effective extrinsic calibration method of a camera and a single line scanning lidar (HY, XL, IP), pp. 1439–1442.

ICPR-2012-ZhangWSD #approach #detection #effectiveness

A simple and effective saliency detection approach (HZ, WW, GS, LD), pp. 186–189.

KDD-2012-JanWLL #classification

A simple methodology for soft cost-sensitive classification (TKJ, DWW, CHL, HTL), pp. 141–149.

KEOD-2012-LeraJP #metric #ontology #summary

Ontology Summarization through Simple Pruning Measures (IL, CJ, RP), pp. 339–342.

CSL-2012-GradelL #game studies

Banach-Mazur Games with Simple Winning Strategies (EG, SL), pp. 305–319.

RTA-2012-Bahr #graph grammar

Infinitary Term Graph Rewriting is Simple, Sound and Complete (PB), pp. 69–84.

WICSA-2011-SavolainenMM #dependence #diagrams #industrial

Evaluating Simple Dependency Diagrams in Industry (JS, VM, TM), pp. 224–227.

DAC-2011-KungHSS #optimisation

Thermal signature: a simple yet accurate thermal index for floorplan optimization (JK, IH, SSS, YS), pp. 108–113.

DATE-2011-MeynardRFGHD

Enhancement of simple electro-magnetic attacks by pre-characterization in frequency domain and demodulation techniques (OM, DR, FF, SG, NH, JLD), pp. 1004–1009.

DRR-2011-LiuZ11a #detection #documentation #effectiveness

A simple and effective figure caption detection system for old-style documents (ZL, HZ), pp. 1–10.

ICDAR-2011-LiMV #visual notation

Symbol Knowledge Extraction from a Simple Graphical Language (JL, HM, CVG), pp. 608–612.

ICDAR-2011-MeierCGS #recognition

Better Digit Recognition with a Committee of Simple Neural Nets (UM, DCC, LMG, JS), pp. 1250–1254.

PODS-2011-WeiY #query #summary

Beyond simple aggregates: indexing for summary queries (ZW, KY), pp. 117–128.

STOC-2011-PatrascuT #power of

The power of simple tabulation hashing (MP, MT), pp. 1–10.

ICALP-v1-2011-AustrinK #distance #problem #reduction

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (PA, SK), pp. 474–485.

ICALP-v1-2011-HuangP #game studies #probability

Automatizability and Simple Stochastic Games (LH, TP), pp. 605–617.

LATA-2011-AxelsenG #performance #turing machine

A Simple and Efficient Universal Reversible Turing Machine (HBA, RG), pp. 117–128.

ICFP-2011-GibbonsH #equation #monad #reasoning

Just do it: simple monadic equational reasoning (JG, RH), pp. 2–14.

CHI-2011-KandoganKMP #how #interface #problem

How a freeform spatial interface supports simple problem solving tasks (EK, JK, TPM, PP), pp. 925–934.

CSCW-2011-DornerWSP #distributed #named #video

SISO: simple service orchestration (video showcase) (CD, TW, MAS, VP), pp. 575–576.

HCI-DDA-2011-IglesiasT #component #representation #user interface #using

User Interface Representation Using Simple Components (JRI, PMTF), pp. 278–287.

EDOC-2011-SapkotaAIS #composition #hybrid #information management #web #web service

A Simple Solution for Information Sharing in Hybrid Web Service Composition (BS, CHA, MEI, MvS), pp. 235–244.

CIKM-2011-CarteretteKY #behaviour #effectiveness #evaluation #simulation

Simulating simple user behavior for system effectiveness evaluation (BC, EK, EY), pp. 611–620.

ECIR-2011-BaskayaKJ #feedback #simulation

Simulating Simple and Fallible Relevance Feedback (FB, HK, KJ), pp. 593–604.

ECIR-2011-MagdyLJ

Simple vs. Sophisticated Approaches for Patent Prior-Art Search (WM, PL, GJFJ), pp. 725–728.

KDD-2011-SimonKL #classification #statistics

A simple statistical model and association rule filtering for classification (GJS, VK, PWL), pp. 823–831.

OOPSLA-2011-PintoDDGW #abstraction #concurrent

A simple abstraction for complex concurrent indexes (PdRP, TDY, MD, PG, MJW), pp. 845–864.

HPDC-2011-YooLKK #distributed #named #parallel

InContext: simple parallelism for distributed applications (SY, HL, CEK, MK), pp. 97–108.

PPoPP-2011-StrzodkaSP

Time skewing made simple (RS, MS, DP), pp. 295–296.

ICLP-J-2011-Porto #composition #prolog #semantics

A structured alternative to Prolog with simple compositional semantics (AP), pp. 611–627.

TACAS-2010-ValmariF #markov

Simple O(m logn) Time Markov Chain Lumping (AV, GF), pp. 38–52.

ICPC-2010-BeyerF10b #dependence #effectiveness #low level

A Simple and Effective Measure for Complex Low-Level Dependencies (DB, AF), pp. 80–83.

PLDI-2010-MarinoSMMN #concurrent #memory management #named #performance #programming language

DRFX: a simple and efficient memory model for concurrent programming languages (DM, AS, TDM, MM, SN), pp. 351–362.

DLT-2010-Ibarra #on the #problem

On Decision Problems for Simple and Parameterized Machines (OHI), p. 31.

ICALP-v1-2010-MonienDT

Local Search: Simple, Successful, But Sometimes Sluggish (BM, DD, TT), pp. 1–17.

LATA-2010-ArrighiG #automaton #quantum

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton (PA, JG), pp. 70–81.

CHI-2010-OulasvirtaB #flexibility #multimodal

A simple index for multimodal flexibility (AO, JBL), pp. 1475–1484.

CIKM-2010-GaoQJWY #graph #performance

Fast top-k simple shortest paths discovery in graphs (JG, HQ, XJ, TW, DY), pp. 509–518.

ICML-2010-JaggiS #algorithm #problem

A Simple Algorithm for Nuclear Norm Regularized Problems (MJ, MS), pp. 471–478.

ICML-2010-XuJYKL #kernel #learning #multi #performance

Simple and Efficient Multiple Kernel Learning by Group Lasso (ZX, RJ, HY, IK, MRL), pp. 1175–1182.

ICPR-2010-FaradjiWB #approach #classification #problem

A Simple Approach to Find the Best Wavelet Basis in Classification Problems (FF, RKW, GEB), pp. 641–644.

ICPR-2010-StuhlsatzLZ #classification #feature model

Feature Extraction for Simple Classification (AS, JL, TZ), pp. 1525–1528.

KDIR-2010-OlsonL #clustering #performance

Simple and Efficient Projective Clustering (CFO, HJL), pp. 45–55.

KMIS-2010-SrivastavaS #composition #game studies #using #validation

The Validation of a Dynamic Service Composition Model using a Simple Game (AS, PGS), pp. 260–266.

OOPSLA-2010-ItzhakyGIS #induction #synthesis

A simple inductive synthesis methodology and its applications (SI, SG, NI, MS), pp. 36–46.

GPCE-J-2007-GilL10 #c++ #query #sql

Simple and safe SQL queries with C++ templates (JYG, KL), pp. 573–595.

PADL-2010-MarquesSC #concurrent #implementation #performance

A Simple and Efficient Implementation of Concurrent Local Tabling (RM, TS, JCC), pp. 264–278.

POPL-2010-TristanL #pipes and filters #validation

A simple, verified validator for software pipelining (JBT, XL), pp. 83–92.

SAC-2010-BlundoC #algorithm #mining

A simple role mining algorithm (CB, SC), pp. 1958–1962.

HPCA-2010-XuZZY #throughput

Simple virtual channel allocation for high throughput and high frequency on-chip routers (YX, BZ, YZ, JY), pp. 1–11.

SAT-2010-NamasivayamT

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

SAT-2010-PankratovB #on the #problem #satisfiability

On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem (DP, AB), pp. 223–236.

CASE-2009-BeraN #using

A Simple instrumentation calibration technique for Electrical Impedance Tomography (EIT) using a 16-electrode phantom (TKB, JN), pp. 347–352.

CASE-2009-CaldwellM #estimation #higher-order

Second-order optimal estimation of slip state for a simple slip-steered vehicle (TMC, TDM), pp. 133–139.

ICSM-2009-YoshikawaHS #natural language #ontology #source code #traceability #using

Recovering traceability links between a simple natural language sentence and source code using domain ontologies (TY, SH, MS), pp. 551–554.

WCRE-1999-LetarteM99a #interprocedural #modelling #php

Extraction of Inter-procedural Simple Role Privilege Models from PHP Code (DL, EM), pp. 187–191.

DLT-2009-RestivoR #word

Balanced Words Having Simple Burrows-Wheeler Transform (AR, GR), pp. 431–442.

ICALP-v1-2009-BorosM #algorithm #parallel #performance #problem

A Fast and Simple Parallel Algorithm for the Monotone Duality Problem (EB, KM), pp. 183–194.

ICALP-v2-2009-UmmelsW #complexity #game studies #multi #nash #probability

The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games (MU, DW), pp. 297–308.

LATA-2009-Masopust #context-free grammar #generative #power of

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.

DHM-2009-AmantiniC #behaviour #fault #predict #simulation

A Simple Simulation Predicting Driver Behavior, Attitudes and Errors (AA, PCC), pp. 345–354.

HCI-NIMT-2009-LiCMY #gesture

Emotions and Messages in Simple Robot Gestures (JL, MHC, SM, MY), pp. 331–340.

ICEIS-HCI-2009-TroianoBAC #algorithm #layout #mobile #optimisation #search-based #web

Web Form Page in Mobile Devices — Optimization of Layout with a Simple Genetic Algorithm (LT, CB, RA, GC), pp. 118–123.

CIKM-2009-LaberSJACRTV #performance

A fast and simple method for extracting relevant content from news webpages (ESL, CPdS, IVJ, ECFdA, ETC, RPR, LCT, CDV), pp. 1685–1688.

ECIR-2009-Ailon #algorithm #linear #query #ranking #using

A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.

ECIR-2009-PaltoglouSS #adaptation #algorithm #data fusion

Simple Adaptations of Data Fusion Algorithms for Source Selection (GP, MS, MS), pp. 497–508.

ICML-2009-Makino #network #predict #representation

Proto-predictive representation of states with simple recurrent temporal-difference networks (TM), pp. 697–704.

ICML-2009-ZhuangTH #kernel #learning #named #parametricity

SimpleNPKL: simple non-parametric kernel learning (JZ, IWT, SCHH), pp. 1273–1280.

KDIR-2009-Ivanko #complexity

A Simple Measure of the Kolmogorov Complexity (EI), pp. 5–9.

KEOD-2009-Grimm #formal method #ontology #research #semantics #web

A Unifying Formal Ontology Model — A Simple Formal Model for Unifying the Presentation of Ontologies in Semantic Web Research (SG), pp. 327–335.

ICMT-2009-Stevens #approach #game studies #qvt

A Simple Game-Theoretic Approach to Checkonly QVT Relations (PS), pp. 165–180.

ECOOP-2009-WrigstadPMZV #java #named #thread

Loci: Simple Thread-Locality for Java (TW, FP, FM, LZ, JV), pp. 445–469.

SAC-2009-DemailleLS #abstract syntax tree #effectiveness #named #parsing #using

TWEAST: a simple and effective technique to implement concrete-syntax AST rewriting using partial parsing (AD, RL, BS), pp. 1924–1929.

SAC-2009-LeS #concept #detection #performance #visual notation

Efficient concept detection by fusing simple visual features (DDL, SS), pp. 1839–1840.

SAC-2009-NetoFP #named #people #using

MATRACA: a tool to provide support for people with impaired vision when using the computer for simple tasks (FGdON, JMF, RRGP), pp. 158–159.

HPCA-2009-PowellBEMSY #named #parametricity #runtime #using

CAMP: A technique to estimate per-structure power at run-time using a few simple parameters (MDP, AB, JSE, SSM, BRS, SMY), pp. 289–300.

ICST-2009-SilvaAJ #approach #estimation #execution #functional #testing

A Simple Approach for Estimation of Execution Effort of Functional Test Cases (DGeS, BTdA, MJ), pp. 289–298.

ICST-2009-SteimannB #fault #multi

A Simple Coverage-Based Locator for Multiple Faults (FS, MB), pp. 366–375.

CASE-2008-EconomopoulosK #analysis

Analysis of a simple CONWIP system with impatient customers (AAE, VSK), pp. 291–296.

FoSSaCS-2008-GimbertH #game studies #probability #random

Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.

PLDI-2008-HalbwachsP #array #source code

Discovering properties about arrays in simple programs (NH, MP), pp. 339–348.

AFL-2008-Martyugin #automaton #commutative #complexity #problem #word

Complexity of problems concerning reset words for commutative automata and automata with simple idempotents (PVM), pp. 314–324.

DLT-2008-HadravovaH #scalability #similarity #word

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

ICALP-A-2008-AvinKL #evolution #graph #how #random

How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.

ICALP-B-2008-BirkedalRSY #higher-order #logic

A Simple Model of Separation Logic for Higher-Order Store (LB, BR, JS, HY), pp. 348–360.

LATA-2008-RegnaultST #2d #analysis #automaton #on the #probability

On the Analysis of “Simple” 2D Stochastic Cellular Automata (DR, NS, ET), pp. 452–463.

ICFP-2008-Leijen #morphism #named #polymorphism #type inference

HMF: simple type inference for first-class polymorphism (DL), pp. 283–294.

AdaEurope-2008-Evequoz #concurrent #performance #using #word

Practical, Fast and Simple Concurrent FIFO Queues Using Single Word Synchronization Primitives (CE), pp. 59–72.

ICEIS-AIDSS-2008-Zacharias

Rules as Simple Way to Model Knowledge — Closing the Gap between Promise and Reality (VZ), pp. 87–94.

SIGIR-2008-YilmazKA #performance

A simple and efficient sampling method for estimating AP and NDCG (EY, EK, JAA), pp. 603–610.

DATE-2007-DabrowskiR #interactive

Interactive presentation: Boosting SER test for RF transceivers by simple DSP technique (JD, RR), pp. 719–724.

VLDB-2007-ChenCB #estimation #performance

A Simple and Efficient Estimation Method for Stream Expression Cardinalities (AC, JC, TB), pp. 171–182.

ITiCSE-2007-TremblayLS #testing

Extending a marking tool with simple support for testing (GT, LL, AS), p. 313.

STOC-2007-BayatiGKNT #algorithm #approximate

Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.

CIAA-J-2006-BastienCFR07 #exponential

Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 715–725.

ILC-2007-Latendresse #compilation #comprehension #lisp #performance

Simple and efficient compilation of list comprehension in common Lisp (ML), p. 12.

GT-VMT-2007-BonevaHKR #graph transformation #multi #simulation #using

Simulating Multigraph Transformations Using Simple Graphs (IB, FH, HK, AR).

HCI-IDU-2007-Karjalainen #analysis #why

Why It Is Difficult to Use a Simple Device: An Analysis of a Room Thermostat (SK), pp. 544–548.

ICML-2007-MannM #learning #robust #scalability

Simple, robust, scalable semi-supervised learning via expectation regularization (GSM, AM), pp. 593–600.

SEKE-2007-ZiemerC #development #release planning #web

Knowledge Sharing through a Simple Release Planning Method for Web Application Development (SZ, ICC), pp. 686–691.

SIGIR-2007-Lee #probability

IDF revisited: a simple new derivation within the Robertson-Spärck Jones probabilistic model (LL), pp. 751–752.

GPCE-2007-GilL #c++ #query #sql

Simple and safe SQL queries with c++ templates (JYG, KL), pp. 13–24.

PPDP-2007-BentonZ #compilation #formal method #semantics #verification

Formalizing and verifying semantic type soundness of a simple compiler (NB, UZ), pp. 1–12.

PPDP-2007-Lopez-FraguasRS #semantics

A simple rewrite notion for call-time choice semantics (FJLF, JRH, JSH), pp. 197–208.

SAC-2007-LodhiG #design #effectiveness

Design of a simple and effective object-to-relational mapping technique (FL, MAG), pp. 1445–1449.

RTA-2007-DowekH #proving

A Simple Proof That Super-Consistency Implies Cut Elimination (GD, OH), pp. 93–106.

RTA-2007-Kikuchi #calculus #normalisation #proving

Simple Proofs of Characterizing Strong Normalization for Explicit Substitution Calculi (KK), pp. 257–272.

SAT-2007-CimattiGS #flexibility #modulo theories #satisfiability

A Simple and Flexible Way of Computing Small Unsatisfiable Cores in SAT Modulo Theories (AC, AG, RS), pp. 334–339.

TLCA-2007-Tatsuta #higher-order #quantifier #set

Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.

DATE-2006-MullerBJ #design #multi

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

DocEng-2006-HurstMA #layout #problem

Solving the simple continuous table layout problem (NH, KM, DWA), pp. 28–30.

DocEng-2006-LindholmKT #difference #performance #sequence #xml

Fast and simple XML tree differencing by sequence alignment (TL, JK, ST), pp. 75–84.

VLDB-2006-HoukjaerTW #generative

Simple and Realistic Data Generation (KH, KT, RW), pp. 1243–1246.

VLDB-2006-XiaoT #effectiveness #named #privacy

Anatomy: Simple and Effective Privacy Preservation (XX, YT), pp. 139–150.

STOC-2006-FleischerKLS #multi #probability

Simple cost sharing schemes for multicommodity rent-or-buy and stochastic Steiner tree (LF, JK, SL, GS), pp. 663–670.

CIAA-2006-BastienCFR #exponential

Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (CB, JC, WF, WR), pp. 90–101.

CIAA-2006-GalvezSF #bound #linear #lookahead #parsing

Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.

CIAA-2006-MesserschmidtMOP #complexity #correctness

Correctness Preservation and Complexity of Simple RL-Automata (HM, FM, FO, MP), pp. 162–172.

DLT-2006-BastienCFR #context-free grammar #equivalence

Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.

DLT-2006-MrazOP #on the

On the Gap-Complexity of Simple RL-Automata (FM, FO, MP), pp. 83–94.

ICFP-2006-JonesVWW #data type #type inference

Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.

ICEIS-ISAS-2006-AkhlakiTT #algebra #design #modelling #process #realtime #specification #uml

Design of Real-Time Systems by Systematic Transformation of UML/RT Models into Simple Timed Process Algebra System Specifications (KBA, MICT, JAHT), pp. 290–297.

ICPR-v1-2006-CastelanH #3d #statistics

A Simple Coupled Statistical Model for 3D Face Shape Recovery (MC, ERH), pp. 231–234.

ICPR-v1-2006-FredembachF

Simple Shadow Removal (CF, GDF), pp. 832–835.

ICPR-v2-2006-SridharanBG

Competitive Mixtures of Simple Neurons (KS, MJB, VG), pp. 494–497.

ICPR-v3-2006-NodaNK #performance

Simple and Efficient Colorization in YCbCr Color Space (HN, MN, JK), pp. 685–688.

SIGIR-2006-KumaranA #feedback #pseudo

Simple questions to improve pseudo-relevance feedback results (GK, JA), pp. 661–662.

SIGIR-2006-TurpinS #metric #performance #precise

User performance versus precision measures for simple search tasks (AT, FS), pp. 11–18.

MoDELS-2006-AkehurstBEHM #java #named

SiTra: Simple Transformations in Java (DHA, BB, MJE, WGJH, KDMM), pp. 351–364.

MoDELS-2006-AkehurstBEHM #java #named

SiTra: Simple Transformations in Java (DHA, BB, MJE, WGJH, KDMM), pp. 351–364.

DAC-2005-AminMKDCHI #analysis #how #question #statistics

Statistical static timing analysis: how simple can we get? (CSA, NM, KK, FD, UC, NH, YII), pp. 652–657.

ICDAR-2005-LeeI #performance #recognition #word

A Simple and Efficient Method for Global Handwritten Word Recognition Applied to Brazilian Bankchecks (LLL, SI), pp. 950–955.

STOC-2005-Ben-SassonS #complexity #query

Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.

CIAA-2005-BastienCFR #equivalence #normalisation

Prime Normal Form and Equivalence of Simple Grammars (CB, JC, WF, WR), pp. 78–89.

ICALP-2005-RodittyZ #graph

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs (LR, UZ), pp. 249–260.

ICALP-2005-Zimand #encryption #generative #pseudo

Simple Extractors via Constructions of Cryptographic Pseudo-random Generators (MZ), pp. 115–127.

ICFP-2005-Remy #system f

Simple, partial type-inference for System F based on type-containment (DR), pp. 130–143.

ICEIS-v1-2005-ChaariL #adaptation #generative #named #user interface #visual notation

SEFAGI: Simple Environment for Adaptable Graphical Interfaces — Generating User Interfaces for Different Kinds of Terminals (TC, FL), pp. 232–237.

ICEIS-v5-2005-JaklicV #algorithm #documentation #image #preprocessor

Two Simple Algorithms for Document Image Preprocessing — Making a Document Scanning Application More User-Friendly (AJ, BV), pp. 116–121.

KDD-2005-LebanMBZ #effectiveness #modelling #visual notation

Simple and effective visual models for gene expression cancer diagnostics (GL, MM, IB, BZ), pp. 167–176.

SIGIR-2005-BlancoB #documentation #identifier #problem

Characterization of a simple case of the reassignment of document identifiers as a pattern sequencing problem (RB, AB), pp. 587–588.

OOPSLA-2005-Vanderburg #agile #process #programming

A simple model of agile software processes — or — extreme programming annealed (GV), pp. 539–545.

POPL-2005-ChenT #object-oriented

A simple typed intermediate language for object-oriented languages (JC, DT), pp. 38–49.

VMCAI-2005-LatvalaBHJ #bound #ltl #model checking #performance

Simple Is Better: Efficient Bounded Model Checking for Past LTL (TL, AB, KH, TAJ), pp. 380–395.

DATE-v1-2004-ChangYL

Value-Conscious Cache: Simple Technique for Reducing Cache Access Power (YJC, CLY, FL), pp. 16–21.

DATE-v2-2004-PhillipsS #reduction

Poor Man’s TBR: A Simple Model Reduction Scheme (JRP, LMS), pp. 938–943.

PODS-2004-MartensN #xml

Frontiers of Tractability for Typechecking Simple XML Transformations (WM, FN), pp. 23–34.

ITiCSE-2004-Sher #implementation #queue

A simple implementation of a queue with a circularly linked list (DBS), p. 274.

IWPC-2004-Kelsen #behaviour #comprehension #source code

A Simple Static Model for Understanding the Dynamic Behavior of Programs (PK), pp. 46–51.

WCRE-2004-AbbasTC #using

Using DDL to Understand and Modify SimpleScalar (NA, ST, JEC), pp. 296–297.

PLDI-2004-QadeerW #named

KISS: keep it simple and sequential (SQ, DW), pp. 14–24.

STOC-2004-DunaganV #algorithm #linear #polynomial #source code

A simple polynomial-time rescaling algorithm for solving linear programs (JD, SV), pp. 315–320.

CIAA-2004-DebskiF #state machine

Concatenation State Machines and Simple Functions (WD, WF), pp. 113–124.

ICALP-2004-HooryMMR #permutation

Simple Permutations Mix Well (SH, AM, SM, CR), pp. 770–781.

ICALP-2004-Lyngso #complexity #modelling #predict #pseudo

Complexity of Pseudoknot Prediction in Simple Models (RBL), pp. 919–931.

IFL-2004-StefanovS #effectiveness #functional #reduction #source code

Simple, Effective Code-Size Reduction for Functional Programs (ES, AMS), pp. 211–225.

CAiSE-2004-SebastianiGM #low cost #modelling #satisfiability

Simple and Minimum-Cost Satisfiability for Goal Models (RS, PG, JM), pp. 20–35.

CIKM-2004-RobertsonZT #multi

Simple BM25 extension to multiple weighted fields (SER, HZ, MJT), pp. 42–49.

ICPR-v1-2004-CaoF #metric #using

Simple Calibration Without Metric Information Using an Isoceles Trapezoid (XC, HF), pp. 104–107.

ICPR-v1-2004-KavallieratouS #using

Discrimination of Machine-Printed from Handwritten Text Using Simple Structural Characteristics (EK, ES), pp. 437–440.

ICPR-v1-2004-WuAL #detection

Glasses Detection by Boosting Simple Wavelet Features (BW, HA, RL), pp. 292–295.

ICPR-v2-2004-DengC #image #implementation #segmentation #using

Unsupervised Image Segmentation Using A Simple MRF Model with A New Implementation Scheme (HD, DAC), pp. 691–694.

POPL-2004-Benton #analysis #correctness #program transformation #proving #relational

Simple relational correctness proofs for static analyses and program transformations (NB), pp. 14–25.

ICLP-2004-ElkabaniPS #approach #effectiveness

Smodels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP (IE, EP, TCS), pp. 73–89.

DAC-2003-AgarwalSB03a #metric

Simple metrics for slew rate of RC circuits based on two circuit moments (KA, DS, DB), pp. 950–953.

HT-2003-AbdullahD #adaptation #hypermedia #question

Is simple sequencing simple adaptive hypermedia? (NAA, HCD), pp. 172–173.

ESOP-2003-GorrieriLM #analysis #encryption #protocol #realtime

A Simple Language for Real-Time Cryptographic Protocol Analysis (RG, EL, FM), pp. 114–128.

TACAS-2003-EsparzaM #multi #protocol

Simple Representative Instantiations for Multicast Protocols (JE, MM), pp. 128–143.

WCRE-2003-BeyerNL #performance #query #relational

Simple and Efficient Relational Querying of Software Structures (DB, AN, CL), pp. 216–225.

STOC-2003-DietzfelbingerW #graph #random

Almost random graphs with simple hash functions (MD, PW), pp. 629–638.

DLT-2003-FalcoGL #modelling #probability

Frequency of Symbol Occurrences in Simple Non-primitive Stochastic Models (DdF, MG, VL), pp. 242–253.

ICALP-2003-BaswanaS #algorithm #graph #linear

A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs (SB, SS), pp. 384–296.

ICALP-2003-CrescenziGNPU #online

Online Load Balancing Made Simple: Greedy Strikes Back (PC, GG, GN, PP, WU), pp. 1108–1122.

ICALP-2003-Jagerskupper #algorithm #analysis

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces (JJ), pp. 1068–1079.

ICALP-2003-KarkkainenS #array #linear

Simple Linear Work Suffix Array Construction (JK, PS), pp. 943–955.

ICFP-2003-ShinwellPG #named #programming

FreshML: programming with binders made simple (MRS, AMP, MG), pp. 263–274.

AGTIVE-2003-AgnarssonEH #graph

Proper Down-Coloring Simple Acyclic Digraphs (GA, ÁSE, MMH), pp. 299–312.

CHI-2003-SalvucciL #architecture #modelling

Simple cognitive modeling in a complex cognitive architecture (DDS, FJL), pp. 265–272.

ICML-2003-VishwanathanSM

SimpleSVM (SVNV, AJS, MNM), pp. 760–767.

KDD-2003-BayS #linear #mining

Mining distance-based outliers in near linear time with randomization and a simple pruning rule (SDB, MS), pp. 29–38.

MLDM-2003-EstruchFHR #classification

Simple Mimetic Classifiers (VE, CF, JHO, MJRQ), pp. 156–171.

SIGIR-2003-Sakai #evaluation #multi #performance #retrieval

Average gain ratio: a simple retrieval performance measure for evaluation with multiple relevance levels (TS), pp. 417–418.

POPL-2003-ZibinGC #algorithm #morphism #performance

Efficient algorithms for isomorphisms of simple types (YZ, JYG, JC), pp. 160–171.

SAC-2003-DattaS #energy #network #protocol

A Simple and Energy-Efficient Routing Protocol for Radio Networks (AD, SS), pp. 1014–1018.

CSL-2003-ChatterjeeJH #game studies #probability

Simple Stochastic Parity Games (KC, MJ, TAH), pp. 100–113.

DATE-2002-YmeriNMRSV #approach #parametricity #performance

Simple and Efficient Approach for Shunt Admittance Parameters Calculations of VLSI On-Chip Interconnects on Semiconducting Substrate (HY, BN, KM, DDR, MS, SV), p. 1113.

DocEng-2002-WibowoW #categorisation #feature model

Simple and accurate feature selection for hierarchical categorisation (WW, HEW), pp. 111–118.

ITiCSE-2002-WyattKB #ide #implementation #student

Implementing student ideas in CS2: a simple IDE (JNW, MJK, MAB), p. 224.

ESOP-2002-GoubaultMP #float #interpreter #precise

Asserting the Precision of Floating-Point Computations: A Simple Abstract Interpreter (EG, MM, SP), pp. 209–212.

SCAM-2002-RamseyA #framework #using

A Simple Mathematically Based Framework for Rule Extraction Using Wide Spectrum Language (FVR, JJA), p. 44–?.

ICFP-2002-Ford #functional #lazy evaluation #linear #parsing

Packrat parsing: : simple, powerful, lazy, linear time, functional pearl (BF), pp. 36–47.

ICEIS-2002-Castro-SchezJMR #fuzzy

Simple Decision Support System Based on Fuzzy Repertory Table (JJCS, LJ, JMG, LRB), pp. 424–430.

ICPR-v3-2002-RavindranF #linear

A Simple Linear Method to Obtain Height Ordering of Scene Points (PR, NJF), pp. 719–722.

ICPR-v4-2002-NoguchiO #algorithm

A Simple but High-Quality Stereo Algorithm (TN, YO), pp. 351–354.

SEKE-2002-GriffithsHLO #web

A simple method & tool for web engineering (GG, BDH, MAL, BJO), pp. 755–762.

ECOOP-2002-ArnoldR #effectiveness

Thin Guards: A Simple and Effective Technique for Reducing the Penalty of Dynamic Class Loading (MA, BGR), pp. 498–524.

ECOOP-2002-CheonL #approach #ml #testing

A Simple and Practical Approach to Unit Testing: The JML and JUnit Way (YC, GTL), pp. 231–255.

SAC-2002-Sarbazi-AzadO #adaptation

A simple mathematical model of adaptive routing in wormhole k-ary n-cubes (HSA, MOK), pp. 835–839.

ICSE-2002-MaysL #approach #realtime #reliability #robust

The cyclefree methodology: a simple approach to building reliable, robust, real-time systems (DM, RJL), pp. 567–575.

CSL-2002-BaazM #on the

On Generalizations of Semi-terms of Particularly Simple Form (MB, GM), pp. 382–396.

ICLP-2002-VaucheretGM #fuzzy #implementation #prolog #using

Fuzzy Prolog: A Simple General Implementation Using CLP(R) (CV, SG, SMH), p. 469.

ICDAR-2001-JustinoBS #random #using #verification

Off-line Signature Verification Using HMM for Random, Simple and Skilled Forgeries (EJRJ, FB, RS), pp. 1031–1034.

ITiCSE-2001-BruceDM #programming

Event-driven programming is simple enough for CS1 (KBB, APD, TPM), pp. 1–4.

WCRE-2001-BaxterM #partial evaluation #preprocessor

Preprocessor Conditional Removal by Simple Partial Evaluation (IDB, MM), pp. 281–290.

WCRE-2001-Guilfanov #re-engineering #type system

A Simple Type System for Program Reengineering (IG), pp. 357–361.

FLOPS-2001-DanvyR #haskell #syntax

A Simple Take on Typed Abstract Syntax in Haskell-like Languages (OD, MR), pp. 343–358.

ICFP-2001-Hinze #implementation

A Simple Implementation Technique for Priority Search Queues (RH), pp. 110–121.

KDD-2001-MannilaS #sequence

Finding simple intensity descriptions from event sequence data (HM, MS), pp. 341–346.

ECOOP-2001-ClarkeNP

Simple Ownership Types for Object Containment (DGC, JN, JP), pp. 53–76.

TOOLS-USA-2001-Guerreiro #c++ #contract #design

Simple Support for Design by Contract in C++ (PG), pp. 24–34.

SAC-2001-MernikNAZ #implementation

Designa and implementation of simple object description language (MM, UN, EA, VZ), pp. 590–595.

SAC-2001-OngCC #approach #clustering #image

A simple partitioning approach to fractal image compression (GHO, CMC, YC), pp. 301–305.

ICLP-2001-GuoG #implementation #logic programming #order

A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives (HFG, GG), pp. 181–196.

RTA-2001-Ringeissen #question

Matching with Free Function Symbols — A Simple Extension of Matching? (CR), pp. 276–290.

TLCA-2001-Padovani

Retracts in Simple Types (VP), pp. 376–384.

PODS-2000-YuOB #approach #performance

Indexing the Edges — A Simple and Yet Efficient Approach to High-Dimensional Indexing (BCO, KLT, CY, SB), pp. 166–174.

WRLA-2000-MasonT #maude #network #protocol #simulation

Simple Network Protocol Simulation within Maude (IAM, CLT), pp. 274–291.

ICALP-2000-CalcagnoMT #approach #imperative #multi #programming

Closed Types as a Simple Approach to Safe Imperative Multi-stage Programming (CC, EM, WT), pp. 25–36.

ICALP-2000-Pichler #equation

Negation Elimination from Simple Equational Formulae (RP), pp. 612–623.

ICPR-v3-2000-WinkNV #heuristic #using

Minimum Cost Path Determination Using a Simple Heuristic Function (OW, WJN, MAV), pp. 7010–7013.

SIGIR-2000-DownieN #effectiveness #evaluation #information retrieval #music

Evaluation of a simple and effective music information retrieval method (JSD, MN), pp. 73–80.

TOOLS-EUROPE-2000-RakotonirainyBIL #architecture #component #framework #named

SCAF: A Simple Component Architecture Framework (AR, AB, JI, DL), pp. 359–370.

CC-2000-AycockH #generative

Simple Generation of Static Single-Assignment Form (JA, RNH), pp. 110–124.

CC-2000-KnoopR #constant #graph

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

LCTES-2000-BuddeP #modelling

Complex Reactive Control with Simple Synchronous Models (RB, AP), pp. 19–32.

CL-2000-Inoue #abduction

A Simple Characterization of Extended Abduction (KI), pp. 718–732.

ASE-1999-FedeleK #automation #proving

Automatic Proofs of Properties of Simple C-- Modules (CF, EK), pp. 283–286.

ICDAR-1999-KharmaW #invariant #recognition

A Simple Invariant Mapping Applied to Hand-written Pre-segmented Character Recognition (NNK, RKW), pp. 41–44.

STOC-1999-Ben-SassonW #proving

Short Proofs are Narrow — Resolution Made Simple (EBS, AW), pp. 517–526.

ICALP-1999-KuceraM #algebra #process #simulation

Simulation Preorder on Simple Process Algebras (AK, RM), pp. 503–512.

ICFP-1999-Crary #parametricity #proving

A Simple Proof Technique for Certain Parametricity Results (KC), pp. 82–89.

CIKM-1999-YuOE #performance #scalability

Simple QSF-Trees: An Efficient and Scalable Spatial Access Method (BY, RO, MWE), pp. 5–14.

ICML-1999-ParekhH #automaton

Simple DFA are Polynomially Probably Exactly Learnable from Simple Examples (RP, VH), pp. 298–306.

SIGIR-1999-Downie #effectiveness #music #retrieval

Music Retrieval as Text Retrieval: Simple Yet Effective (poster abstract) (JSD), pp. 297–298.

PPDP-1999-BaldanCFP #abstract interpretation

A Simple and General Method for Integrating Abstract Interpretation in SICStus (DB, NC, GF, FP), pp. 207–223.

POPL-1999-OCallahn #bytecode #java #type system

A Simple, Comprehensive Type System for Java Bytecode Subroutines (RO), pp. 70–78.

CSL-1999-GastinM #concurrent #parallel #programming language #semantics

A Truly Concurrent Semantics for a Simple Parallel Programming Language (PG, MWM), pp. 515–529.

IWTCS-1999-BelinfanteFVTGFMH #automation #empirical #testing

Formal Test Automation: A Simple Experiment (AB, JF, RGdV, JT, NG, LMGF, SM, LH), pp. 179–196.

DATE-1998-SawadaYN #detection #logic

Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions (HS, SY, AN), pp. 755–759.

CSMR-1998-JakobiW #automation #database #evaluation #framework #maintenance #named #proving #theorem proving

DBFW: A Simple DataBase FrameWork for the Evaluation and Maintenance of Automated Theorem Prover Data (PJ, AW), pp. 185–188.

ICALP-1998-Danvy

A Simple Solution to Type Specialization (OD), pp. 908–917.

ICALP-1998-GrafV #proving

Reducing Simple Polygons to Triangles — A Proof for an Improved Conjecture (TG, KV), pp. 130–139.

ICALP-1998-LiuS #algorithm #fixpoint #linear

Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) (XL, SAS), pp. 53–66.

TAGT-1998-HeckelHKK

Simple Modules for GRACE (RH, BH, PK, SK), pp. 383–395.

AdaEurope-1998-Gonzalez-BarahonaQCB #ada #approach #communication #composition

Building Modular Communication Systems in Ada: The Simple_Com Approach (JMGB, PdlHQ, JCG, FJB), pp. 225–237.

ICML-1998-FriessCC #algorithm #kernel #learning #performance

The Kernel-Adatron Algorithm: A Fast and Simple Learning Procedure for Support Vector Machines (TTF, NC, CC), pp. 188–196.

ICPR-1998-OjalaP #multi #parametricity

Nonparametric multichannel texture description with simple spatial operators (TO, MP), pp. 1052–1056.

TOOLS-PACIFIC-1998-RakotonirainyB #architecture

A Simple Architecture Description Model (AR, AB), pp. 278–286.

SAC-1998-ChunLC #semantics

Succinct model semantics: a simple model for inclusive interpretations (SC, HL, JC), pp. 39–44.

SAC-1998-Marchiori98a #algorithm #clique #heuristic #problem #search-based

A simple heuristic based genetic algorithm for the maximum clique problem (EM), pp. 366–373.

HPCA-1998-BasuT #memory management #multi

Enhancing Memory Use in Simple Coma: Multiplexed Simple Coma (SB, JT), pp. 152–161.

CADE-1998-SchurmannP #automation #logic #proving #theorem proving

Automated Theorem Proving in a Simple Meta-Logic for LF (CS, FP), pp. 286–300.

DAC-1997-CongHKNSY #2d #analysis

Analysis and Justification of a Simple, Practical 2 1/2-D Capacitance Extraction Methodology (JC, LH, ABK, DN, NS, SHCY), pp. 627–632.

PLDI-1997-Proebsting #evaluation

Simple Translation of Goal-Directed Evaluation (TAP), pp. 1–6.

ICFP-1997-SabelfeldS #analysis #functional #problem #semantics #source code

Simple Semantic Analysis Problems for Functional Programs (VKS, AS), p. 319.

HCI-SEC-1997-IgaY #interactive

Retrieving and Transmitting Real World Oriented Information by Simple Interaction Through Augmented Electrical Stick (SI, MY), pp. 399–402.

TOOLS-USA-1997-GolubskiP #named #object-oriented

SOLAT — A Simple Object-Oriented Language Analyzing Tool (WG, BP), p. 99–?.

POPL-1997-RemyV #ml #object-oriented

Objective ML: A Simple Object-Oriented Extension of ML (DR, JV), pp. 40–53.

SAC-1997-JagotaD #algorithm #distributed #problem

Simple distributed algorithms for the cycle cutset problem (AKJ, RD), pp. 366–373.

CADE-1997-Matthews #implementation #induction #using

A Practical Implementation of Simple Consequence Relations Using Inductive Definitions (SM), pp. 306–320.

CADE-1997-YangFZ #algorithm #geometry

A Practical Symbolic Algorithm for the Inverse Kinematics of 6R Manipulators with Simple Geometry (LY, HF, ZZ), pp. 73–86.

CSL-1997-Voda #normalisation #recursion

A Simple Ordinal Recursive Normalization of Gödel’s T (PJV), pp. 491–509.

LICS-1997-HengleinR #complexity #type system

The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.

TLCA-1997-Brauner #category theory

A Simple Adequate Categorical Model for PCF (TB), pp. 82–98.

WPC-1996-Sullivan #agile #development #program analysis #tool support

Rapid Development of Simple, Custom Program Analysis Tools (KJS), pp. 40–44.

PLDI-1996-Boehm #garbage collection

Simple Garbage-Collector-Safety (HJB), pp. 89–98.

PLDI-1996-ReppyR #ml #standard

Simple Objects for Standard ML (JHR, JGR), pp. 171–180.

CIKM-1996-Greco #bound #set #unification

Optimal Unification of Bounded Simple Set Terms (SG), pp. 326–336.

ICML-1996-DomingosP #classification #independence

Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier (PMD, MJP), pp. 105–112.

ICPR-1996-ChiaCY #re-engineering #using

Curved surface reconstruction using a simple structured light method (TLC, ZC, CJY), pp. 844–848.

OOPSLA-1996-DiwanMM #analysis #effectiveness #object-oriented #source code #static typing

Simple and Effective Analysis of Statically Typed Object-Oriented Programs (AD, JEBM, KSM), pp. 292–305.

SAC-1996-ChungLLD #behaviour #comparison #using

A comparison of variational data assimilation and nudging using a simple dynamical system with chaotic behavior (WC, JML, SL, SKD), pp. 454–462.

SAC-1996-Nanavati #protocol #self

A simple self-stabilizing reset protocol (AAN), pp. 93–97.

CADE-1996-Schumann #named #parallel #proving #theorem proving

SiCoTHEO: Simple Competitive Parallel Theorem Provers (JS), pp. 240–244.

RTA-1996-Cosmo #diagrams #on the #power of

On the Power of Simple Diagrams (RDC), pp. 200–214.

ICDAR-v1-1995-BlandoKN #image #predict #using

Prediction of OCR accuracy using simple image features (LRB, JK, TAN), pp. 319–322.

ICDAR-v2-1995-Smith #algorithm #detection #performance

A simple and efficient skew detection algorithm via text row accumulation (RS), pp. 1145–1148.

PLDI-1995-Fernandez #effectiveness #optimisation #source code

Simple and Effective Link-Time Optimization of Modula-3 Programs (MFF), pp. 103–115.

ICALP-1995-Petersen

Alternation in Simple Devices (HP), pp. 315–323.

ECOOP-1995-Agesen #algorithm #morphism #parametricity #polymorphism #precise #type inference

The Cartesian Product Algorithm: Simple and Precise Type Inference Of Parametric Polymorphism (OA), pp. 2–26.

ASF+SDF-1995-Deursen #π-calculus

A Simple π-Calculus Manipulation Tool (AvD), pp. 211–232.

HPCA-1995-SaulsburyWCL

An Argument for Simple COMA (AS, TW, JBC, AL), pp. 276–285.

CAV-1995-FidgeKU #realtime #verification

Interactively Verifying a Simple Real-time Scheduler (CJF, PK, MU), pp. 395–408.

ILPS-1995-BigotD #approach

A Simple Approach to Supporting Untagged Objects in Dynamically Typed Languages (PAB, SKD), pp. 257–271.

RTA-1995-Kuper #proving #reduction

Proving the Genericity Lemma by Leftmost Reduction is Simple (JK), pp. 271–278.

TLCA-1995-Groote #calculus #exception

A Simple Calculus of Exception Handling (PdG), pp. 201–215.

TLCA-1995-Hofmann

A Simple Model for Quotient Types (MH0), pp. 216–234.

EDAC-1994-RudnickHSP #algorithm #generative #search-based #testing

Application of Simple Genetic Algorithms to Sequential Circuit Test Generation (EMR, JGH, DGS, JHP), pp. 40–45.

STOC-1994-AlonYZ #graph #named #scalability

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (NA, RY, UZ), pp. 326–335.

STOC-1994-HerlihyS #theorem

A simple constructive computability theorem for wait-free computation (MH, NS), pp. 243–252.

STOC-1994-LiptonY #complexity #game studies #scalability

Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.

STOC-1994-OstrovskyRV #performance

Simple and efficient leader election in the full information model (RO, SR, UVV), pp. 234–242.

ICALP-1994-GilM #parallel #performance

Simple Fast Parallel Hashing (JYG, YM), pp. 239–250.

LFP-1994-ClingerH #compilation #optimisation

λ, the Ultimate Label or a Simple Optimizing Compiler for Scheme (WDC, LTH), pp. 128–139.

KR-1994-GoldmanB #nondeterminism #representation

Representing Uncertainty in Simple Planners (RPG, MSB), pp. 238–245.

SIGIR-1994-RobertsonW #approximate #effectiveness #probability #retrieval

Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval (SER, SW), pp. 232–241.

PLILP-1994-BevemyrL #garbage collection #performance #prolog

A Simple and Efficient Copying Garbage Collector for Prolog (JB, TL), pp. 88–101.

POPL-1994-BosschereDGK #interprocedural #optimisation

Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages (KDB, SKD, DG, SK), pp. 409–420.

SAC-1994-MahoneyLW #exponential #network

Construction of an artificial neural network for simple exponential smoothing in forecasting (DWM, RPL, SIW), pp. 308–312.

SAC-1994-Sen #classification

Representational effects in a simple classifier system (SS), pp. 206–211.

ASPLOS-1994-SkeppstedtS #algorithm #compilation #protocol

Simple Compiler Algorithms to Reduce Ownership Operhead in Cache Coherence Protocols (JS, PS), pp. 286–296.

CADE-1994-MiddeldorpZ #revisited #termination

Simple Termination Revisited (AM, HZ), pp. 451–465.

CAV-1994-LamB #automaton

Criteria for the Simple Path Property in Timed Automata (WKCL, RKB), pp. 27–40.

ILPS-1994-DebrayJ #parallel #program transformation

A Simple Program Transformation for Parallelism (SKD, MJ), pp. 305–319.

ILPS-1994-YuanY #effectiveness

A Simple but Effective Program Revision Method (LYY, JHY), p. 686.

ISSTA-1994-BuyS #analysis #petri net #realtime #source code

Analysis of Real-Time Programs with Simple Time Petri Nets (UAB, RHS), pp. 228–239.

LICS-1994-Otto #quantifier

Generalized Quantifiers for Simple Properties (MO), pp. 30–39.

VLDB-1993-TalensOC

Versions of Simple and Composite Objects (GT, CO, MFC), pp. 62–72.

ICALP-1993-DillencourtS

A Simple Method for Resolving Degeneracies in Delaunay Triangulations (MBD, WDS), pp. 177–188.

HCI-ACS-1993-SuzukiH #effectiveness #on the #variability

On a Simple and Effective Method to Analyze Heart Rate Variability (KS, YH), pp. 914–919.

INTERCHI-1993-HudsonH #approach #independence #specification

A synergistic approach to specifying simple number independent layouts by example (SEH, CNH), pp. 285–292.

CIKM-1993-RusS #architecture #component #multi #retrieval

Multi-media RISSC Informatics: Retrieval of Information with Simple Structural Components (Part I: The Architecture) (DR, DS), pp. 283–294.

ICML-1993-RendersBS #adaptation #black box #how

Adaptive NeuroControl: How Black Box and Simple can it be (JMR, HB, MS), pp. 260–267.

SIGIR-1993-OgawaBH #keyword #ranking #string #word

Simple Word Strings as Compound Keywords: An Indexing and Ranking Method for Japanese Texts (YO, AB, MH), pp. 227–236.

CAV-1993-Gordon #imperative #source code #verification

A Verifier and Timing Analyser for Simple Imperative Programs (Abstract) (MJCG), p. 320.

RTA-1993-MiddeldorpG #termination

Simple Termination is Difficult (AM, BG), pp. 228–242.

SIGMOD-1992-ShashaSV #transaction

Simple Rational Guidance for Chopping Up Transactions (DS, ES, PV), pp. 298–307.

PEPM-1992-Field #imperative #program analysis #semantics #source code

A Simple Rewriting Semantics for Realistic Imperative Programs and its Application to Program Analysis (JF), pp. 98–107.

PLDI-1992-Proebsting #generative #performance

Simple and Efficient BURS Table Generation (TAP), pp. 331–340.

STOC-1992-DworkW #bound #concurrent #exclamation #performance

Simple and Efficient Bounded Concurrent Timestamping or Bounded Concurrent Timestamp Systems are Comprehensible! (CD, OW), pp. 655–666.

STOC-1992-MaggsS #algorithm #bound #network

Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) (BMM, RKS), pp. 150–161.

CSCW-1992-HymesO #editing

Unblocking Brainstorming Through the Use of a Simple Group Editor (CMH, GMO), pp. 99–106.

KR-1992-GoldszmidtP #approach #reasoning

Rank-based Systems: A Simple Approach to Belief Revision, Belief Update, and Reasoning about Evidence and Actions (MG, JP), pp. 661–672.

SEKE-1992-KimH #database #deduction #evaluation #parallel #recursion

Network-Based Simple Recursive Answer Evaluation for Deductive Databases in Parallel Environment (KK, LJH), pp. 63–70.

FPCA-1991-LeungM #lazy evaluation #reasoning

Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages (AL, PM), pp. 328–351.

SIGMOD-1990-BlumS #query

The INA: A Simple Query Language with Only Attribute Names (BIB, RDS), p. 390.

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

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

VLDB-1990-Mohan90a #commit #named #novel #transaction

Commit_LSN: A Novel and Simple Method for Reducing Locking and Latching in Transaction Processing Systems (CM), pp. 406–418.

VLDB-1989-MendelzonW #database #graph

Finding Regular Simple Paths in Graph Databases (AOM, PTW), pp. 185–193.

FPCA-1989-Ohori #ml #morphism #polymorphism #semantics

A Simple Semantics for ML Polymorphism (AO), pp. 281–292.

KR-1989-Baker #problem

A Simple Solution to the Yale Shooting Problem (ABB), pp. 11–20.

KR-1989-KautzS #logic #problem

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

SOSP-1989-BoloskyFS #effectiveness #memory management

Simple But Effective Techniques for NUMA Memory Management (WJB, RPF, MLS), pp. 19–31.

DAC-1988-PillageR #metric #polynomial

A Quadratic Metric with a Simple Solution Scheme for Initial Placement (LTP, RAR), pp. 324–329.

ESOP-1988-Takayama #analysis #compilation #named #proving

QPC: QJ-based Proof Compiler — Simple Examples and Analysis (YT), pp. 49–63.

ICALP-1988-ChangIP #bound #modelling #parallel #performance #simulation

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM’s and Space-Bounded TM’s (JHC, OHI, MAP), pp. 119–132.

LFP-1988-GharachorlooSH #approach #performance

A Simple and Efficient Implmentation Approach for Single Assignment Languages (KG, VS, JLH), pp. 259–268.

JICSCP-1988-Port88 #approach

A Simple Approach to Finding the Cause of Non-Unifiability (GSP), pp. 651–665.

JICSCP-1988-SmithL88 #interpreter #prolog

A Simple Near-Horn Prolog Interpreter (BTS, DWL), pp. 794–809.

LICS-1988-MullerSS #automaton #decidability #exponential #logic #why

Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.

LICS-1988-Wand #named #type inference

Corrigendum: Complete Type Inference for Simple Objects (MW), p. 132.

PODS-1987-AfratiP #complexity #parallel #query

The Parallel Complexity of Simple Chain Queries (FNA, CHP), pp. 210–213.

SIGMOD-1987-RubensteinKC #benchmark #database #metric

Benchmarking Simple Database Operations (WBR, MSK, RGGC), pp. 387–394.

VLDB-1987-BancilhonBKV #database

FAD, a Powerful and Simple Database Language (FB, TB, SK, PV), pp. 97–105.

STOC-1987-Ronyai #algebra

Simple Algebras Are Difficult (LR), pp. 398–408.

FPCA-1987-FairbairnW #automaton #combinator #lazy evaluation #named

TIM: A simple, lazy abstract machine to execute supercombinatorics (JF, SW), pp. 34–45.

HCI-SES-1987-JarvenpaaT #design

Mental Workload in Simple and Complicated Computer Aided Design (EJ, VT), pp. 271–276.

SOSP-1987-BirrellJW #big data #database #implementation #performance

A Simple and Efficient Implementation for Small Databases (AB, MBJ, EW), pp. 149–154.

LICS-1987-Breazu-TannenM #morphism #polymorphism

Polymorphism is conservative over simple types (Preliminary Report) (VT, ARM), pp. 7–17.

LICS-1987-Wand #type inference

Complete Type Inference for Simple Objects (MW), pp. 37–44.

SLP-1987-Debray87 #analysis #logic programming #source code

Flow Analysis of a Simple Class of Dynamic Logic Programs (SKD), pp. 307–316.

PODS-1986-SaccaZ #database #implementation #logic #on the #query

On the Implementation of a Simple Class of Logic Queries for Databases (DS, CZ), pp. 16–23.

VLDB-1986-OlkenR #database #random #relational

Simple Random Sampling from Relational Databases (FO, DR), pp. 160–169.

STOC-1986-TarjanW #algorithm #linear

A Linear-Time Algorithm for Triangulating Simple Polygons (RET, CJVW), pp. 380–388.

LFP-1986-ClementDDK

A Simple Applicative Language: Mini-ML (DC, JD, TD, GK), pp. 13–27.

SIGIR-1986-BoscCR #named #natural language #user interface

CALIN — A User Interface Based on a Simple Natural Language (PB, MC, SR), pp. 114–122.

OOPSLA-1986-Ingalls #morphism #multi #polymorphism

A Simple Technique for Handling Multiple Polymorphism (DHHI), pp. 347–349.

CADE-1986-Plaisted

A Simple Non-Termination Test for the Knuth-Bendix Method (DAP), pp. 79–88.

STOC-1985-GacsR #3d #array #realtime #reliability

A Simple Three-Dimensional Real-Time Reliable Cellular Array (PG, JHR), pp. 388–395.

STOC-1985-Luby #algorithm #independence #parallel #problem #set

A Simple Parallel Algorithm for the Maximal Independent Set Problem (ML), pp. 1–10.

ICALP-1985-Hansel #proving #theorem

A Simple Proof of the Skolem-Mahler-Lech Theorem (GH), pp. 244–249.

ICSE-1985-KnightA #evaluation #fault

An Experimental Evaluation of Simple Methods for Seeding Program Errors (JCK, PA), pp. 337–342.

PODS-1984-Hull #capacity #database #relational

Relative Information Capacity of Simple Relational Database Schemata (RH), pp. 97–109.

SIGMOD-1984-Chan

Optimal Computation of Total Projections with Unions of Simple Chase Join Expressions (EPFC), pp. 149–163.

STOC-1984-Miller #graph

Finding Small Simple Cycle Separators for 2-Connected Planar Graphs (GLM), pp. 376–382.

ICALP-1984-Vitanyi #realtime

The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version) (PMBV), pp. 486–489.

DAC-1983-MicheliS #array #logic #multi #named #programmable

PLEASURE: a computer program for simple/multiple constrained/unconstrained folding of Programmable Logic Arrays (GDM, ALSV), pp. 530–537.

PODS-1983-GoodmanST #database #performance

A Simple Analytic Model for Performance of Exclusive Locking in Database Systems (NG, RS, YCT), pp. 203–215.

VLDB-1983-BuckleyS #database #multi #protocol

Obtaining Progressive Protocols for a Simple Multiversion Database Model (GNB, AS), pp. 74–80.

DAC-1982-TrimbergerR #assembly #named #visual notation

Riot — a simple graphical chip assembly tool (ST, JAR), pp. 371–376.

STOC-1982-CookD #bound #parallel #ram

Bounds on the Time for Parallel RAM’s to Compute Simple Functions (SAC, CD), pp. 231–233.

ICALP-1982-KrevnerY #precedence #theorem

An Iteration Theorem for Simple Precedence Languages (Extended Abstract) (YK, AY), pp. 360–368.

ICALP-1981-IbarraLM #complexity #on the

On the Complexity of Simple Arithmetic Expressions (OHI, BSL, SM), pp. 294–304.

SOSP-1981-CarrH #algorithm #effectiveness #memory management #named

WSClock — A Simple and Effective Algorithm for Virtual Memory Management (RWC, JLH), pp. 87–95.

POPL-1980-Kfoury #analysis #set #source code

Analysis of Simple Programs Over Different Sets of Primitives (AJK), pp. 56–61.

CADE-1980-Gloess #correctness #empirical #parsing #proving #theorem proving

An Experiment with the Boyer-Moore Theorem Prover: A Proof of the Correctness of a Simple Parser of Expressions (PYG), pp. 154–169.

DAC-1979-MuraiTKST

A hierarchical placement procedure with a simple blocking scheme (SM, HT, MK, KS, CT), pp. 18–23.

DAC-1979-SatoNSY #design #layout #named

MIRAGE — a simple-model routing program for the hierarchical layout design of IC masks (KS, TN, HS, TY), pp. 297–304.

STOC-1979-GurariI #complexity #equivalence #linear #problem #set #source code

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs (EMG, OHI), pp. 142–152.

SOSP-1979-SwinehartMB #distributed #file system #named

WFS: A Simple Shared File System for a Distributed Environment (DCS, GM, DB), pp. 9–17.

ICALP-1978-AlbertMR #generative

Simple EOL Forms under Uniform Interpretation Generating CF Languages (JA, HAM, GR), pp. 1–14.

ICALP-1978-Nijholt #on the #parsing

On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.

ICALP-1977-ChytilJ #composition #finite #source code #string #transducer

Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.

ICALP-1977-Nijholt

Simple Chain Grammars (AN), pp. 352–364.

ICALP-1977-PnueliS #problem #source code

Simple Programs and Their Decision Problems (AP, GS), pp. 380–390.

POPL-1977-CherniavskyK #consistency #hoare #programming language #semantics

A Complete and Consistent Hoare Semantics for a Simple Programming Language (JCC, SNK), pp. 1–9.

STOC-1976-MachteyY

Simple Gödel Numberings, Translations, and the P-Hierarchy (MM, PY), pp. 236–243.

POPL-1975-JonesM #source code

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

DAC-1974-DruffelSW #automation #design #performance

A simple, efficient design automation processor (LED, DCS, RAW), pp. 127–136.

DAC-1974-Ressler

A simple computer-aided artwork system that works (DGR), pp. 92–97.

STOC-1974-CourcelleV #axiom #recursion #semantics

Semantics and Axiomatics of a Simple Recursive Language (BC, JV), pp. 13–26.

ICALP-1974-HartmanisB #on the

On Simple Goedel Numberings and Translations (JH, TPB), pp. 301–316.

ICALP-1974-Hayes #nondeterminism

Simple and Structural Redundancy in Non-Deterministic Computation (PJH), pp. 601–611.

STOC-1973-Vuillemin #implementation #programming language #recursion

Correct and Optimal Implementations of Recursion in a Simple Programming Language (JV), pp. 224–239.

POPL-1973-HechtU #algorithm #analysis #problem

Analysis of a Simple Algorithm for Global Flow Problems (MSH, JDU), pp. 207–217.

ICALP-1972-Engelfriet

Translation of Simple Program Schemes (JE), pp. 215–223.

STOC-1970-Morris #precedence

A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages (JBM), pp. 73–80.