Stem restrict$ (all stems)

160 papers:

ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.

ICEIS-v1-2015-AwasthiLK #algorithm #linear #problem #sequence #strict

Un-restricted Common Due-Date Problem with Controllable Processing Times — Linear Algorithm for a Given Job Sequence (AA, JL, OK), pp. 526–534.

ECIR-2015-HuynhHR #analysis #learning #sentiment #strict

Learning Higher-Level Features with Convolutional Restricted Boltzmann Machines for Sentiment Analysis (TH, YH, SMR), pp. 447–452.

ICML-2015-LeeY #category theory #predict #strict

Boosted Categorical Restricted Boltzmann Machine for Computational Prediction of Splice Junctions (TL, SY), pp. 2483–2492.

KDD-2015-XieDX #documentation #modelling #strict

Diversifying Restricted Boltzmann Machine for Document Modeling (PX, YD, EPX), pp. 1315–1324.

CSL-2015-GasconST #polynomial #strict #unification

Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.

LICS-2015-AmarilliB #finite #query #strict

Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.

DAC-2014-WenZMC #design #memory management #strict

State-Restrict MLC STT-RAM Designs for High-Reliable High-Performance Memory System (WW, YZ, MM, YC), p. 6.

DATE-2014-CasparLH #automation #strict #testing #using

Automated system testing using dynamic and resource restricted clients (MC, ML, WH), pp. 1–4.

CSCW-2014-Vitak #facebook #maintenance #strict

Facebook makes the heart grow fonder: relationship maintenance strategies among geographically dispersed and communication-restricted connections (JV), pp. 842–853.

CIKM-2014-RahmanH #network #strict #using

Sampling Triples from Restricted Networks using MCMC Strategy (MR, MAH), pp. 1519–1528.

ICML-c2-2014-MittelmanKSL #strict

Structured Recurrent Temporal Restricted Boltzmann Machines (RM, BK, SS, HL), pp. 1647–1655.

ICPR-2014-TanakaO #novel #strict

A Novel Inference of a Restricted Boltzmann Machine (MT, MO), pp. 1526–1531.

ICPR-2014-YamashitaTYYF #strict

To Be Bernoulli or to Be Gaussian, for a Restricted Boltzmann Machine (TY, MT, EY, YY, HF), pp. 1520–1525.

IJCAR-2014-Lellmann #axiom #strict #theory and practice

Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (BL), pp. 307–321.

SAT-2014-SakaiST #reduction #satisfiability #strict

Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.

HIMI-D-2013-VuH #memory management #strict

The Influence of Password Restrictions and Mnemonics on the Memory for Passwords of Older Adults (KPLV, MMH), pp. 660–668.

ICML-c3-2013-GeorgievN #collaboration #framework #strict

A non-IID Framework for Collaborative Filtering with Restricted Boltzmann Machines (KG, PN), pp. 1148–1156.

SPLC-2013-ClementsKSW #strict

A PLE-based auditing method for protecting restricted content in derived products (PCC, CWK, JS, AW), pp. 218–226.

VLDB-2012-BenediktBL #query #strict

Querying Schemas With Access Restrictions (MB, PB, CL), pp. 634–645.

ICALP-v1-2012-PolacekS #strict

Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.

ICML-2012-DahlAL #strict #word

Training Restricted Boltzmann Machines on Word Observations (GED, RPA, HL), p. 152.

ICML-2012-RudermanRGP #metric #probability #strict

Tighter Variational Representations of f-Divergences via Restriction to Probability Measures (AR, MDR, DGG, JP), p. 151.

ICPR-2012-HuZFZ #clustering #multi #strict

Multi-way constrained spectral clustering by nonnegative restriction (HH, JZ, JF, JZ), pp. 1550–1553.

ICPR-2012-YasudaKWT #estimation #strict

Composite likelihood estimation for restricted Boltzmann machines (MY, SK, YW, KT), pp. 2234–2237.

IJCAR-2012-BaaderBM #encoding #ontology #satisfiability #strict #unification

SAT Encoding of Unification in ℰℒℋ_R⁺ w.r.t. Cycle-Restricted Ontologies (FB, SB, BM), pp. 30–44.

FoSSaCS-2011-GabbayC #set #strict

Freshness and Name-Restriction in Sets of Traces with Names (MJG, VC), pp. 365–380.

AFL-2011-CermakM #automaton #strict

n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.

AFL-2011-Ito #strict

K-Restricted Duplication Closure of Languages (MI), pp. 28–33.

ICALP-v1-2011-LokshtanovM #clustering #strict

