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:
context (176)
languag (106)
grammar (77)
use (56)
model (49)

Stem free$ (all stems)

778 papers:

CASECASE-2015-GiulianiC #optimisation #problem
Derivative-free optimization with use of problem structure: Applications to oil production (CMG, EC), pp. 764–768.
CASECASE-2015-Lee #locality #mobile #reliability
A reliable range-free indoor localization method for mobile robots (YCL), pp. 720–727.
CASECASE-2015-QiuZL #modelling
Visible light communication-based indoor environment modeling and metric-free path planning (KQ, FZ, ML), pp. 200–205.
CASECASE-2015-UenoGATIK #video
Motion-blur-free microscopic video shooting based on frame-by-frame intermittent tracking (TU, QG, TA, TT, II, TK), pp. 837–842.
PODSPODS-2015-KoutrisW #complexity #consistency #constraints #query #self
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.
VLDBVLDB-2015-MakreshanskiLS #hardware #memory management #transaction
To Lock, Swap, or Elide: On the Interplay of Hardware Transactional Memory and Lock-Free Indexing (DM, JJL, RS), pp. 1298–1309.
VLDBVLDB-2015-WuJLZ #community #detection #robust
Robust Local Community Detection: On Free Rider Effect and Its Elimination (YW, RJ, JL, XZ), pp. 798–809.
VLDBVLDB-2015-YoonMB #database #named
DBSeer: Pain-free Database Administration through Workload Intelligence (DYY, BM, DPB), pp. 2036–2047.
TACASTACAS-2015-UnnoT #horn clause #recursion
Inferring Simple Solutions to Recursion-Free Horn Clauses via Sampling (HU, TT), pp. 149–163.
SCAMSCAM-J-2013-CeruloPBCC15 #detection #markov #named
Irish: A Hidden Markov Model to detect coded information islands in free text (LC, MDP, AB, MC, GC), pp. 26–43.
ICSMEICSME-2015-TianNLH #android #case study #what
What are the characteristics of high-rated apps? A case study on free Android Applications (YT, MN, DL, AEH), pp. 301–310.
SANERSANER-2015-Keivanloo0Z #clone detection #detection #java #repository #scalability
Threshold-free code clone detection for a large-scale heterogeneous Java repository (IK, FZ, YZ), pp. 201–210.
CIAACIAA-2015-Prusa #context-free grammar #decidability #multi #problem
(Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (DP), pp. 250–262.
DLTDLT-2015-EremondiIM #on the
On the Density of Context-Free and Counter Languages (JE, OHI, IM), pp. 228–239.
DLTDLT-2015-JirasekJ #bound
The Boundary of Prefix-Free Languages (JJ, GJ), pp. 300–312.
ICALPICALP-v1-2015-0001GR #graph #morphism
Counting Homomorphisms to Square-Free Graphs, Modulo 2 (AG, LAG, DR), pp. 642–653.
ICALPICALP-v1-2015-AnshelevichKS #approximate #scalability
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare (EA, KK, SS), pp. 52–64.
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.
ICALPICALP-v1-2015-KarpinskiLS #set
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (MK, AL, DS), pp. 785–796.
ICALPICALP-v2-2015-BringmannFHRS #network
Ultra-Fast Load Balancing on Scale-Free Networks (KB, TF, MH, RR, TS), pp. 516–527.
ICALPICALP-v2-2015-CiobanuDE #equation #set
Solution Sets for Equations over Free Groups are EDT0L Languages (LC, VD, ME), pp. 134–145.
ICALPICALP-v2-2015-SwernofskyW #complexity #on the
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages (JS, MW), pp. 414–426.
LATALATA-2015-GodinKP #automaton #on the
On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata (TG, IK, MP), pp. 328–339.
LATALATA-2015-MikulskiPR #commutative #word
Square-Free Words over Partially Commutative Alphabets (LM, MP, WR), pp. 424–435.
ICFPICFP-2015-BowmanA #for free
Noninterference for free (WJB, AA), pp. 101–113.
ICFPICFP-2015-NewtonFV #adaptation #scalability
Adaptive lock-free maps: purely-functional to scalable (RRN, PPF, AV), pp. 218–229.
GaMGaM-2015-KissingerZ #exclamation
!-graphs with trivial overlap are context-free (AK, VZ), pp. 16–31.
ICGTICGT-2015-KissingerZ #diagrams #equation #product line #reasoning #string
Equational Reasoning with Context-Free Families of String Diagrams (AK, VZ), pp. 138–154.
CHICHI-2015-CorstenCKB #named
HaptiCase: Back-of-Device Tactile Landmarks for Eyes-Free Absolute Indirect Touch (CC, CC, TK, JOB), pp. 2171–2180.
CHICHI-2015-ZhengFSDYG #maintenance
Eye-Wearable Technology for Machine Maintenance: Effects of Display Position and Hands-free Operation (XSZ, CF, PMdS, SD, TY, SG), pp. 2125–2134.
CSCWCSCW-2015-FilippovaC #open source
Mudslinging and Manners: Unpacking Conflict in Free and Open Source Software (AF, HC), pp. 1393–1403.
HCILCT-2015-LaugassonM #usability #user interface
Free Software User Interfaces: Usability and Aesthetics (EL, MM), pp. 676–686.
ICMLICML-2015-TangSX #learning #network
Learning Scale-Free Networks by Dynamic Node Specific Degree Prior (QT, SS, JX), pp. 2247–2255.
ICMLICML-2015-WangFS #for free #monte carlo #privacy #probability
Privacy for Free: Posterior Sampling and Stochastic Gradient Monte Carlo (YXW, SEF, AJS), pp. 2493–2502.
SIGIRSIGIR-2015-TangJLZL #personalisation #recommendation
Personalized Recommendation via Parameter-Free Contextual Bandits (LT, YJ, LL, CZ, TL), pp. 323–332.
MODELSMoDELS-J-2011-Steimann15 #refactoring
From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.
MODELSMoDELS-J-2011-Steimann15 #refactoring
From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.
OOPSLAOOPSLA-2015-CohenP #automation #data type #memory management
Automatic memory reclamation for lock-free data structures (NC, EP), pp. 260–279.
OOPSLAOOPSLA-2015-GveroK #java #query
Synthesizing Java expressions from free-form queries (TG, VK), pp. 416–432.
PPDPPPDP-2015-GrandeBS #concurrent #library #thread
Jthread, a deadlock-free mutex library (JG, GB, MS), pp. 149–160.
PPDPPPDP-2015-MeiklejohnR #coordination #distributed #named #programming
Lasp: a language for distributed, coordination-free programming (CM, PVR), pp. 184–195.
POPLPOPL-2015-BastaniAA #context-free grammar #reachability #specification #using
Specification Inference Using Context-Free Language Reachability (OB, SA, AA), pp. 553–566.
SACSAC-2015-BarringtonFD #multi #scalability
A scalable multi-producer multi-consumer wait-free ring buffer (AB, SDF, DD), pp. 1321–1328.
ICSEICSE-v2-2015-GveroK #interactive #query #synthesis #using
Interactive Synthesis Using Free-Form Queries (TG, VK), pp. 689–692.
ICSEICSE-v2-2015-MinelliML #developer
Free Hugs — Praising Developers for Their Actions (RM, AM, ML), pp. 555–558.
ASPLOSASPLOS-2015-FletcherRKDD #ram #recursion #verification
Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM (CWF, LR, AK, MvD, SD), pp. 103–116.
ASPLOSASPLOS-2015-GoiriNB #for free #named
CoolAir: Temperature- and Variation-Aware Management for Free-Cooled Datacenters (IG, TDN, RB), pp. 253–265.
ASPLOSASPLOS-2015-MorrisonA #bound #symmetry
Temporally Bounding TSO for Fence-Free Asymmetric Synchronization (AM, YA), pp. 45–58.
CCCC-2015-AckermannRMS #java #optimisation #runtime
A Backend Extension Mechanism for PQL/Java with Free Run-Time Optimisation (HA, CR, CM, YS), pp. 111–130.
CCCC-2015-HollingumS #context-free grammar #framework #reachability #scalability #towards
Towards a Scalable Framework for Context-Free Language Reachability (NH, BS), pp. 193–211.
CCCC-2015-PingaliB #context-free grammar #parsing #visual notation
A Graphical Model for Context-Free Grammar Parsing (KP, GB), pp. 3–27.
CGOCGO-2015-TangZLLHLG #multi #optimisation
Optimizing and auto-tuning scale-free sparse matrix-vector multiplication on Intel Xeon Phi (WTT, RZ, ML, YL, HPH, XL, RSMG), pp. 136–145.
HPCAHPCA-2015-FujiwaraKOMC #network
Augmenting low-latency HPC network with free-space optical links (IF, MK, TO, HM, HC), pp. 390–401.
HPCAHPCA-2015-KimE #performance #reliability #trade-off
Balancing reliability, cost, and performance tradeoffs with FreeFault (DWK, ME), pp. 439–450.
LCTESLCTES-2015-ManilovFMA
Free Rider: A Tool for Retargeting Platform-Specific Intrinsic Functions (SM, BF, AM, CA), p. 10.
PPoPPPPoPP-2015-0003GTT #queue
The lock-free k-LSM relaxed priority queue (MW, JG, JLT, PT), pp. 277–278.
PPoPPPPoPP-2015-McPhersonNSC #detection #legacy #source code
Fence placement for legacy data-race-free programs via synchronization read detection (AJM, VN, SS, MC), pp. 249–250.
CADECADE-2015-EchenimPT #equation #generative #logic #quantifier
Quantifier-Free Equational Logic and Prime Implicate Generation (ME, NP, ST), pp. 311–325.
CSLCSL-2015-BaazF #logic
Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.
TLCATLCA-2015-AfshariHL #context-free grammar
Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.
TLCATLCA-2015-CastellanCD #similarity
Undecidability of Equality in the Free Locally Cartesian Closed Category (SC, PC, PD), pp. 138–152.
DACDAC-2014-LiuHM #detection #hardware #statistics
Hardware Trojan Detection through Golden Chip-Free Statistical Side-Channel Fingerprinting (YL, KH, YM), p. 6.
SIGMODSIGMOD-2014-AlagiannisIA #adaptation #named
H2O: a hands-free adaptive store (IA, SI, AA), pp. 1103–1114.
SIGMODSIGMOD-2014-LiPJ #sql
Schema-free SQL (FL, TP, HVJ), pp. 1051–1062.
VLDBVLDB-2014-JiangFWX #distance #network #query
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks (MJ, AWCF, RCWW, YX), pp. 1203–1214.
VLDBVLDB-2014-LinK #on the #query
On Arbitrage-free Pricing for General Data Queries (BRL, DK), pp. 757–768.
MSRMSR-2014-RoblesGCCI #case study #development #mining #open source #repository
Estimating development effort in Free/Open source software projects by mining software repositories: a case study of OpenStack (GR, JMGB, CC, AC, DIC), pp. 222–231.
MSRMSR-2014-RoblesRSVG #bibliography #challenge #dataset
FLOSS 2013: a survey dataset about free software contributors: challenges for curating, sharing, and combining (GR, LAR, AS, BV, JMGB), pp. 396–399.
STOCSTOC-2014-AbrahamGGNT #composition #graph
Cops, robbers, and threatening skeletons: padded decomposition for minor-free graphs (IA, CG, AG, ON, KT), pp. 79–88.
STOCSTOC-2014-AlistarhCS #algorithm #concurrent #question
Are lock-free concurrent algorithms practically wait-free? (DA, KCH, NS), pp. 714–723.
DLTDLT-J-2013-BertoniCD14 #automaton #context-free grammar #decidability #on the #problem #quantum
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages (AB, CC, FD), pp. 1065–1082.
DLTDLT-J-2013-DrosteV14 #context-free grammar #theorem
The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 955–970.
AFLAFL-2014-DuS #infinity #similarity #word
Similarity density of the Thue-Morse word with overlap-free infinite binary words (CFD, JS), pp. 231–245.
CIAACIAA-2014-JiraskovaPS
Kleene Closure on Regular and Prefix-Free Languages (GJ, MP, JS), pp. 226–237.
CIAACIAA-2014-Osterholzer #automaton #context-free grammar
Pushdown Machines for Weighted Context-Free Tree Translation (JO), pp. 290–303.
DLTDLT-2014-Sorokin #context-free grammar
Pumping Lemma and Ogden Lemma for Displacement Context-Free Grammars (AS), pp. 154–165.
ICALPICALP-v1-2014-Wulff-Nilsen #approximate #distance #graph #performance
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles (CWN), pp. 1063–1074.
IFMIFM-2014-TofanSR #composition #multi #proving
A Compositional Proof Method for Linearizability Applied to a Wait-Free Multiset (BT, GS, WR), pp. 357–372.
CHICHI-2014-RobinsonPJ14a #interactive #named
AudioCanvas: internet-free interactive audio photos (SR, JSP, MJ), pp. 3735–3738.
CSCWCSCW-2014-GanglbauerFSG #case study #community #network #social
Think globally, act locally: a case study of a free food sharing community and social networking (EG, GF, ÖS, FG), pp. 911–921.
HCIHCI-AIMT-2014-ErikssonLSSK #interface #question
Can User-Paced, Menu-free Spoken Language Interfaces Improve Dual Task Handling While Driving? (AE, AL, AS, AS, KK), pp. 394–405.
HCIHCI-AS-2014-CentieiroRDF #interactive
Bet without Looking: Studying Eyes-Free Interaction during Live Sports (PC, TR, AED, DF), pp. 581–592.
CIKMCIKM-2014-YaoRSLF #locality #probability
Exploring Tag-Free RFID-Based Passive Localization and Tracking via Learning-Based Probabilistic Approaches (LY, WR, QZS, XL, NJGF), pp. 1799–1802.
ICMLICML-c1-2014-DenisGH #bound #learning #matrix
Dimension-free Concentration Bounds on Hankel Matrices for Spectral Learning (FD, MG, AH), pp. 449–457.
ICPRICPR-2014-ChatbriKK #approach #documentation #image #independence #query
An Application-Independent and Segmentation-Free Approach for Spotting Queries in Document Images (HC, PWK, KK), pp. 2891–2896.
ICPRICPR-2014-LaiCCCSH
Appearance-Based Gaze Tracking with Free Head Movement (CCL, YTC, KWC, SCC, SWS, YPH), pp. 1869–1873.
ICPRICPR-2014-SharmaCL #3d #approach #generative #hybrid #novel
Kinect-Variety Fusion: A Novel Hybrid Approach for Artifacts-Free 3DTV Content Generation (MS, SC, BL), pp. 2275–2280.
ICPRICPR-2014-TegenWHOJMNA #image #segmentation #semantics #using
Image Segmentation and Labeling Using Free-Form Semantic Annotation (AT, RW, LH, MO, FJ, DM, PN, ), pp. 2281–2286.
ICPRICPR-2014-ZhuS #learning #recognition #taxonomy
Correspondence-Free Dictionary Learning for Cross-View Action Recognition (FZ, LS), pp. 4525–4530.
KDDKDD-2014-DalessandroCRPWP #learning #online #scalability
Scalable hands-free transfer learning for online advertising (BD, DC, TR, CP, MHW, FJP), pp. 1573–1582.
RecSysRecSys-2014-GueyeAN #algorithm #recommendation
A parameter-free algorithm for an optimized tag recommendation list size (MG, TA, HN), pp. 233–240.
RecSysRecSys-2014-LoniSLH #collaboration
“Free lunch” enhancement for collaborative filtering with factorization machines (BL, AS, ML, AH), pp. 281–284.
SIGIRSIGIR-2014-ZhangLY #documentation #ranking
A POMDP model for content-free document re-ranking (SZ, JL, HY), pp. 1139–1142.
ECOOPECOOP-2014-LeeKZ #concurrent #execution #multi
Infrastructure-Free Logging and Replay of Concurrent Execution on Multiple Cores (KHL, DK, XZ), pp. 232–256.
OOPSLAOOPSLA-2014-DavidTLM #profiling
Continuously measuring critical section pressure with the free-lunch profiler (FD, GT, JL, GM), pp. 291–307.
PPDPPPDP-2014-MehnerSSV #functional #parametricity #proving #theorem
Parametricity and Proving Free Theorems for Functional-Logic Languages (SM, DS, LS, JV), pp. 19–30.
PADLPADL-2014-AreiasR #correctness #logic programming #on the #performance #source code
On the Correctness and Efficiency of Lock-Free Expandable Tries for Tabled Logic Programs (MA, RR), pp. 168–183.
SACSAC-2014-BarddalGE #classification #concept #named #network #social
SFNClassifier: a scale-free social network method to handle concept drift (JPB, HMG, FE), pp. 786–791.
SACSAC-2014-RossiLR #algorithm #classification #network #using
A parameter-free label propagation algorithm using bipartite heterogeneous networks for text classification (RGR, AAL, SOR), pp. 79–84.
SLESLE-2014-Ridge #combinator #context-free grammar #parsing #performance #using
Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
ASPLOSASPLOS-2014-HowerHBGHRW #memory management #modelling
Heterogeneous-race-free memory models (DRH, BAH, BMB, BRG, MDH, SKR, DAW), pp. 427–440.
ASPLOSASPLOS-2014-MorrisonA #bound
Fence-free work stealing on bounded TSO processors (AM, YA), pp. 413–426.
PPoPPPPoPP-2014-LeeKZ #concurrent #execution #multi
Infrastructure-free logging and replay of concurrent execution on multiple cores (KHL, DK, XZ), pp. 371–372.
PPoPPPPoPP-2014-NatarajanM #concurrent #performance
Fast concurrent lock-free binary search trees (AN, NM), pp. 317–328.
PPoPPPPoPP-2014-TimnatP #data type #simulation
A practical wait-free simulation for lock-free data structures (ST, EP), pp. 357–368.
CAVCAV-2014-CernyHRRT #concurrent #synthesis
Regression-Free Synthesis for Concurrency (PC, TAH, AR, LR, TT), pp. 568–584.
RTARTA-TLCA-2014-CarvalhoS #decidability #polynomial #set
An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting (DdC, JGS), pp. 179–193.
RTARTA-TLCA-2014-CreusG #automation #context-free grammar #evaluation
Automatic Evaluation of Context-Free Grammars (System Description) (CC, GG), pp. 139–148.
CASECASE-2013-BjorkenstamGBCL #energy #industrial #performance #using
Energy efficient and collision free motion of industrial robots using optimal control (SB, DG, RB, JSC, BL), pp. 510–515.
CASECASE-2013-DevesseRFW #realtime
A real-time optimal control method for swing-free tower crane motions (WD, MR, LF, JW), pp. 336–341.
DRRDRR-2013-DelayeL #documentation #modelling #online
Context modeling for text/non-text separation in free-form online handwritten documents (AD, CLL).
DRRDRR-2013-KumarWGS #framework #keyword #using
Segmentation-free keyword spotting framework using dynamic background model (GK, SW, VG, RS).
DRRDRR-2013-SabbourS #approach
A segmentation-free approach to Arabic and Urdu OCR (NS, FS).
DRRDRR-2013-VasilopoulosK #classification
A classification-free word-spotting system (NV, EK).
HTHT-2013-JarukasemratanaML #algorithm #community #detection #distance #network
Community detection algorithm based on centrality and node distance in scale-free networks (SJ, TM, XL), pp. 258–262.
ICDARICDAR-2013-GarzFBI #approach #clustering
A Binarization-Free Clustering Approach to Segment Curved Text Lines in Historical Manuscripts (AG, AF, HB, RI), pp. 1290–1294.
ICDARICDAR-2013-HassnerWD
OCR-Free Transcript Alignment (TH, LW, ND), pp. 1310–1314.
ICDARICDAR-2013-MorillotLG #case study #comparative #recognition
Comparative Study of HMM and BLSTM Segmentation-Free Approaches for the Recognition of Handwritten Text-Lines (OM, LLS, EG), pp. 783–787.
ICDARICDAR-2013-PantkeMF #evaluation #on the #word
On Evaluation of Segmentation-Free Word Spotting Approaches without Hard Decisions (WP, VM, TF), pp. 1300–1304.
ICDARICDAR-2013-RothackerRF #documentation #word
Bag-of-Features HMMs for Segmentation-Free Word Spotting in Handwritten Documents (LR, MR, GAF), pp. 1305–1309.
ICDARICDAR-2013-ZhangT #documentation #kernel #keyword
Segmentation-Free Keyword Spotting for Handwritten Documents Based on Heat Kernel Signature (XZ, CLT), pp. 827–831.
ICDARICDAR-2013-ZhuSSGN #2d #online #recognition #using #word
Online Handwritten Cursive Word Recognition Using Segmentation-Free MRF in Combination with P2DBMN-MQDF (BZ, AS, SS, VG, MN), pp. 349–353.
SIGMODSIGMOD-2013-Horikawa #data type #design #evaluation #implementation
Latch-free data structures for DBMS: design, implementation, and evaluation (TH), pp. 409–420.
SCAMSCAM-2013-CeruloCPC #detection #markov
A Hidden Markov Model to detect coded information islands in free text (LC, MC, MDP, GC), pp. 157–166.
PEPMPEPM-2013-Garcia-PerezN #functional #reduction #semantics
A syntactic and functional correspondence between reduction semantics and reduction-free full normalisers (ÁGP, PN), pp. 107–116.
DLTDLT-J-2012-EsikO13 #context-free grammar #on the #word
On Context-Free Languages of Scattered Words (, SO), pp. 1029–1048.
DLTDLT-J-2012-HanKS13 #context-free grammar #regular expression
The Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 1067–1082.
DLTDLT-J-2012-LehtinenO13 #context-free grammar #morphism
Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 1049–1066.
CIAACIAA-2013-DeganoFM #model checking #towards
Towards Nominal Context-Free Model-Checking (PD, GLF, GM), pp. 109–121.
CIAACIAA-2013-HanKS #approximate #automaton #context-free grammar #finite
Approximate Matching between a Context-Free Grammar and a Finite-State Automaton (YSH, SKK, KS), pp. 146–157.
DLTDLT-2013-BertoniCD #automaton #context-free grammar #decidability #finite #linear #problem #quantum
Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem (AB, CC, FD), pp. 82–93.
DLTDLT-2013-DrosteV #context-free grammar #theorem
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages (MD, HV), pp. 203–214.
DLTDLT-2013-FulopM #composition #linear #top-down #transducer
Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
ICALPICALP-v2-2013-EtessamiSY #context-free grammar #probability #regular expression
Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method (KE, AS, MY), pp. 199–211.
ICALPICALP-v2-2013-PettieS #algorithm #distributed #graph #performance
Fast Distributed Coloring Algorithms for Triangle-Free Graphs (SP, HHS), pp. 681–693.
LATALATA-2013-Shamir
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars (ES), pp. 516–522.
ICFPICFP-2013-BernardyC #context-free grammar #divide and conquer #parsing #performance
Efficient divide-and-conquer parsing of practical context-free languages (JPB, KC), pp. 111–122.
CHICHI-2013-HirschIHR #3d #named
8D: interacting with a relightable glasses-free 3D display (MH, SI, HH, RR), pp. 2209–2212.
CHICHI-2013-LiangCCPCLYC13a #interactive #named
GaussBits: magnetic tangible bits for portable and occlusion-free near-surface interactions (RHL, KYC, LWC, CXP, MYC, RHL, DNY, BYC), pp. 1391–1400.
CHICHI-2013-PerraultLEG #gesture #interactive #named
Watchit: simple gestures and eyes-free interaction for wristwatches and bracelets (STP, EL, JE, YG), pp. 1451–1460.
CHICHI-2013-RoudautRSPLB #feedback #gesture #using
Gesture output: eyes-free output using a force feedback touch surface (AR, AR, CS, MP, PL, PB), pp. 2547–2556.
CHICHI-2013-ZoranP #named
FreeD: a freehand digital sculpting tool (AZ, JAP), pp. 2613–2616.
CSCWCSCW-2013-Wiggins #constraints
Free as in puppies: compensating for ict constraints in citizen science (AW), pp. 1469–1480.
HCIHCI-AMTE-2013-Teixeira-FariaI #component #design #interface #prototype #specification
An Interface Prototyper Supporting Free Design Components Specification (PMTF, JRI), pp. 490–499.
HCIHCI-IMT-2013-EbisawaF #detection #using #video
Head-Free, Remote Gaze Detection System Based on Pupil-Corneal Reflection Method with Using Two Video Cameras — One-Point and Nonlinear Calibrations (YE, KF), pp. 205–214.
ICMLICML-c1-2013-Jaggi #optimisation
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization (MJ), pp. 427–435.
PPDPPPDP-2013-MatsudaW #approach #bidirectional #for free #problem #runtime
Bidirectionalization for free with runtime recording: or, a light-weight approach to the view-update problem (KM, MW), pp. 297–308.
PPoPPPPoPP-2013-LuZWZ0 #multi #named #performance #thread
RaceFree: an efficient multi-threading model for determinism (KL, XZ, XW, WZ, GL), pp. 297–298.
CADECADE-2013-KovasznaiFB #quantifier
: A Tool for Polynomially Translating Quantifier-Free Bit-Vector Formulas into (GK, AF, AB), pp. 443–449.
CSLCSL-2013-CloustonDGT #calculus #linear #logic
Annotation-Free Sequent Calculi for Full Intuitionistic Linear Logic (RC, JED, RG, AT), pp. 197–214.
LICSLICS-2013-FacchiniVZ #calculus #theorem #μ-calculus
A Characterization Theorem for the Alternation-Free Fragment of the Modal μ-Calculus (AF, YV, FZ), pp. 478–487.
CASECASE-2012-MatsumotoN #approach #clustering #composition #concurrent #petri net #scheduling #tool support
Petri net decomposition approach to deadlock-free scheduling for dual-armed cluster tools (IM, TN), pp. 194–199.
CASECASE-2012-YaguchiKS #pipes and filters
In-piping actuator capable of free movement in a thin complex pipe (HY, KK, KS), pp. 630–634.
DACDAC-2012-LeeLHCCLS #design
Obstacle-avoiding free-assignment routing for flip-chip designs (PWL, HCL, YKH, YWC, CFC, IJL, CFS), pp. 1088–1093.
ITiCSEITiCSE-2012-BoyceCPCB #behaviour #game studies #learning
Maximizing learning and guiding behavior in free play user generated content environments (AKB, AC, SP, DC, TB), pp. 10–15.
PLDIPLDI-2012-BaconCS #configuration management #garbage collection #hardware #realtime
And then there were none: a stall-free real-time garbage collector for reconfigurable hardware (DFB, PC, SS), pp. 23–34.
STOCSTOC-2012-BeiCGL #design
Budget feasible mechanism design: from prior-free to bayesian (XB, NC, NG, PL), pp. 449–458.
STOCSTOC-2012-EtessamiSY #algorithm #branch #context-free grammar #multi #polynomial #probability #process
Polynomial time algorithms for multi-type branching processes and stochastic context-free grammars (KE, AS, MY), pp. 579–588.
STOCSTOC-2012-LeonardiR #order
Prior-free auctions with ordered bidders (SL, TR), pp. 427–434.
AFLAFL-J-2011-BrzozowskiL12 #complexity
Quotient Complexity of Star-Free Languages (JAB, BL), pp. 1261–1276.
AFLAFL-J-2011-FazekasLS12 #context-free grammar #on the
On Non-Primitive Palindromic Context-Free Languages (SZF, PL, KST), pp. 1277–1290.
DLTDLT-2012-0002HOT #context-free grammar #problem #word
Semigroups with a Context-Free Word Problem (MH, DFH, MDO, RMT), pp. 97–108.
DLTDLT-2012-EsikO #context-free grammar #on the #word
On Context-Free Languages of Scattered Words (, SO), pp. 142–153.
DLTDLT-2012-HanKS #context-free grammar #regular expression
Computing the Edit-Distance between a Regular Language and a Context-Free Language (YSH, SKK, KS), pp. 85–96.
DLTDLT-2012-HolzerJM #context-free grammar
Generalized Derivations with Synchronized Context-Free Grammars (MH, SJ, IM), pp. 109–120.
DLTDLT-2012-LavadoPS #automaton #context-free grammar #nondeterminism
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.
DLTDLT-2012-LehtinenO #context-free grammar #morphism
Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 154–165.
DLTDLT-2012-ReidenbachS #pattern matching
Regular and Context-Free Pattern Languages over Small Alphabets (DR, MLS), pp. 130–141.
ICALPICALP-v1-2012-Bauwens #complexity
Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity (BB), pp. 100–108.
ICALPICALP-v2-2012-Elbassioni #graph
A QPTAS for ε-Envy-Free Profit-Maximizing Pricing on Line Graphs (KME), pp. 513–524.
LATALATA-2012-BarashO #context-free grammar
Defining Contexts in Context-Free Grammars (MB, AO), pp. 106–118.
LATALATA-2012-Yoshinaka #context-free grammar #integration #learning
Integration of the Dual Approaches in the Distributional Learning of Context-Free Grammars (RY), pp. 538–550.
CHICHI-2012-MoellerK #architecture #interactive #multi #named
ZeroTouch: an optical multi-touch and free-air interaction architecture (JM, AK), pp. 2165–2174.
CHICHI-2012-YiCFZ #interactive #mobile
Exploring user motivations for eyes-free interaction on mobile devices (BY, XC, MF, SZ), pp. 2789–2792.
CAiSECAiSE-2012-SchmelingCMM #composition #non-functional #towards
Towards Conflict-Free Composition of Non-functional Concerns (BS, AC, MM, MM), pp. 80–94.
CIKMCIKM-2012-GaoCK #graph #keyword #scalability
Information-complete and redundancy-free keyword search over large data graphs (BJG, ZC, QK), pp. 2639–2642.
CIKMCIKM-2012-HanFJ #query
Schema-free structured querying of DBpedia data (LH, TF, AJ), pp. 2090–2093.
ICMLICML-2012-HazanK #learning #online
Projection-free Online Learning (EH, SK), p. 239.
ICPRICPR-2012-KuriharaA #correlation #image #using
Motion blur free photometric stereo using correlation image sensor (TK, SA), pp. 1872–1875.
ICPRICPR-2012-LuSOS #image #synthesis
Head pose-free appearance-based gaze sensing via eye image synthesis (FL, YS, TO, YS), pp. 1008–1011.
ICPRICPR-2012-NakamuraSMS #artificial reality
Calibration-free projector-camera system for spatial augmented reality on planar surfaces (TN, FdS, SM, HS), pp. 85–88.
ICPRICPR-2012-NaritaOWK #3d #case study #estimation #recognition
A study on three dimensional rotation-free character recognition and rotation angle estimation of characters (RN, WO, TW, FK), pp. 677–680.
ICPRICPR-2012-SharmaCL #3d
A free viewpoint 3DTV system based on parameterized variety model (MS, SC, BL), pp. 1026–1029.
SEKESEKE-2012-FoukarakisKT #open source
Choosing Licenses In Free Open Source Software (IEF, GMK, NDT), pp. 200–204.
ECOOPECOOP-2012-WestbrookZBS #parallel
Practical Permissions for Race-Free Parallelism (EMW, JZ, ZB, VS), pp. 614–639.
OOPSLAOOPSLA-2012-Effinger-DeanLCGB #concurrent #detection #named
IFRit: interference-free regions for dynamic data-race detection (LED, BL, LC, DG, HJB), pp. 467–484.
ICSEICSE-2012-RuscioPP #evolution #named #open source
EVOSS: A tool for managing the evolution of free and open source software systems (DDR, PP, AP), pp. 1415–1418.
HPCAHPCA-2012-SeguljaA #architecture #parallel #programming
Architectural support for synchronization-free deterministic parallel programming (CS, TSA), pp. 337–348.
ISMMISMM-2012-IyengarTWG
The Collie: a wait-free compacting collector (BI, GT, MW, EFG), pp. 85–96.
PPoPPPPoPP-2012-KoganP #data type #performance
A methodology for creating fast wait-free data structures (AK, EP), pp. 141–150.
PPoPPPPoPP-2012-LiuS #queue
A lock-free, array-based priority queue (YL, MFS), pp. 323–324.
PPoPPPPoPP-2012-TimnatBKP
Wait-free linked-lists (ST, AB, AK, EP), pp. 309–310.
PPoPPPPoPP-2012-ZhangL #linear #named
LHlf: lock-free linear hashing (poster paper) (DZ, PÅL), pp. 307–308.
IJCARIJCAR-2012-BruttomessoGR #composition #quantifier
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation (RB, SG, SR), pp. 118–133.
ISSTAISSTA-2012-CaballeroGMN #detection #named #pointer
Undangle: early detection of dangling pointers in use-after-free and double-free vulnerabilities (JC, GG, MM, AN), pp. 133–143.
LICSLICS-2012-AvronKZ #calculus #composition #logic
Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics (AA, BK, AZ), pp. 85–94.
ICSTSAT-2012-LiffitonM #constraints #for free
A Cardinality Solver: More Expressive Constraints for Free — (Poster Presentation) (MHL, JCM), pp. 485–486.
DACDAC-2011-WangXAP #classification #learning #policy #power management #using
Deriving a near-optimal power management policy using model-free reinforcement learning and Bayesian classification (YW, QX, ACA, MP), pp. 41–46.
DATEDATE-2011-ChaixAZN #adaptation #concurrent #fault tolerance
A fault-tolerant deadlock-free adaptive routing for on chip interconnects (FC, DA, NEZ, MN), pp. 909–912.
DocEngDocEng-2011-PiccoliCCOM #documentation #for free #interactive #layout #novel
A novel physics-based interaction model for free document layout (RFBP, RC, NCC, JBSdO, IHM), pp. 153–162.
ICDARICDAR-2011-AlvaroSB #2d #context-free grammar #probability #recognition #using
Recognition of Printed Mathematical Expressions Using Two-Dimensional Stochastic Context-Free Grammars (FA, JAS, JMB), pp. 1225–1229.
ICDARICDAR-2011-CelikY #2d #graph grammar #probability #recognition #using
Probabilistic Mathematical Formula Recognition Using a 2D Context-Free Graph Grammar (MC, BAY), pp. 161–166.
ICDARICDAR-2011-HirayamaSTN #development #recognition
Development of Template-Free Form Recognition System (JH, HS, TT, TN), pp. 237–241.
ICDARICDAR-2011-KimO #documentation #image #segmentation #using
Script-Free Text Line Segmentation Using Interline Space Model for Printed Document Images (MK, ISO), pp. 1354–1358.
ICDARICDAR-2011-LazzaraLGJMC #analysis #documentation #framework #image
The SCRIBO Module of the Olena Platform: A Free Software Framework for Document Image Analysis (GL, RL, TG, YJ, JM, ACL), pp. 252–258.
ICDARICDAR-2011-NaritaOWK #3d #recognition
Three Dimensional Rotation-Free Recognition of Characters (RN, WO, TW, FK), pp. 824–828.
ICDARICDAR-2011-RusinolATL #documentation #word
Browsing Heterogeneous Document Collections by a Segmentation-Free Word Spotting Method (MR, DA, RT, JL), pp. 63–67.
ICDARICDAR-2011-SundaramR #novel #online #segmentation #word
Lexicon-Free, Novel Segmentation of Online Handwritten Indic Words (SS, AGR), pp. 1175–1179.
SIGMODSIGMOD-2011-KiferM #privacy
No free lunch in data privacy (DK, AM), pp. 193–204.
VLDBVLDB-2011-BorisovB #approach #declarative #detection #towards
Proactive Detection and Repair of Data Corruption: Towards a Hassle-free Declarative Approach with Amulet (NB, SB), pp. 1403–1408.
VLDBVLDB-2011-PandisTJA #named
PLP: Page Latch-free Shared-everything OLTP (IP, PT, RJ, AA), pp. 610–621.
VLDBVLDB-2011-SewallCKSD #architecture #manycore #named #parallel
PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors (JS, JC, CK, NS, PD), pp. 795–806.
ITiCSEITiCSE-2011-KleinKT #analysis #assessment #automation #semantics #using
Automated assessment of short free-text responses in computer science using latent semantic analysis (RK, AK, MT), pp. 158–162.
ITiCSEITiCSE-2011-Luxton-ReillyDPB #student
Supporting student-generated free-response questions (ALR, PD, BP, DJB), pp. 153–157.
ESOPESOP-2011-DeDN #analysis #data flow #source code
Dataflow Analysis for Datarace-Free Programs (AD, DD, RN), pp. 196–215.
FoSSaCSFoSSaCS-2011-MollerS #context-free grammar #html #validation
HTML Validation of Context-Free Languages (AM, MS), pp. 426–440.
TACASTACAS-2011-JungLWY #generative #invariant #quantifier
Predicate Generation for Learning-Based Quantifier-Free Loop Invariant Inference (YJ, WL, BYW, KY), pp. 205–219.
MSRMSR-2011-CanforaCCP #debugging #interactive #social
Social interactions around cross-system bug fixings: the case of FreeBSD and OpenBSD (GC, LC, MC, MDP), pp. 143–152.
PLDIPLDI-2011-GulwaniJTV #source code #synthesis
Synthesis of loop-free programs (SG, SJ, AT, RV), pp. 62–73.
PLDIPLDI-2011-ZengWL #concurrent #data type #monitoring #named #using
Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.
STOCSTOC-2011-DemaineHK #algorithm #composition #graph
Contraction decomposition in h-minor-free graphs and algorithmic applications (EDD, MH, KiK), pp. 441–450.
DLTDLT-J-2009-BertoniCR11 #context-free grammar #problem
The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 289–299.
DLTDLT-J-2010-JiraskovaM11 #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 1639–1653.
AFLAFL-2011-BrzozowskiJLS #complexity #regular expression
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Languages (JAB, GJ, BL, JS), pp. 123–137.
AFLAFL-2011-BrzozowskiL #complexity
Quotient Complexity of Star-Free Languages (JAB, BL), pp. 138–152.
AFLAFL-2011-IvanM #context-free grammar #generative #word
Müller context-free grammars generating well-ordered words (SI, ÁM), pp. 225–240.
CIAACIAA-2011-HolzerKM #complexity #nondeterminism
Nondeterministic State Complexity of Star-Free Languages (MH, MK, KM), pp. 178–189.
DLTDLT-2011-Esik #linear #order
Scattered Context-Free Linear Orderings (), pp. 216–227.
DLTDLT-2011-KortelainenS #bound #context-free grammar
There Does Not Exist a Minimal Full Trio with Respect to Bounded Context-Free Languages (JK, TS), pp. 312–323.
DLTDLT-2011-PlyushchenkoS #on the
On Brzozowski’s Conjecture for the Free Burnside Semigroup Satisfying x2 = x3 (ANP, AMS), pp. 362–373.
DLTDLT-2011-RampersadV #on the #word
On Highly Repetitive and Power Free Words (NR, EV), pp. 441–451.
DLTDLT-2011-Shur
Growth Properties of Power-Free Languages (AMS), pp. 28–43.
DLTDLT-2011-Yoshinaka #concept #context-free grammar #learning #towards
Towards Dual Approaches for Learning Context-Free Grammars Based on Syntactic Concept Lattices (RY), pp. 429–440.
ICALPICALP-v1-2011-KawarabayashiKS #approximate #bound #distance #graph
Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (KiK, PNK, CS), pp. 135–146.
CHICHI-2011-AshbrookBW #mobile #named
Nenya: subtle and eyes-free mobile input with a magnetically-tracked finger ring (DA, PB, SW), pp. 2043–2046.
CHICHI-2011-KarrerWLHB #interactive #named
Pinstripe: eyes-free continuous input on interactive clothing (TK, MW, LL, FH, JOB), pp. 1313–1322.
CHICHI-2011-MorrisonVM #interactive
Building sensitising terms to understand free-play in open-ended interactive art environments (AJM, SV, PM), pp. 2335–2344.
CHICHI-2011-PasqueroSS #interactive
A haptic wristwatch for eyes-free interactions (JP, SJS, NS), pp. 3257–3266.
CHICHI-2011-Vazquez-AlvarezB #interface #mobile #multi
Eyes-free multitasking: the effect of cognitive load on mobile spatial audio interfaces (YVA, SAB), pp. 2173–2176.
CSCWCSCW-2011-SantosSCKSRRT #open source #policy
Intellectual property policy and attractiveness: a longitudinal study of free and open source software projects (CDSJ, MBC, FK, JS, VR, DR, TT), pp. 705–708.
HCIHCD-2011-FujitaK #design #development #interface #mobile
Design and Development of Eyes- and Hands-Free Voice Interface for Mobile Phone (KF, TK), pp. 207–216.
HCIHCI-ITE-2011-ParkAK #interactive #interface #mobile
Gaze-Directed Hands-Free Interface for Mobile Interaction (GsP, JgA, GJK), pp. 304–313.
ICEISICEIS-v2-2011-KisilevichKBTR #open source #tool support #using
Developing a Price Management Decision Support System for Hotel Brokers using Free and Open Source Tools (SK, DAK, RB, MT, LR), pp. 147–156.
ECIRECIR-2011-Tjin-Kam-JetTH #web
Free-Text Search versus Complex Web Forms (KTKJ, DT, DH), pp. 670–674.
ICMLICML-2011-MartensS #learning #network #optimisation
Learning Recurrent Neural Networks with Hessian-Free Optimization (JM, IS), pp. 1033–1040.
ICMLICML-2011-TamarCM #algorithm
Integrating Partial Model Knowledge in Model Free RL Algorithms (AT, DDC, RM), pp. 305–312.
MLDMMLDM-2011-WuW #category theory #detection
Parameter-Free Anomaly Detection for Categorical Data (SW, SW), pp. 112–126.
RecSysRecSys-2011-GantnerRFS #library #named #recommendation
MyMediaLite: a free recommender system library (ZG, SR, CF, LST), pp. 305–308.
SIGIRSIGIR-2011-TureEL #similarity
No free lunch: brute force vs. locality-sensitive hashing for cross-lingual pairwise similarity (FT, TE, JJL), pp. 943–952.
QAPLQAPL-2011-SeidelV #for free
Improvements for Free (DS, JV), pp. 89–103.
SLESLE-2011-FischerLZ #comparison #context-free grammar #parsing #testing
Comparison of Context-Free Grammars Based on Parsing Generated Test Data (BF, RL, VZ), pp. 324–343.
HPCAHPCA-2011-HowerDHW #named
Calvin: Deterministic or not? Free will to choose (DH, PD, MDH, DAW), pp. 333–334.
HPCAHPCA-2011-Seznec #branch #estimation #predict
Storage free confidence estimation for the TAGE branch predictor (AS), pp. 443–454.
HPCAHPCA-2011-VantreaseLB #protocol
Atomic Coherence: Leveraging nanophotonics to build race-free cache coherence protocols (DV, MHL, NLB), pp. 132–143.
HPCAHPCA-2011-YoonMCRJE #fault #memory management #named
FREE-p: Protecting non-volatile memory against both hard and soft errors (DHY, NM, JC, PR, NPJ, ME), pp. 466–477.
PPoPPPPoPP-2011-FernandesC #memory management #multi #scalability #transaction
Lock-free and scalable multi-version software transactional memory (SMF, JPC), pp. 179–188.
PPoPPPPoPP-2011-KoganP #multi
Wait-free queues with multiple enqueuers and dequeuers (AK, EP), pp. 223–234.
PPoPPPPoPP-2011-StellwagSKS #constraints #library #parallel
A wait-free NCAS library for parallel applications with timing constraints (PS, FS, JK, WSP), pp. 301–302.
CSLCSL-2011-FridmanLZ #game studies #infinity #lookahead
Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.
RTARTA-2011-BruttomessoGR #array #formal method #quantifier
Rewriting-based Quantifier-free Interpolation for a Theory of Arrays (RB, SG, SR), pp. 171–186.
VMCAIVMCAI-2011-BrilloutKRW #quantifier
Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (AB, DK, PR, TW), pp. 88–102.
CASECASE-2010-HuZLW #assembly #automation #concurrent #flexibility
Deadlock-free control of ratio-enforced automated manufacturing systems with flexible routes and assembly operations (HH, MZ, ZL, NW), pp. 459–464.
CASECASE-2010-ShoaeiLM #automation #flexibility #generative
Automatic generation of controllers for collision-free flexible manufacturing systems (MRS, BL, SM), pp. 368–373.
CASECASE-2010-YangO #design #parallel
Singularity-free workspace design for the translational 3-UPU parallel robot (YY, JFO), pp. 222–227.
DACDAC-2010-CongLR #concurrent #named
ACES: application-specific cycle elimination and splitting for deadlock-free routing on irregular network-on-chip (JC, CL, GR), pp. 443–448.
DocEngDocEng-2010-QuintRSV #editing
From templates to schemas: bridging the gap between free editing and safe data processing (VQ, CR, SS, CV), pp. 61–64.
SIGMODSIGMOD-2010-TerwilligerBU #automation #database #evolution #modelling
Worry-free database upgrades: automated model-driven evolution of schemas and complex mappings (JFT, PAB, AU), pp. 1191–1194.
ESOPESOP-2010-LeinoMS #concurrent
Deadlock-Free Channels and Locks (KRML, PM, JS), pp. 407–426.
ESOPESOP-2010-VardoulakisS #analysis #approach #control flow #named
CFA2: A Context-Free Approach to Control-Flow Analysis (DV, OS), pp. 570–589.
MSRMSR-2010-BougieTGS #comparative #debugging
A comparative exploration of FreeBSD bug lifetimes (GB, CT, DMG, MADS), pp. 106–109.
MSRMSR-2010-HindleHSJ #challenge #gnome #mining
Mining Challenge 2010: FreeBSD, GNOME Desktop and Debian/Ubuntu (AH, IH, ES, ZMJ), pp. 82–85.
MSRMSR-2010-MauczkaSFBG #mining #security
Mining security changes in FreeBSD (AM, CS, FF, MB, TG), pp. 90–93.
MSRMSR-2010-SasakiYHI #clone detection
Finding file clones in FreeBSD Ports Collection (YS, TY, YH, KI), pp. 102–105.
PLDIPLDI-2010-XiW
A context-free markup language for semi-structured text (QX, DW), pp. 221–232.
SASSAS-2010-Might #for free
Abstract Interpreters for Free (MM), pp. 407–421.
FLOPSFLOPS-2010-SeidelV #automation #generative #theorem
Automatically Generating Counterexamples to Naive Free Theorems (DS, JV), pp. 175–190.
FLOPSFLOPS-2010-ThiemannS #combinator #generative #polymorphism
Tag-Free Combinators for Binding-Time Polymorphic Program Generation (PT, MS), pp. 87–102.
DLTDLT-J-2008-GawrychowskiKRS10 #context-free grammar #polynomial
Finding the Growth Rate of a Regular or Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 597–618.
DLTDLT-2010-DassowM #context-free grammar #on the #strict
On Restricted Context-Free Grammars (JD, TM), pp. 434–435.
DLTDLT-2010-EsikI #context-free grammar #on the
On Müller Context-Free Grammars (, SI), pp. 173–184.
DLTDLT-2010-JiraskovaM #complexity #regular expression
Complexity in Union-Free Regular Languages (GJ, TM), pp. 255–266.
ICALPICALP-v2-2010-ChenD #multi
Envy-Free Pricing in Multi-item Markets (NC, XD), pp. 418–429.
LATALATA-2010-Blanchet-SadriKMSS #word
Abelian Square-Free Partial Words (FBS, JIK, RM, WS, SS), pp. 94–105.
LATALATA-2010-KanazawaS #context-free grammar #multi #power of
The Copying Power of Well-Nested Multiple Context-Free Grammars (MK, SS), pp. 344–355.
LATALATA-2010-Leupold #context-free grammar #word
Primitive Words Are Unavoidable for Context-Free Languages (PL), pp. 403–413.
LATALATA-2010-WeinbergN #context-free grammar #probability
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics (FW, MEN), pp. 585–595.
LATALATA-2010-YoshinakaKS #context-free grammar #multi
Chomsky-Schützenberger-Type Characterization of Multiple Context-Free Languages (RY, YK, HS), pp. 596–607.
SEFMSEFM-2010-XuZC #context-free grammar #generative #tool support
A Toolkit for Generating Sentences from Context-Free Grammars (ZX, LZ, HC), pp. 118–122.
LISPILC-2010-UgawaIY #garbage collection #incremental
Starvation-free heap size for replication-based incremental compacting garbage collection (TU, HI, TY), pp. 43–52.
ICGTICGT-2010-KonigE #graph transformation #specification #verification
Verification of Graph Transformation Systems with Context-Free Specifications (BK, JE), pp. 107–122.
CHICHI-2010-MalacriaLG #approach
Clutch-free panning and integrated pan-zoom control on touch-sensitive surfaces: the cyclostar approach (SM, EL, YG), pp. 2615–2624.
CHICHI-2010-TerryKL #community #open source #usability
Perceptions and practices of usability in the free/open source software (FoSS) community (MAT, MK, BL), pp. 999–1008.
CHICHI-2010-YaroshIB #distance #game studies #towards #video
Video playdate: toward free play across distance (SY, KMI, AJBB), pp. 1251–1260.
CSCWCSCW-2010-AntinC #wiki
Readers are not free-riders: reading as a form of participation on wikipedia (JA, CC), pp. 127–130.
ICEISICEIS-DISI-2010-AversanoPT #enterprise #open source #quality
Evaluating the Quality of Free/Open Source ERP Systems (LA, IP, MT), pp. 75–83.
ICEISICEIS-J-2010-AversanoT #case study #open source #quality
Evaluating the Quality of Free/Open Source Systems: A Case Study (LA, MT), pp. 119–134.
ICMLICML-2010-Martens #learning #optimisation
Deep learning via Hessian-free optimization (JM), pp. 735–742.
ICPRICPR-2010-HabedAB #identification #image #parallel
Reconstruction-Free Parallel Planes Identification from Uncalibrated Images (AH, AA, BB), pp. 1828–1831.
ICPRICPR-2010-WohlerGDHKH #gesture #online #recognition
A Calibration-Free Head Gesture Recognition System with Online Capability (NCW, UG, AD, MH, SK, TH), pp. 3814–3817.
ICPRICPR-2010-XieM #segmentation
Initialisation-Free Active Contour Segmentation (XX, MM), pp. 2318–2321.
KDIRKDIR-2010-NakanoY #induction
Number Theory-based Induction of Deterministic Context-free L-system Grammar (RN, NY), pp. 194–199.
SACSAC-2010-RiosBKO #documentation #evaluation #set #word
Evaluation of different feature sets in an OCR free method for word spotting in printed documents (IR, AdSBJ, ALK, LSO), pp. 52–56.
PPoPPPPoPP-2010-CedermanT #composition #concurrent
Supporting lock-free composition of concurrent data objects (DC, PT), pp. 339–340.
CSLCSL-2010-BarthwalN #context-free grammar #formal method #normalisation
A Formalisation of the Normal Forms of Context-Free Grammars in HOL4 (AB, MN), pp. 95–109.
IJCARIJCAR-2010-BrilloutKRW #calculus #quantifier
An Interpolating Sequent Calculus for Quantifier-Free Presburger Arithmetic (AB, DK, PR, TW), pp. 384–399.
IJCARIJCAR-2010-GoreW #logic
Optimal and Cut-Free Tableaux for Propositional Dynamic Logic with Converse (RG, FW), pp. 225–239.
RTARTA-2010-FujitaS #problem #system f
The Undecidability of Type Related Problems in Type-free Style System F (KeF, AS), pp. 103–118.
ICSTSAT-2010-BubeckB #quantifier
Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.
CASECASE-2009-ChiddarwarB #coordination #multi
Dynamic priority allocation for conflict free coordinated manipulation of multiple agents (SSC, NRB), pp. 549–554.
DRRDRR-2009-IwamuraNHKUO #documentation #image
Layout-free dewarping of planar document images (MI, RN, AH, KK, SU, SO), pp. 1–10.
DRRDRR-2009-ShenLD #documentation
Text line extraction in free-style document (XS, CL, XD), pp. 1–10.
ICDARICDAR-2009-DingJG #approach #online #recognition #word
A New Method for Rotation Free Method for Online Unconstrained Handwritten Chinese Word Recognition: A Holistic Approach (KD, LJ, XG), pp. 1131–1135.
ICDARICDAR-2009-GatosP #documentation #word
Segmentation-free Word Spotting in Historical Printed Documents (BG, IP), pp. 271–275.
ICDARICDAR-2009-HuangJL #approach #novel #online #recognition
A Novel Approach for Rotation Free Online Handwritten Chinese Character Recognition (SH, LJ, JL), pp. 1136–1140.
ICDARICDAR-2009-KaeL #learning #on the fly #problem
Learning on the Fly: Font-Free Approaches to Difficult OCR Problems (AK, EGLM), pp. 571–575.
ITiCSEITiCSE-2009-MegiasTBS #distance #education #standard
Free technology academy: a European initiative for distance education about free software and open standards (DM, WT, LB, FS), pp. 70–74.
ESOPESOP-2009-Sumii #for free #formal method #memory management
A Theory of Non-monotone Memory (Or: Contexts for free) (ES), pp. 237–251.
FASEFASE-2009-ChatterjeeJS #java #named #query #using
SNIFF: A Search Engine for Java Using Free-Form Queries (SC, SJ, KS), pp. 385–400.
ICSMEICSM-2009-AdamsCB #coordination
Coordination and productivity issues in free software: The role of brooks’ law (PJA, AC, CB), pp. 319–328.
DLTDLT-2009-BertoniCR #context-free grammar #problem
The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.
DLTDLT-2009-Egecioglu #approximate #context-free grammar
Strongly Regular Grammars and Regular Approximation of Context-Free Languages (ÖE), pp. 207–220.
DLTDLT-2009-Kanazawa #context-free grammar #multi
The Pumping Lemma for Well-Nested Multiple Context-Free Languages (MK), pp. 312–325.
DLTDLT-2009-Kirsten #commutative
The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.
DLTDLT-2009-Shur #bound
Two-Sided Bounds for the Growth Rates of Power-Free Languages (AMS), pp. 466–477.
ICALPICALP-v1-2009-DemaineHK #algorithm #approximate #graph
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs (EDD, MH, KiK), pp. 316–327.
ICALPICALP-v1-2009-KobayashiGNR #communication #network #quantum
General Scheme for Perfect Quantum Network Coding with Free Classical Communication (HK, FLG, HN, MR), pp. 622–633.
ICALPICALP-v2-2009-MelliesTT #exponential #linear #logic
An Explicit Formula for the Free Exponential Modality of Linear Logic (PAM, NT, CT), pp. 247–260.
LATALATA-2009-AfoninG #regular expression
Minimal Union-Free Decompositions of Regular Languages (SA, DG), pp. 83–92.
LATALATA-2009-HanSY #complexity #regular expression
State Complexity of Combined Operations for Prefix-Free Regular Languages (YSH, KS, SY), pp. 398–409.
LATALATA-2009-Masopust #context-free grammar #generative #power of
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.
ICFPICFP-2009-Voigtlander #functional #theorem
Free theorems involving type constructor classes: functional pearl (JV), pp. 173–184.
CHICHI-2009-RothT #mobile #multi
Bezel swipe: conflict-free scrolling and multiple selection on mobile touch screen devices (VR, TT), pp. 1523–1526.
HCIHCI-NIMT-2009-RehrlBGRW #human-computer #interface #named #novel
cfHMI: A Novel Contact-Free Human-Machine Interface (TR, AB, JG, GR, FW), pp. 246–254.
ICMLICML-2009-VlassisT #learning
Model-free reinforcement learning as mixture learning (NV, MT), pp. 1081–1088.
KDDKDD-2009-BohmHMP #detection #named
CoCo: coding cost for parameter-free outlier detection (CB, KH, NSM, CP), pp. 149–158.
POPLPOPL-2009-Voigtlander #bidirectional #exclamation #for free
Bidirectionalization for free! (Pearl) (JV), pp. 165–176.
SACSAC-2009-LaiRC #embedded #on the #realtime #scheduling
On scheduling soft real-time tasks with lock-free synchronization for embedded devices (SL, BR, HC), pp. 1685–1686.
SACSAC-2009-WangT #algorithm #morphism
An algorithm for optimal comma free codes with isomorphism rejection (HW, VDT), pp. 1007–1008.
ICSEICSE-2009-RaysideBSNMJ #abstraction #generative #implementation #similarity
Equality and hashing for (almost) free: Generating implementations from abstraction functions (DR, ZB, RS, JPN, AM, DJ), pp. 342–352.
LDTALDTA-2008-Basten09 #ambiguity #context-free grammar #detection #usability
The Usability of Ambiguity Detection Methods for Context-Free Grammars (BB), pp. 35–46.
HPDCHPDC-2009-HironakaST #concurrent #performance #using
High performance wide-area overlay using deadlock-free routing (KH, HS, KT), pp. 81–90.
TLCATLCA-2009-Atkey #for free #parametricity #representation #syntax #using
Syntax for Free: Representing Syntax with Binding Using Parametricity (RA), pp. 35–49.
ASEASE-2008-MeredithJCR #monitoring #parametricity #performance
Efficient Monitoring of Parametric Context-Free Patterns (POM, DJ, FC, GR), pp. 148–157.
DACDAC-2008-DuanZK #design
Forbidden transition free crosstalk avoidance CODEC design (CD, CZ, SPK), pp. 986–991.
DATEDATE-2008-LuMGB #algorithm #for free #performance
An efficient algorithm for free resources management on the FPGA (YL, TM, GG, KB), pp. 1095–1098.
DATEDATE-2008-WolffPBC #analysis #detection #problem #towards
Towards Trojan-Free Trusted ICs: Problem Analysis and Detection Scheme (FGW, CAP, SB, RSC), pp. 1362–1365.
PEPMPEPM-2008-Voigtlander #correctness #proving #theorem
Proving correctness via free theorems: the case of the destroy/build-rule (JV), pp. 13–20.
FLOPSFLOPS-2008-ChristiansenF #for free #named #testing
EasyCheck — Test Data for Free (JC, SF), pp. 322–336.
DLTDLT-J-2007-Ravikumar08 #ambiguity #context-free grammar
The Benford-Newcomb Distribution and Unambiguous Context-Free Languages (BR), pp. 717–727.
CIAACIAA-2008-Fujiyoshi #automaton #context-free grammar
Combination of Context-Free Grammars and Tree Automata for Unranked and Ranked Trees (AF), pp. 283–285.
DLTDLT-2008-GawrychowskiKRS #context-free grammar #polynomial
Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time (PG, DK, NR, JS), pp. 339–358.
ICALPICALP-A-2008-Briest #problem
Uniform Budgets and the Envy-Free Pricing Problem (PB), pp. 808–819.
ICALPICALP-B-2008-AxelssonHL #context-free grammar #incremental #satisfiability #using
Analyzing Context-Free Grammars Using an Incremental SAT Solver (RA, KH, ML), pp. 410–422.
ICALPICALP-C-2008-KolesnikovS
Improved Garbled Circuit: Free XOR Gates and Applications (VK, TS), pp. 486–498.
AFPAFP-2008-Danvy08 #normalisation
From Reduction-Based to Reduction-Free Normalization (OD), pp. 66–164.
IFLIFL-2008-TrojahnerG #array #dependent type #representation
Descriptor-Free Representation of Arrays with Dependent Types (KT, CG), pp. 100–117.
ICGTICGT-2008-BauderonCL
Pullback Grammars Are Context-Free (MB, RC, OL), pp. 366–378.
ICGTICGT-2008-JelinkovaK #graph #on the
On Switching to H-Free Graphs (EJ, JK), pp. 379–395.
CHICHI-2008-GustafsonBGI #named #visualisation
Wedge: clutter-free visualization of off-screen locations (SG, PB, CG, PI), pp. 787–796.
CHICHI-2008-LiBH #mobile #named
Blindsight: eyes-free access to mobile phones (KAL, PB, KH), pp. 1389–1398.
EDOCEDOC-2008-AmeedeenB #approach #diagrams #modelling #petri net #sequence chart
A Model Driven Approach to Represent Sequence Diagrams as Free Choice Petri Nets (MAA, BB), pp. 213–221.
CIKMCIKM-2008-MihailaSL #incremental
Anomaly-free incremental output in stream processing (GAM, IS, CAL), pp. 359–368.
ICMLICML-2008-UenoKMMI #approach #evaluation #policy #statistics
A semiparametric statistical approach to model-free policy evaluation (TU, MK, TM, SiM, SI), pp. 1072–1079.
ICPRICPR-2008-CollomosseMW #retrieval #sketching #video
Free-hand sketch grouping for video retrieval (JPC, GM, LAW), pp. 1–4.
ICPRICPR-2008-LongJ #novel #online #recognition #word
A novel orientation free method for online unconstrained cursive handwritten chinese word recognition (TL, LJ), pp. 1–4.
ICPRICPR-2008-MollerPF #multi #performance #reliability
Calibration-free camera hand-over for fast and reliable person tracking in multi-camera setups (BM, TP, GAF), pp. 1–4.
ICPRICPR-2008-SrihariNNL #clique #detection #network
Detecting hubs and quasi cliques in scale-free networks (SS, HKN, KN, HWL), pp. 1–4.
ICPRICPR-2008-SuZHL
Segmentation-free recognizer based on enhanced four plane feature for realistic Chinese handwriting (THS, TZ, HJH, CLL), pp. 1–4.
ICPRICPR-2008-ThomasRCB #analysis #comparative
Comparative analysis of registration based and registration free methods for cancelable fingerprint biometrics (AOT, NKR, JHC, RMB), pp. 1–4.
ICPRICPR-2008-UkitaKK #using
IBR-based free-viewpoint imaging of a complex scene using few cameras (NU, SK, MK), pp. 1–4.
BXBX-2008-Voigtlaender1 #bidirectional #theorem
Free Theorems and Bidirectional Transformations (JV), p. 30.
PPDPPPDP-2008-ThiemannN #context-free grammar #metaprogramming
Macros for context-free grammars (PT, MN), pp. 120–130.
SACSAC-2008-Ngomo #multi
Knowledge-free discovery of domain-specific multiword units (ACNN), pp. 1561–1565.
ATEMATEM-J-2006-DubeyJA #context-free grammar #learning #set
Learning context-free grammar rules from a set of program (AD, PJ, SKA), pp. 223–240.
HPDCHPDC-2008-GuptaBG #framework #grid #ontology #query
Ontological framework for a free-form query based grid search engine (CG, RB, MG), pp. 205–208.
PPoPPPPoPP-2008-GiacomoniMV #concurrent #parallel #performance #pipes and filters #queue
FastForward for efficient pipeline parallelism: a cache-optimized concurrent lock-free queue (JG, TM, MV), pp. 43–52.
CSLCSL-2008-NakazawaTKN #λ-calculus
Undecidability of Type-Checking in Domain-Free Typed λ-Calculi with Existence (KN, MT, YK, HN), pp. 478–492.
TAPTAP-2008-DunetsSR #analysis #bound #data type #relational
Bounded Relational Analysis of Free Data Types (AD, GS, WR), pp. 99–115.
DACDAC-2007-MalyLM #design
OPC-Free and Minimally Irregular IC Design Style (WM, YWL, MMS), pp. 954–957.
ICDARICDAR-2007-SuZHZ
HMM-Based Recognizer with Segmentation-free Strategy for Unconstrained Chinese Handwritten Text (THS, TWZ, HJH, YZ), pp. 133–137.
SIGMODSIGMOD-2007-ChengKNL #database #graph #named #query #towards
Fg-index: towards verification-free query processing on graph databases (JC, YK, WN, AL), pp. 857–872.
ESOPESOP-2007-BlanquiHW #data type #implementation #on the
On the Implementation of Construction Functions for Non-free Concrete Data Types (FB, TH, PW), pp. 95–109.
FoSSaCSFoSSaCS-2007-TozawaM #complexity #context-free grammar
Complexity Results on Balanced Context-Free Languages (AT, YM), pp. 346–360.
MSRMSR-2007-German #open source #using
Using Software Distributions to Understand the Relationship among Free and Open Source Software Projects (DMG), p. 24.
PLDIPLDI-2007-RenganarayananKRS #for free
Parameterized tiled loops for free (LR, DK, SVR, MMS), pp. 405–414.
CIAACIAA-2007-BrabrandGM #ambiguity #context-free grammar
Analyzing Ambiguity of Context-Free Grammars (CB, RG, AM), pp. 214–225.
CIAACIAA-2007-CaucalCFR #context-free grammar #performance #throughput
Efficient Computation of Throughput Values of Context-Free Languages (DC, JC, WF, WR), pp. 203–213.
CIAACIAA-2007-MrazPO #context-free grammar #nondeterminism
A Measure for the Degree of Nondeterminism of Context-Free Languages (FM, MP, FO), pp. 192–202.
DLTDLT-2007-MalcherP #bound #complexity #context-free grammar
Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.
DLTDLT-2007-OchmanskiS
A Star Operation for Star-Free Trace Languages (EO, KS), pp. 337–345.
ICALPICALP-2007-Bar-NoyCOS #online
Online Conflict-Free Colorings for Hypergraphs (ABN, PC, SO, SS), pp. 219–230.
ICALPICALP-2007-FioreH #equation
Equational Systems and Free Constructions (Extended Abstract) (MPF, CKH), pp. 607–618.
ICALPICALP-2007-Schmitz #ambiguity #context-free grammar #detection
Conservative Ambiguity Detection in Context-Free Grammars (SS), pp. 692–703.
LATALATA-2007-MrazOP #automaton
Free Word-Order and Restarting Automata (FM, FO, MP), pp. 425–436.
LATALATA-2007-StawikowskaO #on the
On Star-Free Trace Languages and their Lexicographic Representations (KS, EO), pp. 541–552.
SEFMSEFM-2007-ColvinG #algorithm #scalability #stack #verification
A Scalable Lock-Free Stack Algorithm and its Verification (RC, LG), pp. 339–348.
CHICHI-2007-ZhaoDCBB #feedback #named #using
Earpod: eyes-free menu selection using touch input and reactive audio feedback (SZ, PD, MHC, RB, PB), pp. 1395–1404.
HCIHCI-IDU-2007-GokturkC #experience #open source
Out of Box Experience Issues of Free and Open Source Software (MG, ), pp. 774–783.
HCIHCI-IDU-2007-YangTT #perspective #strict
User Response to Free Trial Restrictions: A Coping Perspective (XY, CHT, HHT), pp. 991–1000.
HCIHIMI-MTT-2007-SakuradaHON #interface #online #recognition #using
A Japanese Text Input Interface Using On-Line Writing-Box-Free Handwriting Recognition and Kana-to-Kanji Conversion (TS, YH, HO, MN), pp. 940–949.
HCIHIMI-MTT-2007-TakemuraOKHKY #documentation
Context-Based Loose Information Structure for Medical Free Text Document (TT, KO, HK, MH, TK, HY), pp. 544–548.
KDDKDD-2007-SunFPY #graph #mining #named #scalability
GraphScope: parameter-free mining of large time-evolving graphs (JS, CF, SP, PSY), pp. 687–696.
SEKESEKE-2007-SilvaMPV #context-free grammar #evolution #grammar inference #xml
XML Schema Evolution by Context Free Grammar Inference (JCTdS, MAM, ATRP, SRV), p. 444–?.
ESEC-FSEESEC-FSE-2007-Scacchi #development #open source
Free/open source software development (WS), pp. 459–468.
CADECADE-2007-FalkeK #dependence
Dependency Pairs for Rewriting with Non-free Constructors (SF, DK), pp. 426–442.
CSLCSL-2007-GaintzarainHLNO #calculus #invariant
A Cut-Free and Invariant-Free Sequent Calculus for PLTL (JG, MH, PL, MN, FO), pp. 481–495.
ICLPICLP-2007-Zhou #prolog
A Register-Free Abstract Prolog Machine with Jumbo Instructions (NFZ), pp. 455–457.
LICSLICS-2007-JurdzinskiL #calculus #μ-calculus
Alternation-free modal μ-calculus for data trees (MJ, RL), pp. 131–140.
ASEASE-2006-MancinelliBCVDLT #complexity #open source #scalability
Managing the Complexity of Large Free and Open Source Package-Based Software Distributions (FM, JB, RDC, JV, BD, XL, RT), pp. 199–208.
DACDAC-2006-AlpertKSW
Timing-driven Steiner trees are (practically) free (CJA, ABK, CCNS, QW), pp. 389–392.
DACDAC-2006-LiZJ #concurrent #named #network #proximity
DyXY: a proximity congestion-aware deadlock-free dynamic routing method for network on chip (ML, QAZ, WBJ), pp. 849–852.
DACDAC-2006-NakamuraTOTY #design #scalability
Budgeting-free hierarchical design method for large scale and high-performance LSIs (YN, MT, TO, ST, KY), pp. 955–958.
DATEDATE-2006-ChoRJ #embedded #realtime
Lock-free synchronization for dynamic embedded real-time systems (HC, BR, EDJ), pp. 438–443.
DATEDATE-2006-McConaghyG #canonical #modelling #performance
Double-strength CAFFEINE: fast template-free symbolic modeling of analog circuits via implicit canonical form functions and explicit introns (TM, GGEG), pp. 269–274.
DATEDATE-2006-SchaumontSV #design #hardware #semantics
Design with race-free hardware semantics (PS, SKS, IV), pp. 571–576.
ICSMEICSM-2006-Robles #empirical #open source #re-engineering #research
Empirical Software Engineering Research on Free/Libre/Open Source Software (GR), pp. 347–350.
ICSMEICSM-2006-Stallman #linux #operating system
The Free Software Movement and the GNU/Linux Operating System (RMS), p. 426.
PLDIPLDI-2006-GuyerMF #automation #named #static analysis
Free-Me: a static analysis for automatic individual object reclamation (SZG, KSM, DF), pp. 364–375.
FLOPSFLOPS-2006-DiscoloHMJS #data type #haskell #using
Lock Free Data Structures Using STM in Haskell (AD, TH, SM, SLPJ, SS), pp. 65–80.
DLTDLT-2006-BastienCFR #context-free grammar #equivalence
Equivalence of Functions Represented by Simple Context-Free Grammars with Output (CB, JC, WF, WR), pp. 71–82.
DLTDLT-2006-BertoniCP #context-free grammar #xml
Context-Free Grammars and XML Languages (AB, CC, BP), pp. 108–119.
ICALPICALP-v2-2006-KahlerKW #protocol
A Dolev-Yao-Based Definition of Abuse-Free Protocols (DK, RK, TW), pp. 95–106.
ICEISICEIS-HCI-2006-FrangeskidesL #interactive #multi #prototype #type system
Multi-Modal Hands-Free Human Computer Interaction: A Prototype System (FF, AL), pp. 19–26.
ICMLICML-2006-StrehlLWLL #learning
PAC model-free reinforcement learning (ALS, LL, EW, JL, MLL), pp. 881–888.
ICPRICPR-v1-2006-ChavarriaS #3d #estimation #representation
Local Representation of 3D Free-Form Contours for Pose Estimation (MAC, GS), pp. 751–754.
ICPRICPR-v1-2006-FuTC #orthogonal #using
Specular Free Spectral Imaging Using Orthogonal Subspace Projection (ZF, RTT, TC), pp. 812–815.
ICPRICPR-v2-2006-CaiUS #algorithm #online #performance #recognition
An Efficient Radical-Based Algorithm for Stroke-Order-Free Online Kanji Character Recognition (WC, SU, HS), pp. 986–989.
ICPRICPR-v2-2006-JonssonF #learning
Correspondence-free Associative Learning (EJ, MF), pp. 441–446.
ICPRICPR-v4-2006-FeiLWL #image
Discontinuity-Based Simplification of Free Form Surface From a Range Image (GF, YL, BW, LL), pp. 13–16.
SEKESEKE-2006-JavedMSB #context-free grammar #domain-specific language #incremental
Incrementally Inferring Context-Free Grammars for Domain-Specific Languages (FJ, MM, APS, BRB), pp. 363–368.
MODELSMoDELS-2006-RashidM #domain model #modelling
Domain Models Are NOT Aspect Free (AR, AMDM), pp. 155–169.
MODELSMoDELS-2006-RashidM #domain model #modelling
Domain Models Are NOT Aspect Free (AR, AMDM), pp. 155–169.
SACSAC-2006-BonnetEV #ad hoc #mobile #network #using
Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts (FB, PDE, EV), pp. 670–674.
SACSAC-2006-ChoRJ #embedded #on the #realtime #scheduling
On utility accrual processor scheduling with wait-free synchronization for embedded real-time software (HC, BR, EDJ), pp. 918–922.
SACSAC-2006-KornerW #evaluation #multi
Bias-free hypothesis evaluation in multirelational domains (CK, SW), pp. 639–640.
HPCAHPCA-2006-Prvulovic #concurrent #detection #effectiveness #named
CORD: cost-effective (and nearly overhead-free) order-recording and data race detection (MP), pp. 232–243.
DACDAC-2005-TiriHHLYSV #embedded #encryption
A side-channel leakage free coprocessor IC in 0.18µm CMOS for embedded AES-based cryptographic and biometric processing (KT, DDH, AH, BCL, SY, PS, IV), pp. 222–227.
DATEDATE-2005-LiWYY #named #performance #power management
Q-DPM: An Efficient Model-Free Dynamic Power Management Technique (ML, XW, RY, XY), pp. 526–527.
DATEDATE-2005-McConaghyEG #canonical #generative #named #programming #search-based
CAFFEINE: Template-Free Symbolic Model Generation of Analog Circuits via Canonical Form Functions and Genetic Programming (TM, TE, GGEG), pp. 1082–1087.
ICDARICDAR-2005-GatosKNPP #approach #documentation #keyword
A Segmentation-free Approach for Keyword Search in Historical Typewritten Documents (BG, TK, KN, IP, SJP), pp. 54–58.
ICDARICDAR-2005-HandleyNZ #comprehension #context-free grammar #documentation #probability #using
Document Understanding System Using Stochastic Context-Free Grammars (JCH, AMN, RZ), pp. 511–515.
ICDARICDAR-2005-VajdaB #recognition #word
Structural Information Implant in a Context Based Segmentation-Free HMM Handwritten Word Recognition System for Latin and Bangla Script (SV, AB), pp. 1126–1130.
VLDBVLDB-2005-FungYYL #detection #parametricity
Parameter Free Bursty Events Detection in Text Streams (GPCF, JXY, PSY, HL), pp. 181–192.
FoSSaCSFoSSaCS-2005-Stark #algebra #modelling #π-calculus
Free-Algebra Models for the π-Calculus (IS), pp. 155–169.
ICSMEICSM-2005-KagdiMS #modelling #slicing #uml
Context-Free Slicing of UML Class Models (HHK, JIM, AS), pp. 635–638.
SASSAS-2005-RinetzkySY #analysis #interprocedural #source code
Interprocedural Shape Analysis for Cutpoint-Free Programs (NR, MS, EY), pp. 284–302.
STOCSTOC-2005-DobzinskiNS #algorithm #approximate #combinator
Approximation algorithms for combinatorial auctions with complement-free bidders (SD, NN, MS), pp. 610–618.
STOCSTOC-2005-LepinksiMS #protocol
Collusion-free protocols (ML, SM, AS), pp. 543–552.
CIAACIAA-J-2004-BordihnHK05 #context-free grammar #problem #subclass
Unsolvability levels of operation problems for subclasses of context-free languages (HB, MH, MK), pp. 423–440.
CIAACIAA-J-2004-Yli-Jyra05 #approximate #dependence #regular expression
Approximating dependency grammars through intersection of star-free regular languages (AYJ), pp. 565–579.
DLTDLT-2005-KariKST #on the #word
On Hairpin-Free Words and Languages (LK, SK, PS, GT), pp. 296–307.
IFLIFL-2005-CunhaPP #framework #program transformation
A Framework for Point-Free Program Transformation (AC, JSP, JP), pp. 1–18.
ICEISICEIS-v2-2005-MezaNMGC #analysis #modelling
Free Software for Decision Analysis: A Software Package for Data Envelopment Models (LAM, LBN, JCCBSdM, EGG, PHGC), pp. 207–212.
CIKMCIKM-2005-LiL #community #mining
Mining community structure of named entities from free text (XL, BL), pp. 275–276.
MLDMMLDM-2005-GhoshGYB05a #learning #parametricity
Determining Regularization Parameters for Derivative Free Neural Learning (RG, MG, JY, AMB), pp. 71–79.
SIGIRSIGIR-2005-ViolaN #context-free grammar #learning #using
Learning to extract information from semi-structured text using a discriminative context free grammar (PAV, MN), pp. 330–337.
MODELSMoDELS-2005-Steimann #domain model #modelling
Domain Models Are Aspect Free (FS), pp. 171–185.
MODELSMoDELS-2005-Steimann #domain model #modelling
Domain Models Are Aspect Free (FS), pp. 171–185.
OOPSLAOOPSLA-2005-AllanACHKLMSST #aspectj
Adding trace matching with free variables to AspectJ (CA, PA, ASC, LJH, SK, OL, OdM, DS, GS, JT), pp. 345–364.
SACSAC-2005-Goualard #algorithm #constraints #on the #theorem proving
On considering an interval constraint solving algorithm as a free-steering nonlinear Gauss-Seidel procedure (FG), pp. 1434–1438.
SACSAC-2005-LiuC #knowledge-based #query #retrieval
Knowledge-based query expansion to support scenario-specific retrieval of medical free text (ZL, WWC), pp. 1076–1083.
LDTALDTA-2005-CrepinsekMBJS #context-free grammar #domain-specific language
Inferring Context-Free Grammars for Domain-Specific Languages (MC, MM, BRB, FJ, APS), pp. 99–116.
PPoPPPPoPP-2005-SiegelA #modelling #source code #verification
Modeling wildcard-free MPI programs for verification (SFS, GSA), pp. 95–106.
SOSPSOSP-2005-HuangHS #energy #named #performance #replication
FS2: dynamic data replication in free disk space for improving disk performance and energy consumption (HH, WH, KGS), pp. 263–276.
LICSLICS-2005-LamarcheS #category theory
Constructing Free Boolean Categories (FL, LS), pp. 209–218.
DATEDATE-v2-2004-GoudarziHM #implementation #modelling #morphism #object-oriented #polymorphism
Overhead-Free Polymorphism in Network-on-Chip Implementation of Object-Oriented Models (MG, SH, AM), pp. 1380–1381.
VLDBVLDB-2004-LiYJ #xquery
Schema-Free XQuery (YL, CY, HVJ), pp. 72–83.
ICSMEICSM-2004-Rountev #identification #java #precise
Precise Identification of Side-Effect-Free Methods in Java (AR), pp. 82–91.
PLDIPLDI-2004-Michael #memory management #scalability
Scalable lock-free dynamic memory allocation (MMM), pp. 35–46.
CIAACIAA-2004-BordihnHK #context-free grammar #linear #problem
Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.
CIAACIAA-2004-Shan #graph grammar #modelling #probability
Stochastic Context-Free Graph Grammars for Glycoprotein Modelling (BS), pp. 247–258.
DLTDLT-2004-InenagaST #algorithm #context-free grammar #pattern matching #performance #subclass
An Efficient Pattern Matching Algorithm on a Subclass of Context Free Grammars (SI, AS, MT), pp. 225–236.
DLTDLT-2004-KutribMW #context-free grammar #linear
The Boolean Closure of Linear Context-Free Languages (MK, AM, DW), pp. 284–295.
ICALPICALP-2004-GuruswamiI #linear
Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) (VG, PI), pp. 695–707.
ICALPICALP-2004-SeidlSMH #for free
Counting in Trees for Free (HS, TS, AM, PH), pp. 1136–1149.
ICPRICPR-v1-2004-MiasnikovH #analysis #rank
Regression Analysis and Automorphic Orbits in Free Groups of Rank 2 (ADM, RMH), pp. 180–183.
ICPRICPR-v2-2004-LiuLW #using
Free Form Shape Matching Using Deterministic Annealing and Softassign (YL, LL, YW), pp. 128–131.
ICPRICPR-v2-2004-NakagawaZO #constraints #formal method #online #recognition
A Formalization of On-line Handwritten Japanese Text Recognition free from Line Direction Constraint (MN, BZ, MO), pp. 359–362.
ICPRICPR-v2-2004-NockP #bias #estimation
Grouping with Bias for Distribution-Free Mixture Model Estimation (RN, VP), pp. 44–47.
ICPRICPR-v2-2004-PressigoutM #artificial reality #visual notation
Model-Free Augmented Reality by Virtual Visual Servoing (MP, ÉM), pp. 887–890.
ICPRICPR-v3-2004-ChenB #3d #image #recognition #using
3D Free-Form Object Recognition in Range Images Using Local Surface Patches (HC, BB), pp. 136–139.
KDDKDD-2004-KeoghLR #data mining #mining #towards
Towards parameter-free data mining (EJK, SL, C(R), pp. 206–215.
KDDKDD-2004-WuGH #clustering #mining #network #using
Mining scale-free networks using geodesic clustering (AYW, MG, JH), pp. 719–724.
POPLPOPL-2004-JohannV #theorem
Free theorems in the presence of seq (PJ, JV), pp. 99–110.
SACSAC-2004-BelmonteCPR #robust
A robust deception-free coalition formation model (MVB, RC, JLPdlC, FTR), pp. 469–473.
SACSAC-2004-Kryszkiewicz
Reducing borders of k-disjunction free representations of frequent patterns (MK), pp. 559–563.
SACSAC-2004-RuckertK #graph
Frequent free tree discovery in graph data (UR, SK), pp. 564–570.
SACSAC-2004-SundellT #concurrent #scalability
Scalable and lock-free concurrent dictionaries (HS, PT), pp. 1438–1445.
HPCAHPCA-2004-HuVI #scheduling
Exploring Wakeup-Free Instruction Scheduling (JSH, NV, MJI), pp. 232–243.
HPDCHPDC-2004-AndradeBCM #grid #peer-to-peer
Discouraging Free Riding in a Peer-to-Peer CPU-Sharing Grid (NA, FVB, WC, MM), pp. 129–137.
CAVCAV-2004-FournetHRR #consistency
Stuck-Free Conformance (CF, CARH, SKR, JR), pp. 242–254.
CAVCAV-2004-GaoH #algorithm #parallel #reduction
A Formal Reduction for Lock-Free Parallel Algorithms (HG, WHH), pp. 44–56.
ICLPICLP-2004-LinkeTW #logic programming #on the #source code
On Acyclic and Head-Cycle Free Nested Logic Programs (TL, HT, SW), pp. 225–239.
LICSLICS-2004-SeshiaB #bound #quantifier #using
Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds (SAS, REB), pp. 100–109.
VMCAIVMCAI-2004-AgarwalS #java #type inference
Type Inference for Parameterized Race-Free Java (RA, SDS), pp. 149–160.
DATEDATE-2003-RapakaM #analysis #embedded #performance
Pre-Characterization Free, Efficient Power/Performance Analysis of Embedded and General Purpose Software Applications (VSPR, DM), pp. 10504–10509.
HTHT-2003-MillardDWAB #exclamation #hypermedia
AHA! meets Auld Linky: integrating designed and free-form hypertext systems (DEM, HCD, MJW, KA, PDB), pp. 161–169.
ICDARICDAR-2003-NakagawaO #online #recognition
On-line Handwritten Japanese Text Recognition free from Constrains on Line Direction and Character Orientation (MN, MO), pp. 519–523.
ICDARICDAR-2003-NakaiSS #generative #recognition #taxonomy
Generation of Hierarchical Dictionary for Stroke-order Free Kanji Handwriting Recognition Based on Substroke HMM (MN, HS, SS), pp. 514–518.
TACASTACAS-2003-Mateescu #equation #on the fly
A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems (RM), pp. 81–96.
FMFME-2003-FenkamGJ #approach #concurrent
Constructing Deadlock Free Event-Based Applications: A Rely/Guarantee Approach (PF, HCG, MJ), pp. 636–657.
ICFPICFP-2003-OgawaHS #program analysis
Iterative-free program analysis (MO, ZH, IS), pp. 111–123.
AGTIVEAGTIVE-2003-Klempien-HinrichsMT #3d
Collage Grammars for Collision-Free Growing of Objects in 3D Scenes (RKH, TM, CvT), pp. 383–397.
CHICHI-2003-BrewsterLBHT #interactive #multimodal #smarttech
Multimodal “eyes-free” interaction techniques for wearable devices (SAB, JL, MB, MH, ST), pp. 473–480.
CIKMCIKM-2003-ShanahanR #classification
Boosting support vector machines for text classification through parameter-free threshold relaxation (JGS, NR), pp. 247–254.
KDDKDD-2003-DuMouchelA #design
Applications of sampling and fractional factorial designs to model-free data squashing (WD, DKA), pp. 511–516.
MLDMMLDM-2003-YangOFZ #authoring #maintenance
Authoring Cases from Free-Text Maintenance Data (CY, RO, BF, MZ), pp. 131–140.
LICSLICS-2003-HughesG #linear #logic #multi #proving
Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract) (DJDH, RJvG), pp. 1–10.
RTARTA-2003-BrandMV #exclamation #for free #term rewriting
Environments for Term Rewriting Engines for Free! (MvdB, PEM, JJV), pp. 424–435.
RTARTA-2003-KhasidashviliG #partial order #semantics #term rewriting
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication) (ZK, JRWG), pp. 467–482.
CBSECBSE-2003-InverardiT #assembly #component #composition #synthesis
A compositional synthesis of failure-free connectors for correct components assembly (PI, MT), p. 17.
FoSSaCSFoSSaCS-2002-SchoppS #process #using #verification
Verifying Temporal Properties Using Explicit Approximants: Completeness for Context-free Processes (US, AKS), pp. 372–386.
TACASTACAS-2002-JinRS #fault
Fate and Free Will in Error Traces (HJ, KR, FS), pp. 445–459.
STOCSTOC-2002-AspnesSS #infinity
Wait-free consensus with infinite arrivals (JA, GS, JS), pp. 524–533.
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-GheorghiuB #algebra
Feedback-Free Circuits in the Algebra of Transients (MG, JAB), pp. 106–116.
DLTDLT-2002-Lam #finite
Finite Completion of Comma-Free Codes. Part I (NHL), pp. 357–368.
ICALPICALP-2002-Wich #ambiguity
Universal Inherence of Cycle-Free Context-Free Ambiguity Functions (KW), pp. 669–680.
ICFPICFP-2002-Voigtlander #for free
Concatenate, reverse and map vanish for free (JV), pp. 14–25.
ICGTICGT-2002-HageHW #graph
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes (JH, TH, EW), pp. 148–160.
ICMLICML-2002-OatesDB #context-free grammar #learning
Learning k-Reversible Context-Free Grammars from Positive Structural Examples (TO, DD, VB), pp. 459–465.
ICPRICPR-v1-2002-HuangHN
A Region-Based Method for Model-Free Object Tracking (YH, TSH, HN), pp. 592–595.
ICPRICPR-v2-2002-AbabsaRMD #2d #3d #automation
2D/3D Automatic Matching Technique for 3D Recovering of Free Form Objects (FA, DR, MM, JYD), pp. 430–433.
ICPRICPR-v3-2002-BoyerSF #for free #multi #recognition
Multiscale Surface Organization and Description for Free Form bject Recognition (KLB, RS, PJF), pp. 569–572.
ICPRICPR-v3-2002-CampbellF #recognition #using
Recognition of Free-Form Objects in Dense Range Data Using Local Features (RJC, PJF), pp. 607–610.
LOPSTRLOPSTR-2002-GutierrezR #calculus #type system #verification
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene (FG, BCR), pp. 17–31.
ASPLOSASPLOS-2002-RajwarG #execution #source code #transaction
Transactional lock-free execution of lock-based programs (RR, JRG), pp. 5–17.
CCCC-2002-Mohnen #analysis #approach #data flow
A Graph-Free Approach to Data-Flow Analysis (MM), pp. 46–61.
ISMMISMM-2002-DiceG
Mostly lock-free malloc (DD, AG), pp. 269–280.
CADECADE-2002-Ahrendt #data type #deduction #fault #generative #specification #using
Deductive Search for Errors in Free Data Type Specifications Using Model Generation (WA), pp. 211–225.
SATSAT-2002-Kusper #linear #problem #satisfiability
Solving the resolution-free SAT problem by hyper-unit propagation in linear time (GK), p. 32.
VMCAIVMCAI-2002-ZuckPK #automation #probability #verification
Automatic Verification of Probabilistic Free Choice (LDZ, AP, YK), pp. 208–224.
ASEASE-2001-InverardiS #architecture #component #concurrent #synthesis
Connectors Synthesis for Deadlock-Free Component-Based Architectures (PI, SS), p. 174–?.
ICDARICDAR-2001-HaseYSS #layout #recognition
Alignment of Free Layout Color Texts for Character Recognition (HH, MY, TS, CYS), pp. 932–936.
VLDBVLDB-2001-GravanoIJKMS #approximate #database #for free #string
Approximate String Joins in a Database (Almost) for Free (LG, PGI, HVJ, NK, SM, DS), pp. 491–500.
ITiCSEITiCSE-2001-LancasterC #detection #fault #process #towards
Towards an error free plagarism detection process (TL, FC), pp. 57–60.
TACASTACAS-2001-BolligLW #calculus #model checking #parallel #μ-calculus
Parallel Model Checking for the Alternation Free μ-Calculus (BB, ML, MW), pp. 543–558.
DLTDLT-2001-Hoogeboom #revisited
Context-Free Valence Grammars — Revisited (HJH), pp. 293–303.
DLTDLT-2001-Kuske #axiom #set
Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable (DK), pp. 206–216.
ICALPICALP-2001-DiekertM #commutative #decidability #equation
Solvability of Equations in Free Partially Commutative Groups Is Decidable (VD, AM), pp. 543–554.
OOPSLAOOPSLA-2001-BoyapatiR #java #source code #type system
A Parameterized Type System for Race-Free Java Programs (CB, MCR), pp. 56–69.
PPDPPPDP-2001-Naumann #imperative #modelling #programming #relational
Ideal Models for Pointwise Relational and State-Free Imperative Programming (DAN), pp. 4–15.
SACSAC-2001-VuHT #algorithm #detection #image #performance #query
An efficient core-area detection algorithm for fast noise-free image query processing (KV, KAH, DAT), pp. 258–263.
FSEESEC-FSE-2001-InverardiT #automation #concurrent #synthesis
Automatic synthesis of deadlock free connectors for COM/DCOM applications (PI, MT), pp. 121–131.
IJCARIJCAR-2001-CerritoM #logic #quantifier
Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation (SC, MCM), pp. 137–151.
IJCARIJCAR-2001-Giese #incremental
Incremental Closure of Free Variable Tableaux (MG), pp. 545–560.
RTARTA-2001-Ringeissen #question
Matching with Free Function Symbols — A Simple Extension of Matching? (CR), pp. 276–290.
DATEDATE-2000-KimLS #embedded #optimisation
Free MDD-Based Software Optimization Techniques for Embedded Systems (CK, LL, ALSV), pp. 14–18.
SIGMODSIGMOD-2000-RiedelFGN #data mining #for free #mining
Data Mining on an OLTP System (Nearly) for Free (ER, CF, GRG, DN), pp. 13–21.
WCREWCRE-J-1997-BrandSV00 #component #context-free grammar #generative #legacy
Generation of components for software renovation factories from context-free grammars (MvdB, MPAS, CV), pp. 209–266.
IWPCIWPC-2000-PowerM #analysis #context-free grammar
Metric-Based Analysis of Context-Free Grammars (JFP, BAM), pp. 171–178.
STOCSTOC-2000-Gutierrez #equation #satisfiability
Satisfiability of equations in free groups is in PSPACE (CG), pp. 21–27.
ICALPICALP-2000-Baum-WaidnerW #contract #multi
Round-Optimal and Abuse Free Optimistic Multi-party Contract Signing (BBW, MW), pp. 524–535.
WLCWLC-2000-DomosiK #context-free grammar
An Improvement of Iteration Lemmata for Context-free Languages (PD, MK), pp. 185–191.
ICFPICFP-2000-PottierC #data flow #for free
Information flow inference for free (FP, SC), pp. 46–57.
CIKMCIKM-2000-JohoS #scalability
Retrieving Descriptive Phrases from Large Amounts of Free Text (HJ, MS), pp. 180–186.
ICMLICML-2000-Reynolds #adaptation #bound #clustering #learning
Adaptive Resolution Model-Free Reinforcement Learning: Decision Boundary Partitioning (SIR), pp. 783–790.
ICPRICPR-v1-2000-LiuRC #geometry #using
Using Geometric Properties of Correspondence Vectors for the Registration of Free-Form Shapes (YL, MAR, DC), pp. 5011–5014.
ICPRICPR-v2-2000-FukushimaN #online #recognition
On-Line Writing-Box-Free Recognition of Handwritten Japanese Text Considering Character Size Variations (TF, MN), pp. 2359–2363.
ICPRICPR-v3-2000-SekimotoNTO #query #retrieval #using #video
Continuous Retrieval of Video Using Segmentation-Free Query (NS, TN, HT, RO), pp. 3375–3378.
ICPRICPR-v4-2000-ShihWL
A Calibration-Free Gaze Tracking Technique (SWS, YTW, JL), pp. 4201–4204.
KDDKDD-2000-HanPMCDH #mining #named
FreeSpan: frequent pattern-projected sequential pattern mining (JH, JP, BMA, QC, UD, MH), pp. 355–359.
SACSAC-2000-ODonnellRR #algorithm
A Side-Effect-Free Hierarchical Radiosity Algorithm (JO, TR, GR), pp. 782–791.
SPLCSPLC-2000-DoerrS #architecture #dependence #execution #product line
Freeing product line architectures from execution dependencies (BSD, DS), pp. 313–330.
OSDIOSDI-2000-LumbSGNR #towards
Towards Higher Disk Head Utilization: Extracting “Free” Bandwidth from Busy Disk Drives (CRL, JS, GRG, DN, ER), pp. 87–102.
DACDAC-1999-SgroiL #embedded #petri net #synthesis #using
Synthesis of Embedded Software Using Free-Choice Petri Nets (MS, LL), pp. 805–810.
ICDARICDAR-1999-ChoiO #network #recognition #using
A Segmentation-free Recognition of Two Touching Numerals using Neural Network (SMC, ISO), pp. 253–256.
ICDARICDAR-1999-LehalD #detection #documentation
A Range Free Skew Detection Technique for Digitized Gurmukhi Script Documents (GSL, RD), pp. 147–152.
PLDIPLDI-1999-MarletCB #for free #incremental #performance #runtime
Efficient Incremental Run-Time Specialization for Free (RM, CC, PB), pp. 281–292.
DLTDLT-1999-Wich #ambiguity #context-free grammar #exponential
Exponential ambiguity of context-free grammars (KW), pp. 125–138.
ICMLICML-1999-SakakibaraK #context-free grammar #learning #using
GA-based Learning of Context-Free Grammars using Tabular Representations (YS, MK), pp. 354–360.
CCCC-1999-SariavaS #compilation #data type
Data Structure Free Compilation (JS, SDS), pp. 1–16.
CSLCSL-1999-LautemannW #quantifier #reduction
MonadicNLIN and Quantifier-Free Reductions (CL, BW), pp. 322–337.
RTARTA-1999-CaronSTT #quantifier #satisfiability
Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
DATEDATE-1998-BoglioloBM #behaviour #modelling
Characterization-Free Behavioral Power Modeling (AB, LB, GDM), pp. 767–773.
DATEDATE-1998-RuttenBEK #algorithm #divide and conquer #logic #performance
An Efficient Divide and Conquer Algorithm for Exact Hazard Free Logic Minimization (JWJMR, MRCMB, CAJvE, MAJK), pp. 749–754.
SIGMODSIGMOD-1998-LiS #data mining #mining #parallel
Free Parallel Data Mining (BL, DS), pp. 541–543.
FASEFASE-1998-MargariaS #automation #backtracking #design #synthesis
Backtracking-Free Design Planning by Automatic Synthesis in METAFrame (TMS, BS), pp. 188–204.
FLOPSFLOPS-1998-Takahashi #revisited
λ-representable Functions over Free Structures Revisited (MT), pp. 1–19.
FLOPSFLOPS-1998-Tsukada #equation #reasoning
Type-free Equational Reasoning in the Theeory of Inductively Defined Types (YT), pp. 227–246.
ICALPICALP-1998-Ben-AmramP #source code
CONS-Free Programs with Tree Input (Extended Abstract) (AMBA, HP), pp. 271–282.
CIAAWIA-1998-AlbertGW #algorithm #context-free grammar #normalisation
Extended Context-Free Grammars and Normal Form Algorithms (JA, DG, DW), pp. 1–12.
ICGTTAGT-1998-EngelfrietM #graph grammar
Tree Languages Generated be Context-Free Graph Grammars (JE, SM), pp. 15–29.
CHICHI-1998-SchilitGP
Beyond Paper: Supporting Active Reading with Free Form Digital Ink Annotations (BNS, GG, MNP), pp. 249–256.
AdaSIGAda-1998-CarlisleM #agile #design #named #user interface
RAPID: A Free, Portable GUI Design Tool (MCC, PM), pp. 158–164.
ICPRICPR-1998-HungYCHF #pointer
Free-hand pointer by use of an active stereo vision system (YPH, YSY, YSC, IBH, CSF), pp. 1244–1246.
ICPRICPR-1998-KronerL #authentication #pattern matching #pattern recognition #recognition
Authentication of free hand drawings by pattern recognition methods (SK, ADL), pp. 462–464.
ICPRICPR-1998-NishikawaOM #3d #using
Selective acquisition of 3-D information enough for finding passable free spaces using an active stereo vision system (AN, AO, FM), pp. 857–861.
ICPRICPR-1998-SchutzJH #3d #algorithm #for free #multi
Multi-feature matching algorithm for free-form 3D surface registration (CS, TJ, HH), pp. 982–984.
HPDCHPDC-1998-Zambonelli #algorithm #distributed #effectiveness #on the
On the Effectiveness of Distributed Checkpoint Algorithms for Domino-Free Recovery (FZ), pp. 124–131.
CADECADE-1998-Waldmann
Superposition for Divisible Torsion-Free Abelian Groups (UW), pp. 144–159.
DACDAC-1997-LevitanMKRCFM #design
Computer-Aided Design of Free-Space Opto-Electronic Systems (SPL, PJM, TPK, MAR, DMC, CF, FBM), pp. 768–773.
ICDARICDAR-1997-ShridharHK #recognition #using #word
Handwritten Word Recognition Using Lexicon Free and Lexicon Directed Word (MS, GFH, FK), pp. 861–865.
TACASTACAS-1997-Kleuker #communication #concurrent #development #incremental
Incremental Development of Deadlock-Free Communicating Systems (SK), pp. 306–320.
WCREWCRE-1997-BrandSV #component #context-free grammar #generative #legacy
Generation of Components for Software Renovation Factories from Context-Free Grammars (MvdB, MPAS, CV), p. 144–?.
PEPMPEPM-1997-MelskiR #constraints #context-free grammar #reachability #set
Interconveritibility of Set Constraints and Context-Free Language Reachability (DM, TWR), pp. 74–89.
STOCSTOC-1997-LoH #robust
All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust (WKL, VH), pp. 579–588.
DLTDLT-1997-DassowMP #context-free grammar
Point mutations in context-free languages (JD, VM, GP), pp. 429–446.
DLTDLT-1997-MateescuSY #context-free grammar #decidability
Decidability of fairness for context-free languages (AM, KS, SY), pp. 351–364.
DLTDLT-1997-TokudaYW #re-engineering
Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols (TT, KY, YW), pp. 551–558.
DLTDLT-1997-Zhiltsova #context-free grammar #probability
An Optimal Coding for Stochastic Context-Free Languages with Unique Derivation (LPZ), pp. 539–550.
ICALPICALP-1997-BroersmaKKM #graph #independence #set
Independent Sets in Asteroidal Triple-Free Graphs (HB, TK, DK, HM), pp. 760–770.
ICALPICALP-1997-Wilke #first-order #logic #strict
Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
CIAAWIA-1997-Miller #algorithm #context-free grammar #normalisation #towards
Towards a Meta-Normal Form Algorithm for Context-Free Grammars (CLM), pp. 133–143.
CIAAWIA-1997-Ponty #performance #regular expression
An Efficient Null-Free Procedure for Deciding Regular Language Membership (JLP), pp. 159–170.
HCIHCI-CC-1997-Vanderheiden97a #architecture #interface
Use of a Common Table Architecture for Creating Hands Free, Eyes Free, Noisy Environment (Flex-Modal, Flex-Input) Interfaces (GCV), pp. 449–452.
HCIHCI-SEC-1997-Ramadhan #programming
Free vs. Guided Programming by Discovery (HAR), pp. 279–282.
SOSPSOSP-1997-LowellC #transaction
Free Transactions With Rio Vista (DEL, PMC), pp. 92–101.
LICSLICS-1997-Kobayashi #calculus #concurrent #process
A Partially Deadlock-Free Typed Process Calculus (NK0), pp. 128–139.
RTARTA-1997-Schulz #algorithm
A Criterion for Intractability of E-unification with Free Function Symbols and Its Relevance for Combination Algorithms (KUS), pp. 284–298.
RTARTA-1997-Struth #for free #on the #problem #word
On the Word Problem for Free Lattices (GS), pp. 128–141.
DACDAC-1996-KudvaGJN #multi #network #synthesis
Synthesis for Hazard-free Customized CMOS Complex-Gate Networks Under Multiple-Input Changes (PK, GG, HMJ, SMN), pp. 77–82.
DACDAC-1996-MehendaleVS #code generation #linear #multi
Optimized Code Generation of Multiplication-free Linear Transforms (MM, GV, SDS), pp. 41–46.
DACDAC-1996-TheobaldNW #heuristic #logic #named
Espresso-HF: A Heuristic Hazard-Free Minimizer for Two-Level Logic (MT, SMN, TW), pp. 71–76.
SIGMODSIGMOD-1996-McAuliffeCS #effectiveness #performance #towards
Towards Effective and Efficient Free Space Management (MLM, MJC, MHS), pp. 389–400.
STOCSTOC-1996-BshoutyGMST #concept #geometry #learning
Noise-Tolerant Distribution-Free Learning of General Geometric Concepts (NHB, SAG, HDM, SS, HT), pp. 151–160.
ICALPICALP-1996-BosscherG #decidability #process #scalability
Regularity for a Large Class of Context-Free Processes is Decidable (DJBB, WODG), pp. 182–193.
ICALPICALP-1996-Chen #approximate #graph #problem
Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs (ZZC), pp. 268–279.
ICALPICALP-1996-Senizergues #graph
Semi-Groups Acting on Context-Free Graphs (GS), pp. 206–218.
CSCWCSCW-1996-NakanishiYNI #named #network
FreeWalk: Supporting Casual Meetings in a Network (HN, CY, TN, TI), pp. 308–314.
AdaTRI-Ada-1996-Westley #ada #development #independence #named #tool support #user interface #visual notation
TASH: A Free Platform-Independent Graphical User Interface Development Toolkit for Ada (TJW), pp. 165–178.
ICPRICPR-1996-BrunnstromS #algorithm #for free #search-based
Genetic algorithms for free-form surface matching (KB, AJS), pp. 689–693.
ICPRICPR-1996-DoraiJ #3d #recognition
Recognition of 3D free-form objects (CD, AKJ), pp. 697–701.
ICPRICPR-1996-HanM
Reconstructing free-form surfaces from sparse data (SH, GGM), pp. 100–104.
ICPRICPR-1996-KrebsSK #3d #algorithm #fuzzy #recognition
A fuzzy ICP algorithm for 3D free-form object recognition (BK, PS, BK), pp. 539–543.
ICPRICPR-1996-LiuCC #graph #online #order #recognition #relational #using
Stroke order and stroke number free on-line Chinese character recognition using attributed relational graph matching (JL, WkC, MMYC), pp. 259–263.
ECOOPECOOP-1996-Minsky #alias #pointer #towards
Towards Alias-Free Pointers (NHM), pp. 189–209.
SACSAC-1996-LeungC #network
A stroke-order free Chinese handwriting input system based on relative stroke positions and back-propagation networks (WnL, KsC), pp. 22–27.
HPCAHPCA-1996-ParkA #concurrent #independence
A Topology-Independent Generic Methodology for Deadlock-Free Wormhole Routing (HP, DPA), pp. 191–200.
CSLCSL-1996-Gore #algebra #calculus
Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.
CSLCSL-1996-Roversi #resource management #λ-calculus
A Type-Free Resource-Aware λ-Calculus (LR), pp. 399–413.
LICSLICS-1996-AltenkirchHS #normalisation #polymorphism
Reduction-Free Normalisation for a Polymorphic System (TA, MH, TS), pp. 98–106.
DACDAC-1995-SawasakiYL #implementation
Externally Hazard-Free Implementations of Asynchronous Circuits (MHS, CYC, BL), pp. 718–724.
DACDAC-1995-TelicheveskyKW #analysis #performance
Efficient Steady-State Analysis Based on Matrix-Free Krylov-Subspace Methods (RT, KSK, JW), pp. 480–484.
ICDARICDAR-v1-1995-Al-BadrH #recognition #word
Segmentation-free word recognition with application to Arabic (BAB, RMH), pp. 355–359.
ICDARICDAR-v2-1995-KimuraMS #algorithm #recognition #using #word
Handwritten ZIP code recognition using lexicon free word recognition algorithm (FK, YM, MS), pp. 906–910.
TACASTACAS-1995-KnoopSV #analysis #exclamation #explosion #for free #parallel
Parallelism for Free: Bitvector Analyses -> No State Explosion! (JK, BS, JV), pp. 264–289.
SASSAS-1995-RaoS #execution #prolog #source code
Unification-Free Execution of Well-Moded and Well-Typed Prolog Programs (MRKKR, RKS), pp. 243–260.
STOCSTOC-1995-AfekDT #performance
Wait-free made fast (Extended Abstract) (YA, DD, DT), pp. 538–547.
DLTDLT-1995-Asveld #context-free grammar #parsing #recognition #robust #towards
Towards Robustness in Parsing — Fuzzifying Context-Free Language Recognition (PRJA), pp. 443–453.
DLTDLT-1995-Georgescu #complexity #context-free grammar #metric #orthogonal
The Orthogonality of Some Complexity Measures of Context-Free Languages (GG), pp. 73–78.
DLTDLT-1995-JancarMPPV #automaton #context-free grammar
Restarting Automata, Marcus Grammars and Context-Free Languages (PJ, FM, MP, MP, JV), pp. 102–111.
DLTDLT-1995-MateiT #context-free grammar
(0, 1)-Total Pure Context-Free Grammars (CM, FLT), pp. 148–153.
DLTDLT-1995-SalomaaY #context-free grammar #nondeterminism
Nondeterminism Degrees for Context-Free Languages (KS, SY), pp. 154–165.
DLTDLT-1995-SchieringT #automaton #first-order #logic
Counter-Free Automata, First-Order Logic and Star-Free Expressions (IS, WT), pp. 166–175.
ICALPICALP-1995-CorneilOS #algorithm #graph #linear
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (DGC, SO, LS), pp. 292–302.
ICALPICALP-1995-GolinR #algorithm #programming
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs (MJG, GR), pp. 256–267.
ICMLICML-1995-Niyogi #complexity #learning
Free to Choose: Investigating the Sample Complexity of Active Learning of Real Valued Functions (PN), pp. 405–412.
SACSAC-1995-Cheung #ambiguity #context-free grammar
Ambiguity in context-free grammars (BSNC), pp. 272–276.
DATEEDAC-1994-BernGMS
Boolean Manipulation with Free BDD’s. First Experimental Results (JB, JG, CM, AS), pp. 200–207.
DATEEDAC-1994-LinKL #approach #synthesis
Direct Synthesis of Hazard-Free Asynchronous Circuits from STGs Based on Lock Relation and BG-Decomposition Approach (KJL, JWK, CSL), pp. 178–183.
PEPMPEPM-1994-Jones #partial evaluation
Dictionary-Free Overloading by Partial Evaluation (MPJ), pp. 107–117.
STOCSTOC-1994-BenalohT
Receipt-free secret-ballot elections (extended abstract) (JCB, DT), pp. 544–553.
STOCSTOC-1994-HerlihyS #theorem
A simple constructive computability theorem for wait-free computation (MH, NS), pp. 243–252.
ICALPICALP-1994-BirgetMMW #algorithm #problem
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups (JCB, SWM, JCM, PW), pp. 274–285.
ICALPICALP-1994-HotzP #analysis #context-free grammar #performance
Fast Uniform Analysis of Coupled-Context-Free Languages (GH, GP), pp. 412–423.
LISPLFP-1994-Tolmach #garbage collection #parametricity #using
Tag-Free Garbage Collection Using Explicit Type Parameters (APT), pp. 1–11.
CAVCAV-1994-BouajjaniER #hybrid #linear #using #verification
Verification of Context-Free Timed Systems Using Linear Hybrid Observers (AB, RE, RR), pp. 118–131.
ICLPICLP-1994-AzevedoS #program transformation
Recomputation-Free Lemmatization by Program Transformation (PJdSA, MJS), pp. 739–740.
ICLPILPS-1994-DebrayGB #detection #logic programming #optimisation #source code
Detection and Optimization of Suspension-free Logic Programs (SKD, DG, PAB), pp. 487–501.
LICSLICS-1994-LincolnS #calculus #first-order #linear #logic #proving
Proof Search in First-Order Linear Logic and Other Cut-Free Sequent Calculi (PL, NS), pp. 282–291.
DACDAC-1993-ChuML #finite #performance #state machine
An Efficient Critical Race-Free State Assignment Technique for Asynchronous Finite State Machines (TAC, NM, CKCL), pp. 2–6.
ICDARICDAR-1993-ChenD #approach #recognition #word
Word recognition in a segmentation-free approach to OCR (CHC, JLD), pp. 573–576.
ICDARICDAR-1993-IttnerB #analysis #layout
Language-free layout analysis (DJI, HSB), pp. 336–340.
PLDIPLDI-1993-BallL #branch #for free #predict
Branch Prediction For Free (TB, JRL), pp. 300–313.
STOCSTOC-1993-SaksZ
Wait-free k-set agreement is impossible: the topology of public knowledge (MES, FZ), pp. 101–110.
DLTDLT-1993-EhrenfeuchtHPR #context-free grammar
An Introduction to Context-free Text Grammars (AE, HJH, PtP, GR), pp. 357–369.
DLTDLT-1993-Georgescu #context-free grammar #on the
On the Index of Pure Context-free Grammars and Languages (GG), pp. 60–69.
DLTDLT-1993-Raz #context-free grammar #equivalence #multi
Deciding Multiplicity Equivalence for Certain Context-free Languages (DR), pp. 18–29.
ICALPICALP-1993-HungarS #model checking #process
Local Model Checking for Context-Free Processes (HH, BS), pp. 593–605.
ICALPICALP-1993-MignosiS
If a D0L Language is k-Power Free then it is Circular (FM, PS), pp. 507–518.
ICALPICALP-1993-Senizergues #effectiveness #theorem
An Effective Version of Stallings’ Theorem in the Case of Context-Free Groups (GS), pp. 478–495.
HCIHCI-SHI-1993-PalanqueBD #design #for free
Contextual Help for Free with Formal Dialogue Design (PAP, RB, LD), pp. 615–620.
CIKMCIKM-1993-Sussna #ambiguity #for free #network #semantics #using #word
Word Sense Disambiguation for Free-text Indexing Using a Massive Semantic Network (MS), pp. 67–74.
SACSAC-1993-HyslopL #diagrams #fault #incremental
Error Free Incremental Construction of Voronoi Diagrams in the Plane (GAH, EAL), pp. 388–396.
ICALPICALP-1992-Engelfriet #graph grammar #normalisation
A Greibach Normal Form for Context-free Graph Grammars (JE), pp. 138–149.
ICALPICALP-1992-KarhumakiPR #context-free grammar #polynomial #testing
Polynomial Size Test Sets for Context-Free Languages (JK, WP, WR), pp. 53–64.
POPLPOPL-1992-Remy #for free #type system
Typing Record Concatenation for Free (DR), pp. 166–176.
SOSPSOSP-WIP-1991-MassalinP92 #kernel #multi
A Lock-Free Multiprocessor OS Kernel (Abstract) (HM, CP), p. 8.
CADECADE-1992-BeckertH #semantics #similarity
An Improved Method for Adding Equality to Free Variable Semantic Tableaux (BB, RH), pp. 507–521.
CADECADE-1992-Kesner #order #orthogonal #term rewriting
Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors (DK), pp. 603–617.
CSLCSL-1992-BaazZ #algorithm #proving
Algorithmic Structuring of Cut-free Proofs (MB, RZ), pp. 29–42.
DACDAC-1991-LavagnoKS #algorithm #synthesis
Algorithms for Synthesis of Hazard-Free Asynchronous Circuits (LL, KK, ALSV), pp. 302–308.
PLDIPLDI-1991-Goldberg #garbage collection #programming language
Tag-Free Garbage Collection for Strongly Typed Programming Languages (BG), pp. 165–176.
STOCSTOC-1991-AndersonW #algorithm #parallel #problem
Wait-free Parallel Algorithms for the Union-Find Problem (RJA, HW), pp. 370–380.
ICALPICALP-1991-DuchampK #commutative #monad
Lazard’s Factorizations of Free Partially Commutative Monoids (GD, DK), pp. 242–253.
SIGIRSIGIR-1991-RauJ #database #retrieval
Creating Segmented Databases from Free Text for Text Retrieval (LFR, PSJ), pp. 337–346.
CAVCAV-1991-CleavelandS #algorithm #calculus #linear #model checking #μ-calculus
A Linear-Time Model-Checking Algorithm for the Alternation-Free Modal μ-Calculus (RC, BS), pp. 48–58.
CAVCAV-1991-Huttel #branch #decidability #process #similarity
Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes (HH), pp. 2–12.
LICSLICS-1991-HuttelS #process #proving #similarity #word
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes (HH, CS), pp. 376–386.
ESOPESOP-1990-NielsonN #exclamation #for free
Eureka Definitions for Free! or Disagreement Points for Fold/Unford Transformations (HRN, FN), pp. 291–305.
ICALPICALP-1990-ColeGO #diagrams #parallel #performance
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version) (RC, MTG, ), pp. 432–445.
ICGTGG-1990-CourcelleER #graph grammar
Context-free Handle-rewriting Hypergraph Grammars (BC, JE, GR), pp. 253–268.
ICGTGG-1990-Engelfriet #graph #higher-order #logic #monad
A Characterization of Context-Free NCE Graph Languages by Monadic Second-Order Logic on Trees (JE), pp. 311–327.
ICGTGG-1990-EngelfrietH #generative #graph grammar #power of
The Term Generating Power of Context-Free Hypergraph Grammars (JE, LH), pp. 328–243.
ICGTGG-1990-Lichtblau #polynomial
Recognizing Rooted Context-free Flowgraph Languages in Polynomial Time (UL), pp. 538–548.
SIGIRSIGIR-1990-Burkowski #retrieval #set
Surrogate Subsets: A Free Space Management Strategy for the Index of a Text Retrieval System (FJB), pp. 211–226.
CADECADE-1990-WakayamaP #abstraction #source code
Case-Free Programs: An Abstraction of Definite Horn Programs (TW, THP), pp. 87–101.
ICALPICALP-1989-GambosiNT #data type
A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps (GG, EN, MT), pp. 405–422.
ICALPICALP-1989-LiV #concurrent #how
How to Share Concurrent Asynchronous Wait-Free Variables (Preliminary Version) (ML, PMBV), pp. 488–505.
FPCAFPCA-1989-Wadler #exclamation #for free #theorem
Theorems for Free! (PW), pp. 347–359.
CSLCSL-1989-Stark89a #logic programming #quantifier #source code
A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.
ICLPNACLP-1989-Nystrom #concurrent #execution #logic
Variable-Free Execution of Concurrent Logic Languages (SON), pp. 536–552.
PODSPODS-1988-Kelter #concurrent #protocol #queue
The Queue Protocol: A Deadlock-free Homogeneous Non-Two-Phase Locking Protocol (UK), pp. 142–151.
ICALPICALP-1988-Diekert #commutative #for free #monad #transitive
Transitive Orientations, Möbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids (VD), pp. 176–187.
ICALPICALP-1988-Lautemann #algorithm #graph grammar #performance
Efficient Algorithms on Context-Free Graph Grammars (CL), pp. 362–378.
ICALPICALP-1988-LengauerW #analysis #graph #performance
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract) (TL, EW), pp. 379–393.
PPDPPLILP-1988-YamashitaN #paradigm #programming
Coupled Contex-Free Grammar As a Programming Paradigm (YY, IN), pp. 132–145.
CSLCSL-1988-Lippert #logic
Interval Temporal Logic and Star-Free Expressions (DL), pp. 187–198.
ICLPJICSCP-1988-AttilaF88 #evaluation #execution #semantics #source code
Unification-Free Execution of TYPOL Programs by Semantic Attribute Evaluation (IA, PFZ), pp. 160–177.
ICLPJICSCP-1988-WinsboroughW88
Transparent And-Parallelism in the Presence of Shared Free Variables (WHW, AW), pp. 749–764.
LICSLICS-1988-BoudetJS #unification
Unification in Free Extensions of Boolean Rings and Abelian Groups (AB, JPJ, MSS), pp. 121–130.
ICALPICALP-1987-ChoffrutD #monad #problem
A Star-Height Problem in Free Monoids with Partial Communications (CC, CD), pp. 190–201.
ICALPICALP-1987-HowellR #equivalence #reachability
Completeness Rules for Reachability, Containment, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems (RRH, LER), pp. 509–520.
PODSPODS-1986-ChanA #on the
On the Properties and Characterization of Connection-tap-free Schemes (EPFC, PA), pp. 140–147.
STOCSTOC-1986-Kosaraju #evaluation #parallel
Parallel Evaluation of Division-Free Arithmetic Expressions (SRK), pp. 231–239.
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-Metivier #commutative #monad #on the #set
On Recognizable Subsets of Free Partially Commutative Monoids (YM), pp. 254–264.
ICGTGG-1986-Courcelle86a #graph #higher-order #monad #on the #set
On context-free sets of graphs and their monadic second-order theory (BC), pp. 133–146.
CADECADE-1986-Tiden #set #unification
Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols (ET), pp. 431–449.
ICLPSLP-1986-Naughton86 #recursion
Redundancy in Function-Free Recursive Rules (JFN), pp. 236–245.
DACDAC-1985-KrasniewskiA #estimation #self
Simulation-free estimation of speed degradation in NMOS self-testing circuits for CAD applications (AK, AA), pp. 808–811.
VLDBVLDB-1985-LausenSW #concurrent #policy
Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy (GL, ESS, PW), pp. 270–281.
ICALPICALP-1985-Keranen #morphism #on the #word
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet (VK), pp. 338–347.
ICALPICALP-1985-Pin #finite #for free #monad
Finite Group Topology and p-Adic Topology for Free Monoids (JÉP), pp. 445–455.
SIGIRSIGIR-1985-ChiFSL #database
Processing Free-Text Input to Obtain a Database of Medical Information (ECC, CF, NS, MSL), pp. 82–90.
POPLPOPL-1985-MishraR #type checking
Declaration-Free Type Checking (PM, USR), pp. 7–21.
ICLPSLP-1985-MaluszynskiK85 #execution #logic programming #source code
Unification-Free Execution of Logic Programs (JM, HJK), pp. 78–86.
POPLPOPL-1984-HalpernMT #question #semantics #what
The Semantics of Local Storage, or What Makes the Free-List Free? (JYH, ARM, BAT), pp. 245–257.
CADECADE-1984-PelinG #algebra #complexity #problem #using #word
Solving Word Problems in Free Algebras Using Complexity Functions (AP, JHG), pp. 476–495.
ICALPICALP-1983-Karhumaki #monad
A Note on Intersections of Free Submonoids of a Free Monoid (JK), pp. 397–407.
ICALPICALP-1983-Lange
Context-Free Controlled ETOL Systems (KJL), pp. 723–733.
ICALPICALP-1982-Blum #context-free grammar #on the #power of
On the Power of Chain Rules in Context Free Grammars (NB), pp. 72–82.
ICALPICALP-1982-EhrenfeuchtHR #context-free grammar
Conditions Enforcing Regularity of Context-Free Languages (AE, DH, GR), pp. 187–191.
ICGTGG-1982-HabelK #on the
On context-free gragh languages generated by edge replacement (AH, HJK), pp. 143–158.
ASPLOSASPLOS-1982-DitzelM #c #for free #stack
Register Allocation for Free: The C Machine Stack Cache (DRD, HRM), pp. 48–56.
POPLPOPL-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.
DACDAC-1980-SatoSNOY
A “grid-free” channel router (KS, HS, TN, MO, TY), pp. 22–31.
STOCSTOC-1980-CarlsonS #graph
Graph Pebbling with Many Free Pebbles can be Difficult (DAC, JES), pp. 326–332.
STOCSTOC-1980-Toueg #network
Deadlock- and Livelock-Free Packet Switching Networks (ST), pp. 94–99.
ICALPICALP-1980-AlbertC #context-free grammar #equivalence #morphism #testing
Test Sets for Homomorphism Equivalence on Context Free Languages (JA, KCI), pp. 12–18.
ICALPICALP-1980-Kozen #modelling #representation #theorem
A Representation Theorem for Models of *-Free PDL (DK), pp. 351–362.
DACDAC-1979-KjelkerudT #deduction #fault #generative #logic #simulation #testing #using
Generation of hazard free tests using the D-algorithm in a timing accurate system for logic and deductive fault simulation (EK, OT), pp. 180–184.
STOCSTOC-1979-TouegU #concurrent #network
Deadlock-Free Packet Switching Networks (ST, JDU), pp. 89–98.
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-1978-FortuneHS #complexity #equivalence #for free
The Complexity of Equivalence and Containment for Free Single Variable Program Schemes (SF, JEH, EMS), pp. 227–240.
ICGTGG-1978-Kreowski #graph
A Pumping Lemma for Context-Free Graph Languages (HJK), pp. 270–283.
POPLPOPL-1978-Culik #parallel
Almost Control-Free (Indeterministic) Parallel Computation on Permit Schemes (KC), pp. 176–184.
ICALPICALP-1977-Dieterich #context-free grammar #fault #parsing
Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures (EWD), pp. 180–192.
ICALPICALP-1977-DikovskyM #ambiguity #context-free grammar #on the
On Three Types of Unambiguity of Context-Free Languages (AJD, LSM), pp. 193–205.
ICALPICALP-1977-SippuS #fault #on the #parsing
On Defining Error Recovery in Context-Free Parsing (SS, ESS), pp. 492–503.
ICALPICALP-1977-Walter #context-free grammar #decidability #equivalence
Structural Equivalence of Context-Free Grammar Forms is Decidable (HKGW), pp. 539–553.
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-Sudborough #automaton #context-free grammar #multi #on the #power of
On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.
ICALPICALP-1976-AltM #bound #complexity #recognition
Lower Bounds for the Space Complexity of Context-Free Recognition (HA, KM), pp. 338–354.
ICALPICALP-1976-Linna #context-free grammar #on the
On ω-sets Associated with Context-Free Languages (ML), pp. 1–19.
VLDBVLDB-1975-Chin #analysis #behaviour
Analysis of VSAM’s Free-Space Behavior (YHC), pp. 514–515.
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-HuntR #context-free grammar
Computational Parallels between the Regular and Context-Free Languages (HBHI, DJR), pp. 64–74.
ICALPICALP-1974-Blattner #context-free grammar #set
Transductions of Context-Free Languages into Sets of Sentential Forms (MB), pp. 511–522.
ICALPICALP-1974-CremersG #context-free grammar
Context-Free Grammar Forms (ABC, SG), pp. 364–382.
ICALPICALP-1974-DilgerR #monad #strict
Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.
ICALPICALP-1974-ShamirB
Checking Stacks and Context-Free Programmed Grammars Accept p-complete Languages (ES, CB), pp. 27–33.
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.
STOCSTOC-1973-Teitelbaum #algebra #analysis #evaluation #fault
Context-Free Error Analysis by Evaluation of Algebraic Power Series (RT), pp. 196–199.
DACDAC-1972-Banes #design #fault
Error free MOS/LSI design system (AVB), pp. 29–33.
ICALPICALP-1972-Baker #context-free grammar #context-sensitive grammar #generative
Context-Sensitive Grammars Generating Context-Free Languages (BSB), pp. 501–506.
ICALPICALP-1972-Lentin #equation #monad
Equations in Free Monoids (AL), pp. 67–85.
ICALPICALP-1972-WeissMS #algebra #context-free grammar #parsing
Algebraic Parsing Techniques for Context-Free Languages (SFW, GM, DFS), pp. 493–498.
ICALPICALP-1972-Zalcstein
Syntactic Semigroups of Some Classes of Star-Free Languages (YZ), pp. 135–144.
STOCSTOC-1971-Meyers #linear #representation
Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations (WJM), pp. 50–62.
STOCSTOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #set
An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.
STOCSTOC-1970-Rounds #proving #theorem
Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages (WCR), pp. 109–116.
STOCSTOC-1969-AhoU #context-free grammar
Translations on a Context Free Grammar (AVA, JDU), pp. 93–112.
STOCSTOC-1969-Johansen #regular expression
Free Groups and Regular Expressions (PJ), pp. 113–128.
STOCSTOC-1969-PetersR #analysis #context-free grammar #revisited
Context-Sensitive Immediate Constituent Analysis — Context-Free Languages Revisited (PSPJ, RWR), pp. 1–8.
STOCSTOC-1969-Rounds #context-free grammar
Context-Free Grammars on Trees (WCR), pp. 143–148.
STOCSTOC-1969-Ullian #algorithm #ambiguity #context-free grammar #problem
The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages (JSU), pp. 19–20.

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.