BibSLEIGH — strict tag

strict

strict

Tag #strict

322 papers:

EDM-2019-ColemanBS #predict #student: A Better Cold-Start for Early Prediction of Student At-Risk Status in New School Districts (CC, RSB, SS).
EDM-2019-LiangYZPG #case study #concept #learning #partial order: Active Learning of Strict Partial Orders: A Case Study on Concept Prerequisite Relations (CL0, JY, HZ0, BP, CLG).
CIAA-2019-SmithS #2d #automaton #problem: Decision Problems for Restricted Variants of Two-Dimensional Automata (TJS, KS), pp. 222–234.
ASE-2019-Kolthoff #automation #generative #natural language #prototype #requirements #user interface #visual notation: Automatic Generation of Graphical User Interface Prototypes from Unrestricted Natural Language Requirements (KK), pp. 1234–1237.
CADE-2019-BhayatR #combinator #unification: Restricted Combinatory Unification (AB, GR), pp. 74–93.
CADE-2019-ZhaoS #automation #logic: FAME(Q): An Automated Tool for Forgetting in Description Logics with Qualified Number Restrictions (YZ, RAS), pp. 568–579.
FSCD-2018-Bahr #λ-calculus: Strict Ideal Completions of the Lambda Calculus (PB), p. 16.
ICFP-2018-HirschT #lazy evaluation #monad #semantics: Strict and lazy semantics for effects: layering monads and comonads (AKH, RT), p. 30.
ASE-2018-Diarra #automation #kernel #towards: Towards automatic restrictification of CUDA kernel arguments (RD), pp. 928–931.
SANER-2017-RahmanR #concept #identification #information retrieval #named: STRICT: Information retrieval based search term identification for concept location (MMR0, CKR), pp. 79–90.
ECIR-2017-CeroniGF #constraints #corpus #crowdsourcing #named #validation: JustEvents: A Crowdsourced Corpus for Event Validation with Strict Temporal Constraints (AC, UG, MF), pp. 484–492.
OOPSLA-2017-AdamsM #automaton: Restricting grammars with tree automata (MDA, MM), p. 25.
CGO-2017-MaalejPRGP #ambiguity #pointer: Pointer disambiguation via strict inequalities (MM, VP, PR, LG, FMQP), pp. 134–147.
CADE-2017-CristiaR #set: A Decision Procedure for Restricted Intensional Sets (MC, GR), pp. 185–201.
VMCAI-2017-CuoqRC #alias #detection: Detecting Strict Aliasing Violations in the Wild (PC, LR, AC), pp. 14–33.
DLT-2016-ManeaNS #equation #on the #problem #word: On the Solvability Problem for Restricted Classes of Word Equations (FM, DN, MLS), pp. 306–318.
IFM-2016-Owe #concurrent #inheritance #object-oriented #reasoning #reuse: Reasoning About Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems (OO), pp. 210–225.
Haskell-2016-WangNF #algorithm #named #search-based #using: Autobahn: using genetic algorithms to infer strictness annotations (YRW, DN, KF), pp. 114–126.
CIKM-2016-WangTML #linked data #open data: Paired Restricted Boltzmann Machine for Linked Data (SW, JT, FM, HL0), pp. 1753–1762.
ICML-2016-Tosh: Mixing Rates for the Alternating Gibbs Sampler over Restricted Boltzmann Machines and Friends (CT), pp. 840–849.
ICPR-2016-MurakamiKT #on the: On restricting modalities in likelihood-ratio based biometric score fusion (TM, YK, KT), pp. 3036–3042.
KDD-2016-ZhaoATBDBKD #approach #detection #parametricity #using: A Non-parametric Approach to Detect Epileptogenic Lesions using Restricted Boltzmann Machines (YZ, BA, TT, KEB, JGD, CEB, RK, OD), pp. 373–382.
CC-2016-CamposASP: Restrictification of function arguments (VHSC, PROA, HNS, FMQP), pp. 163–173.
ESOP-2016-Lepigre #semantics: A Classical Realizability Model for a Semantical Value Restriction (RL), pp. 476–502.
CSL-2016-AltenkirchCK #similarity #type system: Extending Homotopy Type Theory with Strict Equality (TA, PC, NK), p. 17.
ICALP-v1-2015-BjorklundDH #exponential #problem #random #set: 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: 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: Learning Higher-Level Features with Convolutional Restricted Boltzmann Machines for Sentiment Analysis (TH, YH, SMR), pp. 447–452.
ICML-2015-LeeY #category theory #predict: Boosted Categorical Restricted Boltzmann Machine for Computational Prediction of Splice Junctions (TL, SY), pp. 2483–2492.
KDD-2015-XieDX #documentation #modelling: Diversifying Restricted Boltzmann Machine for Document Modeling (PX, YD, EPX), pp. 1315–1324.
PEPM-2015-KootH #analysis #exception #functional #higher-order #semantics #type system: Type-based Exception Analysis for Non-strict Higher-order Functional Languages with Imprecise Exception Semantics (RK, JH), pp. 127–138.
PEPM-2015-VerstoepH #analysis #functional #higher-order: Polyvariant Cardinality Analysis for Non-strict Higher-order Functional Languages: Brief Announcement (HV, JH), pp. 139–142.
CASE-2015-FantiMRUP #energy: A control strategy for district energy management (MPF, AMM, MR, WU, SP), pp. 432–437.
CASE-2015-TanakaM #algorithm #bound #problem: Dominance properties for the unrestricted block relocation problem and their application to a branch-and-bound algorithm (ST, FM), pp. 509–514.
DATE-2015-BrunduPAGRRM #distributed #energy #framework #integration: A new distributed framework for integration of district energy data from heterogeneous devices (FGB, EP, AA, MG, GR, SR, EM), pp. 992–993.
PDP-2015-RobertsenWM #data transfer #memory management #multi #simulation: Lattice Boltzmann Simulations at Petascale on Multi-GPU Systems with Asynchronous Data Transfer and Strictly Enforced Memory Read Alignment (FR, JW, KM), pp. 604–609.
PDP-2015-SalamatEB #3d #adaptation #algorithm #fault: An Adaptive, Low Restrictive and Fault Resilient Routing Algorithm for 3D Network-on-Chip (RS, ME, NB), pp. 392–395.
ESOP-2015-DavidKL #source code #termination: Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs (CD, DK, ML), pp. 183–204.
CSL-2015-GasconST #polynomial #unification: Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.
LICS-2015-AmarilliB #finite #query: Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
CSCW-2014-Vitak #facebook #maintenance: Facebook makes the heart grow fonder: relationship maintenance strategies among geographically dispersed and communication-restricted connections (JV), pp. 842–853.
CIKM-2014-RahmanH #network #using: Sampling Triples from Restricted Networks using MCMC Strategy (MR, MAH), pp. 1519–1528.
ICML-c2-2014-MittelmanKSL: Structured Recurrent Temporal Restricted Boltzmann Machines (RM, BK, SS, HL), pp. 1647–1655.
ICPR-2014-TanakaO #novel: A Novel Inference of a Restricted Boltzmann Machine (MT, MO), pp. 1526–1531.
ICPR-2014-YamashitaTYYF: To Be Bernoulli or to Be Gaussian, for a Restricted Boltzmann Machine (TY, MT, EY, YY, HF), pp. 1520–1525.
ASPLOS-2014-KastureS #named #performance: Ubik: efficient cache sharing with strict qos for latency-critical workloads (HK, DS), pp. 729–742.
DAC-2014-WenZMC #design #memory management: State-Restrict MLC STT-RAM Designs for High-Reliable High-Performance Memory System (WW, YZ, MM, YC), p. 6.
DATE-2014-CasparLH #automation #testing #using: Automated system testing using dynamic and resource restricted clients (MC, ML, WH), pp. 1–4.
IJCAR-2014-Lellmann #axiom #theory and practice: Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (BL), pp. 307–321.
SAT-2014-SakaiST #reduction #satisfiability: Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (TS, KS, ST), pp. 32–47.
SIGMOD-2013-ChenZ #difference #privacy #recursion #towards: Recursive mechanism: towards node differential privacy and unrestricted joins (SC, SZ), pp. 653–664.
CIAA-J-2012-Crespi-ReghizziP13 #testing: Strict Local Testability with Consensus Equals Regularity, and Other Properties (SCR, PSP), pp. 747–764.
DLT-2013-Blanchet-SadriW #bound: Strict Bounds for Pattern Avoidance (FBS, BW), pp. 106–117.
ICALP-v2-2013-HoeferW: Locally Stable Marriage with Strict Preferences (MH, LW), pp. 620–631.
HIMI-D-2013-VuH #memory management: The Influence of Password Restrictions and Mnemonics on the Memory for Passwords of Older Adults (KPLV, MMH), pp. 660–668.
ICML-c2-2013-Rebagliati #clustering #fault #normalisation: Strict Monotonicity of Sum of Squares Error and Normalized Cut in the Lattice of Clusterings (NR), pp. 163–171.
ICML-c3-2013-GeorgievN #collaboration #framework: A non-IID Framework for Collaborative Filtering with Restricted Boltzmann Machines (KG, PN), pp. 1148–1156.
SPLC-2013-ClementsKSW: A PLE-based auditing method for protecting restricted content in derived products (PCC, CWK, JS, AW), pp. 218–226.
SAC-2013-AhatAB #grid #modelling #smarttech: Modeling fundamentals for smart grid enabled ecodistricts (MA, SBA, AB), pp. 688–689.
VLDB-2012-BenediktBL #query: Querying Schemas With Access Restrictions (MB, PB, CL), pp. 634–645.
CIAA-2012-Crespi-ReghizziP #testing: Strict Local Testability with Consensus Equals Regularity (SCR, PSP), pp. 113–124.
ICALP-v1-2012-PolacekS: Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.
ICALP-v1-2012-RabinMMY #performance #transaction #validation: Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.
AIIDE-2012-JaffeMALKP #game studies: Evaluating Competitive Game Balance with Restricted Play (AJ, AM, EA, YEL, AK, ZP).
ICML-2012-DahlAL #word: Training Restricted Boltzmann Machines on Word Observations (GED, RPA, HL), p. 152.
ICML-2012-RudermanRGP #metric #probability: Tighter Variational Representations of f-Divergences via Restriction to Probability Measures (AR, MDR, DGG, JP), p. 151.
ICPR-2012-HuZFZ #clustering #multi: Multi-way constrained spectral clustering by nonnegative restriction (HH, JZ, JF, JZ), pp. 1550–1553.
ICPR-2012-YasudaKWT #estimation: Composite likelihood estimation for restricted Boltzmann machines (MY, SK, YW, KT), pp. 2234–2237.
STOC-2012-BrodalLT #fibonacci: Strict fibonacci heaps (GSB, GL, RET), pp. 1177–1184.
IJCAR-2012-BaaderBM #encoding #ontology #satisfiability #unification: SAT Encoding of Unification in ℰℒℋ_R⁺ w.r.t. Cycle-Restricted Ontologies (FB, SB, BM), pp. 30–44.
AFL-2011-CermakM #automaton: n-Accepting Restricted Pushdown Automata Systems (MC, AM), pp. 168–183.
AFL-2011-Ito: K-Restricted Duplication Closure of Languages (MI), pp. 28–33.
CIAA-2011-BechetDF: Categorial Grammars with Iterated Types form a Strict Hierarchy of k-Valued Languages (DB, AJD, AF), pp. 42–52.
ICALP-v1-2011-LokshtanovM #clustering: Clustering with Local Restrictions (DL, DM), pp. 785–797.
EDOC-2011-SchleicherFGLNSS: 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: Enhanced Gradient and Adaptive Learning Rate for Training Restricted Boltzmann Machines (KC, TR, AI), pp. 105–112.
PADL-2011-Christiansen #named: Sloth — A Tool for Checking Minimal-Strictness (JC), pp. 160–174.
PEPM-2011-FernandesSSV #source code: Strictification of circular programs (JPF, JS, DS, JV), pp. 131–140.
PPDP-2011-ChristiansenS #polymorphism: Minimally strict polymorphic functions (JC, DS), pp. 53–64.
REFSQ-2011-PostMP #case study #requirements: Applying Restricted English Grammar on Automotive Requirements — Does it Work? A Case Study (AP, IM, AP), pp. 166–180.
ICSE-2011-AndroutsopoulosBCGHLL #modelling: Model projection: simplifying models in response to restricting the environment (KA, DB, DC, NG, MH, KL, ZL), pp. 291–300.
ICSE-2011-PukallGSKCG #adaptation #java #named: JavAdaptor: unrestricted dynamic software updates for Java (MP, AG, RS, CK, WC, SG), pp. 989–991.
FoSSaCS-2011-GabbayC #set: Freshness and Name-Restriction in Sets of Traces with Names (MJG, VC), pp. 365–380.
VLDB-2011-RiceT10 #graph #network #query: 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: On Restricted Context-Free Grammars (JD, TM), pp. 434–435.
DLT-2010-ReidenbachS #ambiguity #morphism: Restricted Ambiguity of Erasing Morphisms (DR, JCS), pp. 387–398.
FLOPS-2010-AlvezL #axiom #similarity: A Complete Axiomatization of Strict Equality (JÁ, FJLF), pp. 118–133.
ICML-2010-LongS #approximate #simulation: Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate (PML, RAS), pp. 703–710.
ICML-2010-NairH #linear: Rectified Linear Units Improve Restricted Boltzmann Machines (VN, GEH), pp. 807–814.
ICPR-2010-TekeT #image #multi #using: Multi-spectral Satellite Image Registration Using Scale-Restricted SURF (MT, AT), pp. 2310–2313.
KR-2010-CreignouST #abduction #complexity #set: Complexity of Propositional Abduction for Restricted Sets of Boolean Functions (NC, JS, MT).
SEKE-2010-VilaMF #adaptation #analysis #qvt #using: Using QVT for adapting question analysis to restricted domain QA systems (KV, JNM, AF), pp. 335–338.
PEPM-2010-HoldermansH: Making “stricterness” more relevant (SH, JH), pp. 121–130.
SAS-2010-SchrijversM #data flow: Strictness Meets Data Flow (TS, AM), pp. 439–454.
CC-2010-DingO #algorithm #representation: Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values (SD, SÖ), pp. 26–45.
HPDC-2010-YuanYWZ #named #parallel #predict #scheduling: PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling (YY, GY, YW, WZ), pp. 240–251.
ISSTA-2010-BaoZLZX #analysis #data flow #dependence #information management: Strict control dependence and its effect on dynamic information flow analyses (TB, YZ, ZL, XZ, DX), pp. 13–24.
LICS-2010-He #finite #first-order #on the #quantifier: On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures (YH), pp. 170–178.
SAT-2010-Ben-SassonJ #bound #learning: Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.
ICALP-v2-2009-GottlobGS #optimisation #problem: Tractable Optimization Problems through Hypergraph-Based Structural Restrictions (GG, GG, FS), pp. 16–30.
ICML-2009-GargK #algorithm: Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property (RG, RK), pp. 337–344.
ICML-2009-TaylorH #modelling: Factored conditional restricted Boltzmann Machines for modeling motion style (GWT, GEH), pp. 1025–1032.
MLDM-2009-Truemper #reliability: Improved Comprehensibility and Reliability of Explanations via Restricted Halfspace Discretization (KT), pp. 1–15.
OOPSLA-2009-BravenboerS #analysis #declarative #points-to #specification: Strictly declarative specification of sophisticated points-to analyses (MB, YS), pp. 243–262.
AdaEurope-2009-UruenaZP #distributed #middleware #realtime: A Restricted Middleware Profile for High-Integrity Distributed Real-Time Systems (SU, JZ, JAdlP), pp. 16–29.
SAC-2009-GroppeGEL #in memory #memory management #performance: Efficient processing of SPARQL joins in memory by dynamically restricting triple patterns (JG, SG, SE, VL), pp. 1231–1238.
FoSSaCS-2009-ArandaVV #on the #power of #replication: On the Expressive Power of Restriction and Priorities in CCS with Replication (JA, FDV, CV), pp. 242–256.
SAT-2009-Johannsen #bound #exponential #learning: An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.
SAT-2009-JohannsenRW #satisfiability: Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.
VLDB-2008-LuM #database #named: AuditGuard: a system for database auditing under retention restrictions (WL, GM), pp. 1484–1487.
SEFM-2008-GhassemiFM #process: Restricted Broadcast Process Theory (FG, WF, AM), pp. 345–354.
FLOPS-2008-Yokouchi #algorithm #analysis #difference #lazy evaluation: Strictness Analysis Algorithms Based on an Inequality System for Lazy Types (HY), pp. 255–271.
GT-VMT-2006-WinkelmannTEK08 #constraints #generative #graph grammar #metamodelling #ocl: 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 #web: Efficient Processing of Category-Restricted Queries for Web Directories (ISA, FC, ÖU), pp. 695–699.
ICML-2008-LarochelleB #classification #using: Classification using discriminative restricted Boltzmann machines (HL, YB), pp. 536–543.
ICML-2008-Tieleman #approximate #using: Training restricted Boltzmann machines using approximations to the likelihood gradient (TT), pp. 1064–1071.
ICPR-2008-KanataniS #algorithm #ml: Compact algorithm for strictly ML ellipse fitting (KK, YS), pp. 1–4.
ICPR-2008-KobayashiO: Cone-restricted subspace methods (TK, NO), pp. 1–4.
KR-2008-Chetcuti-SperandioL #how #logic: How to Choose Weightings to Avoid Collisions in a Restricted Penalty Logic (NCS, SL), pp. 340–347.
KR-2008-SchroderP #how #logic: How Many Toes Do I Have? Parthood and Number Restrictions in Description Logics (LS, DP), pp. 307–317.
PADL-2008-CasasCH #execution #implementation #independence #towards: Towards a High-Level Implementation of Execution Primitives for Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 230–247.
SAC-2008-EspinasseFF #information management #ontology #web: Agent and ontology based information gathering on restricted web domains with AGATHE (BE, SF, FLGdF), pp. 2381–2386.
CASE-2008-PaekL #clustering #scheduling #tool support: Optimal scheduling of dual-armed cluster tools without swap restriction (JHP, TEL), pp. 103–108.
LCTES-2008-AuerbachBGSV #concurrent #flexibility #graph #java #programming #thread: Flexible task graphs: a unified restricted thread programming model for java (JSA, DFB, RG, JHS, JV), pp. 1–11.
ICLP-2008-CasasCH #implementation #independence #nondeterminism: A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 651–666.
ICALP-2007-BellareNN: Unrestricted Aggregate Signatures (MB, CN, GN), pp. 411–422.
RTA-2007-EchahedP #confluence #pointer #term rewriting: Non Strict Confluent Rewrite Systems for Data-Structures with Pointers (RE, NP), pp. 137–152.
HCI-IDU-2007-YangTT #perspective: User Response to Free Trial Restrictions: A Coping Perspective (XY, CHT, HHT), pp. 991–1000.
ICML-2007-SalakhutdinovMH #collaboration: Restricted Boltzmann machines for collaborative filtering (RS, AM, GEH), pp. 791–798.
MLDM-2007-Olvera-LopezTC #float: Restricted Sequential Floating Search Applied to Object Selection (JAOL, JFMT, JACO), pp. 694–702.
SEKE-2007-ChanCT #parametricity #random testing #testing: Controlling Restricted Random Testing: An Examination of the Exclusion Ratio Parameter (KPC, TYC, DT), pp. 163–166.
SIGIR-2007-SchockaertC #information retrieval: Neighborhood restrictions in geographic IR (SS, MDC), pp. 167–174.
LOPSTR-2007-CasasCH #algorithm #independence #logic programming #source code: Annotation Algorithms for Unrestricted Independent And-Parallelism in Logic Programs (AC, MC, MVH), pp. 138–153.
HPDC-2007-AldermanL: Task-specific restricted delegation (IDA, ML), pp. 243–244.
CSL-2007-DawarR #finite #logic #power of: The Power of Counting Logics on Restricted Classes of Finite Structures (AD, DR), pp. 84–98.
CSL-2007-WeisI #theorem #word: Structure Theorem and Strict Alternation Hierarchy for FO2 on Words (PW, NI), pp. 343–357.
FM-2006-Kassios #dependence: Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions (ITK), pp. 268–283.
ICGT-2006-RiedlSF #generative #graph grammar #order #string #word: String Generating Hypergraph Grammars with Word Order Restrictions (MR, SS, IF), pp. 138–152.
KR-2006-SardinaGLL #nondeterminism #on the: On the Limits of Planning over Belief States under Strict Uncertainty (SS, GDG, YL, HJL), pp. 463–471.
SIGIR-2006-TrotmanL #query: Strict and vague interpretation of XML-retrieval queries (AT, ML), pp. 709–710.
PLDI-2006-TriantafyllisBROA #framework #optimisation: A framework for unrestricted whole-program optimization (ST, MJB, ER, GO, DIA), pp. 61–71.
PPDP-2006-RooverBD #behaviour #fuzzy #logic #similarity #validation: Combining fuzzy logic and behavioral similarity for non-strict program validation (CDR, JB, TD), pp. 15–26.
SAC-2006-Xing: Enhancing program verifications by restricting object types (CCX), pp. 1816–1821.
SAT-2006-KojevnikovK #algebra #complexity #proving: Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.
CIAA-2005-JurdzinskiO #automaton #using: Restricting the Use of Auxiliary Symbols for Restarting Automata (TJ, FO), pp. 176–187.
DLT-2005-AlloucheS #morphism: Restricted Towers of Hanoi and Morphisms (JPA, AS), pp. 1–10.
ICALP-2005-TessonT #communication #complexity: Restricted Two-Variable Sentences, Circuits and Communication Complexity (PT, DT), pp. 526–538.
IFL-2005-EekelenM #proving #tool support: Proof Tool Support for Explicit Strictness (MCJDvE, MdM), pp. 37–54.
ECIR-2005-CamposFH #diagrams #documentation #evaluation #retrieval: 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 #using: Using Restrictive Classification and Meta Classification for Junk Elimination (SS, GW), pp. 287–299.
SAC-2005-RimassaV #comprehension #java #parametricity: Understanding access restriction of variant parametric types and Java wildcards (GR, MV), pp. 1390–1397.
SAC-OOPS-J-2005-ViroliR #java #on the: On Access Restriction with Java Wildcards (MV, GR), pp. 117–139.
FoSSaCS-2005-AehligMO #safety #string: Safety Is not a Restriction at Level 2 for String Languages (KA, JGdM, CHLO), pp. 490–504.
SAT-2005-HirschN #proving #simulation: Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution (EAH, SIN), pp. 135–142.
ECDL-2004-FrankeG #automation #documentation #random #scalability #set: Automated Indexing with Restricted Random Walks on Large Document Sets (MF, AGS), pp. 232–243.
FLOPS-2004-Garrigue: Relaxing the Value Restriction (JG), pp. 196–213.
IFL-2004-Trancon-y-Widemann #evaluation #recursion #virtual machine: V->M: A Virtual Machine for Strict Evaluation of (Co)Recursive Functions (BTyW), pp. 90–107.
SIGIR-2004-SiersdorferS #clustering #documentation #self: Restrictive clustering and metaclustering for self-organizing document collections (SS, SS), pp. 226–233.
SPLC-2004-Wesowski #automation #generative #product line: Automatic Generation of Program Families by Model Restrictions (AW), pp. 73–89.
OOPSLA-2004-BravenboerV #domain-specific language #syntax: Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions (MB, EV), pp. 365–383.
SAC-2004-RahmaniK #graph: Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.
STOC-2004-GairingLMM #nash #parallel #scheduling: Computing Nash equilibria for scheduling on restricted parallel links (MG, TL, MM, BM), pp. 613–622.
ICALP-2003-AroraC #approximate #problem: Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.
ICFP-2003-EnnalsJ #adaptation #evaluation #source code: Optimistic evaluation: an adaptive evaluation strategy for non-strict programs (RE, SLPJ), pp. 287–298.
CAiSE-2003-AntonellisMPP: A Methodology for e -Service Substitutability in a Virtual District Environment (VDA, MM, BP, PP), pp. 552–567.
ECIR-2003-CachedaCGV #data type #hybrid #optimisation #using #web: Optimization of Restricted Searches in Web Directories Using Hybrid Data Structures (FC, VC, CG, ÁV), pp. 436–451.
AdaEurope-2003-ChanCT #normalisation #random testing #testing: Normalized Restricted Random Testing (KPC, TYC, DT), pp. 368–381.
AdaEurope-2003-HolstiL #framework #platform: Impact of a Restricted Tasking Profile: The Case of the GOCE Platform Application Software (NH, TL), pp. 92–101.
STOC-2003-ItohTT #independence #on the #permutation: On the sample size of k-restricted min-wise independent permutations and other k-wise distributions (TI, YT, JT), pp. 710–719.
CSL-2003-KristiansenV #power of #source code: The Surprising Power of Restricted Programs and Gödel’s Functionals (LK, PJV), pp. 345–358.
CSL-2003-Vorobjov #effectiveness #formal method: Effective Model Completeness of the Theory of Restricted Pfaffian Functions (NV), p. 544.
ICALP-2002-HitchcockL #complexity #why: Why Computational Complexity Requires Stricter Martingales (JMH, JHL), pp. 549–560.
ICFP-2002-GlynnSSS #analysis #exception: Exception analysis for non-strict languages (KG, PJS, MS, HS), pp. 98–109.
SAS-2002-WhaleyL #analysis #performance #points-to: An Efficient Inclusion-Based Points-To Analysis for Strictly-Typed Languages (JW, MSL), pp. 180–195.
SAC-2002-RiveroDF #database #elicitation: Elicitation and conversion of hidden objects and restrictions in a database schema (LCR, JHD, VEF), pp. 463–469.
DAC-2002-DanielP #distributed #order #reduction: Model order reduction for strictly passive and causal distributed systems (LD, JRP), pp. 46–51.
STOC-2002-BarakL #polynomial #simulation: Strict polynomial-time in simulation and extraction (BB, YL), pp. 484–493.
STOC-2002-KargerR #metric #nearest neighbour: Finding nearest neighbors in growth-restricted metrics (DRK, MR), pp. 741–750.
CSL-2002-Beckmann #proving: Resolution Refutations and Propositional Proofs with Height-Restrictions (AB), pp. 599–612.
SAT-2002-LynceM1 #algorithm #backtracking #satisfiability: Complete unrestricted backtracking algorithms for satisfiability (IL, JMS), p. 29.
ICALP-2001-BenediktGR #model checking #state machine: Model Checking of Unrestricted Hierarchical State Machines (MB, PG, TWR), pp. 652–666.
TLCA-2001-CardelliG #logic: Logical Properties of Name Restriction (LC, ADG), pp. 46–60.
SIGIR-2001-Zechner #automation #generative #summary: Automatic Generation of Concise Summaries of Spoken Dialogues in Unrestricted Domains (KZ), pp. 199–207.
SAS-2001-GlynnSS #analysis #constraints #effectiveness: Effective Strictness Analysis with HORN Constraints (KG, PJS, MS), pp. 73–92.
RTA-2000-Lohrey #confluence #problem #word: Word Problems and Confluence Problems for Restricted Semi-Thue Systems (ML), pp. 172–186.
ICPR-v4-2000-NakaiIMW #monitoring #visual notation: Non-Restrictive Visual Respiration Monitoring (HN, KI, YM, MW), pp. 4647–4651.
KR-2000-BaaderK #concept: Matching Concept Descriptions with Existential Restrictions (FB, RK), pp. 261–272.
KR-2000-HaarslevM #reasoning #transitive: Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles (VH, RM), pp. 273–284.
UML-2000-AtkinsonK #how #why: Strict Profiles: Why and How (CA, TK), pp. 309–322.
UML-2000-DammHTT #uml: Supporting Several Levels of Restriction in the UML (CHD, KMH, MT, MT), pp. 396–409.
SAS-2000-ClarkHH #analysis #graph grammar #safety: Safety of Strictness Analysis via Term Graph Rewriting (DC, CH, SH), pp. 95–114.
SAC-2000-FacchinettiMP #approach #fuzzy #industrial: A Fuzzy Approach to the Geography of Industrial Districts (GF, GM, SP), pp. 514–518.
SAC-2000-RiveroDL #detection #network #static analysis: Static Detection of Sources of Dynamic Anomalies in a Network of Referential Integrity Restrictions (LCR, JHD, DL), pp. 333–339.
STOC-2000-RasalaW #network: Strictly non-blocking WDM cross-connects for heterogeneous networks (AR, GTW), pp. 514–523.
CL-2000-Janhunen #logic programming #source code: Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.
CL-2000-Pliuskevicius #deduction #on the: On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.
FLOPS-1999-CamaraoF #type inference: Type Inference for Overloading without Restrictions, Declarations or Annotations (CC, LF), pp. 37–52.
HCI-EI-1999-Davies99a #generative #memory management: The role of external memory in a complex task: Effects of device and memory restrictions on program generation (SPD), pp. 1268–1272.
DAC-1999-ZhouWLA: Simultaneous Routing and Buffer Insertion with Restrictions on Buffer Locations (HZ, DFW, IML, AA), pp. 96–99.
CAV-1999-Klarlund #automaton #formal method #logic: A Theory of Restrictions for Logics and Automata (NK), pp. 406–417.
CSL-1999-Tobies #logic: A NExpTime-Complete Description Logic Strictly Contained in C2 (ST), pp. 292–306.
ADL-1998-YoonK #library #multi #user interface: A Three-Level User Interface to Multimedia Digital Libraries with Relaxation and Restriction (JY, SHK), pp. 206–215.
IFL-1998-HallBTK #functional #parallel #semantics #towards: Towards an Operational Semantics for a Parallel Non-Strict Functional Language (JGH, CABF, PWT, DJK), pp. 54–71.
LOPSTR-1998-GabricGS #analysis #constraints #theorem proving: Strictness Analysis as Finite-Domain Constraint Solving (TG, KG, HS), pp. 255–270.
POPL-1998-Jensen #polymorphism: Inference of Polymorphic and Conditional Strictness Properties (TPJ), pp. 209–221.
SAC-1998-HallamY #fuzzy #product line #pseudo: Families of fuzzy implication operators within measure M1 and their pseudo-strict (NH, KMY), pp. 262–266.
ASPLOS-1998-KrintzCLZ #execution #mobile #source code #using: Overlapping Execution with Transfer Using Non-Strict Execution for Mobile Programs (CK, BC, HBL, BGZ), pp. 159–169.
CADE-1998-BachmairG: Strict Basic Superposition (LB, HG), pp. 160–174.
ICALP-1997-Wilke #first-order #logic: Star-Free Picture Expressions are Strictly Weaker Than First-Order Logic (TW), pp. 347–357.
TLCA-1997-DamianiG #algorithm: An Inference Algorithm for Strictness (FD, PG), pp. 129–146.
HCI-SEC-1997-KohtakeYA #communication #process: Reducing Restriction of Activity in Media Communication with Demand Driven Viewer (NK, YY, YA), pp. 189–192.
SAS-1997-PanitzS #automation #functional #higher-order #named #proving #source code #termination: TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language (SEP, MSS), pp. 345–360.
KR-1996-BaaderS #logic: Number Restrictions on Complex Roles in Description Logics: A Preliminary Report (FB, US), pp. 328–339.
ALP-1996-FassbenderM #decidability #recursion: A Strict Border for the Decidability of E-Unification for Recursive Functions (HF, SM), pp. 194–208.
STOC-1996-ChaudhuriR #complexity: Deterministic Restrictions in Circuit Complexity (SC, JR), pp. 30–36.
STOC-1996-Milenkovic #linear #programming #using: Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction (VM), pp. 109–118.
RTA-1995-Boulton #higher-order #semantics: A Restricted Form on Higher-Order Rewriting Applied to an HDL Semantics (RJB), pp. 309–323.
TLCA-1995-PolS #proving #termination: Strict Functionals for Termination Proofs (JvdP, HS), pp. 350–364.
FPCA-1995-AdityaAS #semantics: Semantics of Barriers in a Non-Strict, Implicitly-Parallel Language (SA, A, JES), pp. 204–215.
FPCA-1995-SchauserG #how #question #source code: How Much Non-Strictness do Lenient Programs Require? (KES, SCG), pp. 216–225.
PEPM-1995-Monsuez #abstract interpretation #type inference #using: Using Abstract Interpretation to Define a Strictness Type Inference System (BM), pp. 122–133.
POPL-1995-SansomJ #functional #higher-order #profiling: Time and Space Profiling for Non-Strict Higher-Order Functional Languages (PMS, SLPJ), pp. 355–366.
POPL-1995-SchauserCG #algorithm #clustering #constraints #source code #thread: Separation Constraint Partitioning — A New Algorithm for Partitioning Non-strict Programs into Sequential Threads (KES, DEC, SCG), pp. 259–271.
SAS-1995-Coorg #clustering #code generation #concurrent #functional #multi #thread: Partitioning Non-strict Functional Languages for Multi-threaded Code Generation (SRC), pp. 82–99.
SAS-1995-SerranoW #compilation #functional #named #optimisation: Bigloo: A Portable and Optimizing Compiler for Strict Functional Languages (MS, PW), pp. 366–381.
SAS-1995-Vedrine #abstract interpretation #analysis: Binding-Time Analysis and Strictness Analysis by Abstract Interpretation (FV), pp. 400–417.
TAPSOFT-1995-Solberg #analysis: Strictness and Totality Analysis with Conjunction (KLS), pp. 501–515.
LFP-1994-SastryC #functional #parallel: Parallel Destructive Updating in Strict Functional Languages (AVSS, WDC), pp. 263–272.
POPL-1994-HankinM #algorithm #analysis #type inference: Deriving Algorithms From Type Inference Systems: Application to Strictness Analysis (CH, DLM), pp. 202–212.
SAS-1994-Consel #analysis #fixpoint #performance: Fast Strictness Analysis Via Symbolic Fixpoint Iteration (CC), pp. 423–431.
SAS-1994-GrasH #independence #using: Extracting Non-Strict Independent And-Parallelism Using Sharing and Freeness Information (DCG, MVH), pp. 297–313.
SAS-1994-Henglein #analysis #fixpoint #type system: Iterative Fixed Point Computation for Type-Based Strictness Analysis (FH), pp. 395–407.
SAS-1994-JensenHR #analysis #haskell #performance: Efficient Strictness Analysis of Haskell (KDJ, PH, MR), pp. 246–362.
SAS-1994-Solberg #analysis: Strictness and Totality Analysis (KLS), pp. 408–422.
ESOP-1994-HankinM #analysis #lazy evaluation #type inference: Lazy Type Inference for the Strictness Analysis of Lists (CH, DLM), pp. 257–271.
CADE-1994-KlingenbeckH #semantics: Semantic Tableaux with Ordering Restrictions (SK, RH), pp. 708–722.
ILPS-1994-BuenoBH #analysis #automation #effectiveness #parallel: Effectiveness of Global Analysis in Strict Independence-Based Automatic Parallelization (FB, MJGdlB, MVH), pp. 320–336.
PODS-1993-RastogiKS #database: Strict Histories in Object-Based Database Systems (RR, HFK, AS), pp. 288–299.
DLT-1993-Fernau #parallel: Remarks on Adult Languages of Propagating Systems with Restricted Parallelism (HF), pp. 90–101.
FPCA-1993-Nocker #analysis #reduction #using: Strictness Analysis using Abstract Reduction (EN), pp. 255–265.
FPCA-1993-SastryCA #analysis #functional: Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates (AVSS, WDC, ZMA), pp. 266–275.
SEKE-1993-Maim #abduction #constraints #logic programming #source code: Restricted Abduction in Constraint Logic Programs (EM), pp. 222–224.
PEPM-1993-Seward #analysis #polymorphism #using: Polymorphic Strictness Analysis using Frontiers (JS), pp. 186–193.
PLILP-1993-BurnM #analysis #compilation #correctness #optimisation #proving: Proving the Correctness of Compiler Optimizations Based on Strictness Analysis (GLB, DLM), pp. 346–364.
WSA-1993-Benton #algebra #data type #lazy evaluation: Strictness Properties of Lazy Algebraic Datatypes (PNB), pp. 206–217.
WSA-1993-NielsonN #analysis: Finiteness Conditions for Strictness Analysis (FN, HRN), pp. 194–205.
ILPS-1993-Spencer #order: The Ordered Clause Restriction of Model Elimination and SLI Resolution (BS), p. 678.
LFP-1992-NeubergerM #analysis #deduction #power of #precise: A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis (MN, PM), pp. 127–138.
LFP-1992-TraubCS #analysis #clustering #source code #thread: Global Analysis for Partitioning Non-Strict Programs into Sequential Threads (KRT, DEC, KES), pp. 324–334.
PLILP-1992-Rosendahl #analysis #attribute grammar: Strictness Analysis for Attribute Grammars (MR), pp. 145–157.
WSA-1992-Baker-Finch #analysis #logic: Relevant Logic and Strictness Analysis (CABF), pp. 221–228.
IWPTS-1992-HigashinoBLYT #parametricity: 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: Query Restricted Bottom-Up Evaluation of Normal Logic Programs (DBK, PJS, DS), pp. 288–302.
LICS-1992-Jensen #analysis: Disjunctive Strictness Analysis (TPJ), pp. 174–185.
ICALP-1991-ErnoultM #analysis: Uniform Ideals and Strictness Analysis (CE, AM), pp. 47–59.
FPCA-1991-BarthNA #functional #named #parallel: M-Structures: Extending a Parallel, Non-strict, Functional Language with State (PSB, RSN, A), pp. 538–568.
FPCA-1991-Jensen #analysis #logic: Strictness Analysis in Logical Form (TPJ), pp. 352–366.
FPCA-1991-JonesL #functional: Unboxed Values as First Class Citizens in a Non-Strict Functional Language (SLPJ, JL), pp. 636–666.
FPCA-1991-Traub #architecture #code generation #data flow #multi #source code #thread: Multi-thread Code Generation for Dataflow Architectures from Non-Strict Programs (KRT), pp. 73–101.
KR-1991-HollunderB #concept: Qualifying Number Restrictions in Concept Languages (BH, FB), pp. 335–346.
PLDI-1991-Launchbury #analysis: Strictness and Binding-Time Analyses: Two for the Price of One (JL), pp. 80–91.
POPL-1991-AbramskyJ #analysis #approach #higher-order #polymorphism #relational: A Relational Approach to Strictness Analysis for Higher-Order Polymorphic Functions (SA, TPJ), pp. 49–54.
POPL-1991-SekarMR #abstract interpretation #analysis #on the: On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation (RCS, PM, IVR), pp. 37–48.
CAAP-1991-AstesianoC #algebra #specification: Non-Strict Don't Care Algebras and Specifications (EA, MC), pp. 121–142.
CCPSD-1991-Frutos-EscrigF #on the: On Narrowing Strategies for Partial Non-Strict Functions (DdFE, MIFC), pp. 416–437.
CCPSD-1991-Wright #analysis: A New Technique for Strictness Analysis (DAW), pp. 235–258.
ICLP-1991-Yap: Restriction Site Mapping in CLP(R) (RHCY), pp. 521–534.
PLILP-1990-Asperti #calculus #evaluation #lazy evaluation: Integrating Strict and Lazy Evaluation: The λ-sl-Calculus (AA), pp. 238–254.
POPL-1990-SekarPR #analysis #performance: Small Domains Spell Fast Strictness Analysis (RCS, SP, IVR), pp. 169–183.
CADE-1990-BachmairG #on the #order: On Restrictions of Ordered Paramodulation with Simplification (LB, HG), pp. 427–441.
CLP-1990-HermenegildoR90 #independence: Non-Strict Independent And-Parallelism (MVH, FR), pp. 237–252.
CLP-1990-SchreyeVB90 #detection #graph #horn clause #query #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.
PODS-1989-Borgida #inheritance #query #type system: Type Systems for Querying Class Hierarchies with Non-strict Inheritance (AB), pp. 394–400.
SIGMOD-1989-HullS #complexity #database #object-oriented #on the: On Accessing Object-Oriented Databases: Expressive Power, Complexity, and Restrictions (RH, JS), pp. 147–158.
RTA-1989-Otto #canonical #congruence #finite #string #term rewriting: Restrictions of Congruence Generated by Finite Canonical String-Rewriting Systems (FO), pp. 359–370.
FPCA-1989-KuoM #analysis #type inference: Strictness Analysis: A New Perspective Based on Type Inference (TMK, PM), pp. 260–272.
FPCA-1989-Traub #approach #clustering #compilation #functional: Compilation as Partitioning: A New Approach to Compiling Non-Strict Functional Languages (KRT), pp. 75–88.
STOC-1989-AfratiC #query #recursion: Expressiveness of Restricted Recursive Queries (FNA, SSC), pp. 113–126.
CSL-1989-Goerdt: Davis-Putnam Resolution versus Unrestricted Resolution (AG), pp. 143–162.
NACLP-1989-ChangC #execution: Restricted AND-Parallelism Execution Model with Side-Effects (SEC, YPC), pp. 350–368.
PODS-1988-Hegner #component #composition #relational: Decomposition of Relational Schemata into Components Defined by Both Projection and Restriction (SJH), pp. 174–183.
ICALP-1988-Wagner #on the: On Restricting the Access to an NP-Oracle (KWW), pp. 682–696.
POPL-1988-Wadler #analysis: Strictness Analysis Aids Time Analysis (PW), pp. 119–132.
ESOP-1988-JacobsL #compilation #logic programming #source code: Compilation of Logic Programs for Restricted And-Parallelism (DJ, AL), pp. 284–297.
CADE-1988-Rabinov: A Restriction of Factoring in Binary Resolution (AR), pp. 582–591.
JICSCP-1988-BiswasSY88 #automaton #logic programming #parallel #scalability #source code: A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.
FPCA-1987-WadlerH #analysis: Projections for strictness analysis (PW, RJMH), pp. 385–407.
POPL-1987-HallW #compilation: Compiling Strictness into Streams (CVH, DSW), pp. 132–143.
POPL-1987-KuoM #analysis #on the: On Strictness and its Analysis (TMK, PM), pp. 144–155.
POPL-1987-Nielson #abstract interpretation #analysis: Strictness Analysis and Denotational Abstract Interpretation (FN), pp. 120–131.
CFLP-1987-LindstromGY #generative #performance: Generating Efficient Code from Strictness Annotations (GL, LG, DY), pp. 140–154.
SLP-1987-DeGroot87: Restricted And-Parallelism and Side Effects (DD), pp. 80–89.
ICALP-1986-Fribourg #induction: A Strong Restriction of the Inductive Completion Procedure (LF), pp. 105–115.
LFP-1986-BlossH #analysis: Variations on Strictness Analysis (AGB, PH), pp. 132–142.
GG-1986-AalbersbergER #complexity: Restricting the complexity of regular DNLC languages (IJA, JE, GR), pp. 147–166.
POPL-1986-HudakY #analysis #higher-order #λ-calculus: Higher-Order Strictness Analysis in Untyped λ Calculus (PH, JY), pp. 97–109.
CADE-1986-Burckert #unification: Some Relationships between Unification, restricted Unification, and Matching (HJB), pp. 514–524.
ICLP-1986-Hermenegildo86 #automaton #execution #logic programming #source code: An Abstract Machine for Restricted AND-Parallel Execution of Logic Programs (MVH), pp. 25–39.
PODS-1985-Sagiv85a #on the: On Computing Restricted Projections of Representative Instances (YS), pp. 171–180.
FPCA-1985-ClackJ85 #analysis #approach: Strictness Analysis — A Practical Approach (CDC, SLPJ), pp. 35–49.
FPCA-1985-Turner85 #functional #named #polymorphism: Miranda: A Non-Strict Functional language with Polymorphic Types (DAT), pp. 1–16.
STOC-1985-Heide #algorithm #performance #problem: Fast Algorithms for N-Dimensional Restrictions of Hard Problems (FMadH), pp. 413–420.
ICALP-1984-IbarraKR #performance #simulation: Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.
STOC-1984-KlawePPY #on the: On Monotone Formulae with Restricted Depth (MMK, WJP, NP, MY), pp. 480–487.
ILPC-1984-Sintzoff84 #bound #source code: Bounded-Horizon Success-Complete Restriction of Inference Programs (MS), pp. 139–150.
STOC-1983-Valiant #bound #exponential: Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.
DAC-1982-Kaplan #verification: A “non-restrictive” artwork verification program for printed circuit boards (DK), pp. 551–558.
ILPC-1982-HirschmanP82 #prolog: Restriction Grammar in Prolog (LH, KP), pp. 85–90.
SIGIR-1981-BollmannC #evaluation #information retrieval: Restricted Evaluation in Information Retrieval (PB, VSC), pp. 15–21.
ICALP-1980-Schmidt #attribute grammar: Space-Restricted Attribute Grammars (EMS), pp. 436–448.
DAC-1980-TadaYKS #performance #using: A fast maze router with iterative use of variable search space restriction (FT, KY, TK, TS), pp. 250–254.
ICALP-1979-Chottin #term rewriting: Strict Deterministic Languages and Controlled Rewriting Systems (LC), pp. 104–117.
ICALP-1979-PapadimitriouY #complexity #problem: The Complexity of Restricted Minimum Spanning Tree Problems (CHP, MY), pp. 460–470.
POPL-1978-CartwrightO #hoare #logic: Unrestricted Procedure Calls in Hoare’s Logic (RC, DCO), pp. 131–140.
STOC-1977-KintalaF #nondeterminism: Computations with a Restricted Number of Nondeterministic Steps (CMRK, PCF), pp. 178–185.
ICALP-1974-DilgerR #monad: Monadic Program Schemes Under Restricted Classes of Free Interpretations (WD, PR), pp. 547–561.
STOC-1974-Greibach: Some Restrictions on W-Grammars (SAG), pp. 256–265.
STOC-1974-VairavanD #parallel #scheduling #source code: Parallel Scheduling of Programs in a Restricted Model of Computation (KV, RAD), pp. 248–255.
POPL-1973-GellerH #lr #parsing: Strict Deterministic Versus LR(0) Parsing (MMG, MAH), pp. 22–32.
SIGIR-1971-LovemanMT #named #preprocessor: CUE: A Preprocessor for Restricted, Natural English (DBL, JAM, RGT), pp. 47–59.
STOC-1971-Buttelmann #automaton #finite #generative #on the: On Generalized Finite Automata and Unrestricted Generative Grammars (HWB), pp. 63–77.
DAC-1968-Marin #algorithm #logic #on the #synthesis #using: On a general synthesis algorithm of logical circuits using a restricted inventory of integrated circuits (MAM).