BibSLEIGH — revisited tag

revisited

revisited

Tag #revisited

195 papers:

ICML-2019-Kornblith0LH #network #similarity: Similarity of Neural Network Representations Revisited (SK, MN0, HL, GEH), pp. 3519–3529.
ICML-2019-ShaniEM #learning: Exploration Conscious Reinforcement Learning Revisited (LS, YE, SM), pp. 5680–5689.
POPL-2019-ScalasY #less is more #multi: Less is more: multiparty session types revisited (AS, NY), p. 29.
POPL-2019-ToroLT #parametricity: Gradual parametricity, revisited (MT, EL, ÉT), p. 30.
ICSE-2019-RahmanPR: Natural software revisited (MR, DP, PCR), pp. 37–48.
CC-2019-SerranoF: Property caches revisited (MS, MF), pp. 99–110.
CADE-2019-HirokawaNOO #analysis #confluence: Confluence by Critical Pair Analysis Revisited (NH, JN, VvO, MO), pp. 319–336.
ICML-2018-0002TT #matrix: Differentially Private Matrix Completion Revisited (PJ0, ODT, AT), pp. 2220–2229.
ICML-2017-DembczynskiKKN #analysis #classification #consistency: Consistency Analysis for Binary Classification Revisited (KD, WK, OK, NN), pp. 961–969.
PLDI-2017-KincaidBBR #analysis #composition: Compositional recurrence analysis revisited (ZK, JB, AFB, TWR), pp. 248–262.
CASE-2017-WasserfallH0 #adaptation #process #slicing: Adaptive slicing for the FDM process revisited (FW, NH, JZ0), pp. 49–54.
Haskell-2016-YallopL #commutative: Causal commutative arrows revisited (JY, HL), pp. 21–32.
CIG-2016-GrafP #monte carlo #simulation: Monte-Carlo simulation balancing revisited (TG, MP), pp. 1–7.
ICPR-2016-BicegoL #nearest neighbour: Weighted K-Nearest Neighbor revisited (MB, ML), pp. 1642–1647.
SLE-2016-Lammel: Coupled software transformations revisited (RL), pp. 239–252.
CSL-2016-0002STK #dependence: AC Dependency Pairs Revisited (AY0, CS, RT, KK), p. 16.
SIGMOD-2015-MavroforakisCOK #composition #encryption: Modular Order-Preserving Encryption, Revisited (CM, NC, AO, GK, RC), pp. 763–777.
ICALP-v2-2015-GoldwasserKP #adaptation: Adaptively Secure Coin-Flipping, Revisited (SG, YTK, SP), pp. 663–674.
RTA-2015-HirokawaMM: Leftmost Outermost Revisited (NH, AM, GM), pp. 209–222.
RTA-2015-SuzukiKAT #confluence #orthogonal #term rewriting: Confluence of Orthogonal Nominal Rewriting Systems Revisited (TS, KK, TA, YT), pp. 301–317.
CADE-2015-Bromberger0W #integer #linear: Linear Integer Arithmetic Revisited (MB, TS, CW), pp. 623–637.
CADE-2015-ChocronFR: A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (PC, PF, CR), pp. 419–433.
ICLP-2015-ElsawyZA #execution: CHR Exhaustive Execution — Revisited (AE, AZ, SA), pp. 153–165.
LICS-2015-ClementeL #automaton: Timed Pushdown Automata Revisited (LC, SL), pp. 738–749.
ITiCSE-2014-WatsonL #programming: Failure rates in introductory programming revisited (CW, FWBL), pp. 39–44.
LATA-2014-BerardC #synthesis: Channel Synthesis Revisited (BB, OC), pp. 149–160.
FLOPS-2014-KrienerK #prolog #semantics: Semantics for Prolog with Cut — Revisited (JK, AK), pp. 270–284.
FLOPS-2014-YamadaWHM: AC-KBO Revisited (AY, SW, NH, AM), pp. 319–335.
ICPR-2014-CaoH #polynomial: Quadratic Discriminant Revisited (WC, RMH), pp. 1283–1288.
KR-2014-DeneckerV #induction #principle #semantics: The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited (MD, JV).
KR-2014-Zhou #first-order #logic: First-Order Default Logic Revisited (YZ).
RecSys-2014-Amatriain #problem #recommendation: The recommender problem revisited (XA), pp. 397–398.
PEPM-2014-WangN #bidirectional #semantics: Semantic bidirectionalization revisited (MW, SN), pp. 51–62.
CAV-2014-McMillan #lazy evaluation: Lazy Annotation Revisited (KLM), pp. 243–259.
VLDB-2014-BalkesenATO13 #in memory #manycore: Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited (CB, GA, JT, MTÖ), pp. 85–96.
ICALP-v2-2013-KobeleS: The IO and OI Hierarchies Revisited (GMK, SS), pp. 336–348.
RTA-2013-WinklerM #normalisation: Normalized Completion Revisited (SW, AM), pp. 319–334.
CSCW-2013-Morris #collaboration: Collaborative search revisited (MRM), pp. 1181–1192.
DATE-2013-MishchenkoEBBMN #abstraction #named: GLA: gate-level abstraction revisited (AM, NE, RKB, JB, HM, PKN), pp. 1399–1404.
LICS-2013-FredrikssonG #automaton #game studies #semantics: Abstract Machines for Game Semantics, Revisited (OF, DRG), pp. 560–569.
DocEng-2012-JunediGL #analysis #independence #xml: XML query-update independence analysis revisited (MJ, PG, NL), pp. 95–98.
AFL-J-2011-KariX12 #sequence: De Bruijn Sequences Revisited (LK, ZX), pp. 1307–1322.
IFM-2012-ZhangNN #model checking #static analysis: Model Checking as Static Analysis: Revisited (FZ, FN, HRN), pp. 99–112.
FLOPS-2012-AccattoliP #call-by: Call-by-Value Solvability, Revisited (BA, LP), pp. 4–16.
SIGIR-2012-MarkovAC #linear #normalisation: Unsupervised linear score normalization revisited (IM, AA, FC), pp. 1161–1162.
PLDI-2012-Chen: Polyhedra scanning revisited (CC), pp. 499–508.
PPDP-2012-DardhaGS: Session types revisited (OD, EG, DS), pp. 139–150.
RE-2012-NiuM #clustering #generative #requirements: Enhancing candidate link generation for requirements tracing: The cluster hypothesis revisited (NN, AM), pp. 81–90.
ESOP-2012-ChangF #call-by #λ-calculus: The Call-by-Need λ Calculus, Revisited (SC, MF), pp. 128–147.
LICS-2012-BienvenuM: Von Neumann’s Biased Coin Revisited (LB, BM), pp. 145–154.
SAT-2012-Weissenbacher: Interpolant Strength Revisited (GW), pp. 312–326.
VLDB-2011-ZhangM0 #matrix #theory and practice: Storing Matrices on Disk: Theory and Practice Revisited (YZ, KM, JY), pp. 1075–1086.
ITiCSE-2011-Velazquez-Iturbide #algorithm #design: The design and coding of greedy algorithms revisited (JÁVI), pp. 8–12.
ICPC-2011-Storey #interactive #java #source code #visualisation: An Interactive Visualization Environment for Exploring Java Programs: SHriMP Views Revisited (MADS), p. xviii.
DLT-J-2010-KariS11 #parallel: Schema for Parallel Insertion and Deletion: Revisited (LK, SS), pp. 1655–1668.
AFL-2011-KariX #sequence: De Bruijn Sequences Revisited (LK, ZX), pp. 241–254.
DLT-2011-Shallit #theorem: Fife’s Theorem Revisited (JS), pp. 397–405.
CIKM-2011-SkoutasA: Tag clouds revisited (DS, MA), pp. 221–230.
RecSys-2011-CelmaL #music #recommendation: Music recommendation and discovery revisited (ÒC, PL), pp. 7–8.
MoDELS-2011-MaozRR11a #alloy #analysis #diagrams #named #using: CD2Alloy: Class Diagrams Analysis Using Alloy Revisited (SM, JOR, BR), pp. 592–607.
ICSE-2011-StaatsWH #source code #testing: Programs, tests, and oracles: the foundations of testing revisited (MS, MWW, MPEH), pp. 391–400.
DATE-2011-CabodiNQ #sequence: Interpolation sequences revisited (GC, SN, SQ), pp. 316–322.
STOC-2011-HolensteinKT #equivalence #random: The equivalence of the random oracle model and the ideal cipher model, revisited (TH, RK, ST), pp. 89–98.
LICS-2011-Barto #constraints #problem: The Dichotomy for Conservative Constraint Satisfaction Problems Revisited (LB), pp. 301–310.
SAT-2011-AbioNOR #constraints #pseudo: BDDs for Pseudo-Boolean Constraints — Revisited (IA, RN, AO, ERC), pp. 61–75.
DocEng-2010-Piotrowski #documentation #html: Document conversion for cultural heritage texts: FrameMaker to HTML revisited (MP), pp. 223–226.
DLT-2010-MarinK: Regular Hedge Language Factorization Revisited (MM, TK), pp. 328–339.
RTA-2010-Kahrs: Infinitary Rewriting: Foundations Revisited (SK), pp. 161–176.
KR-2010-BelleL #multi: Multi-Agent Only-Knowing Revisited (VB, GL).
KR-2010-SohrabiBM: Diagnosis as Planning Revisited (SS, JAB, SAM).
KR-2010-ZhangZ10a: Forgetting Revisited (YZ, YZ).
SIGIR-2010-KoolenK #ad hoc: The importance of anchor text for ad hoc search revisited (MK, JK), pp. 122–129.
SIGIR-2010-SmuckerJ #performance #precise #retrieval: Human performance and retrieval precision revisited (MDS, CPJ), pp. 595–602.
SAC-2010-ChokshiB #analysis #calculus #performance #realtime #using: Performance analysis of FlexRay-based systems using real-time calculus, revisited (DBC, PB), pp. 351–356.
SAC-2010-FaggioliBC: Sporadic Server revisited (DF, MB, FC), pp. 340–345.
CGO-2010-BaskaranHTHRS: Parameterized tiling revisited (MMB, AH, ST, TH, JR, PS), pp. 200–209.
ICLP-2010-Janhunen10 #constraints #semantics #source code: Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited (TJ), pp. 94–103.
WICSA-ECSA-2009-MattmannGKPM #grid: The anatomy and physiology of the grid revisited (CM, JG, IK, DP, NM), pp. 285–288.
VLDB-2009-SearsB: Segment-based recovery: Write ahead logging revisited (RS, EAB), pp. 490–501.
CIAA-J-2008-AlmeidaMR09 #term rewriting: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 669–684.
TLCA-2009-LagoH #bound #linear #logic: Bounded Linear Logic, Revisited (UDL, MH), pp. 80–94.
CAiSE-2009-Guizzardi #concept #modelling #problem #transitive: The Problem of Transitivity of Part-Whole Relations in Conceptual Modeling Revisited (GG), pp. 94–109.
CIKM-2009-WuTW #query #using #xml: Answering XML queries using materialized views revisited (XW, DT, WHW), pp. 475–484.
SIGIR-2009-AnderkaS #retrieval: The ESA retrieval model revisited (MA, BS), pp. 670–671.
ECMDA-FA-2009-SodenE #ocl: Temporal Extensions of OCL Revisited (MS, HE), pp. 190–205.
OOPSLA-2009-Cook #abstraction #comprehension #on the: On understanding data abstraction, revisited (WRC), pp. 557–572.
ASE-2009-AthanasopoulosZI: Service Substitution Revisited (DA, AZ, VI), pp. 555–559.
ASE-2009-Maalej #integration #tool support: Task-First or Context-First? Tool Integration Revisited (WM), pp. 344–355.
CSL-2009-KuskeL #automation #bound: Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.
ICLP-2009-Dao-TranEFK #composition #logic programming: Modular Nonmonotonic Logic Programming Revisited (MDT, TE, MF, TK), pp. 145–159.
VMCAI-2009-GodefroidP #ltl #model checking: LTL Generalized Model Checking Revisited (PG, NP), pp. 89–104.
VMCAI-2009-WeiGC: Mixed Transition Systems Revisited (OW, AG, MC), pp. 349–365.
PODS-2008-DeutschNR: The chase revisited (AD, AN, JBR), pp. 149–158.
AFL-2008-Lohrey #problem: Compressed membership problems revisited (ML), pp. 31–53.
CIAA-2008-AlmeidaMR #term rewriting: Antimirov and Mosses’s Rewrite System Revisited (MA, NM, RR), pp. 46–56.
ICALP-C-2008-FischlinLP #multi #robust: Robust Multi-property Combiners for Hash Functions Revisited (MF, AL, KP), pp. 655–666.
FLOPS-2008-Rodriguez-ArtalejoR #logic programming: Quantitative Logic Programming Revisited (MRA, CARD), pp. 272–288.
ICSE-2008-SibayUB #sequence chart: Existential live sequence charts revisited (GES, SU, VAB), pp. 41–50.
FoSSaCS-2008-BonchiM #semantics: Symbolic Semantics Revisited (FB, UM), pp. 395–412.
ICLP-2008-PilozziS #analysis #termination: Termination Analysis of CHR Revisited (PP, DDS), pp. 501–515.
ICFP-2007-Pfenning #type system: Subtyping and intersection types revisited (FP), p. 219.
HCI-IDU-2007-Kurosu #concept #usability: Concept of Usability Revisited (MK), pp. 579–586.
CADE-2007-LynchT #automation #decidability: Automatic Decidability and Combinability Revisited (CL, DKT), pp. 328–344.
CSL-2007-BodirskyC #reasoning: Qualitative Temporal and Spatial Reasoning Revisited (MB, HC), pp. 194–207.
CSL-2007-Kesner #calculus #formal method: The Theory of Calculi with Explicit Substitutions Revisited (DK), pp. 238–252.
VMCAI-2007-Vardi #formal method #model checking: Automata-Theoretic Model Checking Revisited (MYV), pp. 137–150.
ITiCSE-2006-SandersGG #modelling #recursion: Mental models of recursion revisited (IDS, VG, TG), pp. 138–142.
DLT-2006-Maletti: Hierarchies of Tree Series Transformations Revisited (AM), pp. 215–225.
ICALP-v1-2006-KaporisMSTTZ: Dynamic Interpolation Search Revisited (ACK, CM, SS, AKT, KT, CDZ), pp. 382–394.
ICLP-2006-HaemmerleF #prolog: Modules for Prolog Revisited (RH, FF), pp. 41–55.
ICALP-2005-Galindo #encryption: Boneh-Franklin Identity Based Encryption Revisited (DG), pp. 791–802.
POPL-2005-CobbeF: Environmental acquisition revisited (RC, MF), pp. 14–25.
WRLA-2004-Lopez-FraguasRV05 #constraints #functional #logic programming: Constraint Functional Logic Programming Revisited (FJLF, MRA, RdVV), pp. 5–50.
RTA-2004-HirokawaM #dependence: Dependency Pairs Revisited (NH, AM), pp. 249–268.
KR-2004-HerzigL: C&L Intention Revisited (AH, DL), pp. 527–535.
ECOOP-2004-Torgersen #problem: The Expression Problem Revisited (MT), pp. 123–143.
PLDI-2004-Appel #process #proving #social #source code #theorem: Social processes and proofs of theorems and programs, revisited (AWA), p. 170.
PLDI-2004-ZhuC #analysis #pointer: Symbolic pointer analysis revisited (JZ, SC), pp. 145–157.
ICDAR-2003-FujisawaL #pattern matching #recognition: Directional Pattern Matching for Character Recognition Revisited (HF, CLL), pp. 794–798.
ICALP-2003-AntunesF: Sophistication Revisited (LA, LF), pp. 267–277.
SIGIR-2003-StokoeOT #ambiguity #information retrieval #word: Word sense disambiguation in information retrieval revisited (CS, MPO, JT), pp. 159–166.
OOPSLA-2003-BarabashOP #concurrent #garbage collection: Mostly concurrent garbage collection revisited (KB, YO, EP), pp. 255–268.
FoSSaCS-2003-FokkinkP #protocol #verification: Cones and Foci for Protocol Verification Revisited (WF, JP), pp. 267–281.
CSL-2003-SamerV #query: Validity of CTL Queries Revisited (MS, HV), pp. 470–483.
HT-2002-WhiteheadBGLLS: Seven Issues, Revisited (EJWJ, PDB, KG, DL, JJL, MMCS), p. 171.
ITiCSE-2002-Hamer: Hashing revisited (JH), pp. 80–83.
WCRE-2002-SchwarzDA #execution: Disassembly of Executable Code Revisited (BS, SKD, GRA), pp. 45–54.
FME-2002-OheimbN #hoare #logic: Hoare Logic for NanoJava: Auxiliary Variables, Side Effects, and Virtual Methods Revisited (DvO, TN), pp. 89–105.
RTA-2002-Mellies #axiom: Axiomatic Rewriting Theory VI Residual Theory Revisited (PAM), pp. 24–50.
SIGIR-2002-ChowdhuryMGF #documentation #normalisation: Document normalization revisited (AC, MCM, DAG, OF), pp. 381–382.
STOC-2002-Goldreich #concurrent: Concurrent zero-knowledge with timing, revisited (OG), pp. 332–340.
CSL-2002-BridgesIS: Compactness and Continuity, Constructively Revisited (DSB, HI, PS), pp. 89–102.
LICS-2002-FrickG #complexity #first-order #higher-order #logic #monad: The Complexity of First-Order and Monadic Second-Order Logic Revisited (MF, MG), pp. 215–224.
PODS-2001-AlonMNSV #xml: XML with Data Values: Typechecking Revisited (NA, TM, FN, DS, VV).
DLT-2001-Hoogeboom: Context-Free Valence Grammars — Revisited (HJH), pp. 293–303.
FME-2001-Paynter #logic #realtime: Real-Time Logic Revisited (SP), pp. 300–317.
ICSE-2001-Balzer01a #consistency #nondeterminism: “Tolerating Inconsistency” Revisited (RB), p. 665.
ESOP-2001-Boudol #recursion #semantics: The Recursive Record Semantics of Objects Revisited (GB), pp. 269–283.
TACAS-2001-TanC #simulation: Simulation Revisited (LT, RC), pp. 480–495.
SAT-2001-KaporisKSVZ #satisfiability: The unsatisfiability threshold revisited (ACK, LMK, YCS, MV, MZ), pp. 81–95.
HT-2000-GolovchinskyM #hypermedia #interactive: Hypertext interaction revisited (GG, CCM), pp. 171–179.
CADE-2000-TiwariBR: Rigid E-Unification Revisited (AT, LB, HR), pp. 220–234.
CSL-2000-Stirling: Schema Revisited (CS), pp. 126–138.
TLCA-1999-BarreiroE #semantics: Quantitative Semantics Revisited (NB, TE), pp. 40–53.
HCI-EI-1999-WellensM #research #social: The Social Psychology of Intelligent Machines: A Research Agenda Revisited (ARW, MDM), pp. 696–700.
CIKM-1999-WarshawM #optimisation #query #rule-based: Rule-Based Query Optimization, Revisited (LW, DPM), pp. 267–275.
ICSE-1999-HerbslebG: Splitting the Organization and Integrating the Code: Conway’s Law Revisited (JDH, REG), pp. 85–95.
CADE-1999-HustadtS: Maslov’s Class K Revisited (UH, RAS), pp. 172–186.
FLOPS-1998-Takahashi: λ-representable Functions over Free Structures Revisited (MT), pp. 1–19.
KR-1998-Amir: Pointwise Circumscription Revisited (EA), pp. 202–211.
STOC-1998-CanettiGH #random: The Random Oracle Methodology, Revisited (RC, OG, SH), pp. 209–218.
DLT-1997-Neumann #ambiguity #automaton #modelling: Unambiguity of SGML Content Models — Pushdown Automata Revisited (AN), pp. 507–518.
SIGIR-1997-KaszkielZ #retrieval: Passage Retrieval Revisited (MK, JZ), pp. 178–185.
DAC-1997-AlpertCHMY #polynomial: Quadratic Placement Revisited (CJA, TFC, DJHH, ILM, KY), pp. 752–757.
STOC-1997-NaorR #on the #permutation #pseudo: On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (MN, OR), pp. 189–199.
CAV-1997-KupfermanV: Module Checking Revisited (OK, MYV), pp. 36–47.
SIGMOD-1996-BrownCL: Goal-Oriented Buffer Management Revisited (KPB, MJC, ML), pp. 353–364.
RTA-1996-GramlichW #confluence #term rewriting: Confluence of Terminating Conditional Rewrite Systems Revisited (BG, CPW), pp. 245–259.
ICFP-1996-RojemoR #compilation #profiling: Lag, Drag, Void and Use — Heap Profiling and Space-Efficient Compilation Revisited (NR, CR), pp. 34–41.
KR-1996-GoldenW #representation: Representing Sensing Actions: The Middle Ground Revisited (KG, DSW), pp. 174–185.
KR-1996-Herzig: The PMA Revisited (AH), pp. 40–50.
ALP-1996-Suzuki #standard #theorem: Standardization Theorem Revisited (TS), pp. 122–134.
RTA-1995-Marchiori #composition: Modularity of Completeness Revisited (MM), pp. 2–10.
FPCA-1995-Thiemann #polymorphism #type system: Unboxed Values and Polymorphic Typing Revisited (PT), pp. 24–35.
PLILP-1995-Rety: The Notion of Floundering for SLDNF-Resolution Revisited (JHR), pp. 380–396.
ILPS-1995-CominiLV #declarative: Declarative Diagnosis Revisited (MC, GL, GV), pp. 275–287.
ICALP-1994-PrzytyckaL #problem: The Optimal Alphabetic Tree Problem Revisited (TMP, LLL), pp. 251–262.
LFP-1994-Thatte #semantics: Semantics of Type Classes Revisited (SRT), pp. 208–219.
KR-1994-DechterR: Directional Resolution: The Davis-Putnam Procedure, Revisited (RD, IR), pp. 134–145.
ICSE-1994-GreenspanMB #modelling #on the #requirements: On Formal Requirements Modeling Languages: RML Revisited (SJG, JM, AB), pp. 135–147.
ICSE-1994-Tracz #reuse: Software Reuse Myths Revisited (WT), pp. 271–272.
CADE-1994-MiddeldorpZ #termination: Simple Termination Revisited (AM, HZ), pp. 451–465.
ILPS-1994-BenhamouMH: CLP(Intervals) Revisited (FB, DAM, PVH), pp. 124–138.
TLCA-1993-Groote #theorem: The Conservation Theorem revisited (PdG), pp. 163–178.
ILPS-1993-Ben-Eliyahu: Back to the Future: Program Completion, Revisited (RBE), p. 642.
SIGIR-1992-Harman #feedback: Relevance Feedback Revisited (DH), pp. 1–10.
WSA-1992-DevienneLR: Weighted Systems Revisited (PD, PL, JCR), pp. 163–173.
DAC-1992-SaldanhaBS92a #algorithm: Circuit Structure Relations to Redundancy and Delay: The KMS Algorithm Revisited (AS, RKB, ALSV), pp. 245–248.
CAV-1992-GodefroidHP: State-Space Caching Revisited (PG, GJH, DP), pp. 178–191.
CSL-1992-BentonBPH #linear #modelling #λ-calculus: Linear λ-Calculus and Categorial Models Revisited (PNB, GMB, VdP, MH), pp. 61–84.
KR-1991-DelgrandeJ #logic: Default Logic Revisited (JPD, WKJ), pp. 118–127.
STOC-1991-NisanW #communication #complexity: Rounds in Communication Complexity Revisited (NN, AW), pp. 419–429.
ICLP-1991-KoN: Substitution and Refutation Revisited (HPK, MEN), pp. 679–692.
ISLP-1991-RamakrishnanS #bottom-up #top-down: Top-Down versus Bottom-Up Revisited (RR, SS), pp. 321–336.
VDME-1990-BednarczykBP #recursion: Recursive Definitions Revisited (MAB, AMB, WP), pp. 452–476.
OOPSLA-ECOOP-1990-MadsenMM #object-oriented #type system: Strong Typing of Object-Oriented Languages Revisited (OLM, BM, BMP), pp. 140–150.
ALP-1990-HuynhLL #algorithm #fourier: Fourier Algorithm Revisited (TH, CL, JLL), pp. 117–131.
CSL-1990-Vollmer: The Gap-Language-Technique Revisited (HV), pp. 389–399.
SIGMOD-1989-Bry #evaluation #performance #quantifier #query #towards: Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited (FB), pp. 193–204.
SIGMOD-1987-GanskiW #optimisation #query #sql: Optimization of Nested SQL Queries Revisited (RAG, HKTW), pp. 23–33.
RTA-1985-Rusinowitch #composition #recursion: Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.
SIGIR-1985-Voorhees #clustering: The Cluster Hypothesis Revisited (EMV), pp. 188–196.
POPL-1984-MilosPL #compilation #implementation #pascal #specification: Direct Implementation of Compiler Specifications or the Pascal P-code Compiler Revisited (DM, UFP, GL), pp. 196–207.
STOC-1972-Fiduccia #algorithm #evaluation #fourier #performance #polynomial: Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited (CMF), pp. 88–93.
STOC-1969-PetersR #analysis #context-free grammar: Context-Sensitive Immediate Constituent Analysis — Context-Free Languages Revisited (PSPJ, RWR), pp. 1–8.