BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
abstract (684)
model (156)
system (110)
use (100)
program (90)

Stem extend$ (all stems)

1425 papers:

ECSAECSA-2015-PautassoIS #diagrams #modelling #rest
Modeling RESTful Conversations with Extended BPMN Choreography Diagrams (CP, AI, SS), pp. 87–94.
ECSAECSA-2015-TahriDP #architecture #deployment #distributed #feature model #modelling #smarttech #using
Using Feature Models for Distributed Deployment in Extended Smart Home Architecture (AT, LD, JP), pp. 285–293.
CASECASE-2015-FariaHGL #robust
Extended high-gain observer for robust position control of a micro-gripper in air and vacuum (MGdF, YH, YLG, PL), pp. 1626–1631.
CASECASE-2015-QuangTH #adaptation #using
FPGA-based sensorless PMSM speed control using adaptive extended Kalman filter (NKQ, DDT, QPH), pp. 1650–1655.
DATEDATE-2015-KimKK #memory management #programming
Subpage programming for extending the lifetime of NAND flash memory (JHK, SHK, JSK), pp. 555–560.
FoSSaCSFoSSaCS-2015-HabermehlK #on the #quantifier
On Presburger Arithmetic Extended with Modulo Counting Quantifiers (PH, DK), pp. 375–389.
MSRMSR-2015-BarikLSSM #corpus #named #spreadsheet
Fuse: A Reproducible, Extendable, Internet-Scale Corpus of Spreadsheets (TB, KL, JS, JS, ERMH), pp. 486–489.
STOCSTOC-2015-AggarwalDRS #problem #using
Solving the Shortest Vector Problem in 2n Time Using Discrete Gaussian Sampling: Extended Abstract (DA, DD, OR, NSD), pp. 733–742.
STOCSTOC-2015-KothariM #generative #pseudo
Almost Optimal Pseudorandom Generators for Spherical Caps: Extended Abstract (PKK, RM), pp. 247–256.
STOCSTOC-2015-SunW #canonical #performance
Faster Canonical Forms for Primitive Coherent Configurations: Extended Abstract (XS, JW), pp. 693–702.
CIAACIAA-2015-GruberHJ #automaton #finite #nondeterminism
More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.
CIAACIAA-2015-Watson #automaton #finite #hardware #implementation #regular expression
Hardware Implementations of Finite Automata and Regular Expressions — Extended Abstract (BWW), pp. 13–17.
DLTDLT-2015-Yamakami #bound #complexity #quantum
Complexity Bounds of Constant-Space Quantum Computation — (Extended Abstract) (TY), pp. 426–438.
ICALPICALP-v1-2015-GoldreichGR #branch #context-free grammar #proving #proximity #source code
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs — (Extended Abstract) (OG, TG, RDR), pp. 666–677.
LATALATA-2015-MakowskyL #graph #matrix #word
Hankel Matrices: From Words to Graphs (Extended Abstract) (JAM, NL), pp. 47–55.
CHICHI-2015-KatoM #assessment #interface #named
ExtensionSticker: A Proposal for a Striped Pattern Sticker to Extend Touch Interfaces and its Assessment (KK, HM), pp. 1851–1854.
CSCWCSCW-2015-HuiG #research
Crowdfunding Science: Sharing Research with an Extended Audience (JSH, EMG), pp. 31–43.
HCIHCI-DE-2015-SouzaB #collaboration #design
Extending MoLIC for Collaborative Systems Design (LGdS, SDJB), pp. 271–282.
HCIHCI-IT-2015-MurataMF #modelling #performance
Effects of Target Shape and Display Location on Pointing Performance by Eye-Gaze Input System — Modeling of Pointing Time by Extended Fitts’ Law (AM, MM, DF), pp. 94–106.
HCIHIMI-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.
ICEISICEIS-v2-2015-BraunE #enterprise #framework #modelling
A Generic Framework for Modifying and Extending Enterprise Modeling Languages (RB, WE), pp. 277–286.
ICEISICEIS-v3-2015-KypriotakiZG #distributed #network #peer-to-peer
From Bitcoin to Decentralized Autonomous Corporations — Extending the Application Scope of Decentralized Peer-to-Peer Networks and Blockchains (KNK, EDZ, GMG), pp. 284–290.
ICEISICEIS-v3-2015-LongoZB #composition #contract
Extending WSLA for Service and Contract Composition (AL, MZ, MAB), pp. 307–315.
ECMFAECMFA-2015-KhanAIU #constraints #named #ocl
AspectOCL: Extending OCL for Crosscutting Constraints (MUK, NA, MZI, HU), pp. 92–107.
OnwardOnward-2015-PolitoDBF #framework
A bootstrapping infrastructure to build and extend Pharo-like languages (GP, SD, NB, LF), pp. 183–196.
SACSAC-2015-Gregorio-Rodriguez #consistency #simulation
Extending mCRL2 with ready simulation and iocos input-output conformance simulation (CGR, LL, RMT), pp. 1781–1788.
SLESLE-2015-OchoaRT #feature model #modelling #using
Using decision rules for solving conflicts in extended feature models (LO, OGR, TT), pp. 149–160.
SPLCSPLC-2015-DimovskiABW #model checking #off the shelf #using
Family-based model checking using off-the-shelf model checkers: extended abstract (ASD, ASAS, CB, AW), p. 397.
ICLPICLP-2015-AriasC #execution #interface #towards
Towards a Generic Interface to Integrate CLP and Tabled Execution (Extended Abstract) (JA, MC).
LICSLICS-2015-KotekSVZ
Extending ALCQIO with Trees (TK, MS, HV, FZ), pp. 511–522.
RTARTA-2015-Kirchner #data analysis #graph
Port Graphs, Rules and Strategies for Dynamic Data Analytics — Extended Abstract (Invited Talk) (HK), pp. 1–4.
RTARTA-2015-Rosu #logic
Matching Logic — Extended Abstract (Invited Talk) (GR), pp. 5–21.
ICSTSAT-2015-TuHJ #learning #named #reasoning #satisfiability
QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (KHT, TCH, JHRJ), pp. 343–359.
DATEDATE-2014-BoettcherAEGR #architecture
Advanced SIMD: Extending the reach of contemporary SIMD architectures (MB, BMAH, ME, GG, AR), pp. 1–4.
DATEDATE-2014-ShiC #named
Memcomputing: The cape of good hope: [Extended special session description] (YS, HMC), pp. 1–3.
DATEDATE-2014-YinOLW #configuration management
Extending lifetime of battery-powered coarse-grained reconfigurable computing platforms (SY, PO, LL, SW), pp. 1–6.
DocEngDocEng-2014-MartinsP #documentation #multi #named #reuse
ActiveTimesheets: extending web-based multimedia documents with dynamic modification and reuse features (DSM, MdGCP), pp. 3–12.
SIGMODSIGMOD-2014-EmrichFKNRZ #framework #nondeterminism
An extendable framework for managing uncertain spatio-temporal data (TE, MF, HPK, JN, MR, AZ), pp. 1087–1090.
ESOPESOP-2014-ZomerGRS #encapsulation
Checking Linearizability of Encapsulated Extended Operations (OZ, GGG, GR, MS), pp. 311–330.
FoSSaCSFoSSaCS-2014-KoutavasSH #bisimulation #communication #transaction
Bisimulations for Communicating Transactions — (Extended Abstract) (VK, CS, MH), pp. 320–334.
AFLAFL-2014-Klima #algebra #automaton #on the
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract) (OK), pp. 49–54.
DLTDLT-2014-HolzerJ #automaton
Minimal and Hyper-Minimal Biautomata — (Extended Abstract) (MH, SJ), pp. 291–302.
ICALPICALP-v1-2014-BringmannKPPT #performance #physics #simulation
Internal DLA: Efficient Simulation of a Physical Growth Model — (Extended Abstract) (KB, FK, KP, UP, HT), pp. 247–258.
ICALPICALP-v1-2014-EmekR #set
Semi-Streaming Set Cover — (Extended Abstract) (YE, AR), pp. 453–464.
ICALPICALP-v1-2014-MekaRRR #independence #performance #pseudo
Fast Pseudorandomness for Independence and Load Balancing — (Extended Abstract) (RM, OR, GNR, RDR), pp. 859–870.
ICALPICALP-v1-2014-Tzameret #algorithm #problem #random #satisfiability
Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (Extended Abstract) (IT), pp. 1015–1026.
LATALATA-2014-OttoM #automaton #order
Extended Two-Way Ordered Restarting Automata for Picture Languages (FO, FM), pp. 541–552.
SEFMSEFM-2014-CasselHJS #finite #learning #state machine
Learning Extended Finite State Machines (SC, FH, BJ, BS), pp. 250–264.
GT-VMTGT-VMT-2014-StuckrathW #adaptation #modelling #petri net #user interface
Lattice-extended Coloured Petri Net Rewriting for Adaptable User Interface Models (JS, BW).
HCIDUXU-DI-2014-Barros #gesture #interactive #interface #sketching
Extending ActionSketch for New Interaction Styles: Gestural Interfaces and Interactive Environments (GB), pp. 509–520.
HCIDUXU-ELAS-2014-HeibachST #research
Extended Senses in Responsive Environments — An Artistic Research Project on Atmosphere (CH, AS, JLT), pp. 687–698.
HCIHIMI-DE-2014-SutoPK #collaboration #data type #design #multi
A Collaboration Support Tool for Multi-cultural Design Team Based on Extended ADT Model (HS, PP, NK), pp. 548–557.
HCISCSM-2014-KhalidD #experience #legacy #social #social media
Extended Episodic Experience in Social Mediating Technology: Our Legacy (HK, AJD), pp. 452–461.
CAiSECAiSE-2014-WauteletHKM #modelling
Unifying and Extending User Story Models (YW, SH, MK, IM), pp. 211–225.
ICEISICEIS-v1-2014-GuerineRP #data mining #metaheuristic #mining
Extending the Hybridization of Metaheuristics with Data Mining to a Broader Domain (MG, IR, AP), pp. 395–406.
ICEISICEIS-v2-2014-XuLL #design #estimation #industrial #knowledge-based
Knowledge-based Design Cost Estimation Through Extending Industry Foundation Classes (SX, KL, WL), pp. 161–168.
ICEISICEIS-v3-2014-SaidCAB #metamodelling #modelling #process
Extending BPMN 2.0 Meta-models for Process Version Modelling (IBS, MAC, EA, RB), pp. 384–393.
CIKMCIKM-2014-KongA #web
Extending Faceted Search to the General Web (WK, JA), pp. 839–848.
ICPRICPR-2014-GanSZ #learning
An Extended Isomap for Manifold Topology Learning with SOINN Landmarks (QG, FS, JZ), pp. 1579–1584.
ICPRICPR-2014-LiangLLFL #detection #modelling
Accurate Facial Landmarks Detection for Frontal Faces with Extended Tree-Structured Models (AL, WL, LL, MRF, VL), pp. 538–543.
ICPRICPR-2014-LiuKFYG #semantics
Model Semantic Relations with Extended Attributes (YL, XK, HF, XY, YG), pp. 2549–2554.
ICPRICPR-2014-PhamKO #integration #multi #named
DIET: Dynamic Integration of Extended Tracklets for Tracking Multiple Persons (VQP, TK, RO), pp. 1206–1211.
KMISKMIS-2014-Wagner #concept #memory management
The Concept of Team Transactive Memory Systems — Developing an Extended Model for Organizational Contexts (VW), pp. 319–325.
KRKR-2014-PatriziV #constraints #database #similarity
Action Theories over Generalized Databases with Equality Constraints (Extended Abstract) (FP, SV).
KRKR-2014-ZhangR #algebra #reasoning #representation
Qualitative Spatial Representation and Reasoning in Angry Birds: The Extended Rectangle Algebra (PZ, JR).
SEKESEKE-2014-HuHCC #diagrams #execution #model transformation #uml
Extended DEVSML as a Model Transformation Intermediary to Make UML Diagrams Executable (JH, LH, BC, XC), pp. 314–317.
SEKESEKE-2014-PereiraRA #sequence
Extending RBAC Model to Control Sequences of CRUD Expressions (ÓMP, DDR, RLA), pp. 463–469.
SIGIRSIGIR-2014-JayasingheWSC
Extending test collection pools without manual runs (GKJ, WW, MS, JSC), pp. 915–918.
LOPSTRLOPSTR-2014-LucasMG #2d #dependence #framework #term rewriting
Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems (SL, JM, RG), pp. 113–130.
PPDPPPDP-2014-Ilik #continuation #normalisation #proving #tutorial
Proofs in continuation-passing style: normalization of Gödel’s System T extended with sums and delimited control operators: Distilled Tutorial (DI), pp. 55–56.
QAPLQAPL-2014-TschaikowskiT #algebra #biology #difference #performance #process
Extended Differential Aggregations in Process Algebra for Performance and Biology (MT, MT), pp. 34–47.
RERE-2014-AntonelliRLO #using
Language Extended Lexicon points: Estimating the size of an application using its language (LA, GR, JCSdPL, AO), pp. 263–272.
SACSAC-2014-BassoOF #java #model transformation
Extending JUnit 4 with Java annotations and reflection to test variant model transformation assets (FPB, TCdO, KF), pp. 1601–1608.
SLESLE-2014-BillGKS #model checking #ocl #specification
Model Checking of CTL-Extended OCL Specifications (RB, SG, PK, MS), pp. 221–240.
SPLCSPLC-2014-SierszeckiSHSB #variability
Extending variability management to the next level (KS, MS, HHH, JS, DB), pp. 320–329.
CCCC-2014-SulzmannS #flexibility #ml #performance #regular expression
A Flexible and Efficient ML Lexer Tool Based on Extended Regular Expression Submatching (MS, PvS), pp. 174–191.
CGOCGO-2014-Herczeg #backtracking #compilation #library
Extending the PCRE Library with Static Backtracking Based Just-in-Time Compilation Support (ZH), p. 306.
ICTSSICTSS-2014-El-FakihSY #assessment #automaton #on the #test coverage #testing
On Code Coverage of Extended FSM Based Test Suites: An Initial Assessment (KEF, TS, NY), pp. 198–204.
ISSTAISSTA-2014-GaleottiFA #adaptation #execution #generative #search-based #symbolic computation
Extending a search-based test generator with adaptive dynamic symbolic execution (JPG, GF, AA), pp. 421–424.
RTARTA-TLCA-2014-Schmidt-Schauss #analysis #concurrent #programming language #semantics
Concurrent Programming Languages and Methods for Semantic Analyses (Extended Abstract of Invited Talk) (MSS), pp. 21–30.
SMTSMT-2014-BonichonDT #morphism #polymorphism
Extending SMT-LIB v2 with λ-Terms and Polymorphism (RB, DD, CT), pp. 53–62.
CASECASE-2013-MohajeraniMF #automaton #composition #finite #using #verification
Compositional nonblocking verification for extended finite-state automata using partial unfolding (SM, RM, MF), pp. 930–935.
DATEDATE-2013-JimenezNI #named
Phœnix: reviving MLC blocks as SLC to extend NAND flash devices lifetime (XJ, DN, PI), pp. 226–229.
PODSPODS-2013-HernichKLG #datalog #ontology #reasoning #semantics
Well-founded semantics for extended datalog and ontological reasoning (AH, CK, TL, GG), pp. 225–236.
ESOPESOP-2013-JagadeesanPPR #composition #memory management #modelling #reasoning
Quarantining Weakness — Compositional Reasoning under Relaxed Memory Models (Extended Abstract) (RJ, GP, CP, JR), pp. 492–511.
FASEFASE-2013-Czarnecki #state of the art #variability
Variability in Software: State of the Art and Future Directions — (Extended Abstract) (KC), pp. 1–5.
FoSSaCSFoSSaCS-2013-Staton #algebra #logic
An Algebraic Presentation of Predicate Logic — (Extended Abstract) (SS), pp. 401–417.
TACASTACAS-2013-JohnC #linear #quantifier
Extending Quantifier Elimination to Linear Inequalities on Bit-Vectors (AKJ, SC), pp. 78–92.
WCREWCRE-2013-WalkinshawTD #finite #modelling #state machine
Inferring Extended Finite State Machine models from software executions (NW, RT, JD), pp. 301–310.
STOCSTOC-2013-BeckNT #calculus #polynomial #trade-off
Some trade-off results for polynomial calculus: extended abstract (CB, JN, BT), pp. 813–822.
STOCSTOC-2013-Bernstein #graph #maintenance
Maintaining shortest paths under deletions in weighted directed graphs: [extended abstract] (AB), pp. 725–734.
STOCSTOC-2013-BravermanM #approach #complexity
An information complexity approach to extended formulations (MB, AM), pp. 161–170.
STOCSTOC-2013-CadekKMVW
Extending continuous maps: polynomiality and undecidability (MC, MK, JM, LV, UW), pp. 595–604.
STOCSTOC-2013-CaiGW
A complete dichotomy rises from the capture of vanishing signatures: extended abstract (JYC, HG, TW), pp. 635–644.
STOCSTOC-2013-KingS #polynomial
Byzantine agreement in polynomial expected time: [extended abstract] (VK, JS), pp. 401–410.
STOCSTOC-2013-LenzenP #performance #using
Fast routing table construction using small messages: extended abstract (CL, BPS), pp. 381–390.
CIAACIAA-2013-HolzerJ #algorithm #robust
Brzozowski’s Minimization Algorithm — More Robust than Expected — (Extended Abstract) (MH, SJ), pp. 181–192.
DLTDLT-2013-FulopM #composition #linear #top-down #transducer
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
ICALPICALP-v1-2013-AumullerD #clustering
Optimal Partitioning for Dual Pivot Quicksort — (Extended Abstract) (MA, MD), pp. 33–44.
ICALPICALP-v1-2013-FilmusLMNV #bound #calculus #comprehension #polynomial #towards
Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds — (Extended Abstract) (YF, ML, MM, JN, MV), pp. 437–448.
ICALPICALP-v2-2013-CelisGK #information management #on the
On Revenue Maximization for Agents with Costly Information Acquisition — Extended Abstract (LEC, DCG, ARK), pp. 484–495.
LATALATA-2013-Tveretina #bound
A Conditional Superpolynomial Lower Bound for Extended Resolution (OT), pp. 559–569.
CHICHI-2013-Cottman-FieldsBR
Virtual birding: extending an environmental pastime into the virtual world for citizen science (MCF, MB, PR), pp. 2029–2032.
CHICHI-2013-Grosse-PuppendahlBKK #interface #proximity #recognition #ubiquitous
Swiss-cheese extended: an object recognition method for ubiquitous interfaces based on capacitive proximity sensing (TAGP, AB, FK, AK), pp. 1401–1410.
CHICHI-2013-MankoffRF #research #using
Looking past yesterday’s tomorrow: using futures studies methods to extend the research horizon (JM, JAR, HF), pp. 1629–1638.
CHICHI-2013-SchmidtMB #named #scalability
Screenfinity: extending the perception area of content on very large public displays (CS, JM, GB), pp. 1719–1728.
CSCWCSCW-2013-LinF #learning #network
Opportunities via extended networks for teens’ informal learning (PL, SDF), pp. 1341–1352.
HCIDHM-HB-2013-ReischlH #education
Extending Global Education through Remote Laboratory Access (UR, SH), pp. 117–123.
HCIDUXU-CXC-2013-WindlH #aspect-oriented #design
Intercultural Design for Use — Extending Usage-Centered Design by Cultural Aspects (HW, RH), pp. 139–148.
HCIHCI-AMTE-2013-MayasHK #classification #diagrams #process
Extending the Information of Activity Diagrams with a User Input Classification (CM, SH, HK), pp. 391–400.
HCIHIMI-D-2013-LiaoLH #concept #modelling #ontology #perspective #security #towards
Towards an Ontological Interpretation on the i* Modeling Language Extended with Security Concepts: A Bunge-Wand-Weber Model Perspective (GYL, PJL, LTH), pp. 322–328.
EDOCEDOC-2013-SousaMGM #approach #architecture #data type #enterprise #risk management #using
Assessing Risks and Opportunities in Enterprise Architecture Using an Extended ADT Approach (SS, DM, KG, NM), pp. 81–90.
ICEISICEIS-v2-2013-RibeiroSFO #concept #constraints #ocl #validation
Extending OCL to Specify and Validate Integrity Constraints in UML-GeoFrame Conceptual Data Model (AAdAR, SMS, JLF, ILO), pp. 286–293.
ICMLICML-c3-2013-ErolLRR #parametricity
The Extended Parameter Filter (YE, LL, BR, SJR), pp. 1103–1111.
SEKESEKE-2013-SakamotoWF #design pattern #object-oriented #programming language
Extended Design Patterns in New Object-Oriented Programming Languages (S) (KS, HW, YF), pp. 600–605.
ICMTICMT-2013-Horn #query
Model Querying with FunnyQT — (Extended Abstract) (TH), pp. 56–57.
ICMTICMT-2013-LepperT #performance #validation
Fragmented Validation: A Simple and Efficient Contribution to XSLT Checking (Extended Abstract) (ML, BTyW), pp. 54–55.
LOPSTRLOPSTR-2013-Seki #logic programming #model checking #source code
Extending Co-logic Programs for Branching-Time Model Checking (HS), pp. 127–144.
SACSAC-2013-LyleNIF #network #web
Extending the web to support personal network services (JL, CN, AI, SF), pp. 711–716.
SACSAC-2013-Sobieski0 #maude #sql #term rewriting #using
Using maude rewriting system to modularize and extend SQL (SS, BZ), pp. 853–858.
HPCAHPCA-2013-JacobvitzCS #memory management
Coset coding to extend the lifetime of memory (ANJ, ARC, DJS), pp. 222–233.
CADECADE-2013-HeuleHW #verification
Verifying Refutations with Extended Resolution (MH, WAHJ, NW), pp. 345–359.
CAVCAV-2013-DAntoniV #equivalence #finite #transducer
Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.
CSLCSL-2013-Kikuchi #nondeterminism #normalisation #proving #λ-calculus
Proving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus (KK), pp. 395–414.
CSLCSL-2013-WangB #decidability #equation #semantics #type system
Semantics of Intensional Type Theory extended with Decidable Equational Theories (QW, BB), pp. 653–667.
RTARTA-2013-Schmidt-SchaussMS #lazy evaluation #λ-calculus
Extending Abramsky’s Lazy λ Calculus: (Non)-Conservativity of Embeddings (MSS, EM, DS), pp. 239–254.
RTARTA-2013-Schmidt-SchaussRS #algorithm #complexity
Algorithms for Extended α-Equivalence and Complexity (MSS, CR, DS), pp. 255–270.
ASEASE-2012-XiaoTFHM #analysis #privacy
User-aware privacy control via extended static-information-flow analysis (XX, NT, MF, JdH, MM), pp. 80–89.
CASECASE-2012-LiK #automation #automaton #finite #generative #modelling #testing #using
Model-based automatic test generation for Simulink/Stateflow using extended finite automaton (ML, RK), pp. 857–862.
CASECASE-2012-LiLCS #3d
Extended RRT-based path planning for flying robots in complex 3D environments with narrow passages (DL, QL, NC, JS), pp. 1173–1178.
CASECASE-2012-ShoaeiFL #abstraction #automaton #finite
Abstractions for nonblocking supervisory control of Extended Finite Automata (MRS, LF, BL), pp. 364–370.
DATEDATE-2012-WangW #memory management
Extending the lifetime of NAND flash memory by salvaging bad blocks (CW, WFW), pp. 260–263.
PODSPODS-2012-NgoPRR #algorithm #worst-case
Worst-case optimal join algorithms: [extended abstract] (HQN, EP, CR, AR), pp. 37–48.
VLDBVLDB-2012-KangLM #performance #throughput
Flash-based Extended Cache for Higher Throughput and Faster Recovery (WHK, SWL, BM), pp. 1615–1626.
FoSSaCSFoSSaCS-2012-AdamekMMS #algebra
Well-Pointed Coalgebras (Extended Abstract) (JA, SM, LSM, LS), pp. 89–103.
FoSSaCSFoSSaCS-2012-GlabbeekGS #on the #petri net
On Distributability of Petri Nets — (Extended Abstract) (RJvG, UG, JWSU), pp. 331–345.
FoSSaCSFoSSaCS-2012-SeidlR
Extending H₁-Clauses with Path Disequalities (HS, AR), pp. 165–179.
WCREWCRE-2012-JanaN #detection #dynamic analysis #precise #using
Precise Detection of Uninitialized Variables Using Dynamic Analysis — Extending to Aggregate and Vector Types (AJ, RN), pp. 197–201.
SASSAS-2012-SanchezSSC #generative #invariant #self #using
Invariant Generation for Parametrized Systems Using Self-reflection — (Extended Version) (AS, SS, CS, BYEC), pp. 146–163.
STOCSTOC-2012-Ajtai #nondeterminism #testing
Determinism versus nondeterminism with arithmetic tests and computation: extended abstract (MA), pp. 249–268.
STOCSTOC-2012-Belovs #source code
Span programs for functions with constant-sized 1-certificates: extended abstract (AB), pp. 77–84.
STOCSTOC-2012-FioriniMPTW #bound #exponential #linear
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds (SF, SM, SP, HRT, RdW), pp. 95–106.
STOCSTOC-2012-Kayal
Affine projections of polynomials: extended abstract (NK), pp. 643–662.
FLOPSFLOPS-2012-MartinFS #eclipse #integer #set
Extending the TOY System with the ECLiPSe Solver over Sets of Integers (SEM, JCF, FSP), pp. 120–135.
DLTDLT-2012-HolzerJ #automaton #equivalence #fault
From Equivalence to Almost-Equivalence, and Beyond — Minimizing Automata with Errors — (Extended Abstract) (MH, SJ), pp. 190–201.
DLTDLT-2012-KetemaS #normalisation #string #termination
Characterizing Languages by Normalization and Termination in String Rewriting — (Extended Abstract) (JK, JGS), pp. 459–464.
ICALPICALP-v1-2012-BabaiCQ #morphism #polynomial
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups — (Extended Abstract) (LB, PC, YQ), pp. 51–62.
ICALPICALP-v2-2012-Fiore #polynomial
Discrete Generalised Polynomial Functors — (Extended Abstract) (MPF), pp. 214–226.
ICALPICALP-v2-2012-GugelmannPP #clustering #graph #random #sequence
Random Hyperbolic Graphs: Degree Sequence and Clustering — (Extended Abstract) (LG, KP, UP), pp. 573–585.
ICALPICALP-v2-2012-KufleitnerL #logic #word
Lattices of Logical Fragments over Words — (Extended Abstract) (MK, AL), pp. 275–286.
ICALPICALP-v2-2012-ReddyD #algol #formal method
An Automata-Theoretic Model of Idealized Algol — (Extended Abstract) (USR, BPD), pp. 337–350.
ICALPICALP-v2-2012-Vocking #multi #random
Randomized Mechanisms for Multi-unit Auctions — (Extended Abstract) (BV), pp. 27–29.
SEFMSEFM-2012-LefticaruI #algorithm #approach #finite #generative #search-based #state machine #testing #using
An Improved Test Generation Approach from Extended Finite State Machines Using Genetic Algorithms (RL, FI), pp. 293–307.
CHICHI-2012-LinderJ #game studies
Playable character: extending digital games into the real world (JL, WJ), pp. 2069–2078.
CHICHI-2012-ZhangZF #2d
Extending Fitts’ law to account for the effects of movement direction on 2d pointing (XZ, HZ, WF), pp. 3185–3194.
CIKMCIKM-2012-BarbosaPG #algorithm #query
Generically extending anonymization algorithms to deal with successive queries (MB, AP, BG), pp. 1362–1371.
ECIRECIR-2012-DaiPKA
Extended Expectation Maximization for Inferring Score Distributions (KD, VP, EK, JAA), pp. 293–304.
ICPRICPR-2012-HuangW0T #effectiveness #modelling
An effective regional saliency model based on extended site entropy rate (YH, WW, LW, TT), pp. 1407–1410.
ICPRICPR-2012-LeeCP #estimation #using
Articulated hand configuration and rotation estimation using extended torus manifold embedding (CSL, SYC, SWP), pp. 441–444.
ICPRICPR-2012-Liao #reduction
Commensurate dimensionality reduction for extended local ternary patterns (WHL), pp. 3013–3016.
ICPRICPR-2012-YangLL #image
Color image fusion with extend joint sparse model (BY, JL, SL), pp. 376–379.
KRKR-2012-BaaderBM #towards #unification
Extending Unification in EL Towards General TBoxes (FB, SB, BM).
SIGIRSIGIR-2012-BlancoB #multi #query
Extending BM25 with multiple query operators (RB, PB), pp. 921–930.
SIGIRSIGIR-2012-YuLZZL #estimation #network #performance #scalability #towards
SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks (WY, XL, WZ, YZ, JL), pp. 365–374.
OOPSLAOOPSLA-2012-CastanosEINNOW #compilation #jit #on the #scripting language #static typing
On the benefits and pitfalls of extending a statically typed language JIT compiler for dynamic scripting languages (JGC, DE, KI, PN, TN, TO, PW), pp. 195–212.
SACSAC-2012-ChiprianovKR #architecture #enterprise #modelling
Extending Enterprise Architecture Modeling Languages: application to telecommunications service creation (VC, YK, SR), pp. 1661–1666.
SACSAC-2012-LaineSV
Extending XForms with server-side functionality (ML, DS, PV), pp. 688–695.
SACSAC-2012-SoLJHL
Extending Open Directory Project to represent user interests (SS, JHL, DJ, JH, SL), pp. 354–359.
SACSAC-2012-TsadimasNA #design #information management #non-functional #requirements
Extending SysML to explore non-functional requirements: the case of information system design (AT, MN, DA), pp. 1057–1062.
ICSEICSE-2012-SunSPR #mining #static analysis
Extending static analysis by mining project-specific rules (BS, GS, AP, BR), pp. 1054–1063.
PPoPPPPoPP-2012-LeissaHW #programming
Extending a C-like language for portable SIMD programming (RL, SH, IW), pp. 65–74.
ICLPICLP-2012-ChenJY
Extending C+ with Composite Actions for Robotic Task Planning (XC, GJ, FY), pp. 404–414.
ICSTICST-2012-KheddamAP
An Extended LLRP Model for RFID System Test and Diagnosis (RK, OEKA, IP), pp. 529–538.
ICTSSICTSS-2012-GargantiniGM #robust #test coverage
Extending Coverage Criteria by Evaluating Their Robustness to Code Structure Changes (AG, MG, EM), pp. 168–183.
ICTSSICTSS-2012-Havelund #analysis
Requirements-Driven Log Analysis (Extended Abstract) (KH), pp. 1–4.
ICTSSICTSS-2012-Vaandrager #finite #learning #state machine
Active Learning of Extended Finite State Machines (FWV), pp. 5–7.
IJCARIJCAR-2012-SteigmillerLG #logic
Extended Caching, Backjumping and Merging for Expressive Description Logics (AS, TL, BG), pp. 514–529.
LICSLICS-2012-JaberTS #type system
Extending Type Theory with Forcing (GJ, NT, MS), pp. 395–404.
ICSTSAT-2012-GelderWL #preprocessor #quantifier
Extended Failed-Literal Preprocessing for Quantified Boolean Formulas (AVG, SBW, FL), pp. 86–99.
TAPTAP-2012-KosmatovW #automation #testing #tutorial
Tutorial on Automated Structural Testing with PathCrawler — (Extended Abstract) (NK, NW), p. 176.
ECSAECSA-2011-JrCCGOFMG #architecture #component #lessons learnt #product line #uml
Extending UML Components to Develop Software Product-Line Architectures: Lessons Learned (ACCJ, GGC, TEC, IMdSG, EAOJ, SF, PCM, AFG), pp. 130–138.
QoSAQoSA-ISARCS-2011-CavalcantiAM #process #quality #variability
Extending the RiPLE-DE process with quality attribute variability realization (RdOC, ESdA, SRLM), pp. 159–164.
CASECASE-2011-FeiMA #automaton #finite #modelling #resource management #using
Modeling sequential resource allocation systems using Extended Finite Automata (ZF, SM, ), pp. 444–449.
CASECASE-2011-MiremadiLA #automaton #finite
BDD-based supervisory control on extended finite automata (SM, BL, ), pp. 25–31.
ICDARICDAR-2011-WinderAS #algorithm #documentation #segmentation
Extending Page Segmentation Algorithms for Mixed-Layout Document Processing (AW, TLA, EHBS), pp. 1245–1249.
ESOPESOP-2011-KoutavasH #encryption #higher-order #testing
A Testing Theory for a Higher-Order Cryptographic Language — (Extended Abstract) (VK, MH), pp. 358–377.
SCAMSCAM-J-2009-TiarksKF11 #assessment #detection #state of the art #tool support
An extended assessment of type-3 clones as detected by state-of-the-art tools (RT, RK, RF), pp. 295–331.
WCREWCRE-2011-Beard #debugging #information retrieval #locality #using
Extending Bug Localization Using Information Retrieval and Code Clone Location Techniques (MDB), pp. 425–428.
STOCSTOC-2011-HansenKLMT #algorithm #game studies #probability
Exact algorithms for solving stochastic games: extended abstract (KAH, MK, NL, PBM, EPT), pp. 205–214.
STOCSTOC-2011-KouckyNP #generative #pseudo
Pseudorandom generators for group products: extended abstract (MK, PN, PP), pp. 263–272.
STOCSTOC-2011-LenzenW #bound #parallel #random
Tight bounds for parallel randomized load balancing: extended abstract (CL, RW), pp. 11–20.
STOCSTOC-2011-NovocinSV #algorithm #complexity
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract (AN, DS, GV), pp. 403–412.
CIAACIAA-2011-OrtizLS #automaton #distributed
Distributed Event Clock Automata — Extended Abstract (JJO, AL, PYS), pp. 250–263.
ICALPICALP-v1-2011-FeldmanNS #algorithm
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (Extended Abstract) (MF, JN, RS), pp. 342–353.
ICALPICALP-v1-2011-GuoLV #complexity #problem #symmetry
The Complexity of Symmetric Boolean Parity Holant Problems — (Extended Abstract) (HG, PL, LGV), pp. 712–723.
ICALPICALP-v1-2011-Laekhanukit #algorithm #approximate #low cost #set
An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity — (Extended Abstract) (BL), pp. 13–24.
ICALPICALP-v1-2011-Mengel #constraints #problem
Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems — (Extended Abstract) (SM), pp. 700–711.
ICALPICALP-v1-2011-NgoPR #matrix
Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications — (Extended Abstract) (HQN, EP, AR), pp. 557–568.
LATALATA-2011-CaronCM #regular expression
Partial Derivatives of an Extended Regular Expression (PC, JMC, LM), pp. 179–191.
FMFM-2011-DammF #question
Does It Pay to Extend the Perimeter of a World Model? (WD, BF), pp. 12–26.
SFMSFM-2011-Jonsson #automaton #learning #modelling
Learning of Automata Models Extended with Data (BJ), pp. 327–349.
CEFPCEFP-2011-Pali
Extending Little Languages into Big Systems (GP), pp. 499–516.
CHICHI-2011-McLoughlinC #assembly #design
Design interventions for open-air museums: applying and extending the principles of “assembly” (MM, LC), pp. 553–556.
CHICHI-2011-MiyataF #documentation #identification
Document area identification for extending books without markers (AM, KF), pp. 3189–3198.
CHICHI-2011-WigdorBPLW #gesture #interactive #multi #precise
Rock & rails: extending multi-touch interactions with shape gestures to enable precise spatial manipulations (DW, HB, JP, JL, SW), pp. 1581–1590.
HCIHCI-ITE-2011-PoorJ #human-computer #interactive
Introducing Animatronics to HCI: Extending Reality-Based Interaction (GMP, RJKJ), pp. 593–602.
HCIHIMI-v2-2011-RanasingheFC #case study #experience #named #network #social
Petimo: Sharing Experiences through Physically Extended Social Networking (NR, ONNF, ADC), pp. 66–74.
EDOCEDOC-2011-KapurugeCK #adaptation #composition #named
ROAD4WS — Extending Apache Axis2 for Adaptive Service Compositions (MK, AWC, JK), pp. 183–192.
ICEISICEIS-v1-2011-Cuzzocrea #approach #information management #mining
A UML-extended Approach for Mining OLAP Data Cubes in Complex Knowledge Discovery Environments (AC), pp. 281–289.
KMISKMIS-2011-JohnMMMB #behaviour #enterprise
Impact of Behavioral Forces on Knowledge Sharing in an Extended Enterprise System of Systems (LJ, PMM, TM, GRM, JTB), pp. 67–76.
SEKESEKE-2011-Krishna #approach #non-functional #process #requirements #uml
A Process Oriented Approach to Model Non-Functional Requirements Proposition Extending UML (AK), pp. 736–739.
SEKESEKE-2011-RadulovicG #modelling #quality #semantics
Extending Software Quality Models — A Sample In The Domain of Semantic Technologies (FR, RGC), pp. 25–30.
ECMFAECMFA-2011-BehjatiYNBS #architecture #concept #modelling
Extending SysML with AADL Concepts for Comprehensive System Architecture Modeling (RB, TY, SN, LCB, BS), pp. 236–252.
LOPSTRLOPSTR-2011-Gallagher #analysis #logic programming #source code #using
Analysis of Logic Programs Using Regular Tree Languages — (Extended Abstract) (JPG), pp. 1–3.
QAPLQAPL-2011-DengGHM #probability #process #testing
Real-Reward Testing for Probabilistic Processes (Extended Abstract) (YD, RJvG, MH, CM), pp. 61–73.
SACSAC-2011-MacielH #commit #protocol #rest
Extending timestamp-based two phase commit protocol for RESTful services to meet business rules (LAHdSM, CMH), pp. 778–785.
CGOCGO-2011-CuiXWYFF #optimisation
Extendable pattern-oriented optimization directives (HC, JX, LW, YY, XF, DF), pp. 107–118.
PPoPPPPoPP-2011-KourtisKGK #memory management #named
CSX: an extended compression format for spmv on shared memory systems (KK, VK, GIG, NK), pp. 247–256.
CADECADE-2011-BlanchetteBP #smt
Extending Sledgehammer with SMT Solvers (JCB, SB, LCP), pp. 116–130.
ICTSSICTSS-2011-SchwarzlAW #composition #random testing #testing #using
Compositional Random Testing Using Extended Symbolic Transition Systems (CS, BKA, FW), pp. 179–194.
TLCATLCA-2011-BakelBd #λ-calculus #μ-calculus
A Filter Model for the λμ-Calculus — (Extended Abstract) (SvB, FB, Ud), pp. 213–228.
TLCATLCA-2011-RoweB #approximate #object-oriented #programming #semantics
Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming — (Extended Abstract) (RNSR, SvB), pp. 229–244.
CASECASE-2010-OuedraogoKMA #approach #automaton #finite
Symbolic approach to nonblocking and safe control of Extended Finite Automata (LO, RK, RM, ), pp. 471–476.
DATEDATE-2010-YeSP #assessment
Extended Hamiltonian Pencil for passivity assessment and enforcement for S-parameter systems (ZY, LMS, JRP), pp. 1148–1152.
VLDBVLDB-2011-OroRS10 #documentation #named #query #towards #web #xpath
SXPath — Extending XPath towards Spatial Querying on Web Documents (EO, MR, SS), pp. 129–140.
PEPMPEPM-2010-AlpuenteBBF #framework
A fold/unfold transformation framework for rewrite theories extended to CCT (MA, DB, MB, MF), pp. 43–52.
CIAACIAA-2010-CimattiMRT #automaton #nondeterminism #regular expression
From Sequential Extended Regular Expressions to NFA with Symbolic Labels (AC, SM, MR, ST), pp. 87–94.
CIAACIAA-2010-DiekertK #complexity #regular expression
Complexity Results and the Growths of Hairpin Completions of Regular Languages (Extended Abstract) (VD, SK), pp. 105–114.
CIAACIAA-2010-ReidenbachS #polynomial #regular expression #scalability
A Polynomial Time Match Test for Large Classes of Extended Regular Expressions (DR, MLS), pp. 241–250.
DLTDLT-2010-DartoisKL #infinity #word
Rankers over Infinite Words (Extended Abstract) (LD, MK, AL), pp. 148–159.
DLTDLT-2010-Maletti #top-down #transducer
Input Products for Weighted Extended Top-Down Tree Transducers (AM), pp. 316–327.
DLTDLT-2010-Schluter #automaton #lookahead #on the
On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) (NS), pp. 440–441.
ICALPICALP-v1-2010-FakcharoenpholLN #algorithm #performance #problem
Faster Algorithms for Semi-matching Problems (Extended Abstract) (JF, BL, DN), pp. 176–187.
ICALPICALP-v2-2010-BrazdilJK #game studies #reachability
Reachability Games on Extended Vector Addition Systems with States (TB, PJ, AK), pp. 478–489.
LATALATA-2010-Neary #bound
A Boundary between Universality and Non-universality in Extended Spiking Neural P Systems (TN), pp. 475–487.
LATALATA-2010-WeinbergN #context-free grammar #probability
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics (FW, MEN), pp. 585–595.
SEFMSEFM-2010-GallardoS #calculus #verification #μ-calculus
Verification of Dynamic Data Tree with μ-calculus Extended with Separation (MdMG, DS), pp. 211–221.
LISPILC-2010-Mehnert #detection #fault #type inference #type system
Extending Dylan’s type system for better type inference and error detection (HM), pp. 1–10.
AdaSIGAda-2010-LiYBWZL #ada #fault tolerance #manycore #monitoring
Extending Ada to support multi-core based monitoring and fault tolerance (YL, LY, LB, LW, JZ, XL), pp. 53–62.
CAiSECAiSE-2010-LagunaMC #case study #modelling #on the #question #semantics
On the Semantics of the Extend Relationship in Use Case Models: Open-Closed Principle or Clairvoyance? (MAL, JMM, YC), pp. 409–423.
ICEISICEIS-AIDSS-2010-GoncalvesCCS
Extending MAS-ML to Model Proactive and Reactive Sotware Agents (EJTG, MIC, GALdC, VTdS), pp. 75–84.
ICEISICEIS-ISAS-2010-MonfortHK #navigation #towards
Towards Extending IMS LD with Services and Context Awareness — Application to a Navigation and Fishing Simulator (VM, SH, MK), pp. 80–91.
CIKMCIKM-2010-AjiWAG #analysis #modelling #using
Using the past to score the present: extending term weighting models through revision history analysis (AA, YW, EA, EG), pp. 629–638.
CIKMCIKM-2010-LiDF #fault
Extending dictionary-based entity extraction to tolerate errors (GL, DD, JF), pp. 1341–1344.
ICPRICPR-2010-HanerH #estimation #novel #online
On-Line Structure and Motion Estimation Based on a Novel Parameterized Extended Kalman Filter (SH, AH), pp. 1836–1839.
ICPRICPR-2010-IwahoriIWKFK #performance
Extending Fast Marching Method under Point Light Source Illumination and Perspective Projection (YI, KI, RJW, HK, SF, KK), pp. 1650–1653.
ICPRICPR-2010-KatoSS #constraints #geometry #multi
Extended Multiple View Geometry for Lights and Cameras from Photometric and Geometric Constraints (KK, FS, JS), pp. 2110–2113.
ICPRICPR-2010-Liao #using
Region Description Using Extended Local Ternary Patterns (WHL), pp. 1003–1006.
ICPRICPR-2010-LiGW #adaptation #image #reduction #using
Adaptive Enhancement with Speckle Reduction for SAR Images Using Mirror-Extended Curvelet and PSO (YL, HG, QW), pp. 4520–4523.
ICPRICPR-2010-TrummerMD #online #optimisation #using
Online Next-Best-View Planning for Accuracy Optimization Using an Extended E-Criterion (MT, CM, JD), pp. 1642–1645.
ICPRICPR-2010-YangGG #analysis #locality #recognition
Extended Locality Preserving Discriminant Analysis for Face Recognition (LY, WG, XG), pp. 539–542.
ICPRICPR-2010-ZhaoLZZ #parallel
Parallel versus Hierarchical Fusion of Extended Fingerprint Features (QZ, FL, LZ, DZ), pp. 1132–1135.
ICPRICPR-2010-ZhouWH #2d #3d #realtime #using
Real-Time 3D Face and Facial Action Tracking Using Extended 2D+3D AAMs (MZ, YW, XH), pp. 3963–3966.
KRKR-2010-Baral #multi #reasoning
Reasoning about Actions and Change: From Single Agent Actions to Multi-Agent Actions (Extended Abstract) (CB).
SEKESEKE-2010-VaraS #modelling
System Modeling from Extended Task Descriptions (JLdlV, JS), pp. 425–429.
SIGIRSIGIR-2010-RobertsonKY #precise
Extending average precision to graded relevance judgments (SER, EK, EY), pp. 603–610.
MODELSMoDELS-v1-2010-WilkeTW #ocl #variability
Extending Variability for OCL Interpretation (CW, MT, CW), pp. 361–375.
LOPSTRLOPSTR-2010-Seki #induction #on the #proving
On Inductive Proofs by Extended Unfold/Fold Transformation Rules (HS), pp. 117–132.
RERE-2010-SinhaPTN #analysis #automation #case study #natural language
Extending Automated Analysis of Natural Language Use Cases to Other Languages (AS, AMP, HT, TN), pp. 364–369.
RERE-2010-YangRGWN #ambiguity #analysis #natural language #requirements
Extending Nocuous Ambiguity Analysis for Anaphora in Natural Language Requirements (HY, ANDR, VG, AW, BN), pp. 25–34.
SACSAC-2010-BoscPML #algebra #relational
Extending relational algebra to handle bipolarity (PB, OP, AM, LL), pp. 1718–1722.
SACSAC-2010-DuraoD #hybrid #personalisation #recommendation
Extending a hybrid tag-based recommender system with personalization (FAD, PD), pp. 1723–1727.
SLESLE-2010-BandenerSE #behaviour #debugging #execution #specification #visual notation
Extending DMM Behavior Specifications for Visual Execution and Debugging (NB, CS, GE), pp. 357–376.
SPLCSPLC-2010-AzevedoMBR #uml #variability
The UML “extend” Relationship as Support for Software Variability (SA, RJM, AB, HR), pp. 471–475.
SPLCSPLC-2010-KaratasOD #constraints #feature model #finite #logic programming #modelling
Mapping Extended Feature Models to Constraint Logic Programming over Finite Domains (ASK, HO, AHD), pp. 286–299.
CCCC-2010-RoyS #optimisation
The Hot Path SSA Form: Extending the Static Single Assignment Form for Speculative Optimizations (SR, YNS), pp. 304–323.
HPDCHPDC-2010-MontanerSD #low cost #memory management
A practical way to extend shared memory support beyond a motherboard at low cost (HM, FS, JD), pp. 155–166.
CSLCSL-2010-FioreH #equation #higher-order #logic
Second-Order Equational Logic (Extended Abstract) (MPF, CKH), pp. 320–335.
CSLCSL-2010-SchwentickZ #logic #order
Two-Variable Logic with Two Order Relations — (Extended Abstract) (TS, TZ), pp. 499–513.
ICLPICLP-J-2010-HouCD #fixpoint #logic #rule-based
FO(FD): Extending classical logic with rule-based fixpoint definitions (PH, BdC, MD), pp. 581–596.
QoSAQoSA-2009-BjornanderGL #architecture #simulation #specification #state machine
Timed Simulation of Extended AADL-Based Architecture Specifications with Timed Abstract State Machines (SB, LG, KL), pp. 101–115.
CASECASE-2009-SenGupta
Extended abstract — bringing science to the art of workforce management in service industries (SS), pp. 59–64.
CASECASE-2009-SriramL #automation #standard
The role of standards in healthcare automation (Extended abstract) (RDS, BL), pp. 79–82.
CASECASE-2009-WangLNRKML #concurrent #parallel #source code #thread
Maximally permissive deadlock avoidance for multithreaded computer programs (Extended abstract) (YW, HL, AN, SAR, TK, SAM, SL), pp. 37–41.
DATEDATE-2009-BernasconiCTV #on the
On decomposing Boolean functions via extended cofactoring (AB, VC, GT, TV), pp. 1464–1469.
DATEDATE-2009-MrabtiPB #approach #design
Extending IP-XACT to support an MDE based approach for SoC design (AEM, FP, AB), pp. 586–589.
SIGMODSIGMOD-2009-ChaudhuriK #fault
Extending autocompletion to tolerate errors (SC, RK), pp. 707–718.
ITiCSEITiCSE-2009-HsiaoSB #java #personalisation #problem
Extending parameterized problem-tracing questions for Java with personalized guidance (IHH, SAS, PB), p. 392.
ITiCSEITiCSE-2009-RosslingK #education
Extending moodle to better support computing education (GR, AK), pp. 146–150.
WRLAWRLA-2008-DuranO09 #implementation #maude #realtime
A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude (FD, PCÖ), pp. 83–102.
FASEFASE-2009-AndroutsopoulosCHLT #dependence #finite #state machine
Control Dependence for Extended Finite State Machines (KA, DC, MH, ZL, LT), pp. 216–230.
FoSSaCSFoSSaCS-2009-AdamekMV #monad
A Description of Iterative Reflections of Monads (Extended Abstract) (JA, SM, JV), pp. 152–166.
STOCSTOC-2009-ChalopinG #graph
Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.
STOCSTOC-2009-ChengW #distance #problem #reduction
A deterministic reduction for the gap minimum distance problem: [extended abstract] (QC, DW), pp. 33–38.
STOCSTOC-2009-Gafni
The extended BG-simulation and the characterization of t-resiliency (EG), pp. 85–92.
STOCSTOC-2009-KleinbergPT #game studies #learning #multi
Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract (RK, GP, ÉT), pp. 533–542.
STOCSTOC-2009-Peikert #problem #worst-case
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (CP), pp. 333–342.
CIAACIAA-2009-CaronCM #automaton
Small Extended Expressions for Acyclic Automata (PC, JMC, LM), pp. 198–207.
CIAACIAA-2009-LiuYLT #automaton
A Table Compression Method for Extended Aho-Corasick Automaton (YL, YY, PL, JT), pp. 84–93.
LATALATA-2009-CarleN #on the #regular expression
On Extended Regular Expressions (BC, PN), pp. 279–289.
SEFMSEFM-2009-SubramaniamGP #finite #impact analysis #state machine #testing #using
Using Change Impact Analysis to Select Tests for Extended Finite State Machines (MS, BG, ZP), pp. 93–102.
CHICHI-2009-Stewarts #graph #sketching
Graph sketcher: extending illustration to quantitative graphs (RS, MMCS), pp. 1113–1116.
HCIHCD-2009-Bevan #framework #metric #quality #usability
Extending Quality in Use to Provide a Framework for Usability Measurement (NB), pp. 13–22.
HCIHCD-2009-GonzalezPST #development #interface #process
Development of CSCW Interfaces from a User-Centered Viewpoint: Extending the TOUCHE Process Model through Defeasible Argumentation (MPG, VMRP, GRS, RT), pp. 955–964.
ICEISICEIS-DISI-2009-StempliucFAB #concept #modelling #network
Extending the UML-GeoFrame Data Model for Conceptual Modeling of Network Applications (SMS, JLF, MVAA, KAVB), pp. 164–170.
KMISKMIS-2009-RadeschutzM #analysis #optimisation #process
Extended Analysis Techniques for a Comprehensive Business Process Optimization (SR, BM), pp. 77–82.
MLDMMLDM-2009-GadK #clustering #semantics #similarity #using
New Semantic Similarity Based Model for Text Clustering Using Extended Gloss Overlaps (WKG, MSK), pp. 663–677.
SEKESEKE-2009-NusayrC #aspect-oriented #monitoring #runtime
Extending AOP to Support Broad Runtime Monitoring Needs (AN, JC), pp. 438–441.
SEKESEKE-2009-SloanKV
An Extendible Translation of BPEL to a Machine-verifiable Model (JCS, TMK, AV), pp. 344–349.
GPCEGPCE-2009-AkaiC #aspectj
Extending AspectJ for separating regions (SA, SC), pp. 45–54.
SACSAC-2009-AgentA #approach #problem
Extending Problem Frames to deal with stakeholder problems: An Agent- and Goal-Oriented Approach (SS, LC), pp. 389–394.
SACSAC-2009-JamesC #ml #multi #static analysis
Extended static checking in JML4: benefits of multiple-prover support (PRJ, PC), pp. 609–614.
SACSAC-2009-NunesKNCL #multi #product line
Extending PASSI to model multi-agent systems product lines (IN, UK, CN, EC, CJPdL), pp. 729–730.
SACSAC-2009-PassitoMM #analysis #network #protocol #using
Analysis of the secure RTP protocol on voice over wireless networks using extended MedQoS (AP, EdSM, EM), pp. 86–87.
SACSAC-2009-Ries #modelling #representation #trust
Extending Bayesian trust models regarding context-dependence and user friendly representation (SR), pp. 1294–1301.
HPDCHPDC-2009-AssuncaoCB #capacity #clustering #in the cloud #using
Evaluating the cost-benefit of using cloud computing to extend the capacity of clusters (MDdA, AdC, RB), pp. 141–150.
CAVCAV-2009-FuhrmannH #bound #induction #on the #proving
On Extending Bounded Proofs to Inductive Proofs (OF, SH), pp. 278–290.
ICLPICLP-2009-Li #algorithm #constraints #difference #functional #integer #research #summary
Research Summary: Extending Elimination Algorithms for Functional Constraints to Solve Two Integer Variables per Inequality (CL), pp. 530–531.
ICLPICLP-2009-Raiser #constraints #graph transformation #research #summary #using
Analysing Graph Transformation Systems Using Extended Methods from Constraint Handling Rules (Research Summary) (FR), pp. 540–541.
ICSTICST-2009-KalajiHS #finite #generative #state machine #testing
Generating Feasible Transition Paths for Testing from an Extended Finite State Machine (EFSM) (ASK, RMH, SS), pp. 230–239.
ISSTAISSTA-2009-SaxenaPMS #execution #source code #symbolic computation
Loop-extended symbolic execution on binary programs (PS, PP, SM, DS), pp. 225–236.
ICSTSAT-2009-SoosNC #encryption #problem #satisfiability
Extending SAT Solvers to Cryptographic Problems (MS, KN, CC), pp. 244–257.
VMCAIVMCAI-2009-TreflerW #architecture #reduction #symmetry
Extending Symmetry Reduction by Exploiting System Architecture (RJT, TW), pp. 320–334.
ECSAECSA-2008-FankamJBA #approach #architecture #database #ontology #semantics
Extending the ANSI/SPARC Architecture Database with Explicit Data Semantics: An Ontology-Based Approach (CF, SJ, LB, YAA), pp. 318–321.
CASECASE-2008-NagleW #named #using
GSP: Extending G-Code using JSP servlet technologies (SN, JW), pp. 953–958.
DATEDATE-2008-LiTM #analysis #grid #named #network #power management
ETBR: Extended Truncated Balanced Realization Method for On-Chip Power Grid Network Analysis (DL, SXDT, BM), pp. 432–437.
DATEDATE-2008-Pamunuwa #integration #memory management #scalability
Memory Technology for Extended Large-Scale Integration in Future Electronics Applications (DP), pp. 1126–1127.
DATEDATE-2008-PomeranzR08a #fault #taxonomy
A Same/Different Fault Dictionary: An Extended Pass/Fail Fault Dictionary with Improved Diagnostic Resolution (IP, SMR), pp. 1474–1479.
DocEngDocEng-2008-AlkhateebL #composition #documentation #generative #towards #using
Towards extending and using SPARQL for modular document generation (FA, SL), pp. 164–172.
ITiCSEITiCSE-2008-CerboDS #collaboration #learning
Extending moodle for collaborative learning (FDC, GD, GS), p. 324.
ESOPESOP-2008-CirilloJPR #distributed #named #trust
Tapido: Trust and Authorization Via Provenance and Integrity in Distributed Objects (Extended Abstract) (AC, RJ, CP, JR), pp. 208–223.
FoSSaCSFoSSaCS-2008-SelingerV #call-by #λ-calculus
A Linear-non-Linear Model for a Computational Call-by-Value λ Calculus (Extended Abstract) (PS, BV), pp. 81–96.
TACASTACAS-2008-FarzanCCTW #automation #composition #regular expression #verification
Extending Automated Compositional Verification to the Full Class of ω-Regular Languages (AF, YFC, EMC, YKT, BYW), pp. 2–17.
TACASTACAS-2008-TsayCTCL #automaton #logic #research #towards
GOAL Extended: Towards a Research Tool for ω Automata and Temporal Logic (YKT, YFC, MHT, WCC, CJL), pp. 346–350.
PASTEPASTE-2008-ShenZZFY #aspectj #named
XFindBugs: eXtended FindBugs for AspectJ (HS, SZ, JZ, JF, SY), pp. 70–76.
WCREWCRE-2008-Muliawan #higher-order #model transformation #using
Extending a Model Transformation Language Using Higher Order Transformations (OM), pp. 315–318.
STOCSTOC-2008-AroraKKSTV #constraints #game studies #graph
Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.
STOCSTOC-2008-JainKN #bound #communication #complexity #theorem
Direct product theorems for classical communication complexity via subdistribution bounds: extended abstract (RJ, HK, AN), pp. 599–608.
AFLAFL-2008-KaminskiZ #automaton #nondeterminism
Extending finite-memory automata with non-deterministic reassignment (Extended abstract) (MK, DZ), pp. 195–207.
AFLAFL-2008-Paun
Membrane Computing: Recent Developments and Applications (Extended Abstract) (GP), pp. 350–351.
DLTDLT-2008-EngelfrietLM #bottom-up #multi #transducer
Extended Multi Bottom-Up Tree Transducers (JE, EL, AM), pp. 289–300.
ICALPICALP-A-2008-BodlaenderDFH #kernel #on the #polynomial #problem
On Problems without Polynomial Kernels (Extended Abstract) (HLB, RGD, MRF, DH), pp. 563–574.
ICALPICALP-A-2008-DietzfelbingerP #approximate #data type #retrieval
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract) (MD, RP), pp. 385–396.
ICALPICALP-A-2008-FialaGK #complexity #distance #problem
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (JF, PAG, JK), pp. 294–305.
ICALPICALP-A-2008-RazgonO #parametricity #satisfiability
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (IR, BO), pp. 551–562.
ICALPICALP-B-2008-JohanssonPVB #π-calculus
Extended π-Calculi (MJ, JP, BV, JB), pp. 87–98.
LATALATA-2008-BrijderH #assembly #graph
Extending the Overlap Graph for Gene Assembly in Ciliates (RB, HJH), pp. 137–148.
SEFMSEFM-2008-GuoS #finite #impact analysis #proving #state machine #theorem proving #using
Formal Change Impact Analyses of Extended Finite State Machines Using a Theorem Prover (BG, MS), pp. 335–344.
SEFMSEFM-2008-MerayoHN
Extending Stream X-Machines to Specify and Test Systems with Timeouts (MGM, RMH, MN), pp. 201–210.
IFLIFL-2008-JansenPK #interactive #named #plugin
iEditors: Extending iTask with Interactive Plug-ins (JMJ, RP, PWMK), pp. 192–211.
GT-VMTGT-VMT-2008-Weinell #graph #query #reduction
Extending Graph Query Languages by Reduction (EW).
CHICHI-2008-OleksikFBS #comprehension
Sonic interventions: understanding and extending the domestic soundscape (GO, DF, LMB, AS), pp. 1419–1428.
CHICHI-2008-TianXWZLSD #3d #user interface #using
Tilt menu: using the 3D orientation information of pen devices to extend the selection capability of pen-based user interfaces (FT, LX, HW, XZ, YL, VS, GD), pp. 1371–1380.
AdaSIGAda-2008-Taft #ada #implementation
Implementing the extended return statement for Ada 2005 (STT), pp. 97–104.
EDOCEDOC-2008-NitzscheLL #multi
Extending BPELlight for Expressing Multi-Partner Message Exchange Patterns (JN, TvL, FL), pp. 245–254.
CIKMCIKM-2008-MasudaT #algebra
Nested region algebra extended with variables for tag-annotated text search (KM, JT), pp. 1349–1350.
ECIRECIR-2008-LillisTCD #data fusion #probability #using
Extending Probabilistic Data Fusion Using Sliding Windows (DL, FT, RWC, JD), pp. 358–369.
ICPRICPR-2008-Cleuziou #clustering
An extended version of the k-means method for overlapping clustering (GC), pp. 1–4.
ICPRICPR-2008-LeeWCYL #approach #video
Extended Kalman filtering approach to stereo video stabilization (KKL, KhW, MMYC, YKY, MKL), pp. 1–4.
SIGIRSIGIR-2008-Murray #library #modelling #process
Extending language modeling techniques to models of search and browsing activity in a digital library (GCM), p. 900.
SACSAC-2008-GrutterBH #ontology #reasoning
Extending an ontology-based search with a formalism for spatial reasoning (RG, BBM, MH), pp. 2266–2270.
SACSAC-2008-MowatSSC #approximate #network #peer-to-peer
Extending peer-to-peer networks for approximate search (AM, RS, MS, IC), pp. 455–459.
SACSAC-2008-PaesHY #fault tolerance
Extending RUP to develop fault tolerant software (CEdBP, CMH, ETY), pp. 783–790.
SACSAC-2008-PothierT #aspect-oriented #debugging #programming
Extending omniscient debugging to support aspect-oriented programming (GP, ÉT), pp. 266–270.
SACSAC-2008-SchroederM #logic #xml
Conversion of generalization hierarchies and union types from extended entity-relationship model to an XML logical model (RS, RdSM), pp. 1036–1037.
ICSEICSE-2008-BabicH #named #precise #scalability #static analysis
Calysto: scalable and precise extended static checking (DB, AJH), pp. 211–220.
ATEMATEM-J-2006-HenrikssonHJZA #approach #metamodelling #reuse
Extending grammars and metamodels for reuse: the Reuseware approach (JH, FH, JJ, SZ, UA), pp. 165–184.
CSLCSL-2008-Berardid #calculus
A Calculus of Realizers for EM1 Arithmetic (Extended Abstract) (SB, Ud), pp. 215–229.
CSLCSL-2008-Eisinger #automaton #bound #integer #linear
Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract) (JE), pp. 431–445.
ICLPICLP-2008-AnhRD #implementation #using
An Implementation of Extended P-Log Using XASP (HTA, CDPKR, CVD), pp. 739–743.
ICLPICLP-2008-SivaLZ #case study #constraints #database #sql
A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract) (SS, JJL, HZ), pp. 774–778.
ICSTICST-2008-El-FakihKPY #fault #finite #state machine
Extended Finite State Machine Based Test Derivation Driven by User Defined Faults (KEF, AK, SP, NY), pp. 308–317.
ICSTSAT-2008-MarienWDB #induction #logic #satisfiability
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (MM, JW, MD, MB), pp. 211–224.
VMCAIVMCAI-2008-GroceJ #dynamic analysis #model checking
Extending Model Checking with Dynamic Analysis (AG, RJ), pp. 142–156.
ECSAECSA-2007-NavasaPM #concept #named
AspectLEDA: Extending an ADL with Aspectual Concepts (ANM, MAP, JMM), pp. 330–334.
QoSAQoSA-2007-KuzL #component #embedded #modelling
Extending the Capabilities of Component Models for Embedded Systems (IK, YL), pp. 182–196.
CASECASE-2007-RajruangrabinP
Enhancement of Manipulator Interactivity through Compliant Skin and Extended Kalman Filtering (JR, DOP), pp. 1111–1116.
DACDAC-2007-DengBWYZ #named #performance #satisfiability #using
EHSAT: An Efficient RTL Satisfiability Solver Using an Extended DPLL Procedure (SD, JB, WW, XY, YZ), pp. 588–593.
DATEDATE-2007-Naumann #design #evolution #question
Keynote address: Was Darwin wrong? Has design evolution stopped at the RTL level... or will software and custom processors (or system-level design) extend Moore’s law? (AN), p. 2.
DocEngDocEng-2007-Giannetti #multi #standard
A multi-format variable data template wrapper extending podis PPML-T standard (FG), pp. 37–43.
SIGMODSIGMOD-2007-WyssW #integration #multi #optimisation #query #relational
Extending relational query optimization to dynamic schemas for information integration in multidatabases (CMW, FIW), pp. 473–484.
VLDBVLDB-2007-BotanFFKKT #xquery
Extending XQuery with Window Functions (IB, PMF, DF, DK, TK, RT), pp. 75–86.
VLDBVLDB-2007-BravoFM #dependence
Extending Dependencies with Conditions (LB, WF, SM), pp. 243–254.
VLDBVLDB-2007-LeeNS #distance #edit distance #string
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance (HL, RTN, KS), pp. 195–206.
ITiCSEITiCSE-2007-TremblayLS #testing
Extending a marking tool with simple support for testing (GT, LL, AS), p. 313.
ESOPESOP-2007-FrancalanzaH #bisimulation #fault tolerance #proving
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract) (AF, MH), pp. 395–410.
FoSSaCSFoSSaCS-2007-Rosu #algorithm #effectiveness #problem #regular expression
An Effective Algorithm for the Membership Problem for Extended Regular Expressions (GR), pp. 332–345.
MSRMSR-2007-MorisakiMMTM #data analysis #fault #mining
Defect Data Analysis Based on Extended Association Rule Mining (SM, AM, TM, HT, KiM), p. 3.
SCAMSCAM-2007-MagnussonEH #attribute grammar
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications (EM, TE, GH), pp. 69–80.
WCREWCRE-2007-FrenzelKBA #product line
Extending the Reflexion Method for Consolidating Software Variants into Product Lines (PF, RK, APJB, KA), pp. 160–169.
CIAACIAA-J-2006-BordihnHK07 #automaton #finite #hybrid
Hybrid Extended Finite Automata (HB, MH, MK), pp. 745–760.
ICALPICALP-2007-FioreH #equation
Equational Systems and Free Constructions (Extended Abstract) (MPF, CKH), pp. 607–618.
ICALPICALP-2007-HasuoJU #category theory
Categorical Views on Computations on Trees (Extended Abstract) (IH, BJ, TU), pp. 619–630.
ICALPICALP-2007-SimonBMG #induction #logic programming
Co-Logic Programming: Extending Logic Programming with Coinduction (LS, AB, AM, GG), pp. 472–483.
LATALATA-2007-Maletti #composition #top-down #transducer
Compositions of Extended Top-down Tree Transducers (AM), pp. 379–390.
SEFMSEFM-2007-AlhadidiBDB #aspect-oriented #λ-calculus
An AOP Extended λ-Calculus (DA, NB, MD, PB), pp. 183–194.
CHICHI-2007-PettittBS #information management #predict #visual notation
An extended keystroke level model (KLM) for predicting the visual demand of in-vehicle information systems (MP, GEB, AS), pp. 1515–1524.
HCIHCI-IDU-2007-Kirlik #concept #modelling
Conceptual and Technical Issues in Extending Computational Cognitive Modeling to Aviation (AK), pp. 872–881.
HCIHIMI-IIE-2007-ZhangWE #collaboration #comprehension
Resolving Assumptions in Art-Technology Collaboration as a Means of Extending Shared Understanding (YZ, AW, EAE), pp. 204–211.
ICEISICEIS-EIS-2007-KorherrL #metric #performance #process
Extending the EPC and the BPMN with Business Process Goals and Performance Measures (BK, BL), pp. 287–294.
ICEISICEIS-EIS-2007-ThomLIM #modelling #process #reuse #tool support #workflow
Extending Business Process Modeling Tools with Workflow Pattern Reuse (LHT, JML, CI, JM), pp. 447–452.
CIKMCIKM-2007-CaoGNB #markov #modelling #query
Extending query translation to cross-language query expansion with markov chain models (GC, JG, JYN, JB), pp. 351–360.
MLDMMLDM-2007-YuZWZ #3d #image #retrieval
A Filter-Refinement Scheme for 3D Model Retrieval Based on Sorted Extended Gaussian Image Histogram (ZY, SZ, HSW, JZ), pp. 643–652.
SEKESEKE-2007-ZaitM #named #ontology #web
OWLed: Extending Knowledge for Web Ontology Language (HZ, AM), pp. 598–603.
MODELSMoDELS-2007-BrambillaCC #automation #domain model #generative #modelling #workflow
Automatic Generation of Workflow-Extended Domain Models (MB, JC, SC), pp. 375–389.
MODELSMoDELS-2007-BrambillaCC #automation #domain model #generative #modelling #workflow
Automatic Generation of Workflow-Extended Domain Models (MB, JC, SC), pp. 375–389.
TOOLSTOOLS-EUROPE-2007-LanoC #semantics #state machine
Direct Semantics of Extended State Machines (KL, DC), pp. 35–51.
RERE-2007-BorgPS #capacity #requirements
Extending the OpenUP/Basic Requirements Discipline to Specify Capacity Requirements (AB, MP, KS), pp. 328–333.
SACSAC-2007-KorherrL #metric #performance
Extending the EPC with performance measures (BK, BL), pp. 1265–1266.
SACSAC-2007-MarthR #coordination #generative
Extending the ARC model with generative coordination (KM, SR), pp. 366–367.
SACSAC-2007-NeubauerS #performance #process
Extending business process management to determine efficient IT investments (TN, CS), pp. 1250–1256.
SACSAC-2007-ParkPS #reuse #specification
Extending reusable asset specification to improve software reuse (SP, SP, VS), pp. 1473–1478.
CCCC-2007-SarkarB #linear
Extended Linear Scan: An Alternate Foundation for Global Register Allocation (VS, RB), pp. 141–155.
HPCAHPCA-2007-ZhongLM #architecture #hybrid #manycore #parallel #thread
Extending Multicore Architectures to Exploit Hybrid Parallelism in Single-thread Applications (HZ, SAL, SAM), pp. 25–36.
ICLPICLP-2007-Hunyadi #framework #interface #named #prolog #web
Prosper: A Framework for Extending Prolog Applications with a Web Interface (LH), pp. 432–433.
ICLPICLP-2007-JarvisaloO #logic programming #source code
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs (MJ, EO), pp. 134–148.
VMCAIVMCAI-2007-PeronH #abstract domain #bound #constraints #matrix
An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints (MP, NH), pp. 268–282.
ASEASE-2006-DenneyF #automation #certification #safety
Annotation Inference for Safety Certification of Automatically Generated Code (Extended Abstract) (ED, BF), pp. 265–268.
DACDAC-2006-ZhuoCCV #hybrid
Extending the lifetime of fuel cell based hybrid systems (JZ, CC, NC, SBKV), pp. 562–567.
DocEngDocEng-2006-TesarSJP #comparison #documentation
Extending the single words-based document model: a comparison of bigrams and 2-itemsets (RT, VS, KJ, MP), pp. 138–146.
ITiCSEITiCSE-2006-PlimmerA #education #human-computer #learning
Peer teaching extends HCI learning (BP, RA), pp. 53–57.
FLOPSFLOPS-2006-SulzmannWS #algebra #data type #framework
A Framework for Extended Algebraic Data Types (MS, JW, PJS), pp. 47–64.
CIAACIAA-2006-BordihnHK #automaton #finite #hybrid
Hybrid Extended Finite Automata (HB, MH, MK), pp. 34–45.
SEFMSEFM-2006-Meyer
The Context of Object Computation (extended abstract) (BM), pp. 13–17.
CHICHI-2006-GrossmanHBAB #using
Hover widgets: using the tracking state to extend the capabilities of pen-operated devices (TG, KH, PB, MA, RB), pp. 861–870.
EDOCEDOC-2006-JohnsonLNS #analysis #architecture #diagrams #enterprise
Extended Influence Diagrams for Enterprise Architecture Analysis (PJ, RL, PN, MS), pp. 3–12.
EDOCEDOC-2006-LiG #policy
Composing Administrative Scope of Delegation Policies based on extended XACML (XFL, DF), pp. 467–470.
EDOCEDOC-2006-Zhang #collaboration
Extended Collaboration Description Language (X-CODL) (JZ), pp. 56–66.
ICEISICEIS-AIDSS-2006-HefkeZAWBB #framework #java #ontology
An Extendable Java Framework for Instance Similarities in Ontologies (MH, VZ, AA, QW, EB, MB), pp. 263–269.
ICEISICEIS-DISI-2006-DingGJH #approach #modelling #transaction
A New Approach to Implement Extended Transaction Models in J2EE (XD, XG, BJ, TH), pp. 118–123.
ICEISICEIS-DISI-2006-Ifinedo #enterprise #metric #resource management
Enterprise Resource Planning (ERP) Systems Success Measurement: An Extended Model (PI), pp. 71–78.
ICEISICEIS-J-2006-EspirituST06a #tool support #topic
The ViskiMap Toolkit: Extending Mediawiki with Topic Maps (CE, ES, TT), pp. 420–438.
ICPRICPR-v3-2006-ChanLN #re-engineering
Extending the Depth of Field in a Compound-Eye Imaging System with Super-Resolution Reconstruction (WSC, EYL, MKN), pp. 623–626.
ICPRICPR-v3-2006-LakamperL #3d #using
Using Extended EM to Segment Planar Structures in 3D (RL, LJL), pp. 1077–1082.
KDDKDD-2006-IwataSY #recommendation
Recommendation method for extending subscription periods (TI, KS, TY), pp. 574–579.
KRKR-2006-Doyle #on the #process
On Mechanization of Thought Processes (Extended Abstract) (JD), p. 2.
SIGIRSIGIR-2006-HuangM #clustering #feedback
Text clustering with extended user feedback (YH, TMM), pp. 413–420.
RERE-2006-LockerbieM #modelling #named #process #requirements
REDEPEND: Extending i* Modelling into Requirements Processes (JL, NAMM), pp. 354–355.
SACSAC-2006-HuangR
Extending noninterference properties to the timed world (JH, AWR), pp. 376–383.
SACSAC-2006-KacemKJD #architecture #uml #using
Describing dynamic software architectures using an extended UML model (MHK, AHK, MJ, KD), pp. 1245–1249.
SACSAC-2006-Parsons #api
Extending the location API for J2ME to support friend finder services (DP), pp. 992–996.
SACSAC-2006-TsujiHH #array #multi
An extendible multidimensional array system for MOLAP (TT, AH, KH), pp. 503–510.
SPLCSPLC-2006-BragancaM #case study #metamodelling #specification #uml #variability
Extending UML 2.0 Metamodel for Complementary Usages of the «extend» Relationship within Use Case Variability Specification (AB, RJM), pp. 123–130.
SPLCSPLC-2006-SchmidKE #product line #requirements #tool support
Requirements Management for Product Lines: Extending Professional Tools (KS, KK, ME), pp. 113–122.
HPDCHPDC-2006-YehAWCT #performance #using
Using File Grouping to Improve the Disk Performance (Extended Abstract) (TY, JA, JSW, IFC, KHT), pp. 365–366.
AMOSTAMOST-J-2005-Robinson-MallettLMG06 #identification #model checking #using #verification
Extended state identification and verification using a model checker (CRM, PL, TM, UG), pp. 981–992.
CAVCAV-2006-BardinLP #performance
FAST Extended Release (SB, JL, GP), pp. 63–66.
CSLCSL-2006-Ong #approach #infinity #semantics #verification
Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) (CHLO), pp. 31–40.
ICLPICLP-2006-CabalarOPV #equilibrium #logic #semantics #using
Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic (PC, SPO, DP, AV), pp. 346–360.
IJCARIJCAR-2006-GelderS #automation #generative #higher-order #logic #parsing
Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.
ICSTSAT-2006-JussilaSB #proving #quantifier #satisfiability
Extended Resolution Proofs for Symbolic SAT Solving with Quantification (TJ, CS, AB), pp. 54–60.
ICTSSTestCom-2006-KeumKKBC #finite #generative #state machine #testing #using #web #web service
Generating Test Cases for Web Services Using Extended Finite State Machine (CK, SK, IYK, JB, YIC), pp. 103–117.
WICSAWICSA-2005-OlumofinM #architecture #evaluation #product line
Extending the ATAM Architecture Evaluation to Product Line Architectures (FGO, VBM), pp. 45–56.
WICSAWICSA-2005-SmithS #analysis #architecture #automation
Extending SPQR to Architectural Analysis by Semi-Automated Training (JMS, PDS), pp. 239–242.
ASEASE-2005-ErikssonMBB #case study #modelling #product line #tool support
The PLUSS toolkit — extending telelogic DOORS and IBM-rational rose to support product line use case modeling (ME, HM, JB, KB), pp. 300–304.
DATEDATE-2005-HanlaiMJ #control flow #graph #memory management #optimisation #performance #using
Extended Control Flow Graph Based Performance Optimization Using Scratch-Pad Memory (PH, LM, JJ), pp. 828–829.
DATEDATE-2005-KimKKSCCKE #architecture #modelling #performance #transaction
Fast and Accurate Transaction Level Modeling of an Extended AMBA2.0 Bus Architecture (YTK, TK, YK, CS, EYC, KMC, JTK, SKE), pp. 138–139.
DATEDATE-2005-ZhangCHC #analysis #pseudo #statistics
Statistical Timing Analysis with Extended Pseudo-Canonical Timing Model (LZ, WC, YH, CCPC), pp. 952–957.
HTHT-2005-RivaZ #hypermedia #paradigm
Extending the text: digital editions and the hypertextual paradigm (MR, VZ), pp. 205–207.
SIGMODSIGMOD-2005-BeyerCCOPX #xquery
Extending XQuery for Analytics (KSB, DDC, LSC, , HP, YX), pp. 503–514.
VLDBVLDB-2005-LuLCC #encoding #pattern matching #performance #xml
From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching (JL, TWL, CYC, TC), pp. 193–204.
ITiCSEITiCSE-2005-BoavidaSASLV #game studies #online
The MulE game engine extending online role-playing games (MB, JPS, PAAA, LS, JL, RV), p. 404.
ITiCSEITiCSE-2005-KayHR #design #source code
Extending undergraduate CS programs with informatics: emphasizing software and system design in context (DGK, AvdH, DJR), p. 367.
ICSMEICSM-2005-WhiteJR #object-oriented #testing
Utilization of Extended Firewall for Object-Oriented Regression Testing (LJW, KJ, BR), pp. 695–698.
SCAMSCAM-2005-Breu #mining
Extending Dynamic Aspect Mining with Static Information (SB), pp. 57–65.
SEFMSEFM-2005-Sifakis #component #framework
A Framework for Component-based Construction Extended Abstract (JS), pp. 293–300.
CHICHI-2005-ZuckermanAR #education #interface
Extending tangible interfaces for education: digital montessori-inspired manipulatives (OZ, SA, MR), pp. 859–868.
AdaEuropeAdaEurope-2005-AtiyaK #csp
Extending Ravenscar with CSP Channels (DAA, SK), pp. 79–90.
EDOCEDOC-2005-JonesRB #enterprise #health #mobile #modelling
Modelling mobile health systems: an application of augmented MDA for the extended healthcare enterprise. (VJ, AR, EB), pp. 58–69.
EDOCEDOC-2005-KarastoyanovaHCLB #adaptation #runtime
Extending BPEL for Run Time Adaptability (DK, AH, MC, FL, APB), pp. 15–26.
EDOCEDOC-2005-XuXH #approach
An Extended Event Matching Approach in Content-based Pub/Sub Systems for EAI (GX, WX, TH), pp. 287–296.
ICEISICEIS-v1-2005-BenchikhaB #database #object-oriented
Extending Object Oriented Databases to Support the Viewpoint Mechanism (FB, MB), pp. 273–278.
MODELSMoDELS-2005-QuartelDS #concept
Extending Profiles with Stereotypes for Composite Concepts (DACQ, RMD, MvS), pp. 232–247.
MODELSMoDELS-2005-SmialekBNS #metamodelling #uml
Scenario Construction Tool Based on Extended UML Metamodel (MS, JB, WN, TS), pp. 414–429.
MODELSMoDELS-2005-QuartelDS #concept
Extending Profiles with Stereotypes for Composite Concepts (DACQ, RMD, MvS), pp. 232–247.
MODELSMoDELS-2005-SmialekBNS #metamodelling #uml
Scenario Construction Tool Based on Extended UML Metamodel (MS, JB, WN, TS), pp. 414–429.
ECOOPECOOP-2005-RodriguezDFHLR #composition #concurrent #ml #multi #source code #specification #thread #verification
Extending JML for Modular Specification and Verification of Multi-threaded Programs (ER, MBD, CF, JH, GTL, R), pp. 551–576.
QAPLQAPL-2004-HankinW05 #program analysis #λ-calculus
λ-calculus and Quantitative Program Analysis: (Extended Abstract) (CH, HW), pp. 5–18.
SACSAC-2005-BordognaP #sql
Extending SQL with customizable soft selection conditions (GB, GP), pp. 1107–1111.
SACSAC-2005-SchelpS #framework #integration
Extending the business engineering framework for application integration purposes (JS, AS), pp. 1333–1337.
SACSAC-2005-StaakeTF #anti #network
Extending the EPC network: the potential of RFID in anti-counterfeiting (TS, FT, EF), pp. 1607–1612.
SACSAC-2005-UpadhyayaK #diagrams #named #ontology
ERONTO: a tool for extracting ontologies from extended E/R diagrams (SRU, PSK), pp. 666–670.
ICSEICSE-2005-Ayton #how
Extending the discipline: how software can help or hinder human decision making (and vice-versa) (PA), p. 36.
CAVCAV-2005-LalRB #automaton
Extended Weighted Pushdown Systems (AL, TWR, GB), pp. 434–448.
CAVCAV-2005-Yavuz-KahveciBB #verification
Action Language Verifier, Extended (TYK, CB, TB), pp. 413–417.
CSLCSL-2005-KhoussainovR #algebra #decidability
Decidability of Term Algebras Extending Partial Algebras (BK, SR), pp. 292–308.
RTARTA-2005-KesnerL #paradigm
Extending the Explicit Substitution Paradigm (DK, SL), pp. 407–422.
ICTSSTestCom-2005-HongU #data flow #dependence #testing
Dependence Testing: Extending Data Flow Testing with Control Dependence (HSH, HU), pp. 23–39.
CBSECBSE-2004-Jonkers #interface #specification
Interface Specification: A Balancing Act (Extended Abstract) (HBMJ), pp. 5–6.
DACDAC-2004-PasrichaDB #approach #architecture #communication #modelling #performance #transaction
Extending the transaction level modeling approach for fast communication architecture exploration (SP, NDD, MBR), pp. 113–118.
DATEDATE-v1-2004-VandersteenPLD #identification #linear
Extended Subspace Identification of Improper Linear Systems (GV, RP, DL, SD), pp. 454–459.
DocEngDocEng-2004-GoularteCCIIP #interactive #multi
Interactive multimedia annotations: enriching and extending content (RG, RGC, JACG, VRIJ, MdGCP), pp. 84–86.
HTHT-2004-CarrMWPBHG #library
Extending the role of the digital library: computer support for creating articles (LC, TMB, GW, GP, CB, WH, SG), pp. 12–21.
SIGMODSIGMOD-2004-RizviMSR #data access #fine-grained #query
Extending Query Rewriting Techniques for Fine-Grained Access Control (SR, AOM, SS, PR), pp. 551–562.
VLDBVLDB-2004-GuhaKS #approximate #named #streaming
XWAVE: Approximate Extended Wavelets for Streaming Data (SG, CK, KS), pp. 288–299.
ITiCSEITiCSE-2004-Stepney #education
Teaching post-classical computation: (extended abstract) (SS), p. 3.
ITiCSEITiCSE-2004-WangC #assessment #learning #online #performance
Extending e-books with annotation, online support and assessment mechanisms to increase efficiency of learning (CYW, GDC), pp. 132–136.
ESOPESOP-2004-Boudol #named #programming
ULM: A Core Programming Model for Global Computing: (Extended Abstract) (GB), pp. 234–248.
ESOPESOP-2004-JiaW #distributed #proving #source code
Modal Proofs as Distributed Programs (Extended Abstract) (LJ, DW), pp. 219–233.
FoSSaCSFoSSaCS-2004-Demri #constraints #integer #ltl
LTL over Integer Periodicity Constraints: (Extended Abstract) (SD), pp. 121–135.
STOCSTOC-2004-HalpernT #multi
Rational secret sharing and multiparty computation: extended abstract (JYH, VT), pp. 623–632.
FLOPSFLOPS-2004-Kikuchi #calculus #normalisation #proving
A Direct Proof of Strong Normalization for an Extended Herbelin?s Calculus (KK), pp. 244–259.
ICALPICALP-2004-ChenDSY #sequence
Dynamic Price Sequence and Incentive Compatibility (Extended Abstract) (NC, XD, XS, ACCY), pp. 320–331.
ICALPICALP-2004-DabrowskiP #equation #word
Solving Two-Variable Word Equations (Extended Abstract) (RD, WP), pp. 408–419.
ICALPICALP-2004-DengL
A PTAS for Embedding Hypergraph in a Cycle (Extended Abstract) (XD, GL), pp. 433–444.
ICALPICALP-2004-DvorakKP #consistency #constraints #problem
Locally Consistent Constraint Satisfaction Problems: (Extended Abstract) (ZD, DK, OP), pp. 469–480.
ICALPICALP-2004-GasieniecKPX #multi #network
Deterministic M2M Multicast in Radio Networks: (Extended Abstract) (LG, EK, AP, QX), pp. 670–682.
ICALPICALP-2004-GuruswamiI #linear
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) (VG, PI), pp. 695–707.
ICALPICALP-2004-Toftdal #analysis #effectiveness #logic #theorem
A Calibration of Ineffective Theorems of Analysis in a Hierarchy of Semi-classical Logical Principles: (Extended Abstract) (MT), pp. 1188–1200.
SEFMSEFM-2004-SistlaWZ #using
Checking Extended CTL properties Using Guarded Quotient Structures (APS, XW, MZ), pp. 87–94.
ICGTICGT-2004-EetveldeJ #graph grammar #refactoring
Extending Graph Rewriting for Refactoring (NVE, DJ), pp. 399–415.
AdaEuropeAdaEurope-2004-MasmanoRRC #linux #realtime
Extending the Capabilities of Real-Time Applications by Combining MaRTE-OS and Linux (MM, JR, IR, AC), pp. 144–155.
ICEISICEIS-v3-2004-GoethalsVLSBH #architecture #communication #enterprise #integration
Communication and Enterprise Architecture in Extended Enterprise Integration (FGG, JV, WL, MS, MDB, RH), pp. 332–337.
ICEISICEIS-v4-2004-KangT #diagrams #mobile #modelling #process #uml
Modelling Mobile Agent Applications by Extended UML Activity Diagram (MK, KT), pp. 519–522.
ICEISICEIS-v4-2004-SutandiyoCLK #mobile #named
MGAIA: Extending the GAIA Methodology to Model Mobile Agent Systems (WS, MBC, SWL, SK), pp. 515–518.
CIKMCIKM-2004-ChenZ #formal method #logic programming #mobile #multi
An extended logic programming based multi-agent system formalization in mobile environments (JC, YZ), pp. 166–167.
CIKMCIKM-2004-HeL #dependence #functional
Extending and inferring functional dependencies in schema transformation (QH, TWL), pp. 12–21.
ICPRICPR-v3-2004-SolemH #using
Estimating Surface Shape and Extending Known Structure using Specular Reflections (JES, AH), pp. 173–176.
ICPRICPR-v4-2004-ChoH #image
Extending Dynamic Range of Two Color Images under Different Exposures (WhC, KSH), pp. 853–856.
KRKR-2004-PetrickB #approach #knowledge-based
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing (RPAP, FB), pp. 613–622.
UMLUML-2004-Fernandez-MedinaP #database #development #ocl
Extending OCL for Secure Database Development (EFM, MP), pp. 380–394.
PADLPADL-2004-LopesCS
Pruning in the Extended Andorra Model (RL, VSC, FMAS), pp. 120–134.
SACSAC-2004-GoethalsVL #enterprise
Developing the extended enterprise with the FADEE (FGG, JV, WL), pp. 1372–1379.
SACSAC-2004-ParkerC #policy #protocol
Extending invalid-access prevention policy protocols for mobile-client data caching (SP, ZC), pp. 1171–1176.
ICSEICSE-2004-KhareT #architecture #distributed #rest
Extending the Representational State Transfer (REST) Architectural Style for Decentralized Systems (RK, RNT), pp. 428–437.
CGOCGO-2004-TallamZG #bound #profiling
Extending Path Profiling across Loop Backedges and Procedure Boundaries (ST, XZ, RG), pp. 251–264.
IJCARIJCAR-2004-GilHSZ #algorithm #constraints #finite #order #performance #problem
Efficient Algorithms for Constraint Description Problems over Finite Totally Ordered Domains: Extended Abstract (ÀJG, MH, GS, BZ), pp. 244–258.
VMCAIVMCAI-2004-BartheBR #compilation #security
Security Types Preserving Compilation: (Extended Abstract) (GB, AB, TR), pp. 2–15.
ASEASE-2003-MayerS #debugging #exception #source code
Extending Diagnosis to Debug Programs with Exceptions (WM, MS), pp. 240–244.
DACDAC-2003-RongP #approach #markov #mobile #network
Extending the lifetime of a network of battery-powered mobile devices by remote processing: a markovian decision-based approach (PR, MP), pp. 906–911.
DATEDATE-2003-AhmedTN #testing
Extending JTAG for Testing Signal Integrity in SoCs (NA, MHT, MN), pp. 10218–10223.
DATEDATE-2003-KrausP #flexibility #named #synthesis
XBM2PLA: A Flexible Synthesis Tool for Extended Burst Mode Machines (OK, MP), pp. 11092–11093.
DATEDATE-2003-LeeHH #composition #design #finite #power management #state machine
Decomposition of Extended Finite State Machine for Low Power Design (ML, TH, SYH), pp. 11152–11153.
DocEngDocEng-2003-BrunoMM #xquery
Extending xQuery with transformation operators (EB, JLM, EM), pp. 1–8.
SIGMODSIGMOD-2003-DeligiannakisR #metric #multi
Extended Wavelets for Multiple Measures (AD, NR), pp. 229–240.
ITiCSEITiCSE-2003-GrayGR #design #process
Extending CRC cards into a complete design process (KAG, MG, SR), p. 226.
PEPMPEPM-2003-ChinKX #analysis
Extending sized type with collection analysis (WNC, SCK, DNX), pp. 75–84.
CIAACIAA-2003-FanLLTWY #algorithm
An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics Extended Abstract (THF, SL, HIL, TST, TCW, AY), pp. 251–257.
ICFPICFP-2003-Wand #aspect-oriented #comprehension
Understanding aspects: extended abstract (MW), pp. 299–300.
ICEISICEIS-v1-2003-BarkerD #database #implementation
Extended Protected Databases: A Practical Implementation (SB, PD), pp. 456–459.
ICEISICEIS-v1-2003-BouchouALD #automaton #constraints #validation #xml
Extending Tree Automata to Model XML Validation Under Element and Attribute Constraints (BB, MHFA, DL, DD), pp. 184–190.
ICEISICEIS-v1-2003-EdlundFKK #question
Extending Groupware for OLAP: Where Did My Time Go? (SE, DAF, VK, SK), pp. 47–54.
ICEISICEIS-v3-2003-YamaguchiWS #design #petri net #reliability #using
A High Reliability Design for Nfs Server Software By Using an Extended Petri Net (SY, KW, YS), pp. 498–502.
SEKESEKE-2003-DongY #design pattern #diagrams #uml #visualisation
Extending UML to Visualize Design Patterns In Class Diagrams (JD, SY), pp. 124–131.
SEKESEKE-2003-SongPLGCM #e-commerce #uml #verification
Extending UML to Specify and Verify E-commerce Systems (MAJS, AMP, FL, GG, SVAC, WMJ), pp. 306–313.
LOPSTRLOPSTR-2003-FischerV #prolog #syntax #synthesis
Adding Concrete Syntax to a Prolog-Based Program Synthesis System (Extended Abstract) (BF, EV), pp. 56–58.
PPDPPPDP-2003-DuckSBH #constraints
Extending arbitrary solvers with constraint handling rules (GJD, PJS, MJGdlB, CH), pp. 79–90.
PPDPPPDP-2003-HirschowitzLW #call-by #compilation #functional #recursion
Compilation of extended recursion in call-by-value functional languages (TH, XL, JBW), pp. 160–171.
SACSAC-2003-ChenC #named
Similar_Join: Extending DBMS with a Bio-specific Operator (JYC, JVC), pp. 109–114.
SACSAC-2003-GuH #internet #protocol #ubiquitous #web
Extended Internet Caching Protocol: A Foundation for Building Ubiquitous Web Caching (WG, AH), pp. 901–907.
SACSAC-2003-HuC #adaptation #information management
Adaptive Dissemination of Dynamic Information Services in an Extended Data Broadcast Environment (CLH, MSC), pp. 855–859.
CAVCAV-2003-BoigelotHJ #automaton #hybrid #using
Hybrid Acceleration Using Real Vector Automata (Extended Abstract) (BB, FH, SJ), pp. 193–205.
CAVCAV-2003-BoigelotLW #in the large #transducer
Iterating Transducers in the Large (Extended Abstract) (BB, AL, PW), pp. 223–235.
CAVCAV-2003-MouraRS #bound #induction #model checking #verification
Bounded Model Checking and Induction: From Refutation to Verification (Extended Abstract, Category A) (LMdM, HR, MS), pp. 14–26.
CSLCSL-2003-ChevalierKRTV #bound
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (YC, RK, MR, MT, LV), pp. 128–141.
ICLPICLP-2003-ErdoganL #programming #set
Definitions in Answer Set Programming: (Extended Abstract) (STE, VL), pp. 483–484.
ICLPICLP-2003-LopesCS #on the
On Deterministic Computations in the Extended Andorra Model (RL, VSC, FMAS), pp. 407–421.
ICLPICLP-2003-Serebrenik #analysis #logic programming #source code #termination
Termination Analysis of Logic Programs: Extended Abstract (AS), pp. 507–508.
ICLPICLP-2003-SerebrenikD #logic programming #refactoring #source code
Refactoring Logic Programs: Extended Abstract (AS, BD), pp. 509–510.
LICSLICS-2003-FrickGK #evaluation #query
Query Evaluation on Compressed Trees (Extended Abstract) (MF, MG, CK), p. 188–?.
LICSLICS-2003-HughesG #linear #logic #multi #proving
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract) (DJDH, RJvG), pp. 1–10.
LICSLICS-2003-MillerT #proving
A Proof Theory for Generic Judgments: An extended abstract (DM, AFT), pp. 118–127.
RTARTA-2003-RouV #incremental #regular expression #testing
Testing Extended Regular Language Membership Incrementally by Rewriting (GR, MV), pp. 499–514.
ICSTSAT-2003-BroeringL #algorithm #satisfiability
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract) (EB, SVL), pp. 162–171.
ICTSSTestCom-2003-El-FakihPYB #fault #finite #state machine
Fault Diagnosis in Extended Finite State Machines (KEF, SP, NY, GvB), pp. 197–210.
DACDAC-2002-OhH #data flow #graph #multi #performance #synthesis
Efficient code synthesis from extended dataflow graphs for multimedia applications (HO, SH), pp. 275–280.
DATEDATE-2002-LogothetisS #generative #modelling #realtime
Extending Synchronous Languages for Generating Abstract Real-Time Models (GL, KS), pp. 795–802.
DocEngDocEng-2002-Muchaluat-SaadeRS #multi #named
XConnector: extending XLink to provide multimedia synchronization (DCMS, RFR, LFGS), pp. 49–56.
VLDBVLDB-2002-MahnkeMS
Extending an ORDBMS: The StateMachine Module (WM, CM, HPS), pp. 1079–1082.
PLDIPLDI-2002-FlanaganLLNSS #java #static analysis
Extended Static Checking for Java (CF, KRML, ML, GN, JBS, RS), pp. 234–245.
CIAACIAA-2002-Bruggemann-KleinW #context-free grammar #on the #parsing #predict
On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.
CIAACIAA-2002-CampeanuSY #regular expression
Regex and Extended Regex (CC, KS, SY), pp. 77–84.
DLTDLT-2002-Esik #finite #generative #logic #monad #word
Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators (), pp. 43–58.
FMFME-2002-DongSW #semantics #web
Semantic Web for Extending and Linking Formalisms (JSD, JS, HHW), pp. 587–606.
AdaEuropeAdaEurope-2002-DewarHCW #ada #runtime
Exposing Uninitialized Variables: Strengthening and Extending Run-Time Checks in Ada (RD, OH, DC, PW), pp. 193–204.
CAiSECAiSE-2002-TzitzikasSCA #ontology
Extended Faceted Ontologies (YT, NS, PC, AA), pp. 778–781.
ICEISICEIS-2002-KelkarLS #modelling #standard #towards #xml
Towards Extended Price Models in XML Standards for Electronic Product Catalogs (OK, JL, VS), pp. 937–945.
ICMLICML-2002-KamvarKM #algorithm #approach #clustering #modelling #using
Interpreting and Extending Classical Agglomerative Clustering Algorithms using a Model-Based approach (SDK, DK, CDM), pp. 283–290.
ICPRICPR-v1-2002-HiranoHTOE #3d #image #quantifier #using
Quantification of Shrinkage of Lung Lobe from Chest CT Images Using the 3D Extended Voronoi Division and its Application to the Benign/Malignant Discrimination of Tumor Shadows (YH, JiH, JiT, HO, KE), pp. 751–754.
ICPRICPR-v1-2002-MaedaKI #3d #hybrid #modelling #representation #using
Shapes Modeling of 3-D Objects Based on A Hybrid Representation Using Extended B-spline Surface Model (MM, KK, KI), pp. 656–659.
ICPRICPR-v2-2002-KanbaraYT #artificial reality
Registration for Stereo Vision-Based Augmented Reality Based on Extendible Tracking of Markers and Natural Features (MK, NY, HT), pp. 1045–1048.
ICPRICPR-v3-2002-MullerH #linear
Extending the Linear Interpolating Condition to Advanced Synthetic Discriminant Function Variants (NM, BMH), pp. 883–886.
ICPRICPR-v3-2002-Yang #classification
Extended Isomap for Classification (MHY), pp. 615–618.
ICPRICPR-v3-2002-ZhouK #representation #set #using
Representing and Recognizing Complete Set of Geons Using Extended Superquadrics (LZ, CK), pp. 713–718.
LSOLSO-2002-DingsoyrH #agile #feedback
Extending Agile Methods: Postmortem Reviews as Extended Feedback (TD, GKH), pp. 4–12.
SEKESEKE-2002-CostagliolaDFG #modelling #using #visual notation
Using extended positional grammars to develop visual modeling languages (GC, VD, FF, CG), pp. 201–208.
UMLUML-2002-Jurjens #development #named #uml
UMLsec: Extending UML for Secure Systems Development (JJ), pp. 412–425.
UMLUML-2002-Lujan-MoraTS #modelling #multi #uml
Extending the UML for Multidimensional Modeling (SLM, JT, IYS), pp. 290–304.
LOPSTRLOPSTR-2002-VanhoofTB #fixpoint #logic programming #semantics #source code
A Fixed Point Semantics for Logic Programs Extended with Cuts (WV, RT, MB), pp. 238–257.
POPLPOPL-2002-BanerjeeN #data access #independence #representation
Representation independence, confinement and access control [extended abstract] (AB, DAN), pp. 166–177.
SACSAC-2002-PandaH #approach #database #dependence #robust
Extended data dependency approach: a robust way of rebuilding database (BP, KAH), pp. 446–452.
ICSEICSE-2002-Feinberg #enterprise
Transforming and extending the enterprise through IT (DF), p. 3.
CAVCAV-2002-Thomas #game studies #infinity #tutorial #verification
Infinite Games and Verification (Extended Abstract of a Tutorial) (WT), pp. 58–64.
DATEDATE-2001-BeniniCMMPS #scheduling
Extending lifetime of portable systems by battery scheduling (LB, GC, AM, EM, MP, RS), pp. 197–203.
DocEngDocEng-2001-Wong #database #query #scalability #xml
The extended XQL for querying and updating large XML databases (RKW), pp. 95–104.
HTHT-2001-ConlanHLWA #adaptation #learning #metadata
Extending eductional metadata schemas to describe adaptive learning resources (OC, CH, PL, VPW, DA), pp. 161–162.
HTHT-2001-WeinreichOL #concept #user interface
The look of the link — concepts for the user interface of extended hyperlinks (HW, HO, WL), pp. 19–28.
PODSPODS-2001-Murata #xml
Extended Path Expressions for XML (MM).
VLDBVLDB-2001-Adler
DB2 Spatial Extender — Spatial data within the RDBMS (DWA), pp. 687–690.
VLDBVLDB-2001-LahiriSCMC #clustering
Cache Fusion: Extending Shared-Disk Clusters with Shared Caches (TL, VS, WC, NM, SC), pp. 683–686.
VLDBVLDB-2001-OzsuLON #database #image #multi #query #similarity
An Extendible Hash for Multi-Precision Similarity Querying of Image Databases (SL, MTÖ, VO, RTN), pp. 221–230.
FASEFASE-2001-MossakowskiAH #development #graph
Extending Development Graphs with Hiding (TM, SA, DH), pp. 269–283.
ICSMEICSM-2001-FranceBT #evolution #uml
Extending the UML to Support Evolution Management (RBF, JMB, RT), p. 106.
PASTEPASTE-2001-LiangPH #analysis #java #points-to
Extending and evaluating flow-insenstitive and context-insensitive points-to analyses for Java (DL, MP, MJH), pp. 73–79.
SASSAS-2001-BouajjaniCLS #automaton #parametricity
Analyzing Fair Parametric Extended Automata (AB, ACA, YL, MS), pp. 335–355.
SASSAS-2001-Leino #static analysis
Applications of Extended Static Checking (KRML), pp. 185–193.
CIAACIAA-2001-ChamparnaudD #multi
Brzozowski’s Derivatives Extended to Multiplicities (JMC, GD), pp. 52–64.
CHICHI-2001-MynattRCJ #product line
Digital family portraits: supporting peace of mind for extended family members (EDM, JR, SC, AJ), pp. 333–340.
CHICHI-2001-TangYBKLB #mobile
ConNexus to awarenex: extending awareness to mobile users (JCT, NY, JB, MVK, FCL, JRB), pp. 221–228.
ICEISICEIS-v2-2001-VassiliadisTGLBGP #enterprise
Managing Risk in Extended Enterprises (BV, AKT, KG, SL, NB, PG, KP), pp. 799–806.
UMLUML-2001-BaclawskiKKHSHLA #ontology #semantics #uml #web
Extending UML to Support Ontology Engineering for the Semantic Web (KB, MMK, PAK, LH, JES, WSHI, JL, MLA), pp. 342–360.
UMLUML-2001-MarcosVC #database #design #uml
Extending UML for Object-Relational Database Design (EM, BV, JMC), pp. 225–239.
OOPSLAOOPSLA-2001-BachrachP #java
The Java Syntactic Extender (JB, KP), pp. 31–42.
PADLPADL-2001-LopesCS #implementation #novel
A Novel Implementation of the Extended Andorra Model (RL, VSC, FMAS), pp. 199–213.
RERE-2001-ThompsonH #approach #product line
Extending the Product Family Approach to Support n-Dimensional and Hierarchical Product Lines (JMT, MPEH), pp. 56–65.
SACSAC-2001-NakanoHSN #effectiveness #hypermedia #protocol #streaming #web
Extending hypertext streaming protocol to realize effective web page transmission via a chaching proxy (TN, KH, SS, SN), pp. 440–445.
LCTESLCTES-OM-2001-LarusP #performance #scheduling #using
Using Cohort Scheduling to Enhance Server Performance (Extended Abstract) (JRL, MP), pp. 182–187.
IJCARIJCAR-2001-AudemardH #heuristic
The eXtended Least Number Heuristic (GA, LH), pp. 427–442.
IJCARIJCAR-2001-HaarslevMW #approach #logic #motivation
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach (VH, RM, MW), pp. 29–44.
IJCARIJCAR-2001-Stuber #modelling #proving
A Model-Based Completeness Proof of Extended Narrowing and Resolution (JS), pp. 195–210.
ICSTSAT-2001-BejarCFMG #logic #satisfiability
Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.
ASEASE-2000-MorisioTS #analysis #uml
Extending UML to Support Domain Analysis (MM, GT, MES), pp. 321–324.
DACDAC-2000-WangN #analysis #linear #multi #order
Extended Krylov subspace method for reduced order analysis of linear circuits with multiple sources (JMW, TVN), pp. 247–252.
SIGMODSIGMOD-2000-Weininger #database #parallel #scalability
Handling Very Large Databases with Informix Extended Parallel Server (AW), pp. 548–549.
VLDBVLDB-2000-WangZ #relational #sql #using
Using SQL to Build New Aggregates and Extenders for Object- Relational Systems (HW, CZ), pp. 166–175.
ESOPESOP-2000-Hofmann #bound #functional #type system
A Type System for Bounded Space and Functional In-Place Update--Extended Abstract (MH0), pp. 165–179.
PEPMPEPM-2000-SumiiK #approach #partial evaluation
Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract) (ES, NK), pp. 12–21.
PEPMPEPM-2000-Taha #formal method #ml #multi #reduction #semantics
A Sound Reduction Semantics for Untyped CBN Multi-stage Computation. Or, the Theory of MetaML is Non-trivial (Extended Abstract) (WT), pp. 34–43.
STOCSTOC-2000-Achlioptas #bound #random #satisfiability
Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (DA), pp. 28–37.
STOCSTOC-2000-AmbainisSV
Computing with highly mixed states (extended abstract) (AA, LJS, UVV), pp. 697–704.
STOCSTOC-2000-BihamBBMR #proving #quantum #security
A proof of the security of quantum key distribution (extended abstract) (EB, MB, POB, TM, VPR), pp. 715–724.
STOCSTOC-2000-CanettiGGM
Resettable zero-knowledge (extended abstract) (RC, OG, SG, SM), pp. 235–244.
STOCSTOC-2000-CarrV #random
Randomized metarounding (extended abstract) (RDC, SV), pp. 58–62.
STOCSTOC-2000-CharikarFGKRS #query
Query strategies for priced information (extended abstract) (MC, RF, VG, JMK, PR, AS), pp. 582–591.
STOCSTOC-2000-CrescenzoSY #on the #proving
On zero-knowledge proofs (extended abstract): “from membership to decision” (GDC, KS, MY), pp. 255–264.
STOCSTOC-2000-CzumajS #algorithm #approach #problem #satisfiability #scheduling
A new algorithm approach to the general Lovász local lemma with applications to scheduling and satisfiability problems (extended abstract) (AC, CS), pp. 38–47.
STOCSTOC-2000-FaginKKRRRST #random
Random walks with “back buttons” (extended abstract) (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
STOCSTOC-2000-FeigeKN #approximate
Approximating the minimum bisection size (extended abstract) (UF, RK, KN), pp. 530–536.
STOCSTOC-2000-GoldsmithS #query
More theory revision with queries (extended abstract) (JG, RHS), pp. 441–448.
STOCSTOC-2000-GrossiV #array #string
Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (RG, JSV), pp. 397–406.
STOCSTOC-2000-Istrail #3d #statistics
Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract) (SI), pp. 87–96.
STOCSTOC-2000-KaoNT #optimisation #problem
The risk profile problem for stock portfolio optimization (extended abstract) (MYK, AN, SRT), pp. 228–234.
STOCSTOC-2000-MahajanV #graph
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (MM, KRV), pp. 351–357.
STOCSTOC-2000-MotwaniPSV #decidability #on the #problem
On the decidability of accessibility problems (extended abstract) (RM, RP, VAS, SV), pp. 306–315.
STOCSTOC-2000-NaorRR #pseudo
Pseudo-random functions and factoring (extended abstract) (MN, OR, AR), pp. 11–20.
STOCSTOC-2000-OrlinSS #combinator #optimisation #precise
epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract) (JBO, ASS, SS), pp. 565–572.
STOCSTOC-2000-PapadimitriouV #on the #problem
On the approximability of the traveling salesman problem (extended abstract) (CHP, SV), pp. 126–133.
STOCSTOC-2000-RothemundW #complexity #self
The program-size complexity of self-assembled squares (extended abstract) (PWKR, EW), pp. 459–468.
STOCSTOC-2000-Schulman #clustering
Clustering for edge-cost minimization (extended abstract) (LJS), pp. 547–555.
STOCSTOC-2000-Vygen #algorithm #on the
On dual minimum cost flow algorithms (extended abstract) (JV), pp. 117–125.
CIAACIAA-2000-Bruggemann-KleinW #automaton #nondeterminism
Regularly Extended Two-Way Nondeterministic Tree Automata (ABK, DW), pp. 57–66.
CIAACIAA-2000-Gaal #transducer
Extended Sequentialization of Transducers (TG), pp. 333–334.
ICALPICALP-2000-BaudronPS #multi #security
Extended Notions of Security for Multicast Public Key Cryptosystems (OB, DP, JS), pp. 499–511.
CAiSECAiSE-2000-GomezCP #approach #concept #design #modelling #web
Extending a Conceptual Modelling Approach to Web Application Design (JG, CC, OP), pp. 79–93.
ICEISICEIS-2000-Ash #e-commerce #enterprise #internet #perspective
An E-Commerce Model for Extending ERP Systems Onto the Internet: An Australian Perspective (CGA), pp. 390–394.
CIKMCIKM-2000-Fox #library
Digital Libraries: Extending and Applying Library and Information Science and Technology (EAF), p. 3.
CIKMCIKM-2000-PedersenSGJ #database #query
Extending OLAP Querying to External Object Databases (TBP, AS, JG, CSJ), pp. 405–413.
ICMLICML-2000-PellegM #clustering #estimation #named #performance
X-means: Extending K-means with Efficient Estimation of the Number of Clusters (DP, AWM), pp. 727–734.
ICPRICPR-v1-2000-SteinbachGEB #3d #multi #re-engineering #using
3-D Object Reconstruction Using Spatially Extended Voxels and Multi-Hypothesis Voxel Coloring (EGS, BG, PE, AB), pp. 1774–1777.
ICPRICPR-v2-2000-KeysersDTN #distance
Experiments with an Extended Tangent Distance (DK, JD, TT, HN), pp. 2038–2042.
ICPRICPR-v3-2000-Bogoni #image
Extending Dynamic Range of Monochrome and Color Images through Fusion (LB), pp. 3007–3016.
ICPRICPR-v3-2000-CarreiraMTH #using
Grouping of Directional Features Using an Extended Hough Transform (MJC, MM, BTT, JFH), pp. 7002–7005.
ICPRICPR-v4-2000-ParkKL #automation #metric #quality
Automatic Quality Measurement of Gray-Scale Handwriting Based on Extended Average Entropy (JSP, HJK, SWL), pp. 4426–4429.
KDDKDD-2000-GavrilovAIM #mining #question
Mining the stock market (extended abstract): which measure is best? (MG, DA, PI, RM), pp. 487–496.
UMLUML-2000-KleppeW #ocl
Extending OCL to include Actions (AK, JW), pp. 440–450.
ECOOPECOOP-2000-FisherR #type system
Extending Moby with Inheritance-Based Subtyping (KF, JHR), pp. 83–107.
TOOLSTOOLS-EUROPE-2000-CanalFTV #calculus #corba #interface #protocol
Extending CORBA Interfaces with p-Calculus for Protocol Compatibility (CC, LF, JMT, AV), pp. 208–225.
TOOLSTOOLS-EUROPE-2000-RouvellouDREM
Extending Business Objects with Business Rules (IR, LD, KR, DE, BM), pp. 238–249.
PPDPPPDP-2000-PelovB #constraints #logic programming
Extending constraint logic programming with open functions (NP, MB), pp. 235–244.
REICRE-2000-GunterGJZ #requirements
A Reference Model for Requirements and Specifications-Extended Abstract (CAG, ELG, MJ, PZ), p. 189.
SACSAC-2000-JurisicaG #image #reasoning #using
Extending Case-Based Reasoning by Discovering and Using Image Features in IVF (IJ, JIG), pp. 52–59.
ICSEICSE-2000-Pisan #specification #using
Extending requirement specifications using analogy (YP), pp. 70–76.
ASPLOSASPLOS-2000-MartinSAADMMPHW #approach
Timestamp snooping: an approach for extending SMPs (MMKM, DJS, AA, ARA, RMD, CJM, KEM, MP, MDH, DAW), pp. 25–36.
HPCAHPCA-2000-JourdanRAEYR
eXtended Block Cache (SJ, LR, YA, ME, AY, RR), pp. 61–70.
CADECADE-2000-KapurS #induction
Extending Decision Procedures with Induction Schemes (DK, MS), pp. 324–345.
ICLPCL-2000-AlferesHP #logic programming #modelling #source code
Partial Models of Extended Generalized Logic Programs (JJA, HH, LMP), pp. 149–163.
ICLPCL-2000-Denecker #induction #logic
Extending Classical Logic with Inductive Definitions (MD), pp. 703–717.
ICLPCL-2000-Inoue #abduction
A Simple Characterization of Extended Abduction (KI), pp. 718–732.
ASEASE-1999-HoJGP #framework #named #uml
UMLAUT: An Extendible UML Transformation Framework (WMH, JMJ, ALG, FP), pp. 275–278.
ASEASE-1999-PoppletonB #named #refinement
Retrenchment: Extending the Reach of Refinement (MP, RB), pp. 158–165.
ICDARICDAR-1999-Phillips #how #image #set
How to Extend and Bootstrap an Existing Data Set with Real-life Degraded Images (ITP), pp. 689–692.
PODSPODS-1999-Cosmadakis #complexity #query #recursion
Inherent Complexity of Recursive Queries (Extended Abstract) (SSC), pp. 148–154.
SIGMODSIGMOD-1999-LometT #logic
Logical Logging to Extend Recovery to New Domains (DBL, MRT), pp. 73–84.
VLDBVLDB-1999-PedersenJD #online
Extending Practical Pre-Aggregation in On-Line Analytical Processing (TBP, CSJ, CED), pp. 663–674.
FASEFASE-1999-NottegarPD #evaluation #performance #semantics
Semantic-Driven Performance Evaluation (Extended Abstract) (CN, CP, PD), pp. 204–218.
FASEFASE-1999-Weber #communication #information management
Continuous Engineering of Information and Communication Infrastructures (Extended Abstract) (HW), pp. 22–29.
IWPCIWPC-1999-PatenaudeMDL #assessment #java #quality
Extending Software Quality Assessment Techniques to Java Systems (JFP, EM, MD, BL), pp. 49–56.
SASSAS-1999-TakimotoH #graph #using
Partial Dead Code Elimination Using Extended Value Graph (MT, KH), pp. 179–193.
STOCSTOC-1999-Ajtai #linear #nondeterminism
Determinism versus Non-Determinism for Linear Time RAMs (Extended Abstract) (MA), pp. 632–641.
STOCSTOC-1999-AlstrupBR #worst-case
Worst-Case and Amortised Optimality in Union-Find (Extended Abstract) (SA, AMBA, TR), pp. 499–506.
STOCSTOC-1999-CanettiO #what
Secure Computation with Honest-Looking Parties: What If Nobody Is Truly Honest? (Extended Abstract) (RC, RO), pp. 255–264.
STOCSTOC-1999-CharikarGTS #algorithm #approximate #problem
A Constant-Factor Approximation Algorithm for the k-Median Problem (Extended Abstract) (MC, SG, ÉT, DBS), pp. 1–10.
STOCSTOC-1999-ChenM #approximate #multi #polynomial #scheduling
A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling (Extended Abstract) (JC, AM), pp. 418–427.
STOCSTOC-1999-DinitzMR #complexity #symmetry
Bit Complexity of Breaking and Achieving Symmetry in Chains and Rings (Extended Abstract) (YD, SM, SR), pp. 265–274.
STOCSTOC-1999-GuhaMNS #performance
Efficient Recovery from Power Outage (Extended Abstract) (SG, AM, JN, BS), pp. 574–582.
STOCSTOC-1999-IshaiK #bound #information retrieval
Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract) (YI, EK), pp. 79–88.
STOCSTOC-1999-NisanR #algorithm #design
Algorithmic Mechanism Design (Extended Abstract) (NN, AR), pp. 129–140.
STOCSTOC-1999-Rojas #complexity #geometry #on the
On the Complexity of Diophantine Geometry in Low Dimensions (Extended Abstract) (JMR), pp. 527–536.
STOCSTOC-1999-SudanTV #generative #pseudo
Pseudorandom Generators Without the XOR Lemma (Extended Abstract) (MS, LT, SPV), pp. 537–546.
STOCSTOC-1999-Trevisan #generative #pseudo #using
Construction of Extractors Using Pseudo-Random Generators (Extended Abstract) (LT), pp. 141–148.
FLOPSFLOPS-1999-Hinze #programming
Polytypic Programming With Ease (Extended Abstract) (RH), pp. 21–36.
DLTDLT-1999-LopezN #induction
Substitutions from Rauzy induction (extended abstract) (LML, PN), pp. 200–209.
ICALPICALP-1999-BednarczykB #morphism #petri net
General Morphisms of Petri Nets (Extended Abstract) (MAB, AMB), pp. 190–199.
ICALPICALP-1999-BermanK #on the
On Some Tighter Inapproximability Results (Extended Abstract) (PB, MK), pp. 200–209.
CIAAWIA-1999-NoordG #compilation #finite #natural language #regular expression
An Extendible Regular Expression Compiler for Finite-State Approaches in Natural Language Processing (GvN, DG), pp. 122–139.
ICFPICFP-1999-KfouryMTW #type system
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract) (AJK, HGM, FAT, JBW), pp. 90–101.
CHICHI-1999-GuiardBM #multi #navigation #precise
Navigation as Multiscale Pointing: Extending Fitts’ Model to Very High Precision Tasks (YG, MBL, DM), pp. 450–457.
CHICHI-1999-QuintanaECWS #analysis #case study #design #named #process
Symphony: A Case Study in Extending Learner-Centered Design through Process Space Analysis (CQ, JE, AC, HKW, ES), pp. 473–480.
HCIHCI-CCAD-1999-MurataFAI #2d #effectiveness
Extending effective target width in Fitt’s law to two-dimensional pointing task (AM, MF, YA, HI), pp. 1236–1240.
HCIHCI-EI-1999-BergB #enterprise #multi #question #user interface #why
Why extending ERP software with multi-user interfaces? (RJvdB, IMBS), pp. 1083–1087.
HCIHCI-EI-1999-Hollemans #metric #user satisfaction
User Satisfaction Measurement Methodolgies: Extending the User Satisfaction Questionnaire (GH), pp. 1008–1012.
HCIHCI-EI-1999-Stelovsky #architecture #eye tracking #integration #interactive #java #source code #user interface
An Extendible Architecture for the Integration of Eye Tracking and User Interaction Events of Java Programs with Complex User Interfaces (JS), pp. 861–865.
AdaSIGAda-1999-Lowe #ada #development #embedded #multi
Extending Ada to assist multiprocessor embedded development (TL), pp. 125–132.
ICEISICEIS-1999-AlvesHM #database #development #logic #named
DB-GRAPH — A Tool for Development of Database Systems Based on the Extended Entity Relationship Logical Model (MAA, MOH, FLM), pp. 3–6.
CIKMCIKM-1999-JohnsonC #ad hoc
Extending Complex Ad-Hoc OLAP (TJ, DC), pp. 170–179.
KDDKDD-1999-MeretakisW #classification #naive bayes #using
Extending Naïve Bayes Classifiers Using Long Itemsets (DM, BW), pp. 165–174.
SIGIRSIGIR-1999-LosadaB #documentation #modelling #ranking #using
Using a Belief Revision Operator for Document Ranking in Extended Boolean Models (DEL, AB), pp. 66–73.
UMLUML-1999-EgyedM #architecture #integration #representation #uml
Extending Architectural Representation in UML with View Integration (AE, NM), pp. 2–16.
UMLUML-1999-SuzukiY #component #modelling #uml
Extending UML for Modelling Reflective Software Componentsa (JS, YY), pp. 220–235.
TOOLSTOOLS-ASIA-1999-CheungCC #modelling #object-oriented #specification
Extending Formal Specification To Object-Oriented Models Through Level-View Structured Schemas (KSC, KOC, TYC), pp. 118–125.
TOOLSTOOLS-PACIFIC-1999-MitchellM #contract
Extending a Method of Devising Software Contracts (RM, JM), p. 234–?.
TOOLSTOOLS-PACIFIC-1999-PriceSR #modelling
Extending the Unified Modeling Language to Support Spatiotemporal Applications (RP, BS, KR), p. 163–?.
POPLPOPL-1999-WaddellD #abstraction
Extending the Scope of Syntactic Abstraction (OW, RKD), pp. 203–215.
SACSAC-1999-AnconaDG #mobile
Mobile Computing in Outdoor Environments (Extended Abstract) (MA, GD, VG), pp. 413–415.
ICSEICSE-1999-Perry #evolution #semantics
Software Evolution and “light” Semantics (Extended Abstract) (DEP), pp. 587–590.
CCCC-1999-Dinechin #memory management #scheduling
Extending Modulo Scheduling with Memory Reference Merging (BDdD), pp. 274–287.
DACDAC-1998-Dill #simulation #verification #what
What’s Between Simulation and Formal Verification? (Extended Abstract) (DLD), pp. 328–329.
DACDAC-1998-LiuC
Extending Moment Computation to 2-Port Circuit Representations (FJL, CKC), pp. 473–476.
SIGMODSIGMOD-1998-Toyama #database #named #sql
SuperSQL: An Extended SQL for Database Publishing and Presentation (MT), pp. 584–586.
ESOPESOP-1998-Smolka #concurrent #constraints #functional #programming
Concurrent Constraint Programming Based on Functional Programming (Extended Abstract) (GS), pp. 1–11.
FoSSaCSFoSSaCS-1998-AmadioC #analysis #type system
Analysis of a Guard Condition in Type Theory (Extended Abstract) (RMA, SCG), pp. 48–62.
TACASTACAS-1998-AbdullaJ #network #process #verification
Verifying Networks of Timed Processes (Extended Abstract) (PAA, BJ), pp. 298–312.
TACASTACAS-1998-LiuRS #evaluation #fixpoint #performance
Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract) (XL, CRR, SAS), pp. 5–19.
STOCSTOC-1998-Ajtai #np-hard #problem #random #reduction
The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract) (MA), pp. 10–19.
STOCSTOC-1998-AjtaiFS #monad
The Closure of Monadic NP (Extended Abstract) (MA, RF, LJS), pp. 309–318.
STOCSTOC-1998-BellareCK #analysis #approach #authentication #composition #design #protocol
A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract) (MB, RC, HK), pp. 419–428.
STOCSTOC-1998-BroderCFM #independence #permutation
Min-Wise Independent Permutations (Extended Abstract) (AZB, MC, AMF, MM), pp. 327–336.
STOCSTOC-1998-CrescenziGPPY #complexity #on the
On the Complexity of Protein Folding (Extended Abstract) (PC, DG, CHP, AP, MY), pp. 597–603.
STOCSTOC-1998-DoolyGS #theory and practice
TCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract) (DRD, SAG, SDS), pp. 389–398.
STOCSTOC-1998-Feige #approximate
Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract) (UF), pp. 90–99.
STOCSTOC-1998-FeigeS #bound #scheduling
Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract) (UF, CS), pp. 624–633.
STOCSTOC-1998-PeinadoL #embedded #generative #graph #random
Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (Extended Abstract) (MP, TL), pp. 176–185.
STOCSTOC-1998-Trevisan #query #testing
Recycling Queries in PCPs and in Linearity Tests (Extended Abstract) (LT), pp. 299–308.
FLOPSFLOPS-1998-Miyoshi #logic
Rewriting Logic for Cyclic Sharing Structures (extended abstract) (HM), pp. 167–186.
ICALPICALP-1998-Ben-AmramP #source code
CONS-Free Programs with Tree Input (Extended Abstract) (AMBA, HP), pp. 271–282.
ICALPICALP-1998-BoigelotRW #automaton #integer #on the
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) (BB, SR, PW), pp. 152–163.
ICALPICALP-1998-JuknaZ #bound #branch #nondeterminism #on the #source code
On Branching Programs With Bounded Uncertainty (Extended Abstract) (SJ, SZ), pp. 259–270.
ICALPICALP-1998-LiuS #algorithm #fixpoint #linear
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) (XL, SAS), pp. 53–66.
ICALPICALP-1998-SantisCPY #image
Image Density is Complete for Non-Interactive-SZK (Extended Abstract) (ADS, GDC, GP, MY), pp. 784–795.
CIAAWIA-1998-AlbertGW #algorithm #context-free grammar #normalisation
Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.
EDOCEDOC-1998-LiningtonMR #community #enterprise #policy
Policies in communities: extending the ODP enterprise viewpoint (PFL, ZM, KR), pp. 14–24.
EDOCEDOC-1998-Winans #enterprise
Object technology in the extended enterprise (TBW), pp. 378–389.
ICPRICPR-1998-JuanVA #algorithm #approximate #nearest neighbour #performance
Fast k-nearest-neighbours searching through extended versions of the approximating and eliminating search algorithm (AESA) (AJ, EV, PA), pp. 828–830.
ICPRICPR-1998-Perez-CortesV #heuristic
The extended general spacefilling curves heuristic (JCPC, EV), pp. 515–517.
ICPRICPR-1998-TominagaKMK #detection #performance #using
Realization of an efficient line detection by askant glance camera vision system using extended Hough transform (MT, KK, KM, HK), pp. 225–228.
ICPRICPR-1998-WakaharaO #clustering
Extended mean shift in handwriting clustering (TW, KO), pp. 384–388.
KRKR-1998-BrewkaE #logic programming #set #source code
Preferred Answer Sets for Extended Logic Programs (GB, TE), pp. 86–97.
KRKR-1998-InoueS #abduction #specification #transaction
Specifying Transactions for Extended Abduction (KI, CS), pp. 394–405.
SIGIRSIGIR-1998-SmithS #algebra #named #probability #web
PWA: An Extended Probabilistic Web Algebra (DS, RS), p. 388.
UMLUML-1998-SaksenaLFE #uml
Extending Aggregation Constructs in UML (MS, MMLP, RBF, MPE), pp. 435–441.
ECOOPECOOP-1998-AtkinsonJ #java #orthogonal #persistent
Providing Orthogonal Persistence for Java (Extended Abstract) (MPA, MJJ), pp. 383–395.
ECOOPECOOP-1998-BertinoFGM
Extending the ODMG Object Model with Time (EB, EF, GG, IM), pp. 41–66.
OOPSLAOOPSLA-1998-BertinoG
Extending the ODMG Object Model with Composite Objects (EB, GG), pp. 259–270.
OOPSLAOOPSLA-1998-Leino #specification
Data Groups: Specifying the Modification of Extended State (KRML), pp. 144–153.
PPDPALP-PLILP-1998-CosmoLN #game studies #logic programming #semantics
A Game Semantics Foundation for Logic Programming (Extended Abstract) (RDC, JVL, SN), pp. 355–373.
POPLPOPL-1998-RielyH #distributed #mobile #process
A Typed Language for Distributed Mobile Processes (Extended Abstract) (JR, MH), pp. 378–390.
SACSAC-1998-DAntonaC #approach #documentation #named
ANATEMA: a neural approach to extended markup of SGML documents (OMD, MWLC), pp. 297–302.
CCCC-1998-LapkowskiH #multi #pointer
Extended SSA Numbering: Introducing SSA Properties to Language with Multi-level Pointers (CL, LJH), pp. 128–143.
CCCC-1998-LeinoN #static analysis
An Extended Static Checker for Modular-3 (KRML, GN), pp. 302–305.
HPDCHPDC-1998-Nguyen-TuongCG #using
Extending Metasystem Functionality Using Reflection (ANT, SJC, ASG), pp. 346–347.
LCTESLCTES-1998-TerrasaEG #component #flexibility #realtime
Extending RT-Linux to Support Flexible Hard Real-Time Systems with Optional Components (AT, AE, AGF), pp. 41–50.
CAVCAV-1998-AbdullaJKP #approach #partial order #reduction #verification
A General Approach to Partial Order Reductions in Symbolic Verification (Extended Abstract) (PAA, BJ, MK, DP), pp. 379–390.
LICSLICS-1998-Benthem #logic #process
Process Operations in Extended Dynamic Logics (JvB), pp. 244–250.
DACDAC-1997-Dai #verification
Chip Parasitic Extraction and Signal Integrity Verification (Extended Abstract) (WWMD), pp. 717–719.
ICDARICDAR-1997-KimSD #modelling #online #recognition
On-line recognition of cursive Hangul characters by modeling extended graphemes (KHK, TJS, JID), pp. 604–607.
PODSPODS-1997-AgrawalAS #algorithm #database
Epidemic Algorithms in Replicated Databases (Extended Abstract) (DA, AEA, RCS), pp. 161–172.
SASSAS-1997-BoigelotGWW #power of
The Power of QDDs (Extended Abstract) (BB, PG, BW, PW), pp. 172–186.
SASSAS-1997-CharlierF #abstract interpretation #on the #theory and practice
On the Desirable Link Between Theory and Practice in Abstract Interpretation (Extended Abstract) (BLC, PF), pp. 379–387.
SASSAS-1997-Granger #analysis #congruence
Static Analyses of Congruence Properties on Rational Numbers (Extended Abstract) (PG), pp. 278–292.
STOCSTOC-1997-ArgeFGV #memory management #on the #sorting #string
On Sorting Strings in External Memory (Extended Abstract) (LA, PF, RG, JSV), pp. 540–548.
STOCSTOC-1997-Beaver #encryption
Commodity-Based Cryptography (Extended Abstract) (DB), pp. 446–455.
STOCSTOC-1997-BermanC #algorithm #online #problem
On-Line Algorithms for Steiner Tree Problems (Extended Abstract) (PB, CC), pp. 344–353.
STOCSTOC-1997-ChorG #information retrieval
Computationally Private Information Retrieval (Extended Abstract) (BC, NG), pp. 304–313.
STOCSTOC-1997-EdmondsCBD #execution #multi #scheduling
Non-clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics (Extended Abstract) (JE, DDC, TB, XD), pp. 120–129.
STOCSTOC-1997-FeigeK #game studies
Making Games Short (Extended Abstract) (UF, JK), pp. 506–516.
STOCSTOC-1997-HerlihyR #decidability #distributed
The Decidability of Distributed Decision Tasks (Extended Abstract) (MH, SR), pp. 589–598.
STOCSTOC-1997-LubyV #approximate
Approximately Counting Up To Four (Extended Abstract) (ML, EV), pp. 682–687.
STOCSTOC-1997-McCuaigRST
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract) (WM, NR, PDS, RT), pp. 402–405.
STOCSTOC-1997-Mulmuley #algebra #exclamation #proving
Is There an Algebraic Proof for P != NC? (Extended Abstract) (KM), pp. 210–219.
STOCSTOC-1997-NaorR #on the #permutation #pseudo
On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract) (MN, OR), pp. 189–199.
STOCSTOC-1997-OstrovskyS
Private Information Storage (Extended Abstract) (RO, VS), pp. 294–303.
STOCSTOC-1997-PhillipsSTW #scheduling
Optimal Time-Critical Scheduling via Resource Augmentation (Extended Abstract) (CAP, CS, ET, JW), pp. 140–149.
STOCSTOC-1997-ShmoysTA #algorithm #approximate #problem
Approximation Algorithms for Facility Location Problems (Extended Abstract) (DBS, ÉT, KA), pp. 265–274.
STOCSTOC-1997-Trevisan #geometry
When Hamming Meets Euclid: The Approximability of Geometric TSP and MST (Extended Abstract) (LT), pp. 21–29.
DLTDLT-1997-CaludeCK #automaton #simulation
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.
DLTDLT-1997-Dassow
Some Remarks on Extended Reular Languages (JD), pp. 477–488.
ICALPICALP-1997-BouajjaniH #analysis #reachability #set
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract) (AB, PH), pp. 560–570.
ICALPICALP-1997-Bournez #bound #constant #power of
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract) (OB), pp. 143–153.
ICALPICALP-1997-CodenottiEGK
Checking Properties of Polynomials (Extended Abstract) (BC, FE, PG, RK), pp. 203–213.
ICALPICALP-1997-EilamFZ #layout #network #problem
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract) (TE, MF, SZ), pp. 527–537.
ICALPICALP-1997-GrossiI #algorithm #order #performance #problem
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract) (RG, GFI), pp. 605–615.
ICALPICALP-1997-RielyH #distributed #process
Distributed Processes and Location Failures (Extended Abstract) (JR, MH), pp. 471–481.
ICALPICALP-1997-RitterP #on the
On Explicit Substitution and Names (Extended Abstract) (ER, VdP), pp. 248–258.
ICALPICALP-1997-Sangiorgi
The Name Discipline of Uniform Receptiveness (Extended Abstract) (DS), pp. 303–313.
ICALPICALP-1997-SantisCP
Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract) (ADS, GDC, GP), pp. 716–726.
CIAAWIA-1997-Revuz #automaton
Operations on Extended Automata (DR), pp. 171–175.
FMFME-1997-HemerL #design #pattern matching #reuse
Reuse of Verified Design Templates Through Extended Pattern Matching (DH, PAL), pp. 495–514.
ICFPICFP-1997-CookL
Disposable Memo Functions (Extended Abstract) (BC, JL), p. 310.
CIKMCIKM-1997-Jaczynski #case study #experience #framework
A Framework for the Management of Past Experiences with Time-Extended Situations (MJ), pp. 32–39.
CIKMCIKM-1997-SinghSC #concept #documentation #generative #using
Generating Association Rules from Semi-Structured Documents Using an Extended Concept Hierarchy (LS, PS, BC), pp. 193–200.
ECOOPECOOP-1997-Liquori #first-order
An Extended Theory of Primitive Objects: FIrst Order System (LL), pp. 146–169.
TOOLSTOOLS-ASIA-1997-StobartPT #case study #object-oriented #polymorphism #source code #testing #using
Using Extended General Statecharts to Generate Test Cases for Overloaded/Polymorphic Object-Oriented Programs: A Case Study (SS, NP, BYT), pp. 96–103.
TOOLSTOOLS-PACIFIC-1997-Gil #object-oriented
Extendability vs. Substitutability in OO Languages (JYG), p. 368.
TOOLSTOOLS-USA-1997-Borron97a #concept #mixin #multi
Extending the Concept of Mixin to Multidimensional Objects (HJB), p. 215–?.
TOOLSTOOLS-USA-1997-PeriyasamyA #realtime #specification
Extending Object-Z for Specifying Real-Time Systems (KP, VSA), pp. 163–175.
RERE-1997-GotelF #case study #industrial #requirements #traceability
Extended Requirements Traceability: Results of an Industrial Case Study (OG, AF), p. 169–?.
ESECESEC-FSE-1997-Parnas #re-engineering
Software Engineering: An Unconsummated Marriage (Extended Abstract) (DLP), pp. 1–3.
PPoPPPPoPP-1997-Prasanna #compilation #parallel
Compilation of Parallel Multimedia Computations — Extending Retiming Theory and Amdahl’s Law (GNSP), pp. 180–192.
CADECADE-1997-DurandM #call-by #decidability #term rewriting
Decidable Call by Need Computations in term Rewriting (Extended Abstract) (ID, AM), pp. 4–18.
CADECADE-1997-HarlandP #constraints
Resource-Distribution via Boolean Constraint (Extended Abstract) (JH, DJP), pp. 222–236.
CAVCAV-1997-BoigelotBR #analysis #hybrid #linear #reachability
An Improved Reachability Analysis Method for Strongly Linear Hybrid Systems (Extended Abstract) (BB, LB, SR), pp. 167–178.
CAVCAV-1997-CeceF #effectiveness #source code
Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract) (GC, AF), pp. 304–315.
CSLCSL-1997-HartonasH #concurrent #functional #higher-order
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract) (CH, MH), pp. 239–254.
ICLPILPS-1997-MullerW #concurrent #constraints
Extending a Concurrent Constraint Language by Propagators (TM, JW), pp. 149–163.
LICSLICS-1997-AndersenH #diagrams
Boolean Expression Diagrams (Extended Abstract) (HRA, HH), pp. 88–98.
LICSLICS-1997-CosmoK #normalisation #proving
Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract) (RDC, DK), pp. 35–46.
LICSLICS-1997-KanovichI #concurrent #linear #logic #process #specification
Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract) (MIK, TI), pp. 48–57.
LICSLICS-1997-Rathke #fixpoint #induction #process
Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract) (JR), pp. 140–148.
ASEKBSE-1996-RobbinsHR #architecture #design
Extending Design Environments to Software Architecture Design (JER, DMH, DFR), p. 12.
HTHT-1996-BapatWAH #hypermedia #named #object-oriented
HyperStorM: An Extendable Object-Oriented Hypermedia Engine (AB, JW, KA, JMH), pp. 203–214.
ITiCSEITiCSE-1996-ArnowC #email #programming #web
Extending the conversation: integrating email and Web technology in CS programming classes (DMA, DC), pp. 93–95.
TACASTACAS-1996-TripakisC #realtime
Extending Promela and Spin for Real Time (ST, CC), pp. 329–348.
STOCSTOC-1996-AfekMO #algorithm #complexity #convergence
Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract) (YA, YM, ZO), pp. 89–98.
STOCSTOC-1996-Ajtai #generative #problem
Generating Hard Instances of Lattice Problems (Extended Abstract) (MA), pp. 99–108.
STOCSTOC-1996-AllenderBO #complexity #equation #linear #matrix #rank
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract) (EA, RB, MO), pp. 161–167.
STOCSTOC-1996-AndrewsLMZ #automation #latency #network
Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract) (MA, FTL, PTM, LZ), pp. 257–265.
STOCSTOC-1996-AwerbuchAFL #how #nondeterminism
Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract) (BA, YA, AF, FTL), pp. 519–530.
STOCSTOC-1996-BasuPR #algebra #set
Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract) (SB, RP, MFR), pp. 168–173.
STOCSTOC-1996-Beaver96a #adaptation
Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract) (DB), pp. 629–638.
STOCSTOC-1996-BlumRV #algorithm #approximate #problem
A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract) (AB, RR, SV), pp. 442–448.
STOCSTOC-1996-CheriyanT #algorithm #performance
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation (Extended Abstract) (JC, RT), pp. 37–46.
STOCSTOC-1996-Ma #fault tolerance #network #sorting
An O(n log n)-Size Fault-Tolerant Sorting Network (Extended Abstract) (YM), pp. 266–275.
STOCSTOC-1996-Naor #evaluation #generative
Evaluation May Be Easier Than Generation (Extended Abstract) (MN), pp. 74–83.
STOCSTOC-1996-NewmanS #communication #game studies
Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) (IN, MS), pp. 561–570.
STOCSTOC-1996-Ta-Shma #on the #random
On Extracting Randomness From Weak Random Sources (Extended Abstract) (ATS), pp. 276–285.
ICALPICALP-1996-Billaud #fault
Fatal Errors in Conditional Expressions (Extended Abstract) (MB), pp. 146–157.
ICALPICALP-1996-BradfordR #bound
Lower Bounds for Row Minima Searching (Extended Abstract) (PGB, KR), pp. 454–465.
ICALPICALP-1996-MitchellV #effectiveness #modelling #morphism #polymorphism #recursion #type system
Effective Models of Polymorphism, Subtyping and Recursion (Extended Abstract) (JCM, RV), pp. 170–181.
ICALPICALP-1996-ShuklaHRS #complexity #finite #on the #problem #process #relational
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract) (SKS, HBHI, DJR, RES), pp. 466–477.
IFLIFL-1996-Scholz #array #functional #on the #programming
On Programming Scientific Applications in SAC — A Functional Language Extended by a Subsystem for High-Level Array Operations (SBS), pp. 85–104.
CSCWCSCW-1996-BapatGHST #distributed #video
From Electronic Whiteboards to Distributed Meetings: Extending the Scope of DOLPHIN (Video Program) (AB, JG, DLH, NAS, DAT), p. 10.
AdaEuropeAdaEurope-1996-Holzmuller #ada
Extending the Object-Orientedness of Ada 95 (BH), pp. 357–369.
CIKMCIKM-1996-AbdelguerfiCWSMBR #database #representation
A Terrain Database Representation Based on an Extended Vector Product Format (MA, EC, CW, KS, VM, RB, BR), pp. 27–33.
CIKMCIKM-1996-LehnerRT #database #multi #named #statistics
CROSS-DB: A Feature-Extended Multidimensional Data Model for Statistical and Scientific Databases (WL, TR, MT), pp. 253–260.
KDDKDD-1996-MannilaT96a #multi #set
Multiple Uses of Frequent Sets and Condensed Representations (Extended Abstract) (HM, HT), pp. 189–194.
SEKESEKE-1996-MittermeirW #architecture #component #reuse
Greedy Reuse: Architectural Considerations for Extending the Reusability of Components (RM, LGW), pp. 434–441.
PPDPPLILP-1996-Antoy #prolog
Needed Narrowing in Prolog (Extended Abstract) (SA), pp. 473–474.
PPDPPLILP-1996-Liu #database #deduction #programming language
The LOL Deductive Database Programming Language (Extended Abstract) (ML), pp. 454–468.
SACSAC-1996-AksoyYG #fuzzy #object-oriented #similarity
Extending similarity-based fuzzy object-oriented data model (DA, AY, RG), pp. 542–546.
SACSAC-1996-Wedekind #component #workflow
Extending workflow-management-systems by a dialogical component (HW), pp. 150–157.
ICSEICSE-1996-Fischer #design
Domain-Oriented Design Environments (Extended Abstract) (GF), pp. 517–520.
ICSEICSE-1996-Hoare #how #proving #reliability
The Role of Formal Techniques: Past, Current and Future or How Did Software Get so Reliable without Proof? (Extended Abstract) (CARH), pp. 233–234.
ICSEICSE-1996-Vekens #implementation #object-oriented
An Object-Oriented Implementation of B-ISDN Signalling — Part 2: Extendability Stands the Test (AWvdV), pp. 125–132.
CADECADE-1996-GanzingerW #monad #proving #theorem proving
Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) (HG, UW), pp. 388–402.
CADECADE-1996-RitterPW
Proof-Terms for Classical and Intuitionistic Resolution (Extended Abstract) (ER, DJP, LAW), pp. 17–31.
CAVCAV-1996-BoigelotG #communication #infinity #protocol #using #verification
Symbolic Verification of Communication Protocols with Infinite State Spaces Using QDDs (Extended Abstract) (BB, PG), pp. 1–12.
CAVCAV-1996-EmersonN #automation #verification
Automatic Verification of Parameterized Synchronous Systems (Extended Abstract) (EAE, KSN), pp. 87–98.
CAVCAV-1996-PistoreS #algorithm #refinement #π-calculus
A Partition Refinement Algorithm for the π-Calculus (Extended Abstract) (MP, DS), pp. 38–49.
CAVCAV-1996-ShuklaHR #game studies #model checking #verification
HORNSAT, Model Checking, Verification and games (Extended Abstract) (SKS, HBHI, DJR), pp. 99–110.
CSLCSL-1996-Geuvers #dependent type #higher-order #logic #modelling #type system
Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.
ICLPJICSLP-1996-PettorossiPR #algorithm #deduction #how #specification #string
How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification (Poster Abstract) (AP, MP, SR), p. 539.
LICSLICS-1996-FioreMS #π-calculus
A Fully-Abstract Model for the π-Calculus (Extended Abstract) (MPF, EM, DS), pp. 43–54.
LICSLICS-1996-Nieuwenhuis #decidability
Basic Paramodulation and Decidable Theories (Extended Abstract) (RN), pp. 473–482.
LICSLICS-1996-Ong #category theory #proving #semantics
A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract) (CHLO), pp. 230–241.
LICSLICS-1996-Selinger #finite #modelling
Order-Incompleteness and Finite λ Models (Extended Abstract) (PS), pp. 432–439.
RTARTA-1996-Kesner #confluence #λ-calculus
Confluence Properties of Extensional and Non-Extensional λ-Calculi with Explicit Substitutions (Extended Abstract) (DK), pp. 184–199.
ICDARICDAR-v1-1995-HoriuchiTYY #optimisation #probability #process
Relaxation optimizing processes in extended probabilistic space (TH, KT, KY, HY), pp. 266–269.
ICDARICDAR-v1-1995-SabourinG #approach #classification #evaluation #multi #verification
An extended-shadow-code based approach for off-line signature verification. II. Evaluation of several multi-classifier combination strategies (RS, GG), pp. 197–201.
VLDBVLDB-1995-BargaP #composition #implementation #modelling #transaction
A Practical and Modular Implementation of Extended Transaction Models (RSB, CP), pp. 206–217.
SASSAS-1995-WolperB #approach #constraints
An Automata-Theoretic Approach to Presburger Arithmetic Constraints (Extended Abstract) (PW, BB), pp. 21–32.
STOCSTOC-1995-AfekDT #performance
Wait-free made fast (Extended Abstract) (YA, DD, DT), pp. 538–547.
STOCSTOC-1995-BshoutyT #fourier #on the
On the Fourier spectrum of monotone functions (Extended Abstract) (NHB, CT), pp. 219–228.
STOCSTOC-1995-DolevKKP #adaptation #named #network #performance
Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract) (SD, EK, DK, DP), pp. 528–537.
STOCSTOC-1995-FerraginaG #data type #string
A fully-dynamic data structure for external substring search (Extended Abstract) (PF, RG), pp. 693–702.
STOCSTOC-1995-FranklinY #privacy
Secure hypergraphs: privacy from partial broadcast (Extended Abstract) (MKF, MY), pp. 36–44.
STOCSTOC-1995-GalilY #theorem
Short length versions of Menger’s theorem (Extended Abstract) (ZG, XY), pp. 499–508.
STOCSTOC-1995-GoldmannH
Monotone circuits for connectivity have depth (log n)2-o(1) (Extended Abstract) (MG, JH), pp. 569–574.
STOCSTOC-1995-HartI #performance
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract) (WEH, SI), pp. 157–168.
STOCSTOC-1995-KavrakiLMR #query #random
Randomized query processing in robot path planning (Extended Abstract) (LEK, JCL, RM, PR), pp. 353–362.
STOCSTOC-1995-MansourP
Many-to-one packet routing on grids (Extended Abstract) (YM, BPS), pp. 258–267.
STOCSTOC-1995-Pulleyblank #problem
Two Steiner tree packing problems (Extended Abstract) (WRP), pp. 383–387.
ICALPICALP-1995-Ambos-Spies #approximate #on the #polynomial
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract) (KAS), pp. 384–392.
ICALPICALP-1995-Ben-AmramG #algebra #bound #random
Lower Bounds on Algebraic Random Access Machines (Extended Abstract) (AMBA, ZG), pp. 360–371.
ICALPICALP-1995-DiekertG #concurrent #termination
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz Traces (Extended Abstract) (VD, PG), pp. 15–26.
ICALPICALP-1995-GrecoSZ #automaton #logic programming #source code
The PushDown Method to Optimize Chain Logic Programs (Extended Abstract) (SG, DS, CZ), pp. 523–534.
FPCAFPCA-1995-MeijerH #exponential
Bananas in Space: Extending Fold and Unfold to Exponential Types (EM, GH), pp. 324–333.
AdaEuropeAdaEurope-1995-BirusKKRT #ada #realtime
Extending the Ada 95 Initial Conditions for Preelaboration for Use in Real-Time Systems (TB, PK, EK, JR, JLT), pp. 164–169.
CIKMCIKM-1995-AlagarSS #nondeterminism #relational #semantics
Semantics of an Extended Relational Model for Managing Uncertain Information (VSA, FS, JNS), pp. 234–240.
CIKMCIKM-1995-HameurlainM #execution #parallel #query #scheduling #sql
Scheduling and Mapping for Parallel Execution of Extended SQL Queries (AH, FM), pp. 197–204.
CIKMCIKM-1995-Tammet #using
Using Resolution for Extending KL-ONE-type Languages (TT), pp. 326–332.
OOPSLAOOPSLA-1995-AllenC #scheduling #statechart
Extending the Statechart Formalism: Event Scheduling & Disposition (AA, DdC), pp. 1–16.
OOPSLAOOPSLA-1995-KiernanC #design #experience #implementation
Extending SQL-92 for OODB Access: Design and Implementation Experience (JK, MJC), pp. 467–480.
PPDPPLILP-1995-ChinK #deforestation
Better Consumers for Deforestation (Extended Abstract) (WNC, SCK), pp. 223–240.
POPLPOPL-1995-AltucherL #alias #analysis
An Extended Form of Must Alias Analysis for Dynamic Allocation (RA, WL), pp. 74–84.
PPoPPPPoPP-1995-BaderJ #algorithm #case study #component #image #parallel
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract) (DAB, JJ), pp. 123–133.
CAVCAV-1995-Bryant #multi #verification
Multipliers and Dividers: Insights on Arithmetic Circuits Verification (Extended Abstract) (REB), pp. 1–3.
CAVCAV-1995-SokolskyS #model checking #realtime
Local Model Checking for Real-Time Systems (Extended Abstract) (OS, SAS), pp. 211–224.
ICLPILPS-1995-Liu #datalog #named #set #tuple
Relationlog: A Typed Extension to Datalog with Sets and Tuples (Extended Abstract) (ML), pp. 83–97.
LICSLICS-1995-Andersen #model checking
Partial Model Checking (Extended Abstract) (HRA), pp. 398–407.
LICSLICS-1995-ComonNR #constraints #order #theorem proving
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) (HC, RN, AR), pp. 375–385.
LICSLICS-1995-DowekHK #higher-order #unification
Higher-Order Unification via Explicit Substitutions (Extended Abstract) (GD, TH, CK), pp. 366–374.
LICSLICS-1995-LongoMS #logic #type system
A Logic of Subtyping (Extended Abstract) (GL, KM, SS), pp. 292–299.
LICSLICS-1995-NadathurL #logic programming #proving
Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) (GN, DWL), pp. 148–155.
LICSLICS-1995-Piperno #normalisation
Normalization and Extensionality (Extended Abstract) (AP), pp. 300–310.
DACDAC-1994-CabodiCQ #traversal
Auxiliary Variables for Extending Symbolic Traversal Techniques to Data Paths (GC, PC, SQ), pp. 289–293.
DATEEDAC-1994-LangevinC #representation
An Extended OBDD Representation for Extended FSMs (ML, EC), pp. 208–213.
HTHT-ECHT-1994-HillH #distributed
Extending the Microcosm Model to a Distributed Environment (GH, WH), pp. 32–40.
SIGMODSIGMOD-1994-BilirisDGJR #named #transaction
ASSET: A System for Supporting Extended Transactions (AB, SD, NHG, HVJ, KR), pp. 44–54.
ESOPESOP-1994-Boerio #higher-order #polymorphism #λ-calculus
Extending Pruning Techniques to Polymorphic Second order λ-Calculus (LB), pp. 120–134.
SASSAS-1994-LisperC #analysis
Extended Analysis of Data Fields (BL, JFC), pp. 208–222.
STOCSTOC-1994-AzarBKU
Balanced allocations (extended abstract) (YA, AZB, ARK, EU), pp. 593–602.
STOCSTOC-1994-BenalohT
Receipt-free secret-ballot elections (extended abstract) (JCB, DT), pp. 544–553.
STOCSTOC-1994-ChariRS #algorithm #approximate #probability
Improved algorithms via approximations of probability distributions (extended abstract) (SC, PR, AS), pp. 584–592.
STOCSTOC-1994-FeigeKN
A minimal model for secure computation (extended abstract) (UF, JK, MN), pp. 554–563.
STOCSTOC-1994-GoldreichOP #complexity
Computational complexity and knowledge complexity (extended abstract) (OG, RO, EP), pp. 534–543.
STOCSTOC-1994-JacquetS #algorithm #analysis #equation #functional
A functional equation often arising in the analysis of algorithms (extended abstract) (PJ, WS), pp. 780–789.
STOCSTOC-1994-PapadimitriouY #bound #complexity #on the
On complexity as bounded rationality (extended abstract) (CHP, MY), pp. 726–733.
STOCSTOC-1994-Patt-ShamirR #formal method
A theory of clock synchronization (extended abstract) (BPS, SR), pp. 810–819.
STOCSTOC-1994-VavasisY
An accelerated interior point method whose running time depends only on A (extended abstract) (SAV, YY), pp. 512–521.
FMFME-1994-Elvang-GoranssonF #refinement
An Extended VDM Refinement Relation (MEG, REF), pp. 175–189.
AdaEuropeAdaEurope-1994-Ogren #ada
Extended Application of Ada to Cover ECBS with O4S (), pp. 215–230.
AdaEuropeAdaEurope-1994-PitetteCGS #ada #named #realtime
Ex2: Intergrating Ada and Extra Support in a Doubly Portable Extended Executive Designed for Hard Real Time Systems (GMP, JYC, DG, JMS), pp. 406–420.
AdaTRI-Ada-1994-Ogren #ada
Extended Application of Ada to Cover ECBS with O4S: ECBS = Engineering of Computer Based Systems; O4S = Objects for Systems (), pp. 322–330.
CIKMCIKM-1994-KeenD #named
XEL: Extended Ephemeral Logging for Log Storage Management (JSK, WJD), pp. 312–321.
CIKMCIKM-1994-KwonKC #adaptation #query #using
Query Expansion Using Domain Adapted, Weighted Thesaurus in an Extended Boolean Model (OWK, MCK, KSC), pp. 140–146.
KRKR-1994-DamasioNP #knowledge base #logic programming #named
REVISE: An Extended Logic Programming System for Revising Knowledge Bases (CVD, WN, LMP), pp. 607–618.
SEKESEKE-1994-KrogstieS
Extending a temporal rule language with deontic operators (JK, GS), pp. 314–321.
SEKESEKE-1994-MiyakawaY #logic
Temporal logic extended with object creation and destruction (SM, NY), pp. 156–163.
SIGIRSIGIR-1994-Lee #information retrieval #modelling
Properties of Extended Boolean Models in Information Retrieval (JHL), pp. 182–190.
LOPSTRLOPSTR-1994-BensaouG #source code
An Extended Transformation System for CLP Programs (NB, IG), pp. 17–35.
LOPSTRLOPSTR-1994-Renault #execution #source code
Generalizing Extended Execution for Normal Programs (SR), pp. 154–169.
SACSAC-1994-StamatopoulosMH #development #parallel
Extending a parallel CLP language to support the development of multi-agent systems (PS, DM, CH), pp. 410–414.
ICSEICSE-1994-Gaudel #specification
Formal Specification Techniques (Extended Abstract) (MCG), pp. 223–227.
CADECADE-1994-BeckertP #agile #named #proving #theorem proving
leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract) (BB, JP), pp. 793–797.
CADECADE-1994-Graf
Extended Path-Indexing (PG), pp. 514–528.
CAVCAV-1994-BernholtzVW #approach #model checking
An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) (OB, MYV, PW), pp. 142–155.
LICSLICS-1994-Burstall #proving #refinement
Terms, Proofs, and Refinement (Extended abstract) (RMB), pp. 2–7.
LICSLICS-1994-Hemaspaandra #complexity #logic
Complexity Transfer for Modal Logic (Extended Abstract) (EH), pp. 164–173.
DACDAC-1993-ChengK #automation #finite #functional #generative #state machine #testing #using
Automatic Functional Test Generation Using the Extended Finite State Machine Model (KTC, ASK), pp. 86–91.
ASEKBSE-1993-BailesCGP #execution #named #specification
GRIT — An Extended Refine for More Executable Specifications (PB, MC, MG, IP), p. 19.
ICDARICDAR-1993-SabourinCG #approach #verification
An extended-shadow-code based approach for off-line signature verification (RS, MC, GG), pp. 1–5.
PODSPODS-1993-Raz #order #transaction
Extended Commitment Ordering or Guaranteeing Global Serializability by Applying Commitment Order Selectivity to Global Transactions (YR), pp. 83–96.
SIGMODSIGMOD-1993-Egenhofer #database #navigation #requirements #what
What’s Special about Spatial? Database Requirements for Vehicle Navigation in Geographic Space (Extended Abstract) (MJE), pp. 398–402.
SIGMODSIGMOD-1993-Watters #calculus #relational
Interpreting a Reconstructed Relational Calculus (Extended Abstract) (AW), pp. 367–376.
DLTDLT-1993-AntimirovM #regular expression
Rewriting Extended Regular Expressions (VMA, PDM), pp. 195–209.
ICALPICALP-1993-FranklinY #performance
Secure and Efficient Off-Line Digital Money (Extended Abstract) (MKF, MY), pp. 265–276.
ICALPICALP-1993-Gupta #automaton #finite #product line
Finite Automata as Characterizations of Minor Closed Tree Families (Extended Abstract) (AG), pp. 359–370.
ICALPICALP-1993-Hemachandra #complexity #fault tolerance
Fault-Tolerance and Complexity (Extended Abstract) (LAH), pp. 189–202.
ICALPICALP-1993-InverardiPY #bisimulation #parametricity
Extended Transition Systems for Parametric Bisimulation (PI, CP, DY), pp. 558–569.
ICALPICALP-1993-JuedesLL
Computational Depth and Reducibility (Extended Abstract) (DWJ, JIL, JHL), pp. 277–288.
ICALPICALP-1993-MaratheHR #approximate #complexity #problem #specification
The Complexity of Approximating PSPACE-Complete Problems for Hierarchical Specifications (Extended Abstract) (MVM, HBHI, SSR), pp. 76–87.
SIGIRSIGIR-1993-LeeKKL #evaluation #framework #on the #retrieval
On the Evaluation of Boolean Operators in the Extended Boolean Retrieval Framework (JHL, WYK, MHK, YJL), pp. 291–297.
TOOLSTOOLS-PACIFIC-1993-Parekh #architecture #object-oriented
Object-Oriented Languages in the i960® Extended Architecture (PP), pp. 83–95.
TOOLSTOOLS-USA-1993-CaseauSK #object-oriented #optimisation #problem #programming
Extending Object-Oriented Programming to Address Hard Optimization Problems (YC, GS, PK), pp. 351–361.
TOOLSTOOLS-USA-1993-SinghG #concept #object-oriented #scalability
Extending Object-Oriented Concepts to Support Large Scale Business Systems (MSS, NNG), pp. 501–507.
POPLPOPL-1993-Aponte #parametricity #type system
Extending Record Typing to Type Parametric Modules with Sharing (MVA), pp. 465–478.
SACSAC-1993-TangW #modelling #object-oriented
Object-Oriented Modeling of the Extended Application Layer Structure (AT, WW), pp. 430–436.
CAVCAV-1993-GodefroidP #dependence #partial order #verification
Refining Dependencies Improves Partial-Order Verification Methods (Extended Abstract) (PG, DP), pp. 438–449.
CAVCAV-1993-HennessyL #logic #message passing #process
A Modal Logic for Message passing Processes (Extended Abstract) (MH, XL), pp. 359–370.
CAVCAV-1993-Krishnakumar #composition #finite #reachability #state machine
Reachability and Recurrence in Extended Finite State Machines: Modular Vector Addition Systems (ASK), pp. 110–122.
ICLPICLP-1993-Turner #logic programming #source code #theorem
A Monotonicity Theorem for Extended Logic Programs (HT), pp. 567–585.
ICLPILPS-1993-Paterson-JonesW
Extending the WAM for HiLog (RPJ, PTW), p. 654.
ICLPILPS-1993-SudarshanSRB #semantics
Extending the Well-Founded and Valid Semantics for Aggregation (SS, DS, RR, CB), pp. 590–608.
ICLPILPS-1993-Teusink #logic programming #proving #source code
A Proof Procedure for Extended Logic Programs (FT), pp. 235–249.
ICLPILPS-1993-YouY #logic programming #source code
Contradiction Resolving for Extended Logic Programs and Default Theories (JHY, LYY), p. 640.
DACDAC-1992-KrishnamoorthyN #using
Data Path Allocation using an Extended Binding Model (GK, JAN), pp. 279–284.
SIGMODSIGMOD-1992-Carter
Extending Ingres with Methods and Triggers (FC), p. 381.
SIGMODSIGMOD-1992-Rahm #architecture #evaluation #performance #transaction
Performance Evaluation of Extended Storage Architectures for Transaction Processing (ER), pp. 308–317.
VLDBVLDB-1992-Lee #database #nondeterminism #relational
An Extended Relational Database Model for Uncertain and Imprecise Information (SKL), pp. 211–220.
STOCSTOC-1992-AttiyaF #correctness #multi
A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) (HA, RF), pp. 679–690.
STOCSTOC-1992-AwerbuchKP #distributed #scheduling
Competitive Distributed Job Scheduling (Extended Abstract) (BA, SK, DP), pp. 571–580.
STOCSTOC-1992-AwerbuchPPS #adaptation #network
Adapting to Asynchronous Dynamic Networks (Extended Abstract) (BA, BPS, DP, MES), pp. 557–570.
STOCSTOC-1992-BarringtonBR #representation
Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) (DAMB, RB, SR), pp. 455–461.
STOCSTOC-1992-BartalFR #algorithm #data transformation #distributed
Competitive Algorithms for Distributed Data Management (Extended Abstract) (YB, AF, YR), pp. 39–50.
STOCSTOC-1992-BellantoniC #recursion
A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract) (SB, SAC), pp. 283–293.
STOCSTOC-1992-DahlhausJPSY #complexity #multi
The Complexity of Multiway Cuts (Extended Abstract) (ED, DSJ, CHP, PDS, MY), pp. 241–251.
STOCSTOC-1992-FeigeL #matrix #on the #random
On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) (UF, CL), pp. 643–654.
STOCSTOC-1992-FeigeL92a #problem #proving
Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) (UF, LL), pp. 733–744.
STOCSTOC-1992-FranklinY #communication #complexity
Communication Complexity of Secure Computation (Extended Abstract) (MKF, MY), pp. 699–710.
STOCSTOC-1992-GalilIS #testing
Fully Dynamic Planarity Testing (Extended Abstract) (ZG, GFI, NS), pp. 495–506.
STOCSTOC-1992-GathenS
Computing Frobenius Maps and Factoring Polynomials (Extended Abstract) (JvzG, VS), pp. 97–105.
STOCSTOC-1992-Kalai #algorithm #random
A Subexponential Randomized Simplex Algorithm (Extended Abstract) (GK), pp. 475–482.
STOCSTOC-1992-Kilian #performance #proving
A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) (JK), pp. 723–732.
STOCSTOC-1992-LeeY #online
Online Minimization of Transition Systems (Extended Abstract) (DL, MY), pp. 264–274.
STOCSTOC-1992-Lindell #algorithm
A Logspace Algorithm for Tree Canonization (Extended Abstract) (SL), pp. 400–404.
STOCSTOC-1992-LinV #approximate #constraints
epsilon-Approximations with Minimum Packing Constraint Violation (Extended Abstract) (JHL, JSV), pp. 771–782.
STOCSTOC-1992-MaggsS #algorithm #bound #network
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues (Extended Abstract) (BMM, RKS), pp. 150–161.
STOCSTOC-1992-MayerOOY #self #symmetry
Self-Stabilizing Symmetry Breaking in Constant-Space (Extended Abstract) (AJM, YO, RO, MY), pp. 667–678.
STOCSTOC-1992-Rao #algorithm #graph #performance
Faster Algorithms for Finding Small Edge Cuts in Planar Graphs (Extended Abstract) (SR), pp. 229–240.
STOCSTOC-1992-Safra #automaton #exponential
Exponential Determinization for ω-Automata with Strong-Fairness Acceptance Condition (Extended Abstract) (SS), pp. 275–282.
STOCSTOC-1992-VenkatesanR #matrix #problem
Average Case Intractability of Matrix and Diophantine Problems (Extended Abstract) (RV, SR), pp. 632–642.
ICALPICALP-1992-ApostolicoBG #algorithm #parallel
Optimal Parallel Algorithms for Periods, Palindromes and Squares (Extended Abstract) (AA, DB, ZG), pp. 296–307.
ICALPICALP-1992-Bundgen #algorithm #term rewriting
Buchberger’s Algorithm: The Term Rewriter’s Point of View (Extended Abstract) (RB), pp. 380–391.
ICALPICALP-1992-DietzfelbingerGMP #polynomial #reliability
Polynomial Hash Functions Are Reliable (Extended Abstract) (MD, JYG, YM, NP), pp. 235–246.
ICALPICALP-1992-HoogersKT #petri net #semantics
A Trace Semantics for Petri Nets (Extended Abstract) (PWH, HCMK, PST), pp. 595–604.
ICALPICALP-1992-Ong #lazy evaluation #modelling #λ-calculus
Lazy λ Calculus: Theories, Models and Local Structure Characterization (Extended Abstract) (CHLO), pp. 487–498.
ICALPICALP-1992-PeladeauP #on the
On Reverse and General Definite Tree Languages (Extended Abstract) (PP, AP), pp. 150–161.
ICALPICALP-1992-Poutre #component #graph #maintenance
Maintenance of Triconnected Components of Graphs (Extended Abstract) (JALP), pp. 354–365.
ICALPICALP-1992-Rabinovich #concurrent #finite
Checking Equivalences Between Concurrent Systems of Finite Agents (Extended Abstract) (AMR), pp. 696–707.
ICALPICALP-1992-Shallit #linear #set
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract) (JS), pp. 89–100.
ICALPICALP-1992-VaziraniY
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) (VVV, MY), pp. 366–377.
LISPLFP-1992-TannenS #abstraction #on the
On Extending Computational Adequacy by Data Abstraction (VT, RS), pp. 161–169.
CHICHI-1992-MacKenzieB #2d
Extending Fitts’ Law to Two-Dimensional Tasks (ISM, WB), pp. 219–226.
AdaEuropeAdaEurope-1992-ElradLV #adaptation #development
Extending Working Evnrironments for the Development of Reactive/Adaptive Systems with Intelligent Controls (TE, SL, UV), pp. 242–256.
PPDPALP-1992-MiddeldorpH
Counterexamples to Completeness Results for Basic Narrowing (Extended Abstract) (AM, EH), pp. 244–258.
LOPSTRLOPSTR-1992-Neugebauer #approach
The LOPS Approach: A Transformational Point of View (Extended Abstract) (GN), pp. 80–81.
CCCC-1992-Andersen #automation #c #compilation #generative #partial evaluation
Partial Evaluation of C and Automatic Compiler Generation (Extended Abstract) (LOA), pp. 251–257.
ISMMIWMM-1992-Yuasa #architecture #garbage collection #lisp #memory management #parallel
Memory Management and Garbage Collection of an Extended Common Lisp System for Massively Parallel SIMD Architecture (TY), pp. 490–506.
CADECADE-1992-DoughertyJ #approach #combinator #higher-order #logic
A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract) (DJD, PJ), pp. 79–93.
CAVCAV-1992-HiguchiSSFK #communication #finite #invariant #state machine #verification
A Verification Procedure via Invariant for Extended Communicating Finite-State Machines (MH, OS, HS, MF, TK), pp. 384–395.
ICLPJICSLP-1992-GelfondL #logic programming #representation
Representing Actions in Extended Logic Programming (MG, VL), pp. 559–573.
LICSLICS-1992-AikenW #constraints #set
Solving Systems of Set Constraints (Extended Abstract) (AA, ELW), pp. 329–340.
LICSLICS-1992-ComonHJ #decidability #equation #problem
Decidable Problems in Shallow Equational Theories (Extended Abstract) (HC, MH, JPJ), pp. 255–265.
LICSLICS-1992-Sangiorgi #concurrent #lazy evaluation #λ-calculus
The Lazy λ Calculus in a Concurrency Scenario (Extended Abstract) (DS), pp. 102–109.
LICSLICS-1992-Stark #calculus #data flow #network
A Calculus of Dataflow Networks (Extended Abstract) (EWS), pp. 125–136.
SIGMODSIGMOD-1991-HansenU #dependence
An Extended Memoryless Inference Control Method: Accounting for Dependence in Table-level Controls (SCH, EAU), pp. 348–356.
SIGMODSIGMOD-1991-LohmanLLACMMPW #exclamation
Starburst II: The Extender Strikes Back! (GML, GL, TJL, RA, RC, JM, CM, HP, JW), p. 447.
SIGMODSIGMOD-1991-RichardsonS #aspect-oriented #independence #multi #named
Aspects: Extending Objects to Support Multiple, Independent Roles (JER, PMS), pp. 298–307.
VLDBVLDB-1991-ChrysanthisR #transaction
A Formalism for Extended Transaction Model (PKC, KR), pp. 103–112.
VLDBVLDB-1991-Elmasri #modelling #using
Conecptual Modeling Using and Extended E-R Model (Abstract) (RE), p. 67.
PEPMPEPM-1991-Klimov #functional
Dynamic Specialization in Extended Functional Language with Monotone Objects (AVK), pp. 199–210.
PEPMPEPM-1991-Muller #equation #logic #named #semantics
M-LISP: Its Natural Semantics and Equational Logic (Extended Abstract) (RM), pp. 234–242.
PLDIPLDI-1991-Pugh
Advice to Authors of Extended Abstracts (WP), pp. 353–356.
STOCSTOC-1991-AngluinK #query
When Won’t Membership Queries Help? (Extended Abstract) (DA, MK), pp. 444–454.
STOCSTOC-1991-AslamD #bound #fault
Searching in the Presence of Linearly Bounded Errors (Extended Abstract) (JAA, AD), pp. 486–493.
STOCSTOC-1991-BarnesR #algorithm #polynomial #sublinear #using
Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) (GB, WLR), pp. 43–53.
STOCSTOC-1991-BeigelRS
PP Is Closed Under Intersection (Extended Abstract) (RB, NR, DAS), pp. 1–9.
STOCSTOC-1991-BroderFS
Finding Hidden Hamiltonian Cycles (Extended Abstract) (AZB, AMF, ES), pp. 182–189.
STOCSTOC-1991-BuchmannS #finite
Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis (JAB, VS), pp. 72–79.
STOCSTOC-1991-CheriyanT #algorithm #parallel
Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract) (JC, RT), pp. 391–401.
STOCSTOC-1991-CohenM #algorithm #difference #linear
Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) (EC, NM), pp. 145–155.
STOCSTOC-1991-DolevDN #encryption
Non-Malleable Cryptography (Extended Abstract) (DD, CD, MN), pp. 542–552.
STOCSTOC-1991-GalilI #algorithm #problem
Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) (ZG, GFI), pp. 317–327.
STOCSTOC-1991-Hagerup #integer #parallel #sorting
Constant-Time Parallel Integer Sorting (Extended Abstract) (TH), pp. 299–306.
STOCSTOC-1991-Kaltofen #effectiveness
Effective Noether Irreducibility Forms and Applications (Extended Abstract) (EK), pp. 54–63.
STOCSTOC-1991-KedemPRS #parallel #performance
Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract) (ZMK, KVP, AR, PGS), pp. 381–390.
STOCSTOC-1991-Ko #equation #polynomial
Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract) (KIK), pp. 10–20.
STOCSTOC-1991-KushilevitzM #fourier #learning #using
Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) (EK, YM), pp. 455–464.
STOCSTOC-1991-MatiasV #parallel #probability
Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) (YM, UV), pp. 307–316.
STOCSTOC-1991-Nisan #bound #commutative
Lower Bounds for Non-Commutative Computation (Extended Abstract) (NN), pp. 410–418.
STOCSTOC-1991-Shapiro #category theory #concurrent
Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract) (EYS), pp. 198–208.
STOCSTOC-1991-YannakakisL #finite #state machine #testing
Testing Finite State Machines (Extended Abstract) (MY, DL), pp. 476–485.
SASWSA-1991-CousotC #abstract interpretation #functional #higher-order #relational #source code
Relational Abstract Interpretation of Higher Order Functional Programs (extended abstract) (PC, RC), pp. 33–36.
ICALPICALP-1991-AlurCD #model checking #probability #realtime
Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) (RA, CC, DLD), pp. 115–126.
ICALPICALP-1991-CulikD #generative #image #order
Balancing Order and Chaos in Image Generation (Extended Abstract) (KCI, SD), pp. 600–614.
ICALPICALP-1991-HemachandraH
Collapsing Degrees via Strong Computation (Extended Abstract) (LAH, AH), pp. 393–404.
ICALPICALP-1991-Loebl #graph #performance #polynomial
Efficient Maximal Cubic Graph Cuts (Extended Abstract) (ML), pp. 351–362.
FPCAFPCA-1991-BarthNA #functional #named #parallel #strict
M-Structures: Extending a Parallel, Non-strict, Functional Language with State (PSB, RSN, A), pp. 538–568.
AdaEuropeAdaEurope-1991-ChengU #ada #petri net #using
Analyzing Ada Tasking Deadlocks and Livelocks Using Extended Petri Nets (JC, KU), pp. 125–146.
TOOLSTOOLS-USA-1991-KochutMPW #database #functional #named
h-KDL: A Historically Extended Functional O-O Database System (KK, JAM, WDP, AW), pp. 73–86.
TOOLSTOOLS-USA-1991-Nerson91a #analysis #design #eiffel #towards
Associated Paper: Extending Eiffel Toward O-O Analysis and Design (JMN), pp. 377–392.
LOPSTRLOPSTR-1991-Ameur #evaluation #functional #program transformation
Program Transformations Directed by the Evaluation of non Functional Properties (Extended Abstract) (YAA), pp. 297–299.
LOPSTRLOPSTR-1991-JantkeG #induction #synthesis
Inductive Synthesis of Rewrite Rules as Program Synthesis (Extended Abstract) (KPJ, UG), pp. 65–68.
LOPSTRLOPSTR-1991-JiaoG #database #object-oriented #optimisation #prolog #query #using
Query Optimization in an Object-Oriented Database using Prolog (Extende Abstract) (ZJ, PMDG), pp. 332–334.
LOPSTRLOPSTR-1991-Popelinsky #prolog #source code #synthesis #towards
Towards Synthesis of Nearly Pure Prolog Programs (Extende Abstract) (LP), pp. 94–96.
LOPSTRLOPSTR-1991-ProiettiP #automation #logic programming #source code
An Automatic Transfomation Strategy for Avoiding Unnecessary Variables in Logic Programs (Extended Abstract) (MP, AP), pp. 126–128.
LOPSTRLOPSTR-1991-Schaeck #algorithm #constraints #framework #logic programming
Global Search Algorithms and the Constraint Logic Programming Framework (Extended Abstract) (SS), pp. 252–253.
PPDPPLILP-1991-Loyola #animation #debugging #execution #logic programming
Extending Execution Trees for Debugging and Animation in Logic Programming (DL), pp. 419–420.
ICSEICSE-1991-Lee #design
Extending the Potts and Bruns Model for Recording Design Rationale (JL), pp. 114–125.
ICLPICLP-1991-CodognetS #backtracking
Extending the WAM for Intelligent Backtracking (PC, TS), pp. 127–141.
ICLPICLP-1991-HuY #logic programming #semantics #source code
Extended Well-Founded Model Semantics for General Logic Programs (YH, LYY), pp. 412–425.
ICLPICLP-1991-Inoue #logic programming #source code
Extended Logic Programs with Default Assumptions (KI), pp. 490–504.
ICLPICLP-1991-Turi #logic programming #source code
Extending S-Models to Logic Programs with Negation (DT), pp. 397–411.
ICLPISLP-1991-BeierleMS #automaton #order #polymorphism
Extending the Warren Abstract Machine to Polymorphic Order-Sorted Resolution (CB, GM, HS), pp. 272–286.
RTARTA-1991-Dougherty #algebra #λ-calculus
Adding Algebraic Rewriting to the Untyped λ Calculus (Extended Abstract) (DJD), pp. 37–48.
RTARTA-1991-KennawayKSV #orthogonal #reduction #term rewriting
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract) (RK, JWK, MRS, FJdV), pp. 1–12.
DACDAC-1990-Chakravarty #identification #on the
On Synthesizing and Identifying Stuck-Open Testable CMOS Combinational Circuits (extended abstract) (SC), pp. 736–739.
SIGMODSIGMOD-1990-LaenensSV #logic programming
Extending Logic Programming (EL, DS, DV), pp. 184–193.
SIGMODSIGMOD-1990-Sheng #database #deduction #named #power of
IDLOG: Extending the Expressive Power of Deductive Database Languages (YHS), pp. 54–63.
VLDBVLDB-1990-SudkampL #database
Elimination of View and Redundant Variables in a SQL-like Database Language for Extended NF2 Structures (NS, VL), pp. 302–313.
PLDIPLDI-1990-ChambersU #analysis #dynamic typing #object-oriented #optimisation #source code
Iterative Type Analysis and Extended Message Splitting: Optimizing Dynamically-Typed Object-Oriented Programs (CC, DU), pp. 150–164.
STOCSTOC-1990-AggarwalHL #diagrams #problem
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract) (AA, MH, FTL), pp. 331–340.
STOCSTOC-1990-AroraLM #algorithm #network #online
On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract) (SA, FTL, BMM), pp. 149–158.
STOCSTOC-1990-BeaverMR #complexity #protocol
The Round Complexity of Secure Protocols (Extended Abstract) (DB, SM, PR), pp. 503–513.
STOCSTOC-1990-Ben-DavidBKTW #algorithm #on the #online #power of
On the Power of Randomization in Online Algorithms (Extended Abstract) (SBD, AB, RMK, GT, AW), pp. 379–386.
STOCSTOC-1990-Blum #infinity #learning
Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract) (AB), pp. 64–72.
STOCSTOC-1990-Cole #on the
On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract) (RC0), pp. 8–17.
STOCSTOC-1990-EvenR #distributed #network
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract) (SE, SR), pp. 95–105.
STOCSTOC-1990-FischerMRT #problem
The Wakeup Problem (Extended Abstract) (MJF, SM, SR, GT), pp. 106–116.
STOCSTOC-1990-KedemPS #parallel #performance #robust
Efficient Robust Parallel Computations (Extended Abstract) (ZMK, KVP, PGS), pp. 138–148.
STOCSTOC-1990-PanconesiR #approximate #quantifier
Quantifiers and Approximation (Extended Abstract) (AP, DR), pp. 446–456.
STOCSTOC-1990-PapadimitriouSY #complexity #on the
On the Complexity of Local Search (Extended Abstract) (CHP, AAS, MY), pp. 438–445.
STOCSTOC-1990-SchmidtS #analysis
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) (JPS, AS), pp. 224–234.
STOCSTOC-1990-VitterS #parallel
Optimal Disk I/O with Parallel Block Transfer (Extended Abstract) (JSV, EAMS), pp. 159–169.
STOCSTOC-1990-Yao
Coherent Functions and Program Checkers (Extended Abstract) (ACCY), pp. 84–94.
ICALPICALP-1990-CourcoubetisY #markov #process
Markov Decision Processes and Regular Events (Extended Abstract) (CC, MY), pp. 336–349.
ICALPICALP-1990-Hoffmann #on the #problem
On the Rectilinear Art Gallery Problem (Extended Abstract) (FH), pp. 717–728.
ICALPICALP-1990-JainS #learning
Language Learning by a “Team” (Extended Abstract) (SJ, AS), pp. 153–166.
ICALPICALP-1990-JerrumS #algorithm #approximate #polynomial
Polynomial-Time Approximation Algorithms for Ising Model (Extended Abstract) (MJ, AS), pp. 462–475.
ICALPICALP-1990-MatiasV #integer #on the #parallel #sorting #summary
On Parallel Hashing and Integer Sorting (Extended Summary) (YM, UV), pp. 729–743.
ICALPICALP-1990-RabinovichT #communication
Communication among Relations (Extended Abstract) (AMR, BAT), pp. 294–307.
ICGTGG-1990-Engels #database
Elementary Actions on an Extended Entity-Relationship Database (GE), pp. 344–362.
CAiSECAiSE-1990-BrinkkemperH #concept #development #requirements #specification
The Conceptual Task Model: a Specification Technique between Requirements Engineering and Program Development (Extended abstract) (SB, AHMtH), pp. 228–250.
ICMLML-1990-LairdHYT #using
Correcting and Extending Domain Knowledge using Outside Guidance (JEL, MH, ESY, CMT), pp. 235–243.
SIGIRSIGIR-1990-ChiaramellaN #approach #logic #modelling #retrieval
A Retrieval Model Based on an Extended Modal Logic and its Application to the RIME Experimental Approach (YC, JYN), pp. 25–43.
SIGIRSIGIR-1990-CrouchCN #automation #generative #query
The Automatic Generation of Extended Queries (CJC, DBC, KRN), pp. 369–383.
SIGIRSIGIR-1990-Rousseau #approach #heuristic #question #retrieval
Extended Boolean Retrieval: A Heuristic Approach? (RR), pp. 495–508.
PPDPALP-1990-Hanus #equation #logic programming #source code #specification
Logic Programs with Equational Type Specifications (Extended Abstract) (MH), pp. 70–85.
PPDPPLILP-1990-Fribourg #execution #prolog
A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution (LF), pp. 174–188.
WAGAWAGA-1990-Meijer #affix grammar
The Project on Extended Affix Grammars at Nijmegen (HM), pp. 130–142.
CCCC-1990-HartwigSS #ada #implementation #interface #specification
Specification and Implementation of a Tree-Abiding Interface for Ada (Extended Abstract) (MH, ES, RS), pp. 215–216.
CCCC-1990-HorvathAGF #comprehension #interface #multi #natural language #towards
Towards a Multilingual Natural Language Understanding Interface (Extended Abstract) (TH, ZA, TG, KF), pp. 217–218.
CADECADE-1990-BaralLM #logic programming #semantics #source code
Generalized Well-founded Semantics for Logic Programs (Extended Abstract) (CB, JL, JM), pp. 102–116.
CADECADE-1990-Bundy #reasoning
A Science of Reasoning: Extended Abstract (AB), pp. 633–640.
CADECADE-1990-LeeH #compilation #database #deduction
Substitution-based Compilation of Extended Rules in Deductive Databases (SHL, LJH), pp. 57–71.
ICLPCLP-1990-Fribourg90 #execution #induction #logic programming #prolog #proving #source code
Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction (LF), pp. 685–699.
ICLPCLP-1990-HarsatG90
An Extended RISC Methodology and its Application to FCP (AH, RG), pp. 67–82.
ICLPCLP-1990-PareschiM90 #definite clause grammar
Extending Definite Clause Grammars with Scoping Constructs (RP, DM), pp. 373–389.
ICLPCLP-1990-Przymusinski90 #semantics #source code
Extended Stable Semantics for Normal and Disjunctive Programs (TCP), pp. 459–477.
CSLCSL-1990-CantoneCS #problem #set
Decision Problems for Tarski and Presburger Arithmetics Extended With Sets (DC, VC, JTS), pp. 95–109.
LICSLICS-1990-Clote
ALOGTIME and a Conjecture of S. A. Cook (Extended Abstract) (PC), pp. 181–189.
LICSLICS-1990-Comon #algebra #equation
Solving Inequations in Term Algebras (Extended Abstract) (HC), pp. 62–69.
LICSLICS-1990-Courcelle #graph #higher-order #monad #on the #set
On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) (BC), pp. 190–196.
LICSLICS-1990-EmersonES #decidability #on the #performance
On the Limits of Efficient Temporal Decidability (Extended Abstract) (EAE, ME, JS), pp. 464–475.
LICSLICS-1990-HeintzeJ #constraints #set
A Decision Procedure for a Class of Set Constraints (Extended Abstract) (NH, JJ), pp. 42–51.
LICSLICS-1990-Jung #classification
The Classification of Continuous Domains (Extended Abstract) (AJ), pp. 35–40.
LICSLICS-1990-KfouryT #polymorphism #re-engineering #summary #λ-calculus
Type Reconstruction in Finite-Rank Fragments of the Polymorphic λ-Calculus (Extended Summary) (AJK, JT), pp. 2–11.
LICSLICS-1990-Lewis #logic
A Logic of Concrete Time Intervals (Extended Abstract) (HRL), pp. 380–389.
HTHT-1989-CatlinBY #collaboration #framework #hypermedia #named
InterNote: Extending a Hypermedia Framework to Support Annotative Collaboration (TC, PB, NY), pp. 365–378.
SIGMODSIGMOD-1989-CammarataRS #database #relational
Extendeing a Relational Database with Deferred Referential Integrity Checking and Intelligent Joins (SJC, PR, DS), pp. 88–97.
SIGMODSIGMOD-1989-GyssensPG #approach #grammarware #modelling #towards
A Grammar-Based Approach Towards Unifying Hierarchical Data Models (Extended Abstract) (MG, JP, DVG), pp. 263–272.
SIGMODSIGMOD-1989-HullS #complexity #database #object-oriented #on the #strict
On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (Extended Abstract) (RH, JS), pp. 147–158.
SIGMODSIGMOD-1989-MarkowitzS #correctness #on the #relational #representation
On the Correctness of Representing Extended Entity-Relationship Structures in the Relational Model (VMM, AS), pp. 430–439.
VLDBVLDB-1989-Mitschang #algebra #relational
Extending the Relational Algebra to Capture Complex Objects (BM), pp. 297–305.
STOCSTOC-1989-AfratiC #query #recursion #strict
Expressiveness of Restricted Recursive Queries (Extended Abstract) (FNA, SSC), pp. 113–126.
STOCSTOC-1989-AlonBLP #communication #complexity #on the
On the Complexity of Radio Communication (Extended Abstract) (NA, ABN, NL, DP), pp. 274–285.
STOCSTOC-1989-Awerbuch #algorithm #distributed
Distributed Shortest Paths Algorithms (Extended Abstract) (BA), pp. 490–500.
STOCSTOC-1989-AwerbuchBLP #adaptation #data type #distributed
Compact Distributed Data Structures for Adaptive Routing (Extended Abstract) (BA, ABN, NL, DP), pp. 479–489.
STOCSTOC-1989-BabaiNS #multi #protocol #pseudo #sequence
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract) (LB, NN, MS), pp. 1–11.
STOCSTOC-1989-BerkmanBGSV #problem
Highly Parallelizable Problems (Extended Abstract) (OB, DB, ZG, BS, UV), pp. 309–319.
STOCSTOC-1989-Bshouty #on the
On the Extended Direct Sum Conjecture (NHB), pp. 177–185.
STOCSTOC-1989-ChorK #privacy
A Zero-One Law for Boolean Privacy (extended abstract) (BC, EK), pp. 62–72.
STOCSTOC-1989-CookU #functional
Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract) (SAC, AU), pp. 107–112.
STOCSTOC-1989-FellowsL #algorithm #on the #performance #polynomial
On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract) (MRF, MAL), pp. 501–512.
STOCSTOC-1989-HastadLN #performance #using
Fast Computation Using Faulty Hypercubes (Extended Abstract) (JH, FTL, MN), pp. 251–263.
STOCSTOC-1989-ImpagliazzoLL #generative #pseudo
Pseudo-random Generation from one-way functions (Extended Abstracts) (RI, LAL, ML), pp. 12–24.
STOCSTOC-1989-KochLMRR #network
Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) (RRK, FTL, BMM, SR, ALR), pp. 227–240.
STOCSTOC-1989-KurtzMR #morphism #random
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) (SAK, SRM, JSR), pp. 157–166.
STOCSTOC-1989-RabinB #multi #protocol
Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract) (TR, MBO), pp. 73–85.
STOCSTOC-1989-RivestS #automaton #finite #sequence #using
Inference of Finite Automata Using Homing Sequences (Extended Abstract) (RLR, RES), pp. 411–420.
STOCSTOC-1989-SchmidtS #aspect-oriented #on the #performance
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) (JPS, AS), pp. 355–366.
ICALPICALP-1989-AllenderH #bound
Lower Bounds for the Low Hierarchy (Extended Abstract) (EA, LAH), pp. 31–45.
ICALPICALP-1989-Baeza-YatesG #performance #regular expression
Efficient Text Searching of Regular Expressions (Extended Abstract) (RABY, GHG), pp. 46–62.
ICALPICALP-1989-BermanG #distributed
Asymptotically Optimal Distributed Consensus (Extended Abstract) (PB, JAG), pp. 80–94.
ICALPICALP-1989-GrooteV #bisimulation #congruence #semantics
Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract) (JFG, FWV), pp. 423–438.
ICALPICALP-1989-Kenyon-MathieuV #analysis #data type
General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (Extended Abstract) (CKM, JSV), pp. 473–487.
ICALPICALP-1989-RaghavanS #algorithm #memory management #online
Memory Versus Randomization in On-line Algorithms (Extended Abstract) (PR, MS), pp. 687–703.
ICALPICALP-1989-Zhang #information management
DI-Domains as Information Systems (Extended Abstract) (GQZ), pp. 773–788.
FPCAFPCA-1989-Takayama #performance #proving #source code
Extended Projection — New Method to Extract Efficient Programs from Constructive Proofs (YT), pp. 299–312.
CHICHI-1989-FischerN #named #paradigm #retrieval
Helgon: extending the retrieval by reformulation paradigm (GF, HNL), pp. 357–362.
CAiSECAiSE-1989-CacaceCCGLLTZ #database #named #prototype #relational #specification
ALGRES: An Extended Relational Database System for the Specification and Prototyping of Complex Applications (FC, SC, SCR, GG, GL, LL, LT, RVZ).
KRKR-1989-Rayner #predict #problem #question
Did Newton Solve the “Extended Prediction Problem”? (MR), pp. 381–385.
OOPSLAOOPSLA-1989-BlockC
An Extended Frame Language (FPB, NCC), pp. 151–157.
OOPSLAOOPSLA-1989-MarquesG #object-oriented #operating system
Extending the Operating System to Support an Object-Oriented Environment (JAM, PG), pp. 113–122.
OOPSLAOOPSLA-1989-Pedersen #inheritance
Extending Ordinary Inheritance Schemes to Include Generalization (CHP), pp. 407–417.
OOPSLAOOPSLA-1989-ShillingS #object-oriented #paradigm
Three Steps to Views: Extending the Object-Oriented Paradigm (JJS, PFS), pp. 353–361.
LICSLICS-1989-Cosmadakis #recursion
Computing with Recursive Types (Extended Abstract) (SSC), pp. 24–38.
LICSLICS-1989-EmersonJ #automaton #on the
On Simultaneously Determinizing and Complementing ω-Automata (Extended Abstract) (EAE, CSJ), pp. 333–342.
LICSLICS-1989-Leivant #morphism #polymorphism #summary
Stratified Polymorphism (Extended Summary) (DL), pp. 39–47.
LICSLICS-1989-Luo #calculus
ECC, an Extended Calculus of Constructions (ZL), pp. 386–395.
LICSLICS-1989-Scott #logic
Domains and Logics (Extended Abstract) (DSS), pp. 4–5.
LICSLICS-1989-Vrijer #λ-calculus
Extending the λ Calculus with Surjective Pairing is Conservative (RCdV), pp. 204–215.
ICLPNACLP-1989-WilsonB #comparison #constraints #logic programming
Extending Hierarchical Constraint Logic Programming: Nonmonotonicity and Inter-Hierarchy Comparison (MW, AB), pp. 3–19.
SIGMODSIGMOD-1988-AbiteboulH #datalog
Data Functions, Datalog and Negation (Extended Abstract) (SA, RH), pp. 143–153.
SIGMODSIGMOD-1988-KrishnamurthyRS #datalog #effectiveness #framework #safety #testing
A Framework for Testing Safety and Effective Computability of Extended Datalog (Extended Abstract) (RK, RR, OS), pp. 154–163.
SIGMODSIGMOD-1988-VinesK #ada #framework #named #object-oriented
Gaia: An Object-Oriented Framework for an Ada Environment (Extended Abstract) (DV, TK), p. 206.
VLDBVLDB-1988-LynchS #database
Extended User-Defined Indexing with Application to Textual Databases (CAL, MS), pp. 306–317.
ESOPESOP-1988-Legrand #functional #programming #towards
Extending Functional Programming Towards Relations (RL), pp. 206–220.
STOCSTOC-1988-BellareM #how
How to Sign Given Any Trapdoor Function (Extended Abstract) (MB, SM), pp. 32–42.
STOCSTOC-1988-Ben-OrGW #distributed #fault tolerance #theorem
Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) (MBO, SG, AW), pp. 1–10.
STOCSTOC-1988-Ben-OrT #algorithm #multi
A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) (MBO, PT), pp. 301–309.
STOCSTOC-1988-BlumFM
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) (MB, PF, SM), pp. 103–112.
STOCSTOC-1988-ChaumCD #multi #protocol
Multiparty Unconditionally Secure Protocols (Extended Abstract) (DC, CC, ID), pp. 11–19.
STOCSTOC-1988-FiatNSS
Non-Oblivious Hashing (Extended Abstract) (AF, MN, JPS, AS), pp. 367–376.
STOCSTOC-1988-FiatNSSS #multi
Storing and Searching a Multikey Table (Extended Abstract) (AF, MN, AAS, JPS, AS), pp. 344–353.
STOCSTOC-1988-HalstenbergR #communication #on the
On Different Modes of Communication (Extended Abstract) (BH, RR), pp. 162–172.
STOCSTOC-1988-Istrail #polynomial #sequence #traversal
Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract) (SI), pp. 491–503.
STOCSTOC-1988-KalyanasundaramS #on the #power of
On the Power of White Pebbles (Extended Abstract) (BK, GS), pp. 258–266.
STOCSTOC-1988-KearnsL #fault #learning
Learning in the Presence of Malicious Errors (Extended Abstract) (MJK, ML), pp. 267–280.
STOCSTOC-1988-KrizancPU #trade-off
A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) (DK, DP, EU), pp. 93–102.
STOCSTOC-1988-PapadimitriouY88a #approximate #complexity #optimisation
Optimization, Approximation, and Complexity Classes (Extended Abstract) (CHP, MY), pp. 229–234.
STOCSTOC-1988-PapadimitriouY88b #algorithm #analysis #architecture #independence #parallel #towards
Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) (CHP, MY), pp. 510–513.
STOCSTOC-1988-PelegU #performance #trade-off
A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract) (DP, EU), pp. 43–52.
STOCSTOC-1988-Vaidya #geometry
Geometry Helps in Matching (Extended Abstract) (PMV), pp. 422–425.
STOCSTOC-1988-Yannakakis #combinator #linear #optimisation #problem #source code
Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) (MY), pp. 223–228.
ICALPICALP-1988-ArnborgLS #graph #problem
Problems Easy for Tree-Decomposable Graphs (Extended Abstract) (SA, JL, DS), pp. 38–51.
ICALPICALP-1988-KirchnerKM #semantics
Operational Semantics of OBJ-3 (Extended Abstract) (CK, HK, JM), pp. 287–301.
ICALPICALP-1988-KirschenhoferPS
Do We Really Need to Balance Patricia Trees? (Extended Abstract) (PK, HP, WS), pp. 302–316.
ICALPICALP-1988-KruskalRS #algorithm #complexity #parallel #performance
A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract) (CPK, LR, MS), pp. 333–346.
ICALPICALP-1988-LengauerW #analysis #graph #performance
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) (TL, EW), pp. 379–393.
ICALPICALP-1988-Tamassia #data type #graph
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract) (RT), pp. 576–590.
ICALPICALP-1988-Watanabe #complexity #nondeterminism #on the
On ≤ᴾ₁₋tt-Sparseness and Nondeterministic Complexity Classes (Extended Abstract) (OW0), pp. 697–709.
LISPLFP-1988-Felleisen #named #λ-calculus
λ-V-CS: An Extended λ-Calculus for Scheme (MF), pp. 72–85.
LISPLFP-1988-JategaonkarM #ml #pattern matching #type system
ML with Extended Pattern Matching and Subtypes (LJ, JCM), pp. 198–211.
ICMLML-1988-Amsterdam #learning
Extending the Valiant Learning Model (JA), pp. 381–394.
PPoPPPPEALS-1988-BurkeCFHSS #automation #empirical #parallel
Automatic Discovery of Parallelism: A Tool and an Experiment (Extended Abstract) (MGB, RC, JF, WCH, VS, DS), pp. 77–84.
CADECADE-1988-FeltyGHMNS #logic programming #named #programming language #prolog #λ-calculus
Lambda-Prolog: An Extended Logic Programming Language (APF, ELG, JH, DM, GN, AS), pp. 754–755.
ICLPJICSCP-1988-Plummer88 #debugging #named #prolog
Coda: An Extended Debugger for PROLOG (DP), pp. 496–511.
ICLPJICSCP-1988-SekiI88 #evaluation #query #source code
A Query Evaluation Method for Stratified Programs Under the Extended CWA (HS, HI), pp. 195–211.
ICLPJICSCP-1988-Wu88 #data flow
An Extended Dataflow Model of FGHC (HW), pp. 1272–1276.
LICSLICS-1988-DeganoNM #concurrent #consistency #on the #semantics
On the Consistency of “Truly Concurrent” Operational and Denotational Semantics (Extended Abstract) (PD, RDN, UM), pp. 133–141.
LICSLICS-1988-GunterJ #consistency
Coherence and Consistency in Domains (Extended Outline) (CAG, AJ), pp. 309–317.
LICSLICS-1988-Winskel #composition #petri net #proving
A Category of Labelled Petri Nets and Compositional Proof System (Extended Abstract) (GW), pp. 142–154.
PODSPODS-1987-Gucht #algebra #on the #power of #relational
On the Expressive Power of the Extended Relational Algebra for the Unnormalized Relational Model (DVG), pp. 302–312.
SIGMODSIGMOD-1987-McKenzieS #algebra #relational #transaction
Extending the Relational Algebra to Support Transaction Time (LEM, RTS), pp. 467–478.
VLDBVLDB-1987-Gardarin #datalog #recursion #source code
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs (GG), pp. 21–30.
VLDBVLDB-1987-KahlerR #database
Extending Logging for Database Snapshot Refresh (BK, OR), pp. 389–398.
VLDBVLDB-1987-WhangN #approach #logic #normalisation #optimisation #query #recursion
An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments (KYW, SBN), pp. 275–287.
STOCSTOC-1987-AbadiFK #on the
On Hiding Information from an Oracle (Extended Abstract) (MA, JF, JK), pp. 195–203.
STOCSTOC-1987-Clarkson #algorithm #approximate
Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract) (KLC), pp. 56–65.
STOCSTOC-1987-Fortnow #complexity
The Complexity of Perfect Zero-Knowledge (Extended Abstract) (LF), pp. 204–209.
STOCSTOC-1987-Frederickson #approach #graph
A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) (GNF), pp. 19–28.
STOCSTOC-1987-HastadLN #configuration management #fault
Reconfiguring a Hypercube in the Presence of Faults (Extended Abstract) (JH, FTL, MN), pp. 274–284.
STOCSTOC-1987-HastadLR #analysis #multi #protocol
Analysis of Backoff Protocols for Multiple Access Channels (Extended Abstract) (JH, FTL, BR), pp. 241–253.
STOCSTOC-1987-IwanoS #graph #infinity #testing
Testing for Cycles in Infinite Graphs with Periodic Structure (Extended Abstract) (KI, KS), pp. 46–55.
STOCSTOC-1987-NaorNS #algorithm #graph #parallel #performance
Fast Parallel Algorithms for Chordal Graphs (Extended Abstract) (JN, MN, AAS), pp. 355–364.
STOCSTOC-1987-PelegU #graph
Constructing Disjoint Paths on Expander Graphs (Extended Abstract) (DP, EU), pp. 264–273.
STOCSTOC-1987-Vazirani #performance #using
Efficiency Considerations in Using Semi-random Sources (Extended Abstract) (UVV), pp. 160–168.
ICALPICALP-1987-AggarwalV #complexity #problem #sorting
The I/O Complexity of Sorting and Related Problems (Extended Abstract) (AA, JSV), pp. 467–478.
ICALPICALP-1987-BaetenG #abstraction #algebra #process
Another Look at Abstraction in Process Algebra (Extended Abstract) (JCMB, RJvG), pp. 84–94.
ICALPICALP-1987-GerthB #communication #process
A Timed Failures Model for Extended Communicating Processes (RG, AB), pp. 95–114.
ICALPICALP-1987-LandauSV #parallel
Parallel Construction of a Suffix Tree (Extended Abstract) (GML, BS, UV), pp. 314–325.
ICALPICALP-1987-LevcopoulosLS #geometry #heuristic
Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract) (CL, AL, JRS), pp. 376–385.
ICALPICALP-1987-Marchetti-SpaccamelaV #algorithm #online #performance #problem
Efficient On-Line Algorithms for the Knapsack Problem (Extended Abstract) (AMS, CV), pp. 445–456.
FPCAFPCA-1987-Burn #evaluation #functional #parallel
Evaluation transformers — a model for the parallel evaluation of functional languages (extended abstract) (GLB), pp. 446–470.
SOSPSOSP-1987-ChangM #architecture #programming
801 Storage: Architecture and Programming (Extended Abstract) (AC, MFM), pp. 109–110.
SOSPSOSP-1987-FinlaysonC
Log Files: An Extended File Service Exploiting Write-Once Storage (RSF, DRC), pp. 139–148.
SOSPSOSP-1987-HaskinMSC
Recovery Management in QuickSilver (Extended Abstract) (RLH, YM, WS, GC), pp. 107–108.
SOSPSOSP-1987-HowardKMNSSW #distributed #file system #performance
Scale and Performance in a Distributed File System (Extended Abstract) (JHH, MLK, SGM, DAN, MS, RNS, MJW), pp. 1–2.
SOSPSOSP-1987-JulLHB #fine-grained
Fine-Grained Mobility in the Emerald System (Extended Abstract) (EJ, HML, NCH, APB), pp. 105–106.
SOSPSOSP-1987-NelsonWO #file system #network
Caching in the Sprite Network File System (Extended Abstract) (MNN, BBW, JKO), pp. 3–4.
SOSPSOSP-1987-TerryS
Managing Stored Voice in the Etherphone System (Extended Abstract) (DBT, DCS), pp. 103–104.
LICSLICS-1987-HarelPSS #on the #semantics
On the Formal Semantics of Statecharts (Extended Abstract) (DH, AP, JPS, RS), pp. 54–64.
ICLPSLP-1987-HuberV87 #order #prolog
Extended Prolog for Order-Sorted Resolution (MH, IV), pp. 34–43.
PODSPODS-1986-GelfondPP #parallel
The Extended Closed World Assumpution and its Relationship to Parallel Circumscription (MG, HP, TCP), pp. 133–139.
PODSPODS-1986-Otoo #multi
Balanced Multidimensional Extendible Hash Tree (EJO), pp. 100–113.
SIGMODSIGMOD-1986-DadamKABEGLPW #prototype
A DBMS Prototype to Support Extended NF2 Relations: An Integrated View on Flat Tables and Hierarchies (PD, KK, FA, HMB, RE, JG, VYL, PP, GW), pp. 356–367.
VLDBVLDB-1986-ArisawaM #dependence #on the
On the Properties of Extended Inclusion Dependencies (HA, TM), pp. 449–456.
VLDBVLDB-1986-Chen #database #distributed
The Management of Dynamically Distributed Database Windows (Extended Abstract) (QC), p. 248.
VLDBVLDB-1986-HsuY #concurrent
Concurrent Operations in Extendible Hashing (MH, WPY), pp. 241–247.
VLDBVLDB-1986-JunetFL #database #named #query #semantics
ECRINS/86: An Extended Entity-Relationship Data Base Management System and its Semantic Query Language (MJ, GF, ML), pp. 259–266.
VLDBVLDB-1986-UdagawaM #database #logic #relational
An Extended Relational Database System and It’s Application to Management of Logic Diagrama (YU, TM), pp. 267–277.
ESOPESOP-1986-HankinBJ #approach #combinator #parallel #reduction
A Safe Approach to Parallel Combinator Reduction (Extended Abstract) (CH, GLB, SLPJ), pp. 99–110.
ESOPESOP-1986-TanakaK #compilation #concurrent #prolog #queue
Compiling Extended Concurrent Prolog — Single Queue Compilation (JT, MK), pp. 301–314.
STOCSTOC-1986-BlumerEHW #concept #geometry
Classifying Learnable Geometric Concepts with the Vapnik-Chervonenkis Dimension (Extended Abstract) (AB, AE, DH, MKW), pp. 273–282.
STOCSTOC-1986-Cleve #security
Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) (RC), pp. 364–369.
STOCSTOC-1986-HalpernV #complexity #reasoning
The Complexity of Reasoning about Knowledge and Time: Extended Abstract (JYH, MYV), pp. 304–315.
STOCSTOC-1986-KoLD #morphism #polynomial
A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) (KIK, TJL, DZD), pp. 295–303.
STOCSTOC-1986-Siegel #aspect-oriented #data flow
Aspects of Information Flow in VLSI Circuits (Extended Abstract) (AS), pp. 448–459.
STOCSTOC-1986-Yannakakis #graph
Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) (MY), pp. 104–108.
ICALPICALP-1986-Allender
Characterizations on PUNC and Precomputation (Extended Abstract) (EA), pp. 1–10.
ICALPICALP-1986-BrzozowskiS #analysis #network #simulation #summary
Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary) (JAB, CJHS), pp. 69–78.
ICALPICALP-1986-DymondR #context-free grammar #memory management #parallel #recognition
Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract) (PWD, WLR), pp. 95–104.
ICALPICALP-1986-Lai #communication #detection #distributed #termination
A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract) (THL), pp. 196–205.
ICALPICALP-1986-Lange #nondeterminism #reduction
Decompositions of Nondeterministic Reductions (Extended Abstract) (KJL), pp. 206–214.
ICALPICALP-1986-Niwinski #fixpoint #on the
On Fixed-Point Clones (Extended Abstract) (DN), pp. 464–473.
ICALPICALP-1986-Regan #reduction #theorem
A Uniform Reduction Theorem — Extending a Result of J. Grollmann and A. Selman (KWR), pp. 324–333.
ICALPICALP-1986-Schnorr #algorithm #performance #reduction
A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract) (CPS), pp. 359–369.
ICALPICALP-1986-Schoning #bound #recursion
Lower Bounds by Recursion Theoretic Arguments (Extended Abstract) (US), pp. 370–375.
ICALPICALP-1986-Willard #bound #problem #query
Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract) (DEW), pp. 444–453.
SIGIRSIGIR-1986-WongZRW #on the #query
On Extending the Vector Space Model for Boolean Query Processing (SKMW, WZ, VVR, PCNW), pp. 175–185.
CADECADE-1986-Stickel #compilation #implementation #prolog #proving #theorem proving
A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler (MES), pp. 573–587.
LICSLICS-1986-EmersonL #calculus #model checking #performance #μ-calculus
Efficient Model Checking in Fragments of the Propositional μ-Calculus (Extended Abstract) (EAE, CLL), pp. 267–278.
LICSLICS-1986-Schlipf #how
How Uncomputable is General Circumscription? (Extended Abstract) (JSS), pp. 92–95.
SIGMODSIGMOD-1985-SellisS #database #optimisation #query
Optimization of Extended Database Query Languages (TKS, LDS), pp. 424–436.
STOCSTOC-1985-Buss #bound #polynomial
The Polynomial Hierarchy and Fragments of Bounded Arithmetic (Extended Abstract) (SRB), pp. 285–290.
STOCSTOC-1985-GoldwasserMR #complexity #interactive
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract) (SG, SM, CR), pp. 291–304.
STOCSTOC-1985-Peleg #concurrent #logic
Concurrent Dynamic Logic (Extended Abstract) (DP), pp. 232–239.
STOCSTOC-1985-Vaidya #orthogonal #query #trade-off
Space-Time Tradeoffs for Orthogonal Range Queries (Extended Abstract) (PMV), pp. 169–174.
STOCSTOC-1985-Vazirani #communication #complexity #generative #sequence #towards
Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) (UVV), pp. 366–378.
STOCSTOC-1985-YaoY #approach #geometry #query
A General Approach to d-Dimensional Geometric Queries (Extended Abstract) (ACCY, FFY), pp. 163–168.
ICALPICALP-1985-Ben-OrGMR #contract #protocol
A Fair Protocol for Signing Contracts (Extended Abstract) (MBO, OG, SM, RLR), pp. 43–52.
ICALPICALP-1985-Bouge #csp #implementation
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract) (LB), pp. 63–70.
ICALPICALP-1985-Fortune #algorithm #performance
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract) (SF), pp. 189–198.
ICALPICALP-1985-GabowS #algorithm #performance
Efficient Algorithms for Graphic Matroid Intersection and Parity (Extended Abstract) (HNG, MFMS), pp. 210–220.
ICALPICALP-1985-Jerrum #combinator #generative #random
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract) (MJ), pp. 290–299.
ICALPICALP-1985-LandauYG #algorithm #distributed #network
Distributed Algorithms in Synchronous Broadcasting Networks (Extended Abstract) (GML, MMY, ZG), pp. 363–372.
ICALPICALP-1985-Li #bound
Lower Bounds by Kolmogorov-Complexity (Extended Abstract) (ML0), pp. 383–393.
ICALPICALP-1985-SippuS #algorithm #design #on the #performance #relational
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract) (SS, ESS), pp. 456–464.
ICALPICALP-1985-SistlaVW #automaton #logic #problem
The Complementation Problem for Büchi Automata with Applications to Temporal Logic (Extended Abstract) (APS, MYV, PW), pp. 465–474.
ICALPICALP-1985-Vishkin #parallel #pattern matching #string #summary
Optimal Parallel Pattern Matching in Strings (Extended Summary) (UV), pp. 497–508.
FPCAFPCA-1985-Bellot85 #higher-order #programming
High Order Programming in Extended FP (PB), pp. 65–80.
SIGIRSIGIR-1985-Fox #bibliography #documentation #perspective #retrieval
Composite Document Extended Retrieval — An Overview (EAF), pp. 42–53.
ICSEICSE-1985-Chen #development #formal method #functional #implementation #programming
Extending the Implementation Scheme of Functional Programming System FP for Supporting the Formal Software Development Methodology (QC), pp. 50–54.
SOSPSOSP-1985-CarrieroG #kernel
The S/Net’s Linda Kernel (extended abstract) (NC, DG), p. 160.
DACDAC-1984-Hardwick #database #design #relational
Extending the relational database data model for design applications (MH), pp. 110–116.
SIGMODSIGMOD-1984-Salton #information retrieval #logic
The Use of Extended Boolean Logic in Information Retrieval (GS), pp. 277–285.
SIGMODSIGMOD-1984-SimonV #design #implementation
Design and Implementation of an Extendible Integrity Subsystem (ES, PV), pp. 9–17.
VLDBVLDB-1984-GinsburgT #query
Interval Queries on Object Histories: Extended Abstract (SG, KT), pp. 208–217.
VLDBVLDB-1984-KrishnamurthyM #approach #query
Query Processing on Personal Computers: A Pragmatic Approach (Extended Abstract) (RK, SPM), pp. 26–29.
VLDBVLDB-1984-Otoo #multi
A Mapping Function for the Directory of a Multidimensional Extendible Hashing (EJO), pp. 493–506.
VLDBVLDB-1984-RosenthalR #algebra #framework #query
Extending the Algebraic Framework of Query Processing to Handle Outerjoins (AR, DSR), pp. 334–343.
VLDBVLDB-1984-YangD
A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table (WPY, MWD), pp. 245–254.
STOCSTOC-1984-Alt #comparison
Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract) (HA), pp. 466–470.
STOCSTOC-1984-BachMS
Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) (EB, GLM, JS), pp. 183–190.
STOCSTOC-1984-Clarkson #algorithm #approximate #geometry #performance
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract) (KLC), pp. 342–348.
STOCSTOC-1984-Gonnet #equivalence #polynomial #random
Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract) (GHG), pp. 334–341.
STOCSTOC-1984-Maass #bound #nondeterminism #polynomial #turing machine
Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.
STOCSTOC-1984-Mirzaian
Channel Routing in VLSI (Extended Abstract) (AM), pp. 101–107.
STOCSTOC-1984-VardiW #automaton #logic #source code
Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract) (MYV, PW), pp. 446–456.
ICALPICALP-1984-AfratiPP #complexity #graph
The Complexity of Cubical Graphs (Extended Abstract) (FNA, CHP, GP), pp. 51–57.
ICALPICALP-1984-Jerrum #complexity #generative #sequence
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract) (MJ), pp. 270–280.
ICALPICALP-1984-Jung #complexity #matrix #on the #performance #probability #problem
On Probabilistic Tape Complexity and Fast Circuits for Matrix Inversion Problems (Extended Abstract) (HJ), pp. 281–291.
ICALPICALP-1984-Mannila #algorithm #metric #sorting
Measures of Presortedness and Optimal Sorting Algorithms (Extended Abstract) (HM), pp. 324–336.
ICALPICALP-1984-Vitter #complexity #interface
Computational Complexity of an Optical Disk Interface (Extended Abstract) (JSV), pp. 490–502.
ICALPICALP-1984-Willard #algorithm #difference #problem #retrieval
Sampling Algorithms for Differential Batch Retrieval Problems (Extended Abstract) (DEW), pp. 514–526.
PODSPODS-1983-Ellis #concurrent #distributed
Extendible Hashing for Concurrent Operations and Distributed Data (CSE), pp. 106–116.
VLDBVLDB-1983-IbarakiKM #concept
Disjoint-Interval Topological Sort: A Useful Concept in Serializability Theory (Extended Abstract) (TI, TK, TM), pp. 89–91.
VLDBVLDB-1983-KrishnamurthyMZ #named
Query-By-Example: Operations on Piecewise Continuous Data (Extended Abstract) (RK, SPM, MMZ), pp. 305–308.
VLDBVLDB-1983-VassiliouCJ #how
How Does an Expert System Get its Data? (Extended Abstract) (YV, JC, MJ), pp. 70–72.
STOCSTOC-1983-BakerBL #algorithm #approximate
An Approximation Algorithm for Manhattan Routing (Extended Abstract) (BSB, SNB, FTL), pp. 477–486.
STOCSTOC-1983-Blum #how
How to Exchange (Secret) Keys (Extended Abstract) (MB), pp. 440–447.
STOCSTOC-1983-KanellakisCV #dependence #polynomial #problem
Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) (PCK, SSC, MYV), pp. 264–277.
STOCSTOC-1983-Lenstra #finite #multi
Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) (AKL), pp. 189–192.
STOCSTOC-1983-ODunlaingSY #approach #named
Retraction: A New Approach to Motion-Planning (Extended Abstract) (, MS, CKY), pp. 207–220.
STOCSTOC-1983-Yao
A 3-Space Partition and Its Applications (Extended Abstract) (FFY), pp. 258–263.
ICALPICALP-1983-AptD #axiom #logic #using
An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract) (KRA, CD), pp. 15–27.
ICALPICALP-1983-CohenLP #distributed #problem #symmetry
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract) (SC, DJL, AP), pp. 128–136.
ICALPICALP-1983-EdelsbrunnerW #on the #set
On the Number of Equal-Sized Semispaces of a Set of Points in the Plane (Extended Abstract) (HE, EW), pp. 182–187.
ICALPICALP-1983-Ganzinger #compilation #composition #data type #semantics
Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract) (HG), pp. 237–249.
ICALPICALP-1983-LehmannS #reasoning
Reasoning with Time and Chance (Extended Abstract) (DJL, SS), pp. 445–457.
ICALPICALP-1983-MycroftN #abstract interpretation #using
Strong Abstract Interpretation Using Power Domains (Extended Abstract) (AM, FN), pp. 536–547.
ICALPICALP-1983-SchoningB
Immunity (Extended Abstract) (US, RVB), pp. 653–661.
ICALPICALP-1983-Vitanyi #on the #simulation
On the Simulation of Many Storage Heads by a Single One (Extended Abstract) (PMBV), pp. 687–694.
ICALPICALP-1983-YannakakisKCP #clustering #graph
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) (MY, PCK, SSC, CHP), pp. 712–722.
SOSPSOSP-1983-LindsayHMWY #communication #database #distributed
Computation & Communication in R*: A Distributed Database Manager (Extended Abstract) (BGL, LMH, CM, PFW, RAY), pp. 1–2.
PODSPODS-1982-DayalGK #algebra #relational
An Extended Relational Algebra with Control over Duplicate Elimination (UD, NG, RHK), pp. 117–123.
SIGMODSIGMOD-1982-HaskinL #database #on the #relational
On Extending the Functions of a Relational Database System (RLH, RAL), pp. 207–212.
STOCSTOC-1982-Bach #algorithm #performance
Fast Algorithms under the Extended Riemann Hypothesis: A Concrete Estimate (EB), pp. 290–295.
STOCSTOC-1982-BhattL #how
How to Assemble Tree Machines (Extended Abstract) (SNB, CEL), pp. 77–84.
STOCSTOC-1982-BorodinH #modelling #parallel #sorting
Routing, Merging and Sorting on Parallel Models of Computation (Extended Abstract) (AB, JEH), pp. 338–344.
STOCSTOC-1982-Immerman #polynomial #query #relational
Relational Queries Computable in Polynomial Time (Extended Abstract) (NI), pp. 147–152.
STOCSTOC-1982-Leighton #layout
A Layout Strategy for VLSI which Is Provably Good (Extended Abstract) (FTL), pp. 85–98.
STOCSTOC-1982-MehlhornS #distributed
Las Vegas Is better than Determinism in VLSI and Distributed Computing (Extended Abstract) (KM, EMS), pp. 330–337.
STOCSTOC-1982-Vardi #complexity #query #relational
The Complexity of Relational Query Languages (Extended Abstract) (MYV), pp. 137–146.
STOCSTOC-1982-Willard #maintenance
Maintaining Dense Sequential Files in a Dynamic Environment (Extended Abstract) (DEW), pp. 114–121.
STOCSTOC-1982-Yao #query #trade-off
Space-Time Tradeoff for Answering Range Queries (Extended Abstract) (ACCY), pp. 128–136.
ICALPICALP-1982-Brandenburg #theorem
Extended Chomsky-Schützenberger Theorems (FJB), pp. 83–93.
ICALPICALP-1982-KrevnerY #precedence #theorem
An Iteration Theorem for Simple Precedence Languages (Extended Abstract) (YK, AY), pp. 360–368.
ICALPICALP-1982-Niwinski #algebra #fixpoint #semantics
Fixed-Point Semantics for Algebraic (Tree) Grammars (Extended Abstract) (DN), pp. 384–396.
ICALPICALP-1982-Plotkin #nondeterminism
A Powerdomain for Countable Non-Determinism (Extended Abstract) (GDP), pp. 418–428.
ICALPICALP-1982-SannellaW #implementation #specification
Implementation of Parameterised Specifications (Extended Abstract) (DS, MW), pp. 473–488.
LISPLFP-1982-EggertS #logic programming #programming language
Logic Enhancement: A Metho for Extending Logic Programming Languages (PRE, DVS), pp. 74–80.
POPLPOPL-1982-Francez #communication #process
Extended Naming Conventions for Communicating Processes (NF), pp. 40–45.
POPLPOPL-1982-Wolper #communication #logic #process #specification #synthesis #using
Specification and Synthesis of Communicating Processes using an Extended Temporal Logic (PW), pp. 20–33.
ICLPILPC-1982-Porto82 #logic #named #programming
Epilog: A Language for Extended Programming in Logic (AP), pp. 31–37.
STOCSTOC-1981-HawrusikVY
Classes of Functions for Computing on Binary Trees (Extended Abstract) (FMH, KNV, AY), pp. 19–27.
STOCSTOC-1981-KimR
Digital Straightness and Convexity (Extended Abstract) (CEK, AR), pp. 80–89.
STOCSTOC-1981-King #metric #parallel
Measures of Parallelism in Alternating Computation Trees (Extended Abstract) (KNK), pp. 189–201.
STOCSTOC-1981-KleitmanLLM #graph
New Layouts for the Shuffle-Exchange Graph (Extended Abstract) (DJK, FTL, ML, GLM), pp. 278–292.
STOCSTOC-1981-PatersonRS #bound
Bounds on Minimax Edge Length for Complete Binary Trees (Extended Abstract) (MP, WLR, LS), pp. 293–299.
STOCSTOC-1981-Yao81a
The Entropic Limitations on VLSI Computations (Extended Abstract) (ACCY), pp. 308–311.
ICALPICALP-1981-ItzhaikY #equivalence #linear
A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (Extended Abstract) (YI, AY), pp. 229–237.
ICALPICALP-1981-King #automaton #finite #multi
Alternating Multihead Finite Automata (Extended Abstract) (KNK), pp. 506–520.
STOCSTOC-1980-Angluin #network
Local and Global Properties in Networks of Processors (Extended Abstract) (DA), pp. 82–93.
STOCSTOC-1980-Brown #implementation
Kraft Storage and Access for List Implementations (Extended Abstract) (DJB), pp. 100–107.
STOCSTOC-1980-ChazelleD #detection
Detection is Easier than Computation (Extended Abstract) (BC, DPD), pp. 146–153.
STOCSTOC-1980-Fagin #database #dependence #horn clause
Horn Clauses and Database Dependencies (Extended Abstract) (RF), pp. 123–134.
STOCSTOC-1980-HeintzS #testing
Testing Polynomials which Are Easy to Compute (Extended Abstract) (JH, CPS), pp. 262–272.
STOCSTOC-1980-Hoffmann #graph #morphism #testing
Testing Isomorphism on Cone Graphs (Extended Abstract) (CMH), pp. 244–251.
STOCSTOC-1980-KarpT #algorithm #linear #problem
Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) (RMK, RET), pp. 368–377.
STOCSTOC-1980-Lloyd #constraints #scheduling
Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract) (ELL), pp. 436–446.
STOCSTOC-1980-Reif #logic #probability #programming
Logics for Probabilistic Programming (Extended Abstract) (JHR), pp. 8–13.
STOCSTOC-1980-Storer #graph #grid
The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract) (JAS), pp. 201–210.
STOCSTOC-1980-Strong #execution #graph
Vector Execution of Flow Graphs (Extended Abstract) (HRS), pp. 108–116.
ICALPICALP-1980-LewisP #bound #symmetry
Symmetric Space-Bounded Computation (Extended Abstract) (HRL, CHP), pp. 374–384.
ICALPICALP-1980-Vitanyi #on the #power of #realtime #specification
On the Power of Real-Time Machines Under Varying Specifications (Extended Abstract) (PMBV), pp. 658–671.
CCSDCG-1980-Madsen #attribute grammar #on the #semantics
On defining semantics by means of extended attribute grammars (OLM), pp. 259–299.
SIGMODSIGMOD-1979-Codd #database #relational
Extending the Data Base Relational Model to Capture More Meaning (Abstract) (EFC), p. 161.
PLDISCC-1979-HansenSC #compilation #multi #pascal
Construction of a transportable, multi-pass compiler for extended Pascal (GJH, GAS, JDC), pp. 117–126.
STOCSTOC-1979-Angluin #set #string
Finding Patterns Common to a Set of Strings (Extended Abstract) (DA), pp. 130–141.
STOCSTOC-1979-Ladner #communication #complexity #csp #problem #process
The Complexity of Problems in Systems of Communicating Sequential Processes (Extended Abstract) (REL), pp. 214–223.
STOCSTOC-1979-Long #on the #polynomial
On γ-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) (TJL), pp. 278–287.
STOCSTOC-1979-Maier #database #relational
Minimum Covers in the Relational Database Model (Extended Abstract) (DM), pp. 330–337.
ICALPICALP-1979-Blattner #product line
Inherent Ambiguities in Families of Grammars (Extended Abstract) (MB), pp. 38–48.
ICALPICALP-1979-Gallier #recursion
Recursion Schemes and Generalized Interpretations (Extended Abstract) (JHG), pp. 256–270.
ICALPICALP-1979-KamimuraS #graph
DAGs and Chomsky Hierarchy (Extended Abstract) (TK, GS), pp. 331–337.
ICALPICALP-1979-PapadimitriouY #complexity #problem #strict
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.
ICALPICALP-1979-RozenbergV #finite
Extending the Notion of Finite Index (GR, DV), pp. 479–488.
ICALPICALP-1979-Ruzzo #complexity #context-free grammar #on the #parsing #recognition
On the Complexity of General Context-Free Language Parsing and Recognition (Extended Abstract) (WLR), pp. 489–497.
ICALPICALP-1979-Therien
Languages of Nilpotent and Solvable Groups (Extended Abstract) (DT), pp. 616–632.
SOSPSOSP-1979-WalkerKP #kernel #security #specification #verification
Specification and Verification of the UCLA Unix Security Kernel (Extended Abstract) (BJW, RAK, GJP), pp. 64–65.
SIGMODSIGMOD-1978-LeeG #semantics
Extended Semantics for Generalization Hierarchies (RML, RG), pp. 18–25.
STOCSTOC-1978-EngelfrietRS #transducer
Tree Transducers, L Systems and Two-Way Machines (Extended Abstract) (JE, GR, GS), pp. 66–74.
STOCSTOC-1978-Lueker #graph #problem
Maximization Problems on Graphs with Edge Weights Chosen from a Normal Distribution (Extended Abstract) (GSL), pp. 13–18.
STOCSTOC-1978-StorerS #metaprogramming
The Macro Model for Data Compression (Extended Abstract) (JAS, TGS), pp. 30–39.
ICALPICALP-1978-AltenkampM #named
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract) (DA, KM), pp. 15–25.
ICALPICALP-1978-CremersH #using
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract) (ABC, TNH), pp. 165–176.
VLDBVLDB-1977-Childs #set
Extended Set Theory (DLC), pp. 28–46.
STOCSTOC-1977-CarterW
Universal Classes of Hash Functions (Extended Abstract) (LC, MNW), pp. 106–112.
STOCSTOC-1977-FischerL #logic #source code
Propositional Modal Logic of Programs (Extended Abstract) (MJF, REL), pp. 286–294.
STOCSTOC-1977-KintalaF #nondeterminism #strict
Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract) (CMRK, PCF), pp. 178–185.
STOCSTOC-1977-PetersonF #distributed #problem
Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) (GLP, MJF), pp. 91–97.
ICALPICALP-1977-BensonJ #composition #lr #parallel #parsing
Parallel Decomposition of LR(k) Parsers (Extended Abstract) (DBB, RDJ), pp. 76–86.
ICALPICALP-1977-RozenbergV #finite
L Systems of Finite Index (Extended Abstract) (GR, DV), pp. 430–439.
SOSPSOSP-1977-CheritonMMS #operating system #realtime
Thoth, a Portable Real-Time Operating System (Extended Abstract) (DRC, MAM, LSM, GRS), p. 171.
SOSPSOSP-1977-ReedK
Synchronization with Eventcounts and Sequencers (Extended Abstract) (DPR, RKK), p. 91.
STOCSTOC-1976-GrahamHR #context-free grammar #on the #polynomial #recognition
On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract) (SLG, MAH, WLR), pp. 112–120.
STOCSTOC-1976-GuibasS #analysis
The Analysis of Double Hashing (Extended Abstract) (LJG, ES), pp. 187–191.
STOCSTOC-1976-HuntS #problem #reachability
Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract) (HBHI, TGS), pp. 126–134.
STOCSTOC-1976-Yao #algorithm #behaviour #on the #set
On the Average Behavior of Set Merging Algorithms (Extended Abstract) (ACCY), pp. 192–195.
ICSEICSE-1976-BellBD #approach #requirements
An Extendable Approach to Computer-Aided Software Requirements Engineering (Abstract) (TEB, DCB, MED), p. 70.
ICSEICSE-1976-SilberschatzKB #concurrent #pascal #resource management
Extending Concurrent Pascal to Allow Dynamic Resource Management (Abstract) (AS, RBK, AJB), p. 236.
STOCSTOC-1975-EhrenfeuchtR #formal method #on the #predict
On (Un)predictability of Formal Languages (Extended Abstract) (AE, GR), pp. 117–120.
STOCSTOC-1975-RosenbergS #array
Hashing Schemes for Extendible Arrays (Extended Arrays) (ALR, LJS), pp. 159–166.
STOCSTOC-1975-Wagner #complexity #on the #problem #string
On the Complexity of the Extended String-to-String Correction Problem (RAW), pp. 218–223.
STOCSTOC-1974-BookNP #bound #context-free grammar #linear #multi
Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) (RVB, MN, MP), pp. 290–296.
STOCSTOC-1974-Hammer #ll
A New Grammatical Transformation into LL(k) Form (Extended Abstract) (MH), pp. 266–275.
STOCSTOC-1974-HyafilPV #algorithm #performance
An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract) (LH, FP, JV), pp. 216–229.
STOCSTOC-1974-Rosenberg #array
Managing Storage for Extendible Arrays (ALR), pp. 297–302.
ICALPICALP-1974-GellerGH #parsing
Production Prefix Parsing (Extended Abstract) (MMG, SLG, MAH), pp. 232–241.
STOCSTOC-1973-Greibach #context-free grammar #polynomial
Jump PDA’s, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract (SAG), pp. 20–28.
POPLPOPL-1973-Rosenberg #array
Transitions in Extendible Arrays (ALR), pp. 218–225.
SOSPSOSP-1973-BrunoCS #independence #scheduling
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract) (JLB, EGCJ, RS), pp. 102–103.
STOCSTOC-1972-Savitch #automaton
Maze Recognizing Automata (Extended Abstract) (WJS), pp. 151–156.
ICALPICALP-1972-Book #complexity #formal method
Complexity Classes of Formal Languages (Extended Abstract) (RVB), pp. 517–520.
ICALPICALP-1972-HarrisonH #on the #product line
On a Family of Deterministic Grammars (Extended Abstract) (MAH, IMH), pp. 413–441.
ICALPICALP-1972-PazR #approximate #automaton #linear #problem
Linear Automata — Approximation Problem (Extended Abstract) (AP, MR), pp. 99–102.
STOCSTOC-1971-Berry
Block Structure: Retention or Deletion? (Extended Abstract) (DMB), pp. 86–100.
STOCSTOC-1971-Rosenberg #graph
Addressable Data Graphs: Extended Abstract (ALR), pp. 138–150.
STOCSTOC-1970-BookGW #bound
Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract (RVB, SAG, BW), pp. 92–99.
STOCSTOC-1970-Rosenberg #graph
Data Graphs and Addressing Schemes: Extended Abstract (ALR), pp. 48–61.
DACDAC-1969-Haas
Trw’s extended sceptre software-dc program (TESS-DC) a non-linear worst case program (BAH), pp. 185–191.
STOCSTOC-1969-BookG #realtime
Quasi-Realtime Languages (Extended Abstract) (RVB, SAG), pp. 15–18.
SOSPSOSP-1967-Fuchel68 #design #multi
Considerations in the design of a multiple computer system with extended core storage (KF), pp. 334–340.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.