Clustering with Local Restrictions (DL, DM), pp. 785–797.

EDOC-2011-SchleicherFGLNSS #strict

Compliance Domains: A Means to Model Data-Restrictions in Cloud Environments (DS, CF, SG, FL, AN, PS, DS), pp. 257–266.

ICML-2011-ChoRI #adaptation #learning #strict

Enhanced Gradient and Adaptive Learning Rate for Training Restricted Boltzmann Machines (KC, TR, AI), pp. 105–112.

REFSQ-2011-PostMP #case study #requirements #strict

Applying Restricted English Grammar on Automotive Requirements — Does it Work? A Case Study (AP, IM, AP), pp. 166–180.

ICSE-2011-AndroutsopoulosBCGHLL #modelling #strict

Model projection: simplifying models in response to restricting the environment (KA, DB, DC, NG, MH, KL, ZL), pp. 291–300.

VLDB-2011-RiceT10 #graph #network #query #strict

Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.

DLT-2010-DassowM #context-free grammar #on the #strict

On Restricted Context-Free Grammars (JD, TM), pp. 434–435.

DLT-2010-ReidenbachS #ambiguity #morphism #strict

Restricted Ambiguity of Erasing Morphisms (DR, JCS), pp. 387–398.

ICML-2010-LongS #approximate #simulation #strict

Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate (PML, RAS), pp. 703–710.

ICML-2010-NairH #linear #strict

Rectified Linear Units Improve Restricted Boltzmann Machines (VN, GEH), pp. 807–814.

ICPR-2010-TekeT #image #multi #strict #using

Multi-spectral Satellite Image Registration Using Scale-Restricted SURF (MT, AT), pp. 2310–2313.

KR-2010-CreignouST #abduction #complexity #set #strict

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).

SEKE-2010-VilaMF #adaptation #analysis #qvt #strict #using

Using QVT for adapting question analysis to restricted domain QA systems (KV, JNM, AF), pp. 335–338.

SAT-2010-Ben-SassonJ #bound #learning #strict

Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.

FoSSaCS-2009-ArandaVV #on the #power of #replication #strict

On the Expressive Power of Restriction and Priorities in CCS with Replication (JA, FDV, CV), pp. 242–256.

ICALP-v2-2009-GottlobGS #optimisation #problem #strict

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (GG, GG, FS), pp. 16–30.

AdaEurope-2009-UruenaZP #distributed #middleware #realtime #strict

A Restricted Middleware Profile for High-Integrity Distributed Real-Time Systems (SU, JZ, JAdlP), pp. 16–29.

ICML-2009-GargK #algorithm #strict

Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property (RG, RK), pp. 337–344.

ICML-2009-TaylorH #modelling #strict

Factored conditional restricted Boltzmann Machines for modeling motion style (GWT, GEH), pp. 1025–1032.

MLDM-2009-Truemper #reliability #strict

Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization (KT), pp. 1–15.

SAC-2009-GroppeGEL #in memory #memory management #performance #strict

Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns (JG, SG, SE, VL), pp. 1231–1238.

SAT-2009-Johannsen #bound #exponential #learning #strict

An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.

SAT-2009-JohannsenRW #satisfiability #strict

Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.

CASE-2008-PaekL #clustering #scheduling #strict #tool support

Optimal scheduling of dual-armed cluster tools without swap restriction (JHP, TEL), pp. 103–108.

VLDB-2008-LuM #database #named #strict

AuditGuard: a system for database auditing under retention restrictions (WL, GM), pp. 1484–1487.

SEFM-2008-GhassemiFM #process #strict

Restricted Broadcast Process Theory (FG, WF, AM), pp. 345–354.

GT-VMT-2006-WinkelmannTEK08 #constraints #generative #graph grammar #metamodelling #ocl #strict

Translation of Restricted OCL Constraints into Graph Constraints for Generating Meta Model Instances by Graph Grammars (JW, GT, KE, JMK), pp. 159–170.

ECIR-2008-AltingovdeCU #performance #query #strict #web

Efficient Processing of Category-Restricted Queries for Web Directories (ISA, FC, ÖU), pp. 695–699.

ICML-2008-LarochelleB #classification #strict #using

Classification using discriminative restricted Boltzmann machines (HL, YB), pp. 536–543.

ICML-2008-Tieleman #approximate #strict #using

Training restricted Boltzmann machines using approximations to the likelihood gradient (TT), pp. 1064–1071.

ICPR-2008-KobayashiO #strict

Cone-restricted subspace methods (TK, NO), pp. 1–4.

KR-2008-Chetcuti-SperandioL #how #logic #strict

