Stem list$ (all stems)

235 papers:

STOC-2015-BhowmickL

The List Decoding Radius of Reed-Muller Codes over Small Fields (AB, SL), pp. 277–285.

ICALP-v1-2015-HemenwayW #linear

Linear-Time List Recovery of High-Rate Expander Codes (BH, MW), pp. 701–712.

SEFM-2015-Muhlberg0DLP #learning #source code #verification

Learning Assertions to Verify Linked-List Programs (JTM, DHW, MD, GL, FP), pp. 37–52.

CHI-2015-ZhangAK #how #question #what #why

Mailing Lists: Why Are They Still Here, What’s Wrong With Them, and How Can We Fix Them? (AXZ, MSA, DRK), pp. 4009–4018.

ECIR-2015-ChappellGZ #approximate #nearest neighbour #slicing

Approximate Nearest-Neighbour Search with Inverted Signature Slice Lists (TC, SG, GZ), pp. 147–158.

ICML-2015-TewariC #bound #documentation #fault #learning #matter #question #rank

Generalization error bounds for learning to rank: Does the length of document lists matter? (AT, SC), pp. 315–323.

SEKE-2015-DingLTV #architecture #communication #empirical

Causes of Architecture Changes: An Empirical Study through the Communication in OSS Mailing Lists (WD, PL, AT, HvV), pp. 403–408.

SIGIR-2015-HeBVAR #evaluation #framework #predict #quality #ranking #refinement

Untangling Result List Refinement and Ranking Quality: a Framework for Evaluation and Prediction (JH, MB, APdV, LA, MdR), pp. 293–302.

PPoPP-2015-AlistarhKLS #queue #scalability

The SprayList: a scalable relaxed priority queue (DA, JK, JL, NS), pp. 11–20.

LICS-2015-DalmauEHLR #complexity #problem

Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (VD, LE, PH, BL, AR), pp. 487–498.

SIGMOD-2014-ShaoCCMYX #graph #parallel #scalability

Parallel subgraph listing in a large-scale graph (YS, BC, LC, LM, JY, NX), pp. 625–636.

STOC-2014-RudraW

Every list-decodable code for high noise has abundant near-optimal rate puncturings (AR, MW), pp. 764–773.

ICALP-v1-2014-BjorklundPWZ

Listing Triangles (AB, RP, VVW, UZ), pp. 223–234.

ICALP-v1-2014-KusumotoY #morphism #testing

Testing Forest-Isomorphism in the Adjacency List Model (MK, YY), pp. 763–774.

LATA-2014-BellaouarCZ #kernel #performance #sequence #string

Efficient List-Based Computation of the String Subsequence Kernel (SB, HC, DZ), pp. 138–148.

LATA-2014-BoyarKLL #on the #problem

On the List Update Problem with Advice (JB, SK, KSL, ALO), pp. 210–221.

ILC-2014-Penkler #array

An Array and List Processing System (DP), p. 22.

HIMI-DE-2014-LinKT #analysis #collaboration #design #learning

A Learning Method for Product Analysis in Product Design — Learning Method of Product Analysis Utilizing Collaborative Learning and a List of Analysis Items (HL, HK, TT), pp. 503–513.

ICPR-2014-BashbaghiGSB #multi #using

Watch-List Screening Using Ensembles Based on Multiple Face Representations (SB, EG, RS, GAB), pp. 4489–4494.

RecSys-2014-DeryKRS #elicitation #recommendation

Preference elicitation for narrowing the recommended list for groups (LND, MK, LR, BS), pp. 333–336.

RecSys-2014-GueyeAN #algorithm #recommendation

A parameter-free algorithm for an optimized tag recommendation list size (MG, TA, HN), pp. 233–240.

RecSys-2014-Liu0L #recommendation

Recommending user generated item lists (YL, MX, LVSL), pp. 185–192.

SIGIR-2014-KaneT

Skewed partial bitvectors for list intersection (AK, FWT), pp. 263–272.

SIGIR-2014-YuWZTSZ #learning #rank

Hashing with List-Wise learning to rank (ZY, FW, YZ, ST, JS, YZ), pp. 999–1002.

HPDC-2014-AlamKW #distributed #query #scalability

A scalable distributed skip list for range queries (SA, HK, AW), pp. 315–318.

ESOP-2013-EneaSS #composition #invariant

Compositional Invariant Checking for Overlaid and Nested Linked Lists (CE, VS, MS), pp. 129–148.

TACAS-2013-DudkaMPV #contest #low level #named #verification

Predator: A Tool for Verification of Low-Level List Manipulation — (Competition Contribution) (KD, PM, PP, TV), pp. 627–629.

