Stem basic$ (all stems)

158 papers:

DATE-2015-KyrtatasSP #algebra #compilation #embedded #linear

A basic linear algebra compiler for embedded processors (NK, DGS, MP), pp. 1054–1059.

DHM-EH-2015-HuZZRL #analysis #correlation

Correlation Analysis on the Main and Basic Body Dimension for Chinese Adults (HH, CZ, XZ, LR, TL), pp. 37–43.

DUXU-UI-2015-ZhuSK #case study #design #smarttech

A Field Study on Basic Usage Patterns of Traditional Watch and Smart Phone for Designing Smart Watch (ZZ, HS, SWK), pp. 597–608.

HIMI-IKD-2015-SakuraiNKTH #image #integration

Basic Study of Evoking Emotion Through Extending One’s Body Image by Integration of Internal Sense and External Sense (SS, TN, TK, TT, MH), pp. 433–444.

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.

DAC-2014-WangA #constraints #data mining #mining

Data Mining In EDA — Basic Principles, Promises, and Constraints (LCW, MSA), p. 6.

DATE-2014-Pomeranz14a #fault

Substituting transition faults with path delay faults as a basic delay fault model (IP), pp. 1–6.

FoSSaCS-2014-BonnetKL #analysis #parallel #probability #process

Analysis of Probabilistic Basic Parallel Processes (RB, SK, AWL), pp. 43–57.

TACAS-2014-ReinekeT #modelling #multi #problem

Basic Problems in Multi-View Modeling (JR, ST), pp. 217–232.

SFM-2014-AlbertAGR #concept #concurrent #execution #generative #symbolic computation #testing

Test Case Generation by Symbolic Execution: Basic Concepts, a CLP-Based Instance, and Actor-Based Concurrency (EA, PA, MGZ, JMR), pp. 263–309.

HCI-TMT-2014-HankiewiczB #performance #quality #source code #using #word

Efficiency in Performing Basic Tasks Using Word Processing Programs by the Elderly as a Measure of the Ergonomic Quality of Software (KH, MB), pp. 481–488.

HCI-TMT-2014-PhotiadisZ #3d #design #experience #user interface #visualisation

The Formulation and Visualization of 3D Avatar Design, Including Three Basic Theoretical Elements: Aesthetic, User Experience and Psychology (TP, PZ), pp. 134–144.

HIMI-AS-2014-IizukaG #mobile #using

Basic Study on Personal Space while Using Mobile Devices in Public (SI, KG), pp. 404–412.

HIMI-DE-2014-YamanakaN #image #research

Basic Research on the Factors Influencing Perception of Texture from Images (KY, KN), pp. 281–288.

CGO-2014-SpampinatoP #algebra #compilation #linear

A Basic Linear Algebra Compiler (DGS, MP), p. 23.

LCTES-2014-BeaugnonKHBTAL #algebra #linear #named

VOBLA: a vehicle for optimized basic linear algebra (UB, AK, SvH, RB, DT, JA, AL), pp. 115–124.

VLDB-2013-HuaiMLO0 #clustering #comprehension

Understanding Insights into the Basic Structure and Essential Issues of Table Placement Methods in Clusters (YH, SM, RL, OO, XZ), pp. 1750–1761.

ITiCSE-2013-Rodriguez-CerezoGS #compilation #comprehension #concept #education #interactive #simulation

Interactive educational simulations for promoting the comprehension of basic compiler construction concepts (DRC, MGA, JLSR), pp. 28–33.

CIAA-2013-BrzozowskiL #complexity

Universal Witnesses for State Complexity of Basic Operations Combined with Reversal (JAB, DL), pp. 72–83.

CIAA-2013-MaiaMR #complexity #finite

Incomplete Transition Complexity of Basic Operations on Finite Languages (EM, NM, RR), pp. 349–356.

HCI-AMTE-2013-OhkuraK

Basic Study on Kawaii Feeling of Material Perception (MO, TK), pp. 585–592.

HIMI-D-2013-SugayaSNT #recognition #using

Basic Investigation into Hand Shape Recognition Using Colored Gloves Taking Account of the Peripheral Environment (TS, TS, HN, HT), pp. 133–142.

VLDB-2012-DallachiesaNMP #nondeterminism #similarity

Uncertain Time-Series Similarity: Return to the Basics (MD, BN, KM, TP), pp. 1662–1673.