How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic (NCS, SL), pp. 340–347.

KR-2008-SchroderP #how #logic #strict

How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics (LS, DP), pp. 307–317.

SAC-2008-EspinasseFF #information management #ontology #strict #web

Agent and ontology based information gathering on restricted web domains with AGATHE (BE, SF, FLGdF), pp. 2381–2386.

LCTES-2008-AuerbachBGSV #concurrent #flexibility #graph #java #programming #strict #thread

Flexible task graphs: a unified restricted thread programming model for java (JSA, DFB, RG, JHS, JV), pp. 1–11.

HCI-IDU-2007-YangTT #perspective #strict

User Response to Free Trial Restrictions: A Coping Perspective (XY, CHT, HHT), pp. 991–1000.

ICML-2007-SalakhutdinovMH #collaboration #strict

Restricted Boltzmann machines for collaborative filtering (RS, AM, GEH), pp. 791–798.

MLDM-2007-Olvera-LopezTC #float #strict

Restricted Sequential Floating Search Applied to Object Selection (JAOL, JFMT, JACO), pp. 694–702.

SEKE-2007-ChanCT #parametricity #random testing #strict #testing

Controlling Restricted Random Testing: An Examination of the Exclusion Ratio Parameter (KPC, TYC, DT), pp. 163–166.

SIGIR-2007-SchockaertC #information retrieval #strict

Neighborhood restrictions in geographic IR (SS, MDC), pp. 167–174.

HPDC-2007-AldermanL #strict

Task-specific restricted delegation (IDA, ML), pp. 243–244.

CSL-2007-DawarR #finite #logic #power of #strict

The Power of Counting Logics on Restricted Classes of Finite Structures (AD, DR), pp. 84–98.

FM-2006-Kassios #dependence #strict

Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions (ITK), pp. 268–283.

ICGT-2006-RiedlSF #generative #graph grammar #order #strict #string #word

String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.

SAC-2006-Xing #strict

Enhancing program verifications by restricting object types (CCX), pp. 1816–1821.

SAT-2006-KojevnikovK #algebra #complexity #proving #strict

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.

FoSSaCS-2005-AehligMO #safety #strict #string

Safety Is not a Restriction at Level 2 for String Languages (KA, JGdM, CHLO), pp. 490–504.

CIAA-2005-JurdzinskiO #automaton #strict

Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.

DLT-2005-AlloucheS #morphism #strict

Restricted Towers of Hanoi and Morphisms (JPA, AS), pp. 1–10.

ICALP-2005-TessonT #communication #complexity #strict

Restricted Two-Variable Sentences, Circuits and Communication Complexity (PT, DT), pp. 526–538.

ECIR-2005-CamposFH #diagrams #documentation #evaluation #retrieval #strict

Improving the Context-Based Influence Diagram Model for Structured Document Retrieval: Removing Topological Restrictions and Adding New Evaluation Methods (LMdC, JMFL, JFH), pp. 215–229.

ECIR-2005-SiersdorferW #classification #strict #using

Using Restrictive Classification and Meta Classification for Junk Elimination (SS, GW), pp. 287–299.

SAC-2005-RimassaV #comprehension #java #parametricity #strict

Understanding access restriction of variant parametric types and Java wildcards (GR, MV), pp. 1390–1397.

SAC-OOPS-J-2005-ViroliR #java #on the #strict

On Access Restriction with Java Wildcards (MV, GR), pp. 117–139.

SAT-2005-HirschN #proving #simulation #strict

Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution (EAH, SIN), pp. 135–142.

STOC-2004-GairingLMM #nash #parallel #scheduling #strict

Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.

FLOPS-2004-Garrigue #strict

Relaxing the Value Restriction (JG), pp. 196–213.

SIGIR-2004-SiersdorferS #clustering #documentation #self #strict

Restrictive clustering and metaclustering for self-organizing document collections (SS, SS), pp. 226–233.

OOPSLA-2004-BravenboerV #domain-specific language #strict #syntax

Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions (MB, EV), pp. 365–383.

SAC-2004-RahmaniK #graph #strict

Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.

SPLC-2004-Wesowski #automation #generative #product line #strict

Automatic Generation of Program Families by Model Restrictions (AW), pp. 73–89.

STOC-2003-ItohTT #independence #on the #permutation #strict

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions (TI, YT, JT), pp. 710–719.

ICALP-2003-AroraC #approximate #problem #strict

Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.

AdaEurope-2003-ChanCT #normalisation #random testing #strict #testing