MSR-2013-GuzziBLPD #communication #development #open source

Communication in open source software development mailing lists (AG, AB, ML, MP, AvD), pp. 277–286.

SAS-2013-0001MP #abstract domain #automaton #quantifier

Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists (PG, PM, GP), pp. 172–193.

SAS-2013-DudkaPV #low level #verification

Byte-Precise Verification of Low-Level List Manipulation (KD, PP, TV), pp. 215–237.

STOC-2013-GuruswamiX #algebra #bound #geometry

List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound (VG, CX), pp. 843–852.

STOC-2013-Wootters #fault #linear #on the #random #scalability

On the list decodability of random linear codes with large error rates (MW), pp. 853–860.

ICALP-v1-2013-DinurG #clustering

Clustering in the Boolean Hypercube in a List Decoding Regime (ID, EG), pp. 413–424.

CIKM-2013-TongWL #web

Latency-aware strategy for static list caching in flash-based web search engines (JT, GW, XL), pp. 1209–1212.

ICML-c3-2013-JunZSR #learning

Learning from Human-Generated Lists (KSJ, X(Z, BS, TTR), pp. 181–189.

RecSys-2013-BartelD #evolution #network #social

Evolving friend lists in social networks (JWB, PD), pp. 435–438.

ECOOP-2013-MaierO #higher-order #incremental #programming

Higher-Order Reactive Programming with Incremental Lists (IM, MO), pp. 707–731.

SAC-2013-ChenLWW #abstraction #source code #static analysis

Static analysis of list-manipulating programs via bit-vectors and numerical abstractions (LC, RL, XW, JW), pp. 1204–1210.

SIGMOD-2012-LuSLDWC #generative

Optimal top-k generation of attribute combinations based on ranked lists (JL, PS, CL, XD, SW, XC), pp. 409–420.

STOC-2012-GuruswamiX

Folded codes from function field towers and improved optimal rate list decoding (VG, CX), pp. 339–350.

CSCW-2012-ZhouZAH #documentation #health #problem

Cooperative documentation: the patient problem list as a nexus in electronic health records (XZ, KZ, MSA, DAH), pp. 911–920.

ICEIS-J-2012-GeJG #analysis #recommendation

Bringing Diversity to Recommendation Lists — An Analysis of the Placement of Diverse Items (MG, DJ, FG), pp. 293–305.

ICEIS-v2-2012-GeJGH #recommendation

Effects of the Placement of Diverse Items in Recommendation Lists (MG, DJ, FG, MH), pp. 201–208.

CIKM-2012-AsadiL #documentation #generative #performance #ranking

Fast candidate generation for two-phase document ranking: postings list intersection with bloom filters (NA, JL), pp. 2419–2422.

CIKM-2012-KangLC #category theory #predict

Predicting primary categories of business listings for local search (CK, JL, YC), pp. 2591–2594.

KDD-2012-ShenWLW #knowledge base #named #web

LIEGE: : link entities in web lists with knowledge base (WS, JW, PL, MW), pp. 1424–1432.

KDD-2012-ZhangZW #web

A system for extracting top-K lists from the web (ZZ, KQZ, HW), pp. 1560–1563.

RecSys-2012-BrigadirGC #twitter

A system for twitter user list curation (IB, DG, PC), pp. 293–294.

RecSys-2012-Parra #recommendation #visualisation

Beyond lists: studying the effect of different recommendation visualizations (DP), pp. 333–336.

SIGIR-2012-ShuklaLT #using

Parallelizing ListNet training using spark (SS, ML, AT), pp. 1127–1128.

PPoPP-2012-TimnatBKP

Wait-free linked-lists (ST, AB, AK, EP), pp. 309–310.

VMCAI-2012-BouajjaniDES #abstract domain #automation #infinity #reasoning #source code

Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (AB, CD, CE, MS), pp. 1–22.

VLDB-2011-AoZWSWLLL #algorithm #parallel #performance #using

Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units (NA, FZ, DW, DSS, GW, XL, JL, SL), pp. 470–481.

PLDI-2011-BouajjaniDES #analysis #interprocedural #on the #source code

On inter-procedural analysis of programs with lists and data (AB, CD, CE, MS), pp. 578–589.

ICALP-v1-2011-NgoPR #matrix

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications — (Extended Abstract) (HQN, EP, AR), pp. 557–568.

ICFP-2011-MuM #functional #morphism #theorem

Generalising and dualising the third list-homomorphism theorem: functional pearl (SCM, AM), pp. 385–391.

GCM-2010-PicardM11 #embedded #graph #induction #problem #representation

Coinductive Graph Representation: the Problem of Embedded Lists (CP, RM).

ICEIS-v2-2011-HouGM

Accounting Information Content and Timeliness of Annual Report Disclosure — An Evidence from China’s Listed Companies (PH, GG, ZM), pp. 400–408.

ICEIS-v4-2011-Feng11a #analysis #enterprise

Factorial Analysis to Measure Developing Ability of Listed Retail Enterprises (YF), pp. 553–556.

ICEIS-v4-2011-WangX #empirical #multi #performance

Is Internal Capital Market of China Listed Companies Efficient? — Empirical Evidences from Listed Companies Which Have Multiple Divisions in H-stock (FW, ZX), pp. 600–605.

CIKM-2011-RotaBG #algorithm #database #keyword

The list Viterbi training algorithm and its application to keyword search over databases (SR, SB, FG), pp. 1601–1606.

CIKM-2011-StepanovGREO

SIMD-based decoding of posting lists (AAS, ARG, DER, RJE, PSO), pp. 317–326.

ECIR-2011-CampinasDT #named #self

SkipBlock: Self-indexing for Block-Based Inverted List (SC, RD, GT), pp. 555–561.

KDD-2011-ChuC #network

Triangle listing in massive networks and its applications (SC, JC), pp. 672–680.

SIGIR-2011-Ghorab #adaptation #information retrieval #multi #personalisation #query

Improving query and result list adaptation in personalized multilingual information retrieval (MRG), pp. 1323–1324.

SIGIR-2011-KozorovitzkyK #clustering

Cluster-based fusion of retrieved lists (AKK, OK), pp. 893–902.

SIGIR-2011-TatikondaCJ #architecture #manycore

Posting list intersection on multicore architectures (ST, BBC, FPJ), pp. 963–972.

SIGIR-2011-YuanCM #predict

Predicting eBay listing conversion (TTY, ZC, MM), pp. 1335–1336.

POPL-2011-AlurC #algorithm #source code #streaming #transducer #verification

Streaming transducers for algorithmic verification of single-pass list-processing programs (RA, PC), pp. 599–610.

SAC-2011-ZhangWAWLL #performance #using

Fast lists intersection with Bloom filter using graphics processing units (FZ, DW, NA, GW, XL, JL), pp. 825–826.

LICS-2011-ChenF #logic

Listings and Logics (YC, JF), pp. 165–174.

MSR-2010-ColacoMFH #analysis #developer

OSS developers context-specific Preferred Representational systems: A initial Neurolinguistic text analysis of the Apache mailing list (MCJ, MGM, MF, PHdS), pp. 126–129.

PEPM-2010-HofmannK #detection #morphism #problem #towards

I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP (MH, EK), pp. 93–100.

STOC-2010-GuruswamiHK #linear #on the #random

On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.

STOC-2010-KoppartyS #fault #linear #random #testing

Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.

CHI-2010-LeeSL #adaptation #algorithm #evaluation

An adaptive speed-call list algorithm and its evaluation with ESM (SL, JS, GL), pp. 2019–2022.

CIKM-2010-ShalemK

Computing the top-k maximal answers in a join of ranked lists (MS, YK), pp. 1381–1384.

CIKM-2010-SilvestriV #encoding #integer #named #performance #programming

VSEncoding: efficient coding and fast decoding of integer lists via dynamic programming (FS, RV), pp. 1219–1228.

ECIR-2010-KimZH #multi #order

Aggregation of Multiple Judgments for Evaluating Ordered Lists (HDK, CZ, JH), pp. 166–178.

RecSys-2010-EkstrandKSBKR #automation #research

Automatically building research reading lists (MDE, PK, JAS, JTB, JAK, JR), pp. 159–166.

RecSys-2010-ShiLH #collaboration #learning #matrix #rank

List-wise learning to rank with matrix factorization for collaborative filtering (YS, ML, AH), pp. 269–272.

PADL-2010-RaimundoR #evaluation

Compact Lists for Tabled Evaluation (JR, RR), pp. 249–263.

REFSQ-2010-BebenseeWB #requirements

Binary Priority List for Prioritizing Software Requirements (TB, IvdW, SB), pp. 67–78.

CAV-2010-BouajjaniDERS #bound #invariant #source code #synthesis

Invariant Synthesis for Programs Manipulating Lists with Unbounded Data (AB, CD, CE, AR, MS), pp. 72–88.

CAV-2010-CernyRZCA #concurrent #implementation #model checking

Model Checking of Linearizability of Concurrent List Implementations (PC, AR, DZ, SC, RA), pp. 465–479.

ICLP-J-2010-PettorossiSP #infinity #logic programming #source code

Transformations of logic programs on infinite lists (AP, VS, MP), pp. 383–399.

VLDB-2009-ElmeleegyMH #relational #web

Harvesting Relational Tables from Lists on the Web (HE, JM, AYH), pp. 1078–1089.

VLDB-2009-GuptaS #query #web

Answering Table Augmentation Queries from Unstructured Lists on the Web (RG, SS), pp. 289–300.

VLDB-2009-TsirogiannisGK #performance

Improving the Performance of List Intersection (DT, SG, NK), pp. 838–849.

FoSSaCS-2009-BansalBL #order

Beyond Shapes: Lists with Ordered Data (KB, RB, ÉL), pp. 425–439.

ICSM-2009-BettenburgSH #empirical #off the shelf #risk management #using

An empirical study on the risks of using off-the-shelf techniques for processing mailing list data (NB, ES, AEH), pp. 539–542.

WCRE-1999-TangHZ99a #identification

Techniques for Identifying the Country Origin of Mailing List Participants (RT, AEH, YZ), pp. 36–40.

STOC-2009-GopalanGR

List decoding tensor products and interleaved codes (PG, VG, PR), pp. 13–22.

STOC-2009-Guruswami #morphism

Artin automorphisms, cyclotomic function fields, and folded list-decodable codes (VG), pp. 23–32.

HCD-2009-Kurosu #approach

Full Description Persona vs. Trait List Persona in the Persona-Based sHEM Approach (MK), pp. 230–238.

HCI-NIMT-2009-JainGD #multimodal

Multimodal Shopping Lists (JJ, RG, MD), pp. 39–47.

CIKM-2009-LuHM #algorithm #approximate #performance #using

Efficient algorithms for approximate member extraction using signature-based inverted lists (JL, JH, XM), pp. 315–324.

KDD-2009-YangCWHZM #crawling #incremental #web

Incorporating site-level knowledge for incremental crawling of web forums: a list-wise strategy (JMY, RC, CW, HH, LZ, WYM), pp. 1375–1384.

KDD-2009-YeLJHW #detection

Intelligent file scoring system for malware detection from the gray list (YY, TL, QJ, ZH, LW), pp. 1385–1394.

RecSys-2009-KhezrzadehTW #power of #recommendation

Harnessing the power of “favorites” lists for recommendation systems (MK, AT, WWW), pp. 289–292.

SIGIR-2009-ArampatzisKR #optimisation #using

Where to stop reading a ranked list?: threshold optimization using truncated score distributions (AA, JK, SR), pp. 524–531.

SIGIR-2009-TatikondaJCP #manycore #on the #performance

On efficient posting list intersection with multicore processors (ST, FJ, BBC, VP), pp. 738–739.

SIGMOD-2008-BansalGK #ad hoc

Ad-hoc aggregations of ranked lists in the presence of hierarchies (NB, SG, NK), pp. 67–78.

VLDB-2008-GeZ #approach #query

A skip-list approach for efficiently processing forecasting queries (TG, SBZ), pp. 984–995.

SCAM-2008-ChuD #ajax #automation #migration #web

Automated Migration of List Based JSP Web Pages to AJAX (JC, TRD), pp. 217–226.

STOC-2008-GopalanKZ

List-decoding reed-muller codes over small fields (PG, ARK, DZ), pp. 265–274.

FLOPS-2008-PrinceGM #proving #using

Proving Properties about Lists Using Containers (RP, NG, CM), pp. 97–112.

ICALP-A-2008-AlbersL #locality #on the

On List Update with Locality of Reference (SA, SL), pp. 96–107.

ICALP-A-2008-ChierichettiV #graph

The Local Nature of List Colorings for Graphs of High Girth (FC, AV), pp. 320–332.

ICALP-A-2008-Kawarabayashi #approximate

Approximating List-Coloring on a Fixed Surface (KiK), pp. 333–344.

IFL-2008-ShkaravskaET #functional #semantics #source code

Collected Size Semantics for Functional Programs over Lists (OS, MCJDvE, AT), pp. 118–137.

CHI-2008-GeyerDDMBM #reuse #social

Use and reuse of shared lists as a social content type (WG, CD, JMD, DRM, BB, MJM), pp. 1545–1554.

RecSys-2008-ZhangH #recommendation

Avoiding monotony: improving the diversity of recommendation lists (MZ, NH), pp. 123–130.

IJCAR-2008-BozgaIP #logic #source code

Quantitative Separation Logic and Programs with Lists (MB, RI, SP), pp. 34–49.

DRR-2007-Yan #approach #novel

A novel approach for nonuniform list fusion (WQY).

SIGMOD-2007-RamanQHNCYL #adaptation #lazy evaluation

Lazy, adaptive rid-list intersection, and its application to index anding (VR, LQ, WH, IN, YLC, KHY, FLL), pp. 773–784.

MSR-2007-RigbyH #analysis #developer #what

What Can OSS Mailing Lists Tell Us? A Preliminary Psychometric Text Analysis of the Apache Developer Mailing List (PCR, AEH), p. 23.

ICFP-2007-CouttsLS

Stream fusion: from lists to streams to nothing at all (DC, RL, DS), pp. 315–326.

ILC-2007-Latendresse #compilation #comprehension #lisp #performance

Simple and efficient compilation of list comprehension in common Lisp (ML), p. 12.

HCI-AS-2007-CaiX #design #sorting

Designing Product List on E-tailing Websites: The Effect of Sorting on Consumer Decision (SC, YX), pp. 104–113.

HIMI-MTT-2007-SongQLPZ #linear #named #navigation

LensList: Browsing and Navigating Long Linear Information Structures (HS, YQ, YL, HP, LZ), pp. 535–543.

SIGIR-2007-KollaV #enterprise #retrieval

Retrieval of discussions from enterprise mailing lists (MK, OV), pp. 881–882.

VMCAI-2007-BozgaI #on the #source code

On Flat Programs with Lists (MB, RI), pp. 122–136.

VMCAI-2007-CheremR #analysis #invariant #maintenance #reasoning

Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning (SC, RR), pp. 234–250.

MSR-2006-TsunodaMKKM #developer #using

Analyzing OSS developers’ working time using mailing lists archives (MT, AM, TK, YK, KiM), pp. 181–182.

SCAM-2006-GallagherBH #slicing

Stop-List Slicing (KG, DB, MH), pp. 11–20.

STOC-2006-GuruswamiR

Explicit capacity-achieving list-decodable codes (VG, AR), pp. 1–10.

STOC-2006-KawarabayashiM #approximate #graph

Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs (KiK, BM), pp. 401–416.

ICALP-v2-2006-KawachiY #quantum

Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding (AK, TY), pp. 216–227.

SEFM-2006-RaniseZ #formal method

A Theory of Singly-Linked Lists and its Extensible Decision Procedure (SR, CGZ), pp. 206–215.

CHI-2006-MatthewsCRT #design #multi #performance

Clipping lists and change borders: improving multitasking efficiency with peripheral information design (TM, MC, GGR, DST), pp. 989–998.

KDD-2006-Kahn #problem #statistics

Capital One’s statistical problems: our top ten list (WK), p. 834.

POPL-2006-LahiriQ #verification

Verifying properties of well-founded linked lists (SKL, SQ), pp. 115–126.

CAV-2006-BouajjaniBHIMV #automaton #source code

Programs with Lists Are Counter Automata (AB, MB, PH, RI, PM, TV), pp. 517–531.

CAV-2006-ColvinGLM #algorithm #concurrent #lazy evaluation #set #verification

Formal Verification of a Lazy Concurrent List-Based Set Algorithm (RC, LG, VL, MM), pp. 475–488.

IJCAR-2006-ReeberH #satisfiability #subclass

A SAT-Based Decision Procedure for the Subclass of Unrollable List Formulas in ACL2 (SULFA) (ER, WAHJ), pp. 453–467.

ITiCSE-2005-Dias

Moving from mailing lists to web-based discussion forums (AMD), p. 373.

ICSM-2005-HassanH #fault #predict

The Top Ten List: Dynamic Fault Prediction (AEH, RCH), pp. 263–272.

STOC-2005-GuruswamiR

Limits to list decoding Reed-Solomon codes (VG, AR), pp. 602–609.

ECIR-2005-CoyleS #interactive #using #web

Enhancing Web Search Result Lists Using Interaction Histories (MC, BS), pp. 543–545.

MLDM-2005-DuKAB #algorithm #clustering #encoding #multi #search-based

Alternative Clustering by Utilizing Multi-objective Genetic Algorithm with Linked-List Based Chromosome Encoding (JD, EEK, RA, KB), pp. 346–355.

SAC-2005-KhuranaSB #email #named

SELS: a secure e-mail list service (HK, AJS, RB), pp. 306–313.

VMCAI-2005-ManevichYRS #abstraction #canonical

Predicate Abstraction and Canonical Abstraction for Singly-Linked Lists (RM, EY, GR, SS), pp. 181–198.

DocEng-2004-WatanabeSYO #using

A question answer system using mails posted to a mailing list (YW, KS, KY, YO), pp. 67–73.

PODS-2004-HartmannL #dependence #multi

Multi-valued Dependencies in the Presence of Lists (SH, SL), pp. 330–341.

SIGMOD-2004-KaushikKNR #integration #on the

On the Integration of Structure Indexes and Inverted Lists (RK, RK, JFN, RR), pp. 779–790.

ITiCSE-2004-Sher #implementation #queue

A simple implementation of a queue with a circularly linked list (DBS), p. 274.

ITiCSE-WGR-2004-Bruce #education #how

Controversy on how to teach CS 1: a discussion on the SIGCSE-members mailing list (KBB), pp. 29–34.

ICALP-2004-GuruswamiI #linear

Linear-Time List Decoding in Error-Free Settings: (Extended Abstract) (VG, PI), pp. 695–707.

CHI-2004-BellottiDGFBD #design #towards #what

What a to-do: studies of task management towards the design of a personal task list manager (VB, BD, NG, PF, DGB, ND), pp. 735–742.

CSCW-2004-TaylorS

List making in the home (AST, LS), pp. 542–545.

KDD-2004-CumbyFGK #predict

Predicting customer shopping lists from point-of-sale purchase data (CMC, AEF, RG, MK), pp. 402–409.

SIGIR-2004-YangC #classification #effectiveness #web

Effectiveness of web page classification on finding list answers (HY, TSC), pp. 522–523.

ICDAR-2003-ZimmermannCB #parsing

Parsing N-Best Lists of Handwritten Sentences (MZ, JCC, HB), pp. 572–576.

STOC-2003-GuruswamiI #linear

Linear time encodable and list decodable codes (VG, PI), pp. 126–135.

ICALP-2003-MatiasP #performance #traversal

Efficient Pebbling for List Traversal Synopses (YM, EP), pp. 918–928.

SAC-2003-AuyeungGD #algorithm #multi #scheduling #search-based

Multi-Heuristic List Scheduling Genetic Algorithms for Task Scheduling (AA, IG, HKD), pp. 721–724.

SAS-2002-Yavuz-KahveciB #automation #concurrent #verification

Automated Verification of Concurrent Linked Lists with Counters (TYK, TB), pp. 69–84.

STOC-2002-Guruswami #linear

Limits to list decodability of linear codes (VG), pp. 802–811.

STOC-2002-GuruswamiI #linear

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.

IFL-2002-Bagwell #functional #performance

Fast Functional Lists (PB), pp. 34–50.

SAT-2002-GentP #encoding #problem #satisfiability

SAT encodings of the stable marriage problem with ties and incomplete lists (IG, PP), p. 19.

DAC-2001-MaHDCCG #constraints

Floorplanning with Abutment Constraints and L-Shaped/T-Shaped Blocks based on Corner Block List (YM, XH, SD, YC, CKC, JG), pp. 770–775.

ICDAR-2001-KwokP #adaptation #recognition #word

Adaptive N-Best List Handwritten Word Recognition (TK, MPP), pp. 168–173.

SAC-2001-Julstrom #encoding

Encoding rectilinear Steiner trees as lists of edges (BAJ), pp. 356–360.

DATE-2000-GovindarajanV #quality #scheduling

Improving the Schedule Quality of Static-List Time-Constrained Scheduling (SG, RV), p. 749.

PODS-2000-DantsinV #complexity #query

Expressive Power and Data Complexity of Query Languages for Trees and Lists (ED, AV), pp. 157–165.

SAS-2000-DorRS

Checking Cleanness in Linked Lists (ND, MR, SS), pp. 115–134.

STOC-2000-GuruswamiS #algorithm

List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.

ICALP-2000-AmbuhlGS #algorithm #problem

Optimal Projective Algorithms for the List Update Problem (CA, BG, BvS), pp. 305–316.

ICML-2000-ChangCM #learning

Learning to Create Customized Authority Lists (HC, DC, AM), pp. 127–134.

ICSE-2000-Brewer #problem

Improving problem-oriented mailing list archives with MCS (RSB), pp. 95–104.

DAC-1999-Grajcar #algorithm #multi #scheduling #search-based

Genetic List Scheduling Algorithm for Scheduling and Allocation on a Loosely Coupled Heterogeneous Multiprocessor System (MG), pp. 280–285.

DATE-1999-WuGR #approach #fault #performance #reduction

A Fault List Reduction Approach for Efficient Bridge Fault Diagnosis (JW, GSG, EMR), pp. 780–781.

STOC-1999-Ben-AmramP

Backing Up in Singly Linked Lists (AMBA, HP), pp. 780–786.

ICALP-1999-IwamaMMM

Stable Marriage with Incomplete Lists and Ties (KI, DM, SM, YM), pp. 443–452.

CIKM-1999-LiY #classification #probability #using

Text Classification Using ESC-based Stochastic Decision Lists (HL, KY), pp. 122–130.

CIKM-1998-JagadishJSV #flexibility

Flexible List Management in a Directory (HVJ, MAJ, DS, DV), pp. 10–19.

ICML-1998-NockJ #on the #power of

On the Power of Decision Lists (RN, PJ), pp. 413–420.

SIGIR-1998-LeouskiA #interactive #multi #visual notation

Visual Interactions with a Multidimensional Ranked List (AL, JA), pp. 353–354.

EDTC-1997-BensoPRRU #approach #fault #graph #low level

A new approach to build a low-level malicious fault list starting from high-level description and alternative graphs (AB, PP, MR, MSR, RU), pp. 560–565.

EDTC-1997-GovindarajanV #algorithm #clustering #heuristic

Cone-based clustering heuristic for list-scheduling algorithms (SG, RV), pp. 456–462.

ITiCSE-1996-WuLC #recursion #visualisation

Visualizing recursion and linked lists (CCW, JMCL, GFC), p. 232.

STOC-1996-KaplanT #functional

Purely Functional Representations of Catenable Sorted Lists (HK, RET), pp. 202–211.

ICALP-1996-AlbersM #algorithm #analysis

Average Case Analyses of List Update Algorithms, with Applications to Data Compression (SA, MM), pp. 514–525.

CIKM-1996-Hall #email #knowledge-based #named

Infomod: A Knowledge-Based Moderator for Electronic Mail Help Lists (RJH), pp. 107–114.

JICSLP-1996-HamfeltN #declarative #logic programming #recursion

Declarative Logic Programming with Primitive Recursive Relations on Lists (AH, JFN), pp. 230–243.

DAC-1995-VenkataramanHFRCP #agile #fault #simulation #using

Rapid Diagnostic Fault Simulation of Stuck-at Faults in Sequential Circuits Using Compact Lists (SV, IH, WKF, EMR, SC, JHP), pp. 133–138.

VLDB-1995-WienerN #approach

OODB Bulk Loading Revisited: The Partitioned-List Approach (JLW, JFN), pp. 30–41.

STOC-1995-KaplanT #persistent #recursion

Persistent lists with catenation via recursive slow-down (HK, RET), pp. 93–102.

FPCA-1995-Okasaki #functional

Purely Functional Random-Access Lists (CO), pp. 86–95.

PODS-1994-ColbyRSG #query

A Query Language for List-Based Complex Objects (LSC, ELR, LVS, DVG), pp. 179–189.

SIGMOD-1994-TomasicGS #documentation #incremental #retrieval

Incremental Updates of Inverted Lists for Text Document Retrieval (AT, HGM, KAS), pp. 289–300.

ESOP-J-1992-NielsonN94 #analysis

The Tensor Product in Wadler’s Analysis of Lists (FN, HRN), pp. 327–354.

ESOP-1994-HankinM #analysis #lazy evaluation #strict #type inference

Lazy Type Inference for the Strictness Analysis of Lists (CH, DLM), pp. 257–271.

LFP-1994-Hall #representation #type inference #using

Using Hindley-Milner Type Inference to Optimise List Representation (CVH), pp. 162–172.

LFP-1994-ShaoRA

Unrolling Lists (ZS, JHR, AWA), pp. 185–195.

CIKM-1994-RoseG #classification #database

Hierarchical Classification as an Aid to Database and Hit-List Browsing (JRR, JG), pp. 408–414.

STOC-1993-Goldberg #algorithm #graph #polynomial #product line

Polynomial space polynomial delay algorithms for listing families of graphs (LAG), pp. 218–225.

VLDB-1992-ParkerSV #named #parallel #set

SVP: A Model Capturing Sets, Lists, Streams, and Parallelism (DSPJ, ES, PV), pp. 115–126.

VLDB-1992-Richardson #approach

Supporting Lists in a Data Model (A Timely Approach) (JER), pp. 127–138.

ESOP-1992-NielsonN #analysis

The Tensor Product in Wadler’s Analysis of Lists (FN, HRN), pp. 351–370.

PLDI-1992-ParkG #analysis

Escape Analysis on Lists (YGP, BG), pp. 116–127.

CHI-1992-Chimera #multi #navigation #visualisation

Value bars: an information visualization and navigation tool for multi-attribute listings (RC), pp. 293–294.

SIGIR-1992-Grefenstette #retrieval

Use of Syntactic Context to Produce Term Association Lists for Text Retrieval (GG), pp. 89–97.

IWMM-1992-PlainfosseS #distributed #experience #fault tolerance #garbage collection

Experience with a Fault-Tolerant Garbage Collector in a Distributed List System (DP, MS), pp. 116–133.

LICS-1992-Fribourg #recursion

Mixing List Recursion and Arithmetic (LF), pp. 419–429.

ICALP-1991-TannenS #aspect-oriented #logic #programming #set

Logical and Computational Aspects of Programming with Sets/Bags/Lists (VT, RS), pp. 60–75.

FPCA-1991-HeytensN #object-oriented #parallel

List Comprehensions in Agna, A Parallel Persistant Object System (MLH, RSN), pp. 569–591.

SEKE-1990-LukZH #approach #database #named #relational

Path: An Approach to Incorporate List Processing in A Relational Database (WSL, WZ, JH), pp. 189–194.

DAC-1989-LueM

Extracting Schematic-like Information from CMOS Circuit Net-lists (WJL, LPM), pp. 690–693.

DAC-1988-Meyer #data type

A Data Structure for Circuit Net Lists (SM), pp. 613–616.

DAC-1987-ChunCM #named

VISION: VHDL Induced Schematic Imaging on Net-Lists (RKC, KJC, LPM), pp. 436–442.

STOC-1987-DietzS #algorithm #maintenance #order

Two Algorithms for Maintaining Order in a List (PFD, DDS), pp. 365–372.

SIGIR-1987-CaterK #information retrieval #named #requirements

TIRS: A Topological Information Retrieval System Satisfying the Requirements of the Waller-Kraft Wish List (SCC, DHK), pp. 171–180.

FPCA-1985-Wadler85 #backtracking #exception #functional #how #lazy evaluation #pattern matching

How to Replace Failure by a List of Successes: A method for exception handling, backtracking, and pattern matching in lazy functional languages (PW), pp. 113–128.

STOC-1984-SleatorT #performance

Amortized Efficiency of List Update Rules (DDS, RET), pp. 488–492.

POPL-1984-HalpernMT #question #semantics #what

The Semantics of Local Storage, or What Makes the Free-List Free? (JYH, ARM, BAT), pp. 245–257.

DAC-1982-LarsenLS #equation #logic

Aw expanded logic equation list for checkout (RPL, JAL, AKS), pp. 291–299.

STOC-1982-Dietz #maintenance #order

Maintaining Order in a Linked List (PFD), pp. 122–127.

ASPLOS-1982-SansonnetCPBP #architecture #execution #lisp

Direct Execution of Lisp on a List-Directed Architecture (JPS, MC, CP, DB, JP), pp. 132–139.

STOC-1981-Kosaraju #locality

Localized Search in Sorted Lists (SRK), pp. 62–69.

ICALP-1981-EhrenfeuchtR #on the #problem

On the (Generalized) Post Correspondence Problem with Lists of Length 2 (AE, GR), pp. 408–416.

STOC-1980-Brown #implementation

Kraft Storage and Access for List Implementations (Extended Abstract) (DJB), pp. 100–107.

LISP-1980-MorrisS

Computing Cyclic List Structures (LM, JS), pp. 144–153.

POPL-1979-LeeGR #algorithm #evolution

The Evolution of List-Copying Algorithms (SL, WPdR, SLG), pp. 53–67.

STOC-1978-BrownT #linear #representation

A Representation for Linear Lists with Movable Fingers (MRB, RET), pp. 19–29.

DAC-1977-JaffeY #automation #diagrams #using

Automating analog circuit diagrams using a list processing language (RCJ, JPY), pp. 391–395.

STOC-1977-GuibasMPR #linear #representation

A New Representation for Linear Lists (LJG, EMM, MFP, JRR), pp. 49–60.

SIGMOD-1976-WelchG #multi #order #retrieval #using

Retrieval Using Ordered Lists in Inverted and Multilist Files (JWW, JWG), pp. 21–29.

STOC-1975-AhoU #graph

Node Listings for Reducible Flow Graphs (AVA, JDU), pp. 177–185.

POPL-1975-Kennedy #analysis #data flow

Node Listings Applied to Data Flow Analysis (KK), pp. 10–21.

SIGFIDET-1972-WalkerG #data type #hybrid

Hybrid Trees: A Data Structure for Lists of Keys (WAW, CCG), pp. 189–211.

STOC-1972-Morris #recursion

Recursion Schemes with Lists (JHMJ), pp. 35–43.

DAC-1969-RaderI #equation #logic

Aw expanded logic equation list for checkout (JAR, DAI), pp. 291–296.