Stem fulli$ (all stems)

177 papers:

DATE-2015-KonstantinouKM #encryption #functional #privacy #verification

Privacy-preserving functional IP verification utilizing fully homomorphic encryption (CK, AK, MM), pp. 333–338.

DATE-2015-SalivaCHFABBA #monitoring #reliability

Digital circuits reliability with in-situ monitors in 28nm fully depleted SOI (MS, FC, VH, XF, DA, AB, AB, LA), pp. 441–446.

STOC-2015-GorbunovVW #standard

Leveled Fully Homomorphic Signatures from Standard Lattices (SG, VV, DW), pp. 469–477.

ICALP-v1-2015-BernsteinS #graph

Fully Dynamic Matching in Bipartite Graphs (AB, CS), pp. 167–179.

ICALP-v1-2015-FaonioNV

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation (AF, JBN, DV), pp. 456–468.

FM-2015-PolikarpovaTF #library

A Fully Verified Container Library (NP, JT, CAF), pp. 414–434.

DUXU-UI-2015-Klein #3d #smarttech

Digital Craftsmanship — The Making of Incunabula, a Fully 3D Printed Wearable Dress (TK), pp. 643–654.

MoDELS-2015-OakesTLW #atl #contract #declarative #verification

Fully verifying transformation contracts for declarative ATL (BJO, JT, LL, MW), pp. 256–265.

Onward-2015-ChariGMD #towards

Towards fully reflective environments (GC, DG, SM, SD), pp. 240–253.

SAC-2015-HublerRFS #data flow #named #using

P-SaMI: a data-flow pattern to perform massively-parallel molecular docking experiments using a fully-flexible receptor model (PH, DDAR, JEF, ONdS), pp. 54–57.

LICS-2015-CastellanCW #game studies #parallel

The Parallel Intensionally Fully Abstract Games Model of PCF (SC, PC, GW), pp. 232–243.

ICALP-v2-2014-KopelowitzKPS #bound #graph #worst-case

Orienting Fully Dynamic Graphs with Worst-Case Time Bounds (TK, RK, EP, SS), pp. 532–543.

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

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

ICPR-2014-XianCZ #approach #automation #image #segmentation

A Fully Automatic Breast Ultrasound Image Segmentation Approach Based on Neutro-Connectedness (MX, HDC, YZ), pp. 2495–2500.

POPL-2014-EhrhardTP #probability

Probabilistic coherence spaces are fully abstract for probabilistic PCF (TE, CT, MP), pp. 309–320.

SAC-2014-PatrignaniC #low level #semantics

Fully abstract trace semantics for low-level isolation mechanisms (MP, DC), pp. 1562–1569.

DATE-2013-BeigneVGTBTBMBMFNAPGCRCEW #design

Ultra-wide voltage range designs in fully-depleted silicon-on-insulator FETs (EB, AV, BG, OT, TB, YT, SB, GM, OB, YM, PF, JPN, FA, BPP, AG, SC, PR, JLC, SE, RW), pp. 613–618.

DATE-2013-PistorHRTSBGMPKSLPP #development

Development of a fully implantable recording system for ECoG signals (JP, JH, DR, ET, TS, DB, VGG, SM, DPD, AKK, MS, WL, KP, SP), pp. 893–898.

DocEng-2013-ConstantinPV #named

PDFX: fully-automated PDF-to-XML conversion of scientific literature (AC, SP, AV), pp. 177–180.

STOC-2013-Goyal #concurrent #simulation

Non-black-box simulation in the fully concurrent setting (VG), pp. 221–230.

STOC-2013-NeimanS #algorithm

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

OOPSLA-2013-ClebschD #concurrent #garbage collection #manycore

Fully concurrent garbage collection of actors on many-core machines (SC, SD), pp. 553–570.

POPL-2013-FournetSCDSL #compilation #javascript

Fully abstract compilation to JavaScript (CF, NS, JC, PÉD, PYS, BL), pp. 371–384.

POPL-2013-LivshitsC #automation #classification #security #towards

Towards fully automatic placement of security sanitizers and declassifiers (BL, SC), pp. 385–398.

CAV-2013-EsparzaLNNSS #execution #ltl #model checking