FLOPS-2012-AntoyP #compilation #functional #logic

Compiling a Functional Logic Language: The Basic Scheme (SA, AP), pp. 17–31.

ICALP-v1-2012-DinitzKR #approximate #scalability

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

SFM-2012-AndovaBEV #domain-specific language

MDE Basics with a DSL Focus (SA, MvdB, LJPE, TV), pp. 21–57.

LICS-2012-Hoshino #call-by #combinator #semantics

Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects (NH), pp. 385–394.

ICDAR-2011-ZhuN11a #classification #online #recognition #scalability

A Coarse Classifier Construction Method from a Large Number of Basic Recognizers for On-line Recognition of Handwritten Japanese Characters (BZ, MN), pp. 1090–1094.

ITiCSE-2011-Goldweber #learning #process #turing machine

Two kinesthetic learning activities: turing machines and basic computer organization (MG), p. 335.

HCI-DDA-2011-MiyazakiNI #detection #image

A Detection Method of Basic Mouth Shapes from Japanese Utterance Images (TM, TN, NI), pp. 608–617.

HIMI-v1-2011-TakahashiSHNIHKWK #analysis #process

Basic Study of Analysis of Human Brain Activities during Car Driving (NT, SS, YH, HN, HI, NH, SK, EW, SK), pp. 627–635.

ICEIS-v1-2011-GongZPY #information management #integration #research

Research on the Information Integration of China’s Basic Industries Trademark Information Service (XG, ZZ, JP, WY), pp. 495–503.

DATE-2010-Diekhoff

AUTOSAR basic software for complex control units (DD), pp. 263–266.

KEOD-2010-BoinskiOSK #concept #design #ontology

Influence and Selection of Basic Concepts on Ontology Design (TB, PO, PS, HK), pp. 364–369.

IJCAR-2010-MayerC #hybrid #logic #proving

Herod and Pilate: Two Tableau Provers for Basic Hybrid Logic (MCM, SC), pp. 255–262.

ITiCSE-2009-MiuraSK #concept #interactive #object-oriented #programming language

Anchor garden: an interactive workbenchfor basic data concept learningin object oriented programming languages (MM, TS, SK), pp. 141–145.

ITiCSE-2009-WiesnerB #concept #how #learning #question

How do robots foster the learning of basic concepts in informatics? (BW, TB), p. 403.

HCI-NIMT-2009-NagaiKI

A Basic Study on a Drawing-Learning Support System in the Networked Environment (TN, MK, KI), pp. 860–868.

HCI-NIMT-2009-SuzukiKYY #interactive #interface #towards

A Basic Study of Sensory Characteristics toward Interaction with a Box-Shaped Interface (NS, TK, SY, SY), pp. 513–522.

HIMI-DIE-2009-BrangierDE #analysis #integration #library

The 7 Basic Functions of a Digital Library — Analysis of Focus Groups about the Usefulness of a Thematic Digital Library on the History of European Integration (EB, JD, LE), pp. 345–354.

ICEIS-HCI-2009-NakanishiTO #artificial reality #complexity #design #effectiveness #guidelines #using #verification

Study for Establishing Design Guidelines for Manuals using Augmented Reality Technology — Verification and Expansion of the Basic Model Describing “Effective Complexity” (MN, SiT, YO), pp. 21–26.

ITiCSE-2008-CorberaGRRT #architecture #development

Development of a new MOODLE module for a basic course on computer architecture (FC, EG, JR, SR, MAT), p. 349.

ICEIS-DISI-2008-SchulteHSES #collaboration #flexibility #framework #generative #research #towards

Towards the Next Generation of Service-Oriented Flexible Collaborative Systems — A Basic Framework Applied to Medical Research (JS, TH, KS, JE, ES), pp. 232–239.

KR-2008-FritzBM #compilation

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond (CF, JAB, SAM), pp. 600–610.

KR-2008-VassosLL #first-order

First-Order Strong Progression for Local-Effect Basic Action Theories (SV, GL, HJL), pp. 662–672.

SEKE-2008-SalvianoF #concept #modelling #process

Unified Basic Concepts for Process Capability Models (CFS, AMCMF), pp. 173–178.

OOPSLA-2008-Russo #visual notation

Join patterns for visual basic (CVR), pp. 53–72.