Normalized Restricted Random Testing (KPC, TYC, DT), pp. 368–381.

AdaEurope-2003-HolstiL #framework #strict

Impact of a Restricted Tasking Profile: The Case of the GOCE Platform Application Software (NH, TL), pp. 92–101.

ECIR-2003-CachedaCGV #data type #hybrid #optimisation #strict #using #web

Optimization of Restricted Searches in Web Directories Using Hybrid Data Structures (FC, VC, CG, ÁV), pp. 436–451.

CSL-2003-KristiansenV #power of #source code #strict

The Surprising Power of Restricted Programs and Gödel’s Functionals (LK, PJV), pp. 345–358.

CSL-2003-Vorobjov #effectiveness #formal method #strict

Effective Model Completeness of the Theory of Restricted Pfaffian Functions (Invited Lecture) (NV), p. 544.

STOC-2002-KargerR #metric #nearest neighbour #strict

Finding nearest neighbors in growth-restricted metrics (DRK, MR), pp. 741–750.

SAC-2002-RiveroDF #database #elicitation #strict

Elicitation and conversion of hidden objects and restrictions in a database schema (LCR, JHD, VEF), pp. 463–469.

CSL-2002-Beckmann #proving #strict

Resolution Refutations and Propositional Proofs with Height-Restrictions (AB), pp. 599–612.

TLCA-2001-CardelliG #logic #strict

Logical Properties of Name Restriction (LC, ADG), pp. 46–60.

ICPR-v4-2000-NakaiIMW #monitoring #strict #visual notation

Non-Restrictive Visual Respiration Monitoring (HN, KI, YM, MW), pp. 4647–4651.

KR-2000-BaaderK #concept #strict

Matching Concept Descriptions with Existential Restrictions (FB, RK), pp. 261–272.

KR-2000-HaarslevM #reasoning #strict #transitive

Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles (VH, RM), pp. 273–284.

UML-2000-DammHTT #strict #uml

Supporting Several Levels of Restriction in the UML (CHD, KMH, MT, MT), pp. 396–409.

SAC-2000-RiveroDL #detection #network #static analysis #strict

Static Detection of Sources of Dynamic Anomalies in a Network of Referential Integrity Restrictions (LCR, JHD, DL), pp. 333–339.

CL-2000-Janhunen #logic programming #source code #strict

Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.

CL-2000-Pliuskevicius #deduction #on the #strict

On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.

RTA-2000-Lohrey #confluence #problem #strict #word

Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.

DAC-1999-ZhouWLA #strict

Simultaneous Routing and Buffer Insertion with Restrictions on Buffer Locations (HZ, DFW, IML, AA), pp. 96–99.

FLOPS-1999-CamaraoF #strict #type inference

Type Inference for Overloading without Restrictions, Declarations or Annotations (CC, LF), pp. 37–52.

HCI-EI-1999-Davies99a #generative #memory management #strict

The role of external memory in a complex task: Effects of device and memory restrictions on program generation (SPD), pp. 1268–1272.

CAV-1999-Klarlund #automaton #formal method #logic #strict

A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.

HCI-SEC-1997-KohtakeYA #communication #process #strict

Reducing Restriction of Activity in Media Communication with Demand Driven Viewer (NK, YY, YA), pp. 189–192.

STOC-1996-ChaudhuriR #complexity #strict

Deterministic Restrictions in Circuit Complexity (SC, JR), pp. 30–36.

STOC-1996-Milenkovic #linear #programming #strict #using

Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction (VM), pp. 109–118.

KR-1996-BaaderS #logic #strict

Number Restrictions on Complex Roles in Description Logics: A Preliminary Report (FB, US), pp. 328–339.

RTA-1995-Boulton #higher-order #semantics #strict

A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics (RJB), pp. 309–323.

CADE-1994-KlingenbeckH #semantics #strict

Semantic Tableaux with Ordering Restrictions (SK, RH), pp. 708–722.

DLT-1993-Fernau #parallel #strict

Remarks on Adult Languages of Propagating Systems with Restricted Parallelism (HF), pp. 90–101.

SEKE-1993-Maim #abduction #constraints #logic programming #source code #strict

Restricted Abduction in Constraint Logic Programs (EM), pp. 222–224.

ILPS-1993-Spencer #order #strict

The Ordered Clause Restriction of Model Elimination and SLI Resolution (BS), p. 678.

IWPTS-1992-HigashinoBLYT #parametricity #strict

Test System for a Restricted Class of LOTOS Expressions with Data Parameters (TH, GvB, XL, KY, KT), pp. 205–216.