A Fully Verified Executable LTL Model Checker (JE, PL, RN, TN, AS, JGS), pp. 463–478.

CAV-2013-HolikLRSV #analysis #automation #automaton

Fully Automated Shape Analysis Based on Forest Automata (LH, OL, AR, JS, TV), pp. 740–755.

CSL-2013-Nishimura #game studies #parallel #semantics

A Fully Abstract Game Semantics for Parallelism with Non-Blocking Synchronization on Shared Variables (SN), pp. 578–596.

ASE-2012-BauersfeldV #automation #java #library #named #robust #testing #user interface

GUITest: a Java library for fully automated GUI robustness testing (SB, TEJV), pp. 330–333.

ASE-2012-FalconeC #android #aspect-oriented #embedded #in the cloud #programming

Weave droid: aspect-oriented programming on Android devices: fully embedded or in the cloud (YF, SC), pp. 350–353.

PLDI-2012-PradelG #automation #concurrent #detection #precise #safety #thread

Fully automatic and precise detection of thread safety violations (MP, TRG), pp. 521–530.

STOC-2012-AbrahamCG #approximate #distance #graph

Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels (IA, SC, CG), pp. 1199–1218.

STOC-2012-Lopez-AltTV #encryption #multi #on the fly

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption (ALA, ET, VV), pp. 1219–1234.

ICALP-v1-2012-Jez #pattern matching #performance

Faster Fully Compressed Pattern Matching by Recompression (AJ), pp. 533–544.

CAiSE-2012-Missikoff #enterprise #future of

The Future of Enterprise Systems in a Fully Networked Society (MM), pp. 1–18.

ICPR-2012-HayatBE #3d #automation #recognition

Fully automatic face recognition from 3D videos (MH, MB, AAES), pp. 1415–1418.

ICPR-2012-KanekoSOFS #consistency #process #recognition

Consistent collective activity recognition with fully connected CRFs (TK, MS, SO, RF, TS), pp. 2792–2795.

ICPR-2012-LiSY #detection #invariant

A Fully Affine Invariant Feature detector (WL, ZS, JY), pp. 2768–2771.

POPL-2012-Balabonski #approach #lazy evaluation

A unified approach to fully lazy sharing (TB), pp. 469–480.

HPCA-2012-MaJW12a #adaptation #algorithm #design #performance

Whole packet forwarding: Efficient design of fully adaptive routing algorithms for networks-on-chip (SM, NDEJ, ZW), pp. 467–478.

LICS-2012-SchalkS #linear #logic #modelling #multi

Constructing Fully Complete Models for Multiplicative Linear Logic (AS, HPS), pp. 571–580.

DATE-2011-RahimiLKB #clustering #network

A fully-synthesizable single-cycle interconnection network for Shared-L1 processor clusters (AR, IL, MRK, LB), pp. 491–496.

CIKM-2011-TretyakovAGVD #estimation #graph #performance #scalability

Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.

POPL-2011-CousotCL #analysis #array #automation #parametricity #scalability #segmentation

A parametric segmentation functor for fully automatic and scalable array content analysis (PC, RC, FL), pp. 105–118.

CAV-2011-MorbePS #automaton #model checking

Fully Symbolic Model Checking for Timed Automata (GM, FP, CS), pp. 616–632.

DAC-2010-WohlWNG

Fully X-tolerant, very high scan compression (PW, JAW, FN, EG), pp. 362–367.

DATE-2010-ThonnartVC #framework #integration #power management

A fully-asynchronous low-power framework for GALS NoC integration (YT, PV, FC), pp. 33–38.

ICST-2010-EldhBSHP #automation #scalability #towards

Towards Fully Automated Test Management for Large Complex Systems (SE, JB, MS, HH, SP), pp. 412–420.

CASE-2009-CappelleriHSKEK #automation #towards

Towards fully automated phototransfection (DJC, ÁMH, JYS, TKK, JE, VK), pp. 202–207.

DAC-2009-HuLA #approximate #polynomial

A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion (SH, ZL, CJA), pp. 424–429.

DATE-2009-BonnaudS #design

