BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
graph (5)
has (4)
student (4)
testabl (4)
properti (4)

Stem everi$ (all stems)

38 papers:

Coding by Everyone, Every Day (PL), p. 485.
Every list-decodable code for high noise has abundant near-optimal rate puncturings (AR, MW), pp. 764–773.
HCIHCI-TMT-2014-Merlin #implementation #interactive #paradigm #tool support
IntNovate a Toolkit to Ease the Implementation of Every Interaction Paradigm on Every Device (BM), pp. 331–339.
Bringing data science to the speakers of every language (RM), p. 1523.
ITiCSEITiCSE-2013-CrescenziEK #student #theory and practice
From theory to practice: NP-completeness for every CS student (PC, EE, VK), pp. 16–21.
STOCSTOC-2013-BhattacharyyaFHHL #invariant
Every locally characterized affine-invariant property is testable (AB, EF, HH, PH, SL), pp. 429–436.
ICEISICEIS-v2-2013-HollingsworthP #student
Seeding the Cloud with Students from Every Computer Science Undergraduate Program (JKH, DJP), pp. 513–518.
KDIRKDIR-KMIS-2013-DimasKV #approach #sentiment #twitter
Every Character Counts — A Character based Approach to Determine Political Sentiment on Twitter (AD, PCK, EMV), pp. 261–266.
DATEDATE-2012-YangLTW #modelling
Almost every wire is removable: A modeling and solution for removing any circuit wire (XY, TKL, WCT, YLW), pp. 1573–1578.
STOCSTOC-2011-NewmanS #graph
Every property of hyperfinite graphs is testable (IN, CS), pp. 675–684.
STOCSTOC-2011-Yoshida #algorithm #approximate #bound #csp
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.
SACSAC-2011-GalvaoD #distance #permutation #symmetry
Computing rearrangement distance of every permutation in the symmetric group (GRG, ZD), pp. 106–107.
SIGMODSIGMOD-2010-TaoYSPL #summary
Logging every footstep: quantile summaries for the entire history (YT, KY, CS, JP, FL), pp. 639–650.
ICFPICFP-2010-VytiniotisK #functional
Functional pearl: every bit counts (DV, AJK), pp. 15–26.
There are at least two sides to every heterogeneous system (CCJN), p. 120.
WICSA-ECSAWICSA-ECSA-2009-EmeryH #architecture #framework #using
Every architecture description needs a framework: Expressing architecture frameworks using ISO/IEC 42010 (DEE, RH), pp. 31–40.
CSEETCSEET-2009-ThompsonE #approach #industrial #scalability #student
A Scalable Approach to Graduate Student Projects: Hundreds with Industry Every Year (JBT, HME), pp. 158–161.
STOCSTOC-2009-ChalopinG #graph
Every planar graph is the intersection graph of segments in the plane: extended abstract (JC, DG), pp. 631–638.
STOCSTOC-2008-BenjaminiSS #graph
Every minor-closed property of sparse graphs is testable (IB, OS, AS), pp. 393–402.
STOCSTOC-2008-Raghavendra #algorithm #csp #question
Optimal algorithms and inapproximability results for every CSP? (PR), pp. 245–254.
RERE-2007-KousikV #development #requirements
Total Requirements Control at Every Stage of Product Development (SRK, RV), pp. 337–342.
DocEngDocEng-2006-Moore #documentation
Every page is different: a new document type for commercial printing (KM), p. 2.
CSEETCSEET-2006-GrunbacherSBIKP #approach #education #re-engineering #student
Making Every Student a Winner: The WinWin Approach in Software Engineering Education (PG, NS, ROB, HPI, HK, DP), pp. 201–208.
STOCSTOC-2006-Impagliazzo #algorithm #question #random
Can every randomized algorithm be derandomized? (RI), pp. 373–374.
STOCSTOC-2005-AlonS #graph
Every monotone graph property is testable (NA, AS), pp. 128–137.
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read (IB, OS, DBW), pp. 244–250.
STOCSTOC-2005-Hastad #approximate
Every 2-CSP allows nontrivial approximation (JH), pp. 740–746.
KDDKDD-2002-WuF #performance #scalability
Making every bit count: fast nonlinear axis scaling (LW, CF), pp. 664–669.
PLDIPLDI-1999-StichnothLC #compilation #garbage collection #java
Support for Garbage Collection at Every Instruction in a Java Compiler (JMS, GYL, MC), pp. 118–127.
Every Unsolvable λ Term has a Decoration (RD), pp. 98–113.
STOCSTOC-1996-AwerbuchAFL #how #nondeterminism
Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract) (BA, YA, AF, FTL), pp. 519–530.
SACSAC-1996-GabrielliGM #design #fuzzy #process
VLSI design of a fuzzy chip that processes 2-4 inputs every 160-320 ns whichever is the fuzzy system (AG, EG, MM), pp. 590–594.
SIGMODSIGMOD-1995-Golding #replication
Things Every Update Replication Customer Should Know (RG), pp. 439–440.
ICMLICML-1995-RaoGS #question
For Every Generalization Action, Is There Really an Equal and Opposite Reaction? (RBR, DFG, WMS), pp. 471–479.
FSEFSE-1993-Votta #question
Does Every Inspection Need a Meeting? (LGV), pp. 107–114.
PODSPODS-1989-Przymusinski #fixpoint #logic programming
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model (TCP), pp. 11–21.
ICALPICALP-1985-Kortelainen #commutative #regular expression
Every Commutative Quasirational Language is Regular (JK), pp. 348–355.
STOCSTOC-1984-KahnS #comparison
Every Poset Has a Good Comparison (JK, MES), pp. 299–301.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.