SAC-2008-BelliH #generative #testing

Test generation and minimization with “basic” statecharts (FB, AH), pp. 718–723.

RTA-2008-AlpuenteEI #composition #termination

Modular Termination of Basic Narrowing (MA, SE, JI), pp. 1–16.

FASE-2007-Lopez-HerrejonA #case study #metric #source code

Measuring and Characterizing Crosscutting in Aspect-Based Programs: Basic Metrics and Case Studies (RELH, SA), pp. 423–437.

LATA-2007-LiuMSY #complexity

State Complexity of Basic Operations Combined with Reversal (GL, CMV, AS, SY), pp. 355–366.

HCI-AS-2007-ChenL #assessment #usability

Usability Assessment of an E-Learning Courseware for Basic Cataloging (XSC, TL), pp. 198–207.

HCI-IDU-2007-TarbyERTLK #architecture #aspect-oriented #comparison #evaluation #interactive #programming #usability #using

Traces Using Aspect Oriented Programming and Interactive Agent-Based Architecture for Early Usability Evaluation: Basic Principles and Comparison (JCT, HE, JR, CDT, PL, CK), pp. 632–641.

HIMI-MTT-2007-SatoKF #concept #interface #precise #verification

Basic Experimental Verification of Grasping Information Interface Concept, Grasping Force Increases in Precise Periods (SS, MK, YF), pp. 180–188.

SIGIR-2007-TrieschniggKJ #documentation #retrieval

The influence of basic tokenization on biomedical document retrieval (DT, WK, FdJ), pp. 803–804.

RE-2007-BorgPS #capacity #requirements

Extending the OpenUP/Basic Requirements Discipline to Specify Capacity Requirements (AB, MP, KS), pp. 328–333.

REFSQ-2007-BorgPS #capacity #process #requirements

Integrating an Improvement Model of Handling Capacity Requirements with the OpenUP/Basic Process (AB, MP, KS), pp. 341–354.

ESOP-2006-CarpinetiL #contract #web #web service

A Basic Contract Language for Web Services (SC, CL), pp. 197–213.

ICPR-v3-2006-Haralick #concept #testing

Basic Concepts For Testing The Torah Code Hypothesis (RMH), pp. 104–109.

MoDELS-2006-AlanenP #modelling #set

Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.

MoDELS-2006-AlanenP #modelling #set

Basic Operations over Models Containing Subset and Union Properties (MA, IP), pp. 469–483.

DATE-2005-OzturkKI #garbage collection #named

BB-GC: Basic-Block Level Garbage Collection (ÖÖ, MTK, MJI), pp. 1032–1037.

DATE-2005-SyriHM #metric

EEE 1149.4 Compatible ABMs for Basic RF Measurements (PS, JH, MM), pp. 172–173.

SAS-2005-BagnaraRZ #algebra #generative #invariant #using

Generation of Basic Semi-algebraic Invariants Using Convex Polyhedra (RB, ERC, EZ), pp. 19–34.

SAS-2005-NarasamdyaV

Finding Basic Block and Variable Correspondence (IN, AV), pp. 251–267.

ICALP-2005-NicolaGP #calculus

Basic Observables for a Calculus for Global Computing (RDN, DG, RP), pp. 1226–1238.

SIGIR-2005-BadueBGRZ #query #web

Basic issues on the processing of web queries (CSB, RAB, PBG, BARN, NZ), pp. 577–578.

RTA-2005-LynchM #equation #performance

Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories (CL, BM), pp. 90–104.

CSEET-2004-Nikula #case study #experience #requirements

Experiences of Embedding Training in a Basic Requirements Engineering Method (UN), pp. 104–109.

ITiCSE-2004-Gal-EzerLS #problem

Interesting basic problems for CS1 (JGE, DL, DS), p. 275.

ITiCSE-WGR-2004-Shumba #education #effectiveness #towards

Towards a more effective way of teaching a cybersecurity basics course (RS), pp. 108–111.

FLOPS-2004-Kahl #calculus #pattern matching

Basic Pattern Matching Calculi: a Fresh View on Matching Failure (WK), pp. 276–290.

DLT-2004-EhrenfeuchtR

Basic Notions of Reaction Systems (AE, GR), pp. 27–29.

ICEIS-v5-2004-EscribanoCGC #internet