Cross-coupling in 65nm fully integrated EDGE System On Chip Design and cross-coupling prevention of complex 65nm SoC (PHB, GS), pp. 1045–1050.

DATE-2009-KasperskiPDS #architecture #configuration management #development #flexibility

High data rate fully flexible SDR modem advanced configurable architecture & development methodology (FK, OP, FD, MS), pp. 1040–1044.

DATE-2009-KeCG #configuration management #design

A design methodology for fully reconfigurable Delta-Sigma data converters (YK, JC, GGEG), pp. 1379–1384.

SIGMOD-2009-XuLWB #named #xml

DDE: from dewey to a fully dynamic XML labeling scheme (LX, TWL, HW, ZB), pp. 719–730.

STOC-2009-Gentry #encryption #using

Fully homomorphic encryption using ideal lattices (CG), pp. 169–178.

HPCA-2009-FidalgoVM #adaptation #multi #named #network

MRR: Enabling fully adaptive multicast routing for CMP interconnection networks (PAF, VP, JÁG), pp. 355–366.

HPDC-2009-SaballusF #distributed #graph #maintenance

Maintaining reference graphs of globally accessible objects in fully decentralized distributed systems (BS, TF), pp. 59–60.

LICS-2009-Dominguez #calculus #logic #polymorphism #similarity

Fully Abstract Logical Bisimilarity for a Polymorphic Object Calculus (LD), pp. 81–90.

LICS-2009-NainV #semantics

Trace Semantics is Fully Abstract (SN, MYV), pp. 59–68.

RTA-2009-Lopez-FraguasRS #semantics

A Fully Abstract Semantics for Constructor Systems (FJLF, JRH, JSH), pp. 320–334.

DAC-2008-FaviC #communication

Techniques for fully integrated intra-/inter-chip optical communication (CF, EC), pp. 343–344.

ICML-2008-LoeffFR #approximate #learning #named

ManifoldBoost: stagewise function approximation for fully-, semi- and un-supervised learning (NL, DAF, DR), pp. 600–607.

ICML-2008-WolfeHK #dataset #distributed #scalability

Fully distributed EM for very large datasets (JW, AH, DK), pp. 1184–1191.

ICPR-2008-HortaMF #algorithm #clustering #comparison #image #using

A comparison of clustering fully polarimetric SAR images using SEM algorithm and G0P mixture modelwith different initializations (MMH, NDAM, ACF), pp. 1–4.

POPL-2008-FisherWZW #ad hoc #automation #generative

From dirt to shovels: fully automatic tool generation from ad hoc data (KF, DW, KQZ, PW), pp. 421–434.

FSE-2008-GabelS #automation #mining #named

Javert: fully automatic mining of general temporal properties from dynamic traces (MG, ZS), pp. 339–349.

DAC-2007-AndrikosLPS

A Fully-Automated Desynchronization Flow for Synchronous Circuits (NA, LL, DP, CPS), pp. 982–985.

DATE-2007-EeckelaertSGSS #performance #synthesis

An efficient methodology for hierarchical synthesis of mixed-signal systems with fully integrated building block topology selection (TE, RS, GGEG, MS, WMCS), pp. 81–86.

ITiCSE-2007-CrescenziN #algorithm #experience #visualisation

Fully integrating algorithm visualization into a cs2 course.: a two-year experience (PC, CN), pp. 296–300.

ICALP-2007-Elkin #algorithm #maintenance #streaming

Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners (ME), pp. 716–727.

ICALP-2007-FurukawaA #black box #encryption

Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys (JF, NA), pp. 496–508.

ICALP-2007-Laird #semantics

A Fully Abstract Trace Semantics for General References (JL), pp. 667–679.

HPCA-2007-GaneshJWJ #architecture #comprehension #memory management #scalability

Fully-Buffered DIMM Memory Architectures: Understanding Mechanisms, Overheads and Scaling (BG, AJ, DW, BLJ), pp. 109–120.

DAC-2006-AnanthanR #physics #process

A fully physical model for leakage distribution under process variations in Nanoscale double-gate CMOS (HA, KR), pp. 413–418.

DAC-2006-LiuCLLW #design #mobile #video