JICSLP-1992-KempSS #bottom-up #evaluation #logic programming #query #source code #strict

Query Restricted Bottom-Up Evaluation of Normal Logic Programs (DBK, PJS, DS), pp. 288–302.

KR-1991-HollunderB #concept #strict

Qualifying Number Restrictions in Concept Languages (BH, FB), pp. 335–346.

ICLP-1991-Yap #strict

Restriction Site Mapping in CLP(R) (RHCY), pp. 521–534.

CADE-1990-BachmairG #on the #order #strict

On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.

CLP-1990-SchreyeVB90 #detection #graph #horn clause #query #strict #using

A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs (DDS, KV, MB), pp. 649–663.

SIGMOD-1989-HullS #complexity #database #object-oriented #on the #strict

On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (Extended Abstract) (RH, JS), pp. 147–158.

STOC-1989-AfratiC #query #recursion #strict

Expressiveness of Restricted Recursive Queries (Extended Abstract) (FNA, SSC), pp. 113–126.

NACLP-1989-ChangC #execution #strict

Restricted AND-Parallelism Execution Model with Side-Effects (SEC, YPC), pp. 350–368.

RTA-1989-Otto #canonical #congruence #finite #strict #string #term rewriting

Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.

PODS-1988-Hegner #component #composition #relational #strict

Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction (SJH), pp. 174–183.

ESOP-1988-JacobsL #compilation #logic programming #source code #strict

Compilation of Logic Programs for Restricted And-Parallelism (DJ, AL), pp. 284–297.

ICALP-1988-Wagner #on the #strict

On Restricting the Access to an NP-Oracle (KWW), pp. 682–696.

CADE-1988-Rabinov #strict

A Restriction of Factoring in Binary Resolution (AR), pp. 582–591.

JICSCP-1988-BiswasSY88 #automaton #logic programming #parallel #scalability #source code #strict

A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.

SLP-1987-DeGroot87 #strict

Restricted And-Parallelism and Side Effects (DD), pp. 80–89.

ICALP-1986-Fribourg #induction #strict

A Strong Restriction of the Inductive Completion Procedure (LF), pp. 105–115.

GG-1986-AalbersbergER #complexity #strict

Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.

CADE-1986-Burckert #strict #unification

Some Relationships between Unification, restricted Unification, and Matching (HJB), pp. 514–524.

ICLP-1986-Hermenegildo86 #automaton #execution #logic programming #source code #strict

An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.

PODS-1985-Sagiv85a #on the #strict

On Computing Restricted Projections of Representative Instances (YS), pp. 171–180.

STOC-1985-Heide #algorithm #performance #problem #strict

Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.

STOC-1984-KlawePPY #on the #strict

On Monotone Formulae with Restricted Depth (Preliminary Version) (MMK, WJP, NP, MY), pp. 480–487.

ICALP-1984-IbarraKR #performance #simulation #strict

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.

ILPC-1984-Sintzoff84 #bound #source code #strict

Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.

STOC-1983-Valiant #bound #exponential #strict

Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.

DAC-1982-Kaplan #strict #verification

A “non-restrictive” artwork verification program for printed circuit boards (DK), pp. 551–558.

ILPC-1982-HirschmanP82 #prolog #strict

Restriction Grammar in Prolog (LH, KP), pp. 85–90.

SIGIR-1981-BollmannC #evaluation #information retrieval #strict

Restricted Evaluation in Information Retrieval (PB, VSC), pp. 15–21.

DAC-1980-TadaYKS #performance #strict

A fast maze router with iterative use of variable search space restriction (FT, KY, TK, TS), pp. 250–254.

ICALP-1980-Schmidt #attribute grammar #strict

Space-Restricted Attribute Grammars (EMS), pp. 436–448.

ICALP-1979-PapadimitriouY #complexity #problem #strict

The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (CHP, MY), pp. 460–470.

STOC-1977-KintalaF #nondeterminism #strict

Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract) (CMRK, PCF), pp. 178–185.

STOC-1974-Greibach #strict

Some Restrictions on W-Grammars (SAG), pp. 256–265.

STOC-1974-VairavanD #parallel #scheduling #source code #strict

Parallel Scheduling of Programs in a Restricted Model of Computation (KV, RAD), pp. 248–255.

ICALP-1974-DilgerR #monad #strict

Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.

SIGIR-1971-LovemanMT #named #preprocessor #strict

CUE: A Preprocessor for Restricted, Natural English (DBL, JAM, RGT), pp. 47–59.

DAC-1968-Marin #algorithm #logic #on the #strict #synthesis #using

On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits (MAM).