Basic Strategies to Enhance Teleoperation Platforms through the Internet (JE, JAC, RG, CC), pp. 242–245.

ICPR-v4-2004-FangGGC #approach #automation #novel

A Novel Approach to Automatically Extracting Basic Units from Chinese Sign Language (GF, XG, WG, YC), pp. 454–457.

DAC-2003-Hayes #concept #named #quantum #tutorial

Tutorial: basic concepts in quantum circuits (JPH), p. 893.

DATE-2003-GirardiB #automation #generative #layout #named

LIT — An Automatic Layout Generation Tool for Trapezoidal Association of Transistors for Basic Analog Building Blocks (AG, SB), pp. 11106–11107.

ITiCSE-2003-KoldehofePT #case study #distributed #using #visualisation

Integrating a simulation-visualisation environment in a basic distributed systems course: a case study using LYDIAN (BK, MP, PT), pp. 35–39.

SAC-2003-MonfroyC #component #constraints #theorem proving

Basic Components for Constraint Solver Cooperations (EM, CC), pp. 367–374.

LICS-2003-Jancar #parallel #process #similarity

Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete (PJ), p. 218–?.

CIAA-2002-HolzerK #automaton #complexity #finite #nondeterminism

State Complexity of Basic Operations on Nondeterministic Finite Automata (MH, MK), pp. 148–157.

ICALP-2002-Mannila #data mining #mining #problem

Local and Global Methods in Data Mining: Basic Techniques and Open Problems (HM), pp. 57–68.

ICALP-2002-Srba #algebra #process #similarity

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

IFM-2002-NepomniaschySBK #approach #design #distributed #named #specification #verification

Basic-REAL: Integrated Approach for Design, Specification and Verification of Distributed Systems (VAN, NVS, EVB, VEK), pp. 69–88.

ICGT-2002-Klempien-Hinrichs

Hyperedge Substitution in Basic Atom-Replacement Languages (RKH), pp. 192–206.

CADE-2002-LynchM

Basic Syntactic Mutation (CL, BM), pp. 471–485.

CSEET-2001-Kay #re-engineering

Computer Law Basics for Software Engineering Educators (DGK), p. 289–?.

ITiCSE-2001-HabermanK #black box #concept #education

Activating “black boxes” instead of opening “zipper” — a method of teaching novices basic CS concepts (BH, YBDK), pp. 41–44.

FoSSaCS-2001-Stirling #decidability #parallel #process #set #similarity

Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes (CS), pp. 379–393.

IWPC-J-1999-AntoniolCPT01 #traceability

Design-code traceability recovery: selecting the basic linkage properties (GA, BC, AP, PT), pp. 213–234.

FoSSaCS-2000-BerardLS #equivalence #parallel #performance #process #verification

Verifying Performance Equivalence for Timed Basic Parallel Processes (BB, AL, PS), pp. 35–47.

ICALP-2000-BolligW #bound #problem

Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.

ICALP-2000-ElkinP #problem

Strong Inapproximability of the Basic k-Spanner Problem (ME, DP), pp. 636–647.

ICALP-2000-Mayr #bisimulation #complexity #on the #parallel #problem #process

On the Complexity of Bisimulation Problems for Basic Parallel Processes (RM), pp. 329–341.

ECOOP-2000-SecoC #component

A Basic Model of Typed Components (JCS, LC), pp. 108–128.

SAC-2000-ChongS

Back to the Basics: A first Class Chalkboard and More (NSTC, MS), pp. 131–136.

ICSE-2000-LittlewoodS #assessment #concept #reliability #tutorial

Software reliability (tutorial session): basic concepts and assessment methods (BL, LS), p. 831.

SPLC-2000-Wappler

Remember the basics (TW), pp. 73–84.

WIA-1999-CampeanuCSY #complexity #finite

State Complexity of Basic Operations on Finite Languages (CC, KCI, KS, SY), pp. 60–70.

HCI-CCAD-1999-Niemeier #network #web #web service

Networking Companies: from basic web services to business solutions (JN), pp. 467–471.

SIGIR-1999-HoenkampSS #category theory #retrieval

Supporting Content Retrieval from WWW via “Basic Level Categories” (poster abstract) (EH, OS, LS), pp. 311–312.

OOPSLA-1999-France #analysis #concept #modelling #problem #requirements #uml

A Problem-Oriented Analysis of Basic UML Static Requirements Modeling Concepts (RBF), pp. 57–69.