Design of a 125muW, fully-scalable MPEG-2 and H.264/AVC video decoder for mobile applications (TML, CCC, CYL, TAL, SZW), pp. 288–289.

DAC-2006-NieuwoudtRM #named #optimisation #synthesis

SOC-NLNA: synthesis and optimization for fully integrated narrow-band CMOS low noise amplifiers (AN, TR, YM), pp. 879–884.

DATE-2006-BernasconiCDV #network #performance

Efficient minimization of fully testable 2-SPP networks (AB, VC, RD, TV), pp. 1300–1305.

DATE-DF-2006-Daglio #design #embedded #verification

A complete and fully qualified design flow for verification of mixed-signal SoC with embedded flash memories (PD), pp. 94–99.

TACAS-2006-OuaknineW #decidability #logic #metric #safety

Safety Metric Temporal Logic Is Fully Decidable (JO, JW), pp. 411–425.

FM-2006-LundS #diagrams #semantics #sequence chart #uml

A Fully General Operational Semantics for UML 2.0 Sequence Diagrams with Potential and Mandatory Choice (MSL, KS), pp. 380–395.

SAC-2006-NoiaSCTD #framework #image #retrieval #semantics

A framework for content-based image retrieval fully exploiting the semantics of annotation (TDN, EDS, FdC, ET, FMD), pp. 1709–1710.

TestCom-2006-RosiereJP #testing

LaTe, a Non-fully Deterministic Testing Language (EdR, CJ, BP), pp. 71–86.

DATE-2005-StagniGLBR #design #detection

Hardware-Software Design of a Smart Sensor for Fully-Electronic DNA Hybridization Detection (CS, CG, ML, LB, BR), pp. 198–203.

ESOP-2005-JeffreyR #java #semantics

Java Jr: Fully Abstract Trace Semantics for a Core Java Language (AJ, JR), pp. 423–438.

STOC-2005-Thorup #worst-case

Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.

ICALP-2005-BaldamusPV #encoding #π-calculus

A Fully Abstract Encoding of the π-Calculus with Data Terms (MB, JP, BV), pp. 1202–1213.

ICALP-2005-GairingLMT #equilibrium #nash

Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture (MG, TL, BM, KT), pp. 51–65.

CEFP-2005-KoopmanP #automation #specification #testing

Fully Automatic Testing with Functions as Specifications (PWMK, RP), pp. 35–61.

LICS-2005-Mellies #game studies #linear #logic

Asynchronous Games 4: A Fully Complete Model of Propositional Linear Logic (PAM), pp. 386–395.

VLDB-2004-SismanisR #complexity

The Complexity of Fully Materialized Coalesced Cubes (YS, NR), pp. 540–551.

STOC-2004-RodittyZ #algorithm #graph #linear #reachability

A fully dynamic reachability algorithm for directed graphs with an almost linear update time (LR, UZ), pp. 184–191.

KDD-2004-ChakrabartiPMF #automation

Fully automatic cross-associations (DC, SP, DSM, CF), pp. 79–88.

LOPSTR-2004-CraigGLH #analysis #automation #prolog

Fully Automatic Binding-Time Analysis for Prolog (SJC, JPG, ML, KSH), pp. 53–68.

DAC-2003-HenftlingZBZE #architecture

Re-use-centric architecture for a fully accelerated testbench environment (RH, AZ, MB, MZ, WE), pp. 372–375.

DAC-2003-KornarosPNZ #memory management #multi #optimisation #programmable #queue

A fully-programmable memory management system optimizing queue handling at multi-gigabit rates (GK, IP, AN, NZ), pp. 54–59.

DATE-2003-CornoCRS #automation #generative

Fully Automatic Test Program Generation for Microprocessor Cores (FC, GC, MSR, GS), pp. 11006–11011.

DATE-2003-DaglioR #bottom-up #design #top-down

A Fully Qualified Top-Down and Bottom-Up Mixed-Signal Design Flow for Non Volatile Memories Technologies (PD, CR), pp. 20274–20279.

DATE-2003-RettbergZBL #architecture #embedded #pipes and filters #self

A Fully Self-Timed Bit-Serial Pipeline Architecture for Embedded Systems (AR, MCZ, CB, TL), pp. 11130–11131.

