Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Poblete, Patricio V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Stronger quickheaps
Gonzalo Navarro
,
Rodrigo Paredes
,
Patricio V. Poblete
,
Peter Sanders
International Journal of Foundations of Computer Science
22
(4), 2011, pp. 945-969
The binomial transform and the analysis of skip lists
Patricio V. Poblete
,
J. Ian Munro
,
Thomas Papadakis
Theoretical Computer Science
352
(1-3), 2006, pp. 136-158
Searching
Ricardo Baeza-Yates
,
Patricio V. Poblete
Algorithms and Theory of Computation Handbook, 1999, pp. 2-1 - 2-15
The analysis of linear probing hashing with buckets
Alfredo Viola
,
Patricio V. Poblete
Lecture Notes in Computer Science
1136
, 1996, pp. 221-233
Visibility graphs of 2-spiral polygons
James Abello
,
Krishna Kumar
Lecture Notes in Computer Science
911
, 1995, pp. 1-15
Random generation of colored trees
L. Alonso
,
R. Schott
Lecture Notes in Computer Science
911
, 1995, pp. 16-35
Space filling curves and their use in the design of geometric data structures
Tetsuo Asano
,
Desh Ranjan
,
Thomas Roos
,
Emo Welzl
,
Peter Widmayer
Lecture Notes in Computer Science
911
, 1995, pp. 36-48
Higher-order analysis of 2-3 trees
Ricardo A. Baeza-Yates
,
Patricio V. Poblete
International Journal of Foundations of Computer Science
6
(1), 1995, pp. 1-10
Tight bounds for finding degrees from the adjacency matrix
R. Balasubramanian
,
Venkatesh Raman
,
G. Srinivasaraghavan
Lecture Notes in Computer Science
911
, 1995, pp. 49-59
Lower bounds for modular counting by circuits with modular gates
David Mix Barrington
,
Howard Straubing
Lecture Notes in Computer Science
911
, 1995, pp. 60-71
On the relation between BDDs and FDDs
Bernd Becker
,
Rolf Drechsler
,
Ralph Werchner
Lecture Notes in Computer Science
911
, 1995, pp. 72-83
On dynamical properties of generalized toggle automata
F. Blanchard
,
Alejandro Maass
Lecture Notes in Computer Science
911
, 1995, pp. 84-98
Free shuffle algebras in language varieties
Stephen L. Bloom
,
Zoltán Ésik
Lecture Notes in Computer Science
911
, 1995, pp. 99-111
Lower bounds for the matrix chain ordering problem
Phillip G. Bradford
,
Venkatesh Choppella
,
Gregory J.E. Rawlins
Lecture Notes in Computer Science
911
, 1995, pp. 112-130
Off-line electronic cash based on secret-key certificates
Stefan Brands
Lecture Notes in Computer Science
911
, 1995, pp. 131-166
Recognizable sets of numbers in nonstandard bases
Véronique Bruyère
,
Georges Hansel
Lecture Notes in Computer Science
911
, 1995, pp. 167-179
On weak growing context-sensitive grammars
Gerhard Buntrock
,
Gundula Niemann
Lecture Notes in Computer Science
911
, 1995, pp. 180-194
Logic of Plotkin continuous domain
Benjamín R. Callejas Bedregal
,
Benedito Melo Acióly
Lecture Notes in Computer Science
911
, 1995, pp. 195-206
(Probabilistic) recurrence relations revisited
Shiva Chaudhuri
,
Devdatt Dubhashi
Lecture Notes in Computer Science
911
, 1995, pp. 207-219
On linear-time alphabet-independent 2-dimensional pattern matching
Maxime Crochemore
,
Wojciech Rytter
Lecture Notes in Computer Science
911
, 1995, pp. 220-229
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Jérôme Durand-Lose
Lecture Notes in Computer Science
911
, 1995, pp. 230-244
Nearest neighbour graph realizability is
NP
-hard
Peter Eades
,
Sue Whitesides
Lecture Notes in Computer Science
911
, 1995, pp. 245-256
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
David Fernández-Baca
,
Giora Slutzki
Lecture Notes in Computer Science
911
, 1995, pp. 257-271
Paging more than one page
Esteban Feuerstein
Lecture Notes in Computer Science
911
, 1995, pp. 272-285
Permuting in place
Faith E. Fich
,
J. Ian Munro
,
Patricio V. Poblete
SIAM Journal on Computing
24
(2), 1995, pp. 266-278
Seiten 1
2
3
>