HPCA-1999-HuangL #locality #reuse

Exploiting Basic Block Value Locality with Block Reuse (JH, DJL), pp. 106–114.

PPoPP-1999-LeePM #algorithm #compilation #parallel #source code

Basic Compiler Algorithms for Parallel Programs (JL, DAP, SPM), pp. 1–12.

ITiCSE-1998-Makkonen

WWW-based presentations as a complementary part of conventional lectures in the basic of informatics (PM), pp. 162–165.

KR-1998-Lukasiewicz #constraints #deduction #probability

Probabilistic Deduction with Conditional Constraints over Basic Events (TL), pp. 380–393.

TOOLS-USA-1998-Goldstein #visual notation

Developing COM Business Objects with Visual Basics 5.0 (MG), p. 406.

CC-1998-KnoopKS #graph #question

Basic-Block Graphs: Living Dinosaurs? (JK, DK, BS), pp. 65–79.

CADE-1998-BachmairG #strict

Strict Basic Superposition (LB, HG), pp. 160–174.

ITiCSE-1997-Makkonen #collaboration #hypermedia #learning #question

Does collaborative hypertext support better engagement in learning of the basics in informatics? (PM), pp. 130–132.

ICALP-1997-BorealeNP #process

Basic Observables for Processes (MB, RDN, RP), pp. 482–492.

GG-Handbook-Vol1-CorradiniMREHL #algebra #approach #category theory #concept #graph transformation

Algebraic Approaches to Graph Transformation — Part I: Basic Concepts and Double Pushout Approach (AC, UM, FR, HE, RH, ML), pp. 163–246.

HCI-CC-1997-Grzybowski

Ergonomic Assessments of Workstands as the Basic Information for the Work Conditions Management in Plants (WG), pp. 687–690.

CIKM-1997-GoralwallaLOS #modelling

Modeling Temporal Primitives: Back to Basics (IAG, YL, MTÖ, DS), pp. 24–31.

CSL-1997-Faggian #logic #proving

Classical Proofs via Basic Logic (CF), pp. 203–219.

ITiCSE-1996-Castaneda #using #visual notation

Windows-based applications in Visual Basic using project teams (SEC), p. 232.

OOPSLA-1996-DutoitLCP #object-oriented #prototype

The Basic Object System: Supporting a Spectrum From Prototypes To Hardened Code (AHD, SL, DC, RP), pp. 104–121.

JICSLP-1996-Rao #implementation

Completeness Results for Basic Narrowing in Non-Copying Implementations (MRKKR), pp. 393–407.

LICS-1996-Nieuwenhuis #decidability

Basic Paramodulation and Decidable Theories (Extended Abstract) (RN), pp. 473–482.

ICDAR-v2-1995-PriviteraP #word

A system for scanning and segmenting cursively handwritten words into basic strokes (CMP, RP), pp. 1047–1050.

FPLE-1995-HartelET #proving #student

Basic Proof Skills of Computer Science Students (PHH, BvE, DT), pp. 269–287.

FPLE-1995-KoopmanZ #database #functional #programming

Functional Programming in a Basic Database Course (PWMK, VZ), pp. 215–229.

ICSM-1995-AntoniolFMT #c++ #migration #user interface #visual notation

Application and user interface migration from BASIC to Visual C++ (GA, RF, EM, PT), p. 76–?.

CAV-1995-EsparzaK #branch #logic #model checking #on the #parallel #problem #process

On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes (JE, AK), pp. 353–366.

RTA-1995-Senizergues #algorithm #confluence #polynomial #testing

A Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems (GS), pp. 194–209.

TLCA-1995-Kondoh #data type #equation

Basic Properties of Data Types with Inequational Refinements (HK), pp. 279–296.

DAC-1994-KondratyevKLVY #implementation #independence

Basic Gate Implementation of Speed-Independent Circuits (AK, MK, BL, PV, AY), pp. 56–62.

DAC-1994-TeraiGNSO #automation #concept #design #performance

Basic Concept of Cooperative Timing-driven Design Automation Technology for High-speed RISC Processor HARP-1 (HT, KG, YN, YS, YO), pp. 262–269.

ICSE-1994-Ardis #lessons learnt #using

Lessons from Using Basic LOTOS (MAA), pp. 5–14.

