BarrosH's algorithm [133 articles] Export

Recent papers added to BarrosH's library classified by the tag algorithm. You can also see everyone's algorithm.

	Joint Burke's Theorem and RSK Representation for a Queue and a Store [My Copy] In Discrete Random Walks, DRW'03, Vol. AC (2003), pp. 69-82. by Moez Draief, Jean Mairesse, Neil O'Connell edited by Cyril Banderier, Christian Krattenthaler posted to algorithm burkes model non-colliding of queue queues random robinson-schensted-knuth server single storage tandem theorem walks by BarrosH on 2006-05-07 16:05:58 as
	Cellular Lines: An Introduction [My Copy] In Discrete Models for Complex Systems, DMCS'03, Vol. AB (2003), pp. 167-178. by Panama Geer, Harry W. Mclaughlin, Keith Unsworth edited by Michel Morvan, éric Rémila posted to algorithm array cellular definition derived drawing line representation string by BarrosH on 2006-05-07 16:05:58 as along with 1 person ansobol
	Results and conjectures on the Sandpile Identity on a lattice [My Copy] In Discrete Models for Complex Systems, DMCS'03, Vol. AB (2003), pp. 89-102. by Arnaud Dartois, Clémence Magnien edited by Michel Morvan, éric Rémila posted to abelian algorithm burning identity infinite lattice sandpile toppling by BarrosH on 2006-05-07 16:05:57 as
	Efficient Algorithms on the Family Associated to an Implicational System [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 2. (2004), pp. 315-338. by Karell Bertet, Mirabelle Nebut posted to algorithm closure family implicational lattice moore operator ordered set system by BarrosH on 2006-05-07 16:05:51 as
	New Results on Generalized Graph Coloring [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 6, No. 2. (2004), pp. 215-222. by Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin posted to algorithm coloring generalized graph np-completeness polynomial by BarrosH on 2006-05-07 16:05:51 as
	Linear time recognition of $P_4$-indifference graphs [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 173-178. by Michel Habib, Christophe Paul, Laurent Viennot posted to algorithm p_4-indifference recognition by BarrosH on 2006-05-07 16:05:44 as
	Minimum Eccentricity Multicast Trees [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 157-172. by David Krumme, Paraskevi Fragopoulou posted to algorithm communications eccentricity graph multicast network by BarrosH on 2006-05-07 16:05:44 as
	Analysis of Transmissions Scheduling with Packet Fragmentation [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 4, No. 2. (2001), pp. 139-156. by Nir Menakerman, Raphael Rom posted to algorithm analysis average bin case catv fragmentation packing scheduling by BarrosH on 2006-05-07 16:05:44 as
	Approximation algorithms for M-3-C and other problems via complex semidefinite programming [My Copy] Journal of Computer and System Sciences In Special Issue on STOC 2001, Vol. 68, No. 2. (March 2004), pp. 442-470. by Michel X. Goemans, David P. Williamson posted to algorithm approximation math probability programming by BarrosH on 2006-05-07 16:05:39 as
	Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 3, No. 4. (1999), pp. 155-166. by Keqin Li posted to algorithm analysis approximation average-case parallel performance probabilistic ratio scheduling task worst-case by BarrosH on 2006-05-07 16:05:39 as
	Descendants and ascendants in binary trees [My Copy] Discrete Mathematics and Theoretical Computer Science, Vol. 1, No. 1. (1997), pp. 247-266. by Alois Panholzer, Helmut Prodinger posted to algorithm binary function generating traversal tree zeilbergers by BarrosH on 2006-05-07 16:05:35 as
	Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs [My Copy] SIAM Journal on Computing, Vol. 28, No. 3. (1999), pp. 1004-1020. by Wen-Lian Hsu, Tze-Heng Ma posted to algorithm graph by BarrosH on 2006-05-07 16:03:11 as
	A greedy algorithm for convex geometries [My Copy] Discrete Applied Mathematics In Submodularity, Vol. 131, No. 2. (12 September 2003), pp. 449-465. by Kenji Kashiwabara, Yoshio Okamoto posted to algorithm combinatorics geometry by BarrosH on 2006-05-07 15:21:09 as along with 1 person ansobol
	Average-Case Approximability of Optimisation Problems [My Copy] (16 September 2004) by Birgit Schelm posted to algorithm approximation complexity computation by BarrosH on 2006-05-07 14:19:59 as
	Semidefinite programming and integer programming [My Copy] In Handbook on Discrete Optimization by Monique Laurent, Franz Rendl edited by K. Aardal, G. Nemhauser, R. Weismantel posted to algorithm approximation math by BarrosH on 2006-05-07 12:38:04 as
	First-Order Logic and Automated Theorem Proving (Texts in Computer Science) [My Copy] (29 November 1995) by Melvin Fitting posted to algorithm computation logic symbolic by BarrosH on 2006-05-07 11:41:47 as
	Linear-time transitive orientation [My Copy] In SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms (1997), pp. 19-25. by Ross M. Mcconnell, Jeremy P. Spinrad posted to algorithm graph by BarrosH on 2006-05-06 17:37:49 as
	Fundamental Problems of Algorithmic Algebra [My Copy] (30 December 1999) by Chee K. Yap posted to algebra algorithm computation by BarrosH on 2006-05-06 16:32:43 as along with 1 person kujan
	Theoretical Computer Science : Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (Texts ... Computer Science. An EATCS Series) [My Copy] (05 November 2003) by Juraj Hromkovic posted to algorithm complexity computation by BarrosH on 2006-05-06 15:56:14 as along with 1 person leonardo
	Algorithmic Algebra (Applied Mathematical Sciences) [My Copy] by Bhubaneswar Mishra posted to algebra algorithm by BarrosH on 2006-05-06 12:02:22 as along with 1 person ansobol
	Combinatorial Algorithms: Generation, Enumeration, and Search [My Copy] (18 December 1998) by Donald L. Kreher posted to algorithm combinatorics by BarrosH on 2006-05-05 20:07:02 as
	An efficient algorithm for maxdominance, with applications [My Copy] Algorithmica, Vol. 4, No. 1. (December 1989), pp. 221-236. by Mikhail J. Atallah, Rao S. Kosaraju posted to algorithm graph by BarrosH on 2006-05-05 13:12:12 as
	The algorithm description language ALDES (report) [My Copy] SIGSAM Bull., Vol. 10, No. 1. (February 1976), pp. 14-38. by R&\#252;diger G. K. Loos posted to algorithm cs by BarrosH on 2006-05-04 10:46:58 as
	Symbolic Rewriting Techniques (Progress in Computer Science and Applied Logic (PCS)) [My Copy] (25 April 2003) by M. Bronstein, J. Grabmeier, V. Weisfenning posted to algorithm logic symbolic by BarrosH on 2006-05-03 15:19:50 as
	Advanced Topics in Term Rewriting [My Copy] (12 April 2002) by Enno Ohlebusch posted to algorithm logic symbolic by BarrosH on 2006-05-03 15:19:22 as
	Random sampling and approximation of MAX-CSP problems [My Copy] In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002), pp. 232-239. by Noga Alon, Fernandez, Ravi Kannan, Marek Karpinski posted to algorithm approximation math by BarrosH on 2006-05-02 00:55:59 as
	Algorithms column: sublinear time algorithms [My Copy] SIGACT News, Vol. 34, No. 4. (December 2003), pp. 57-67. by Ravi Kumar, Ronitt Rubinfeld posted to algorithm approximation probability by BarrosH on 2006-05-02 00:50:41 as
	How to Solve It: Modern Heuristics [My Copy] (08 December 2004) by Zbigniew Michalewicz, David B. Fogel posted to algorithm by BarrosH on 2006-05-02 00:47:23 as along with 6 people and 4 groups doncieux ansobol mattjb nojhan gvdh japarejo EvolutionaryComputation Metaheuristics Optimization DSTO-CAS
	Principles of Optimal Design : Modeling and Computation [My Copy] (10 July 2000) by Panos Y. Papalambros, Douglass J. Wilde posted to algorithm math by BarrosH on 2006-04-29 17:07:54 as
	From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction [My Copy] Algorithmica, Vol. 19, No. 3. (November 1997), pp. 331-353. by R. Giegerich, S. Kurtz posted to algorithm by BarrosH on 2006-04-29 16:09:47 as
	On-line construction of suffix trees [My Copy] Algorithmica, Vol. 14, No. 3. (September 1995), pp. 249-260. by E. Ukkonen posted to algorithm by BarrosH on 2006-04-29 16:06:55 as
	Optimal suffix tree construction with large alphabets [My Copy] Foundations of Computer Science, 1997. Proceedings., 38th Annual Symposium on (1997), pp. 137-143. by M. Farach posted to algorithm by BarrosH on 2006-04-29 16:04:22 as
	A Space-Economical Suffix Tree Construction Algorithm [My Copy] J. ACM, Vol. 23, No. 2. (April 1976), pp. 262-272. by Edward M. Mccreight posted to algorithm by BarrosH on 2006-04-29 16:03:08 as along with 1 person dleinhaeuser
	Practical methods for constructing suffix trees [My Copy] The VLDB Journal, Vol. 14, No. 3. (September 2005), pp. 281-299. by Yuanyuan Tian, Sandeep Tata, A. Hankins, M. Patel posted to algorithm by BarrosH on 2006-04-29 16:02:37 as along with 2 people mogwaing myui
	NC algorithms for dominations in permutation graphs [My Copy] In SAC '92: Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing (1992), pp. 734-739. by Y. D. Liang, C. Rhee, S. K. Dhall, S. Lakshmivarahan posted to algorithm graph by BarrosH on 2006-04-27 16:15:37 as along with 1 person AlanMicfox
	Finding a minimum independent dominating set in a permutation graph [My Copy] Discrete Applied Mathematics, Vol. 21, No. 3. (October 1988), pp. 177-183. by Mikhail J. Atallah, Glenn K. Manacher, J. Urrutia posted to algorithm graph by BarrosH on 2006-04-27 16:14:50 as along with 1 person gjxu
	Domination in permutation graphs [My Copy] Journal of Algorithms, Vol. 6, No. 3. (September 1985), pp. 309-321. by Martin Farber, Mark posted to algorithm graph by BarrosH on 2006-04-27 16:14:43 as
	On domination problems for permutation and other graphs [My Copy] Theoretical Computer Science, Vol. 54, No. 2-3. (October 1987), pp. 181-198. by Andreas Brandstadt, Dieter Kratsch posted to algorithm graph by BarrosH on 2006-04-27 16:14:33 as
	An $O(N + M)$-Time Algorithm for Finding a Minimum-WeightDominating Set in a Permutation Graph [My Copy] SIAM J. Comput., Vol. 25, No. 2. (February 1996), pp. 404-419. by C. Rhee, Y. D. Liang, S. K. Dhall, S. Lakshmivarahan posted to algorithm graph by BarrosH on 2006-04-27 16:14:25 as
	Hardness as randomness: a survey of universal derandomization [My Copy] (28 Apr 2003) by Russell Impagliazzo posted to algorithm complexity computation probability by BarrosH on 2006-04-27 16:11:00 as along with 1 person and 2 groups camu Crypto Randomness
	A 2 1/2-Approximation Algorithm for Shortest Superstring [My Copy] Vol. 29, No. 3. (1999), pp. 954-986. by Z. Sweedyk posted to algorithm approximation by BarrosH on 2006-04-27 16:09:01 as
	An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem [My Copy] In ENC '04: Proceedings of the Fifth Mexican International Conference in Computer Science (ENC'04) (2004), pp. 27-34. by Heidi J. Romero, Carlos A. Brizuela, Andrei Tchernykh posted to algorithm approximation by BarrosH on 2006-04-27 16:03:02 as
	Algorithmic derandomization via complexity theory [My Copy] In STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002), pp. 619-626. by D. Sivakumar posted to algorithm complexity computation probability by BarrosH on 2006-04-27 16:01:45 as along with 1 person and 2 groups camu Crypto Randomness
	Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization [My Copy] SIAM J Optimization, Vol. 5, No. 1. (1995), pp. 13-51. by Farid Alizadeh posted to algorithm combinatorics computation cs math by BarrosH on 2006-04-26 14:12:33 as
	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming [My Copy] J. ACM, Vol. 42, No. 6. (November 1995), pp. 1115-1145. by Michel X. Goemans, David P. Williamson posted to algorithm computation math by BarrosH on 2006-04-26 13:44:40 as along with 2 people pcarbo NeilInCanadia
	Parsing Techniques 2/e (Monographs in Computer Science) [My Copy] (31 May 2006) by Dick Grune, Ceriel J. H. Jacobs posted to algorithm cs by BarrosH on 2006-04-24 02:38:36 as
	Linear approximation of shortest superstrings [My Copy] J. ACM, Vol. 41, No. 4. (July 1994), pp. 630-647. by Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis posted to algorithm approximation biology by BarrosH on 2006-04-21 11:18:39 as
	An experimental comparison of two approximation algorithms for the common superstring problem [My Copy] Computer Science, 2004. ENC 2004. Proceedings of the Fifth Mexican International Conference in (2004), pp. 27-34. by H. J. Romero, C. A. Brizuela, A. Tchernykh posted to algorithm approximation biology programming by BarrosH on 2006-04-21 11:18:11 as
	Combined super-/substring and super-/subsequence problems [My Copy] Theoretical Computer Science, Vol. 320, No. 2-3. (14 June 2004), pp. 247-267. by Martin Middendorf, Manlove posted to algorithm biology computation by BarrosH on 2006-04-21 10:57:25 as
	An Introduction to Computational Learning Theory [My Copy] (15 August 1994) by Michael J. Kearns, Umesh V. Vazirani posted to algorithm math probability by BarrosH on 2006-04-18 13:43:24 as along with 3 people and 1 group dsilva spirit_of_numenor AbnerCYH ComplexAdaptiveSystems

Note: You may cite this page as: http://www.citeulike.org/user/BarrosH/tag/algorithm

Result page: 1 2 3 Next

algorithm	133
math	120
graph	92
complexity	86
combinatorics	77
computation	72
cs	68
systems	44
algebra	43
probability	39
biology	34
approximation	31
random	26
logic	25
physics	25
automata	22
information	17
programming	16
of	15
pre-print	15
functions	15
discrete	14
graphs	13
symbolic	13
generating	12
dynamical	12
geometry	12
algorithms	11
topology	11
tree	11
cellular	11
walk	10
parallel	10
analysis	10
trees	10
lattice	10
lie	9
group	9
function	8
permutations	7
model	7
search	7
study_method	7
decomposition	7
theory	6
binary	6
theorem	6
symmetric	6
tilings	5
set	5
permutation	5
walks	5
linear	5
word	4
convergence	4
problem	4
system	4
brownian	4
paths	4
data	4
markov	4
game	4
formula	4
operator	4
cycle	4
economics	4
numbers	4
modular	4
basis	4
height	4
sequence	4
polynomials	4
motion	4
algebras	4
polynomial	4
perfect	4
processes	4
np-completeness	4
words	4
partition	4
lyndon	3
generalized	3
central	3
surface	3
path	3
patterns	3
convex	3
groups	3
models	3
classification	3
phase	3
process	3
circuit	3
transition	3
method	3
matrices	3
finite	3
percolation	3
free	3
and	3
on	3
tableaux	3
closure	3
simple	3
tiling	3
structures	3
representation	3
sparse	3
cayley	3
history	3
series	3
proof	3
branching	2
distance	2
schur	2
boolean	2
pile	2
languages	2
limit	2
arrangements	2
sand	2
bijective	2
q-analogue	2
criteria	2
hyperplane	2
moments	2
subword	2
communications	2
planar	2
processing	2
critical	2
sieve	2
catalan	2
singularity	2
simplicial	2
overlap-free	2
conjecture	2
partitions	2
interval	2
grammars	2
q-analogs	2
recurrence	2
enumeration	2
circuits	2
constant	2
structure	2
statistical	2
matrix	2
ring	2
firing	2
decidability	2
networks	2
coloring	2
broken	2
saddle	2
algebraic	2
homogeneous	2
point	2
computational	2
network	2
weak	2
modulus	2
interacting	2
young	2
shuffle	2
pathwidth	2
chip	2
polyominoes	2
p_4-structure	2
number	2
fields	2
queue	2
methods	2
composite	2
transfer	2
average-case	2
mechanics	2
invariant	2
functional	2
poset	2
d0l	2
kernel	2
bounds	2
computations	2
dynamics	2
multicast	2
integer	2
rational	2
quasicrystals	2
distributive	2
lower	2
drawing	2
length	2
gas	2
matching	2
asymptotic	2
scheduling	2
bernoulli	2
forbidden	2
environment	2
recursive	2
uniform	2
factorization	2
complex	2
strong	2
asymptotics	2
rewriting	2
reconstruction	2
hilbert	2
decompositions	1
transforms	1
bi-infinite	1
second-order	1
sum	1
curves	1
monadic	1
embedding	1
non-crossing	1
resolution	1
heat	1
time	1
ratio	1
timing	1
harness	1
elias	1
transitive	1
treewidth	1
minimal	1
non-colliding	1
harmonic	1
moment	1
prediction	1
consistency	1
friendly	1
extremality	1
chebyshev	1
generic	1
rooted	1
robinson-schensted-knuth	1
scattering	1
catv	1
k-sat	1
descent	1
direct	1
one	1
routing	1
specification	1
re-indexation	1
lagrange	1
ramanujan	1
light	1
term	1
monomer-dimer	1
perfection	1
contexts	1
translations	1
burning	1
matroid	1
expanders	1
zeilbergers	1
the	1
sets	1
orientation	1
effect	1
normality	1
subgroups	1
estimates	1
self	1
polytechnic	1
recognition	1
sagbi-grobner	1
immune	1
page-number	1
urns	1
domino	1
design	1
hamming	1
queues	1
secret	1
maxima	1
p-fold	1
norm	1
strategies	1
blockcodes	1
signal	1
theories	1
partitioning	1
wz	1
subexceedant	1
q-binomial	1
cograph	1
karamatas	1
projection	1
degree	1
hypercubic	1
symmetry	1
van	1
dirichlet	1
schroder	1
block	1
permuvar	1
sources	1
summation	1
strip	1
balancing	1
bellman-harris	1
complete	1
distribution	1
magnus	1
multi-scale	1
ordered	1
well-spread	1
morphisms	1
t-design	1
granular	1
dyck	1
space-filling	1
tandem	1
symbols	1
identifying	1
lorentz	1
arrays	1
hexagon	1
special	1
substitution	1
reasoning	1
hypercube	1
b-chromatic	1
locating-dominating	1
mobile	1
polytope	1
implementation	1
p_4-indifference	1
spanning	1
definition	1
stanleys	1
thresholds	1
internal	1
coefficient	1
first-passage	1
bijections	1
bandwidth	1
finitely	1
sandpile	1
acceptance	1
sorting	1
ramified	1
persistence	1
claw-free	1
automatic	1
entropy	1
reliability	1
closed	1
stack-number	1
quasi-closed	1
trie	1
report	1
fibonacci	1
worst-case	1
fumctions	1
m-ary	1
clusterization	1
allocation	1
p-connected	1
chromatic	1
fault-tolerance	1
undecidability	1
case	1
datatypes	1
burkes	1
estimation	1
sour	1
hardy	1
non	1
size	1
scheme	1
3-colourability	1
large	1
recurrences	1
explicit	1
urn	1
identity	1
saturated	1
shape	1
markovian	1
lp	1
entropic	1
polyas	1
arrow	1
hard-core	1
piecewise	1
factorizing	1
locality	1
rules	1
unification	1
limiting	1
diameter	1
digits	1
maps	1
thermodynamics	1
queue-number	1
life	1
atomic	1
pseudo	1
diagonalization	1
deviations	1
media	1
predecessor	1
right-invariant	1
doubling	1
poissonization	1
clustering	1
genome	1
sums	1
compact	1
martingales	1
composition	1
blob	1
derangements	1
affine	1
university	1
implicational	1
presented	1
rhombus	1
parity	1
nested	1
matchings	1
streams	1
colorful	1
abelian	1
sidon	1
binomial	1
catalytic	1
bisection	1
histograms	1
california	1
existence	1
mellin	1
sufficient	1
nonlinear	1
gibbs	1
defect	1
constructions	1
first	1
analytic	1
shephard	1
first-order	1
noncommutative	1
labelling	1
denfants	1
formulae	1
randomization	1
string	1
hook-length	1
reciprocity	1
server	1
hd0l	1
transposition	1
inverse	1
latin	1
streaming	1
temporal	1
luis	1
rank-2	1
density	1
hurwitz	1
task	1
exponential	1
hironaka	1
anti-exchange	1
quicksort	1
numeration	1
q-equations	1
space-time	1
comparison	1
theoryanalysis	1
expanding	1
maximum	1
san	1
homology	1
discovery	1
codes	1
combinatorial	1
performance	1
cut	1
analytical	1
observational	1
toppling	1
reversibility	1
hamiltonian	1
eccentricity	1
self-organization	1
dual	1
cascades	1
stack	1
classes	1
carlitz	1
cubic	1

BarrosH's algorithm [133 articles] Export

BarrosH's tags