CAV-2003-SeshiaB #automaton #bound #model checking #using

Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods (SAS, REB), pp. 154–166.

TLCA-2003-Laird #domain model

A Fully Abstract Bidomain Model of Unary FPC (JL), pp. 211–225.

ICPR-v3-2002-CaputoBN #markov #random #recognition #robust #using

Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field (BC, SB, HN), pp. 565–568.

CSL-2002-McCusker #relational

A Fully Abstract Relational Model of Syntactic Control of Interference (GM), pp. 247–261.

LICS-2002-JeffreyR #concurrent #semantics #testing

A Fully Abstract May Testing Semantics for Concurrent Objects (AJ, JR), pp. 101–112.

VMCAI-2002-CoppoD #higher-order #mobile

A Fully Abstract Model for Higher-Order Mobile Ambients (MC, MDC), pp. 255–271.

ITiCSE-2001-SaikkonenMK #assessment #automation #programming

Fully automatic assessment of programming exercises (RS, LM, AK), pp. 133–136.

STOC-2001-Thorup

Fully-dynamic min-cut (MT), pp. 224–230.

CSL-2001-AbramskyL #modelling #λ-calculus

Fully Complete Minimal PER Models for the Simply Typed λ-Calculus (SA, ML), pp. 443–457.

LICS-2001-Laird #exception #game studies #semantics

A Fully Abstract Game Semantics of Local Exceptions (JL), pp. 105–114.

TLCA-2001-Haghverdi #category theory #linear #logic #modelling

Partially Additive Categories and Fully Complete Models of Linear Logic (EH), pp. 197–216.

TACAS-2000-Wang #data type #performance #realtime #verification

Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems (FW), pp. 157–171.

STOC-2000-Thorup #graph

Near-optimal fully-dynamic graph connectivity (MT), pp. 343–350.

ICALP-2000-LuttgenM #modelling #semantics

Fully-Abstract Statecharts Semantics via Intuitionistic Kripke Models (GL, MM), pp. 163–174.

ICFP-2000-TrifonovSS #analysis #reflexive

Fully reflexive intensional type analysis (VT, BS, ZS), pp. 82–93.

ICEIS-2000-PazdzioraB #information management

University Information System Fully Based on WWW (JP, MB), pp. 467–471.

ICPR-v3-2000-LoretteDZ #clustering #fuzzy

Fully Unsupervised Fuzzy Clustering with Entropy Criterion (AL, XD, JZ), pp. 3998–4001.

ICPR-v4-2000-SziranyiC #optimisation #parallel #segmentation #using

Spatio-Temporal Segmentation with Edge Relaxation and Optimization Using Fully Parallel Methods (TS, LC), pp. 4820–4823.

SAC-2000-DeifKSB

Optical Hierarchical Fully Shuffled Tree (SHD, OHK, SIS, AEMYB), pp. 667–676.

CSL-2000-AbramskyL #ml #polymorphism

A Fully Complete PER Model for ML Polymorphic Types (SA, ML), pp. 140–155.

STOC-1999-KingS #algorithm #maintenance #transitive

A Fully Dynamic Algorithm for Maintaining the Transitive Closure (VK, GS), pp. 492–498.

ICFP-1999-Shao

Transparent Modules with Fully Syntactic Signatures (ZS), pp. 220–232.

LICS-1999-HarmerM #finite #game studies #nondeterminism #semantics

A Fully Abstract Game Semantics for Finite Nondeterminism (RH, GM), pp. 422–430.

RTA-1999-Rubio

A Fully Syntactic AC-RPO (AR), pp. 133–147.

DATE-1998-StrakaMVS #metric

A Fully Digital Controlled Off-Chip IDDQ Measurement Unit (BS, HARM, JV, MS), pp. 495–500.

TACAS-1998-LiuRS #evaluation #fixpoint #performance

Fully Local and Efficient Evaluation of Alternating Fixed Points (Extended Abstract) (XL, CRR, SAS), pp. 5–19.

STOC-1998-HolmLT #algorithm

Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.

TAGT-1998-GadducciHK #logic

A Fully Abstract Model for Graph-Interpreted Temporal Logic (FG, RH, MK), pp. 310–322.

