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="Vazirani, U."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A mildly exponential approximation algorithm for the permanent
M. Jerrum
,
U. Vazirani
Algorithmica
16
, 1996, pp. 392-401
A Markovian extension of Valiant's learning model
D. Aldous
,
U. Vazirani
Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. Vol.~I, FOCS'90 (St. Louis, Missouri, October 22-24, 1990)
, 1990, pp. 392-396
An optimal algorithm for on-line bipartite matching
R.M. Karp
,
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, STOC'90 (Baltimore, Maryland, May 14--16, 1990)
, 1990, pp. 352-358
Graph products and chromatic numbers
N. Linial
,
U. Vazirani
Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, FOCS'89 (Research Triangle Park, NC, October 30 - November 1, 1989)
, 1989, pp. 124-128
Polytopes, permanents and graphs with large factors
P. Dagum
,
M. Luby
,
M. Mihail
,
U. Vazirani
Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, FOCS'88 (White Plains, NY, October 24-26, 1988)
, 1988, pp. 412-421
Global wire routing in two-dimensional arrays
R.M. Karp
,
F.T. Leighton
,
R.L. Rivest
,
C.D. Thompson
,
U.V. Vazirani
,
V.V. Vazirani
Algorithmica
2
(1), 1987, pp. 113-129
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Combinatorica
7
(1), 1987, pp. 105-120
Matching is as easy as matrix inversion
K. Mulmuley
,
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 345-354
Efficiency considerations in using semi-random sources
U. Vazirani
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, STOC'87 (New York City, May 25--27, 1987)
, 1987, pp. 160-168
Strong communication complexity or generating quasirandom sequences from two communicating semi-random sources
U. Vazirani
Combinatorica
7
(4), 1987, pp. 375-392
Generating quasi-random sequences from semi-random sources
M. Santha
,
U.V. Vazirani
Journal of Computer and System Sciences
33
(1), 1986, August, pp. 75-87
Random polynomial time is equal to slightly-random polynomial time
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, FOCS'85 (Portland, OR, October 21-23, 1985)
, 1985, pp. 417-428
The two-processor scheduling problem is in R-NC
U. Vazirani
,
V.V. Vazirani
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 11-21
Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources
U.V. Vazirani
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 366-378
On two geometric problems related to the travelling salesman problem
C.H. Papadimitriou
,
U.V. Vazirani
Journal of Algorithms
5
(2), 1984, June, pp. 231-246
Generating quasi-random sequences from slightly-random sources
M. Santha
,
U.V. Vazirani
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 434-440
Efficient and secure pseudo-random number generation
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 458-463
Global wire routing in two-dimensional arrays
R.M. Karp
,
F.T. Leighton
,
R.L. Rivest
,
C.D. Thompson
,
U. Vazirani
,
V. Vazirani
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 453-459
Trapdoor pseudo-random number generators, with applications to protocol design
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 23-30
A natural encoding scheme proved probabilistic polynomial complete
U.V. Vazirani
,
V.V. Vazirani
Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'82 (Chicago, IL, November 3-5, 1982)
, 1982, pp. 40-44
A parallel algorithm for matching
K. Mulmuley
,
U. Vazirani
,
V. Vazirani
misc
Matching is as easy as matrix inversion
K. Mulmuley
,
U. Vazirani
,
V. Vazirani
misc