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
[1]
Hilfe
Suche: Author="Yesha, Y."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Upper and lower bounds on the makespan of schedules for tree dags on linear arrays
K. Kalpakis
,
Y. Yesha
Algorithmica
23
(2), 1999, pp. 159-179
Scheduling tree dags on parallel architectures
K. Kalpakis
,
Y. Yesha
Algorithmica
15
, 1996, pp. 373-396
A lower bound on the probability of conflict under nonuniform access in database systems
K. Humenik
,
P. Matthews
,
A.B. Stephens
,
Y. Yesha
Algorithmica
13
, 1995, pp. 283-300
On the power of concurrent-write PRAMs with read-only memory
F.E. Fich
,
M. Li
,
P. Ragde
,
Y. Yesha
Information and Computation
83
(2), 1989, November, pp. 234-244
Binary tree algebraic computation and parallel algorithms for simple graphs
Xin He
,
Y. Yesha
Journal of Algorithms
9
(1), 1988, March, pp. 92-113
A polynomial algorithm for computation of the probability of conflicts in a database under arbitrary data access distribution
M. Singhal
,
Y. Yesha
Information Processing Letters
27
(2), 1988, February, pp. 69-74
The probabilistic and deterministic parallel complexity of symmetric functions
M. Li
,
Y. Yesha
Lecture Notes in Computer Science
267
, 1987, pp. 326-335
Separation and lower bounds for ROM and nondeterministic models of parallel computation
M. Li
,
Y. Yesha
Information and Computation
73
(2), 1987, pp. 102-128
String-matching cannot be done by a two-head one-way deterministic finite automaton
M. Li
,
Y. Yesha
Information Processing Letters
22
(5), 1986, April, pp. 231-235
New lower bounds for parallel computation
M. Li
,
Y. Yesha
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 177-187
Computation times of NP sets of different densities
J. Hartmanis
,
Y. Yesha
Theoretical Computer Science
34
(1,2), 1984, pp. 17-32
Computation times of NP sets of different densities
Juris Hartmanis
,
Y. Yesha
Technical Report (TR 83-548), 1983, March
On certain polynomial-time truth-table reducibilities of complete sets to sparse sets
Y. Yesha
SIAM Journal on Computing
12
(3), 1983, August, pp. 411-425
Theory of annihilation games-I
A.S. Fraenkel
,
Y. Yesha
Journal of Combinatorial Theory Series B
33
, 1982, pp. 60-86
Complexity of solving algebraic equations
A.S. Fraenkel
,
Y. Yesha
Information Processing Letters
10
(4-5), 1980, July, pp. 178-179
Complexity of problems in games, graphs and algebraic equations
A.S. Fraenkel
,
Y. Yesha
Discrete Applied Mathematics
1
, 1979, pp. 15-30
The complexity of checkers on a N x N board - preliminary report
A.S. Frankel
,
M.R. Garey
,
D.S. Johnson
,
T. Schaefer
,
Y. Yesha
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 55-64