ICPR-1998-PengZB #automation #recognition

A fully automated face recognition system under different conditions (HP, CZ, ZB), pp. 1223–1225.

LICS-1998-AbramskyHM #game studies #semantics

A Fully Abstract Game Semantics for General References (SA, KH, GM), pp. 334–344.

DAC-1997-FangW #clustering #design #multi

Multi-Way FPGA Partitioning by Fully Exploiting Design Hierarchy (WJF, ACHW), pp. 518–521.

DAC-1997-GuruswamyMDRCFJ #automation #layout #library #named #standard #synthesis

CELLERITY: A Fully Automatic Layout Synthesis System for Standard Cell Libraries (MG, RLM, DD, SR, VC, AF, LGJ), pp. 327–332.

IFL-1997-Erwig #graph #persistent #question

Fully Persistent Graphs — Which One To Choose? (ME), pp. 123–140.

CAV-1997-BaierH #bisimulation #probability #process

Weak Bisimulation for Fully Probabilistic Processes (CB, HH), pp. 119–130.

TACAS-1996-Margaria #automation #detection #fault

Fully Automatic Verifcation and Error Detection for Parameterized Iterative Sequential Circuits (TMS), pp. 258–277.

CAiSE-1996-KellyLR #automation #configuration management #multi

MetaEdit+: A Fully Configurable Multi-User and Multi-Tool CASE and CAME Environment (SK, KL, MR), pp. 1–21.

CAV-1996-MillerK

Saving Space by Fully Exploiting Invisible Transitions (HM, SK), pp. 336–347.

LICS-1996-FioreMS #π-calculus

A Fully-Abstract Model for the π-Calculus (Extended Abstract) (MPF, EM, DS), pp. 43–54.

LICS-1996-Stark #abstract domain #domain model #π-calculus

A Fully Abstract Domain Model for the π-Calculus (IS), pp. 36–42.

DAC-1995-VinnakotaHS #design #difference

System-Level Design for Test of Fully Differential Analog Circuits (BV, RH, NJS), pp. 450–454.

STOC-1995-FerraginaG #data type #string

A fully-dynamic data structure for external substring search (Extended Abstract) (PF, RG), pp. 693–702.

STOC-1995-Karger #approximate #network #polynomial #problem #random #reliability

A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.

ICALP-1995-NikoletseasRSY #graph #memory management #probability

Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time (SEN, JHR, PGS, MY), pp. 159–170.

POPL-1995-Leroy #higher-order

Applicative Functors and Fully Transparent Higher-Order Modules (XL), pp. 142–153.

LICS-1995-Jeffrey #concurrent #functional #monad #semantics

A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types (AJ), pp. 255–264.

RTA-1995-Bellegarde #automation #named #program transformation #towards

ASTRE: Towards a Fully Automated Program Transformation System (FB), pp. 403–407.

TLCA-1995-RitterP #ml #standard #λ-calculus

A Fully Abstract Translation between a λ-Calculus with Reference Types and Standard ML (ER, AMP), pp. 397–413.

DAC-1994-KamVBS #algorithm

A Fully Implicit Algorithm for Exact State Minimization (TK, TV, RKB, ALSV), pp. 684–690.

ESOP-1994-OHearnR #morphism #parametricity #polymorphism

Fully Abstract Translations and Parametric Polymorphism (PWO, JGR), pp. 454–468.

STOC-1994-Rauch #data type

Improved data structures for fully dynamic biconnectivity (MR), pp. 686–695.

AdaEurope-1994-Bondeli #ada #communication #reuse

A Fully Reusable Class of Objects for Synchronization and Communication in Ada 9X (PdB), pp. 355–386.

LICS-1994-Jeffrey #concurrent #graph #reduction #semantics

A Fully Abstract Semantics for Concurrent Graph Reduction (AJ), pp. 82–91.

STOC-1993-GarayM #polynomial

Fully polynomial Byzantine agreement in t+1 rounds (JAG, YM), pp. 31–41.

HCI-ACS-1993-GamoSKMH #automation #collaboration

Collaboration of Line and Staff in Fully Automated VLSI Factory (YG, WS, KK, HM, TH), pp. 540–545.