CC-1994-MahadevanR #framework #scheduling

Instruction Schedulimg over Regions: A Framework for Scheduling Across Basic Blocks (UM, SR), pp. 419–434.

HCI-ACS-1993-Barnard #design #modelling #research

Modelling Users, Systems and Design Spaces (Esprit Basic Research Action 3066) (PJB), pp. 331–336.

HCI-SHI-1993-KatoDO

The Basic Study of Natural Operation in Virtual Space (NK, MD, AO), pp. 681–686.

LOPSTR-1993-OlmedillaBH #automation #independence

Automatic Exploitation of Non-Determinate Independent And-Parallelism in the Basic Andorra Model (MO, FB, MVH), pp. 177–195.

PLILP-1993-KesslerR #performance #scalability

Efficient Register Allocation for Large Basic Blocks (CWK, TR), pp. 418–419.

SAC-1993-AnconaN #reuse

Filtering Import: A Basic Mechanism for Reusability (MA, PN), pp. 103–110.

SAC-1993-HarrisFR

Basic Blocks in Unconstrained Crossword Puzzles (GH, JF, RR), pp. 257–262.

ESOP-1992-NieuwenhuisR

Basic Superposition is Complete (RN, AR), pp. 371–389.

CAiSE-1992-LeoneMRR #query

The Basic Query Machine of the KIWIS System (NL, AM, GR, PR), pp. 632–650.

ALP-1992-MiddeldorpH

Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) (AM, EH), pp. 244–258.

CADE-1992-BachmairGLS

Basic Paramodulation and Superposition (LB, HG, CL, WS), pp. 462–476.

CSL-1992-ArtemovS #logic #proving

The Basic Logic of Proofs (SNA, TS), pp. 14–28.

DAC-1991-TeraiGWKEHH #automation #concept #design

Basic Concepts of Timing-oriented Design Automation for High-performance Mainframe Computers (HT, FG, KW, TK, ME, SH, MH), pp. 193–198.

PEPM-1991-McNerney #abstract interpretation #compilation #correctness #using #verification

Verifying the Correctness of Compiler Transformations on Basic Blocks using Abstract Interpretation (TSM), pp. 106–115.

CHI-1991-MorchG #concept #named

JANUS: basic concepts and sample dialog (AIM, AG), pp. 457–458.

ICLP-1991-CostaWY #preprocessor #prolog

The Andorra-I Preprocessor: Supporting Full Prolog on the Basic Andorra Model (VSC, DHDW, RY), pp. 443–456.

ICLP-1991-CostaWY91a #implementation #parallel

The Andorra-I Engine: A Parallel Implementation of the Basic Andorra Model (VSC, DHDW, RY), pp. 825–839.

ICLP-1991-Ferrand #concept #logic programming #prolog

Basic Concepts of Logic Programming and Prolog (GF), p. 942.

IWPTS-1991-Helwerda

Results of the CTS-2 ISDN Basic Access Project (RJH), pp. 163–177.

CAiSE-1989-Kingsbury #development #problem

Systems Development: Basic Flaws in the Current Culture — Ideas for Rectifying Some of the Problems (MAK).

LICS-1988-ConstableS #recursion

Computational Foundations of Basic Recursive Function Theory (RLC, SFS), pp. 360–371.

RTA-1987-Rety

Improving Basic Narrowing Techniques (PR), pp. 228–241.

GG-1986-JanssensR #graph grammar

Basic notions of actor grammars: A graph grammar model for actor computation (DJ, GR), pp. 280–298.

RTA-1985-Buchberger #development

Basic Features and Development of the Critical-Pair/Completion Procedure (BB), pp. 1–45.

DAC-1984-Smith #layout #tool support #what

Basic turorial layout tools — what really is there (RS), p. 219.

ICALP-1984-Lagarias #analysis #performance

Performance Analysis of Shamir’s Attack on the Basic Merkle-Hellman Knapsack Cryptosystem (JCL), pp. 312–323.

VLDB-1983-LinN #multi

Basic Timestamp, Multiple Version Timestamp, and Two-Phase Locking (WTKL, JN), pp. 109–119.

SOSP-1969-EarlB

Basic time-sharing: a system of computing principles (DBE, FLB), pp. 75–79.

SOSP-1969-Patel

Basic I/O handling on burroughs B6500 (RMP), pp. 120–129.