TOOLS-EUROPE-1993-CollierLMSS #object-oriented

A Fully Object-Oriented CAD System For Telephone Engineers (GHC, MDPL, HM, DS, ES), pp. 95–108.

SAC-1993-WuD #database #interface #named #object-oriented #visual notation

InGRAPH: Graphical Interface for a Fully Object-Oriented Database System (XW, GD), pp. 318–325.

HPDC-1993-LeeRN #distributed #parallel

A Fully Distributed Parallel Ray Tracing Scheme on the Delta Touchstone Machine (TYL, CSR, JBN), pp. 129–134.

TLCA-1993-JungS

Studying the Fully Abstract Model of PCF within its Continuous Function Model (AJ, AS), pp. 230–244.

ESOP-1992-Chuang #array #incremental #performance #persistent

Fully Persistent Arrays for Efficient Incremental Updates and Voluminous Reads (TRC), pp. 110–129.

PEPM-1992-Chin #higher-order #lazy evaluation

Fully Lazy Higher-Order Removal (WNC), pp. 38–47.

STOC-1992-GalilIS #testing

Fully Dynamic Planarity Testing (Extended Abstract) (ZG, GFI, NS), pp. 495–506.

CAiSE-1992-BorrasDP #database #object-oriented #programming

A Fully Integrated Programming Environment for an Object-Oriented Database (PB, AD, PP), pp. 33–47.

PLILP-1992-Plaza #declarative #logic programming

Fully Declarative Logic Programming (JAP), pp. 415–427.

SIGMOD-1991-LankaM #persistent

Fully Persistent B+-trees (SL, EM), pp. 426–435.

STOC-1991-GalilI #algorithm #problem

Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract) (ZG, GFI), pp. 317–327.

POPL-1991-Riecke #functional

Fully Abstract Translations between Functional Languages (JGR), pp. 245–254.

DAC-1990-WeyDC #design

Design of Repairable and Fully Diagnosable Folded PLAs for Yield Enhancement (CLW, JD, TYC), pp. 327–332.

ECOOP-1989-Yelland #object-oriented #semantics #towards

First Steps Towards Fully Abstract Semantics for Object-Oriented Languages (PMY), pp. 347–364.

POPL-1989-GaifmanS #composition #logic programming #semantics #source code

Fully Abstract Compositional Semantics for Logic Programs (HG, EYS), pp. 134–142.

POPL-1989-Jonsson #data flow #network

A Fully Abstract Trace Model for Dataflow Networks (BJ), pp. 155–165.

LICS-1989-JagadeesanPP #functional #logic #semantics

A Fully Abstract Semantics for a Functional Language with Logic Variables (RJ, PP, KP), pp. 294–303.

DAC-1988-WehnGCMR

A Defect-Tolerant and Fully Testable PLA (NW, MG, KC, PM, AR), pp. 22–33.

POPL-1988-MeyerS #semantics #towards

Towards Fully Abstract Semantics for Local Variables (ARM, KS), pp. 191–203.

JICSCP-1988-RamanS88 #distributed #execution #logic #problem

Fully Distributed, AND/OR-Parallel Execution of Logic Problems (PR, EWS), pp. 1188–1203.

LICS-1988-GerthCLS #concurrent #prolog #semantics

Fully Abstract Denotational Semantics for Flat Concurrent Prolog (RG, MC, YL, EYS), pp. 320–335.

DAC-1985-DwyerMBG #array #automation #design #integration

The integration of an advanced gate array router into a fully automated design system (RD, SM, EB, DG), pp. 770–772.

DAC-1985-EntenmanD #automation

A fully automatic hierarchical compactor (GE, SWD), pp. 69–75.

POPL-1981-LehmannR #distributed #on the #problem #symmetry

On the Advantages of Free Choice: A Symmetric and Fully Distributed Solution to the Dining Philosophers Problem (DJL, MOR), pp. 133–138.

VLDB-1979-Svensson #on the #order #performance #query

On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.

DAC-1976-PattersonP #automation

A proven operational CAD system for P.W.B. design-based on a mini-computer and featuring fully automatic placement and routing (GLP, BHP), pp. 259–264.