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
[2]
Hilfe
Suche: Author="Tassa, Tamir"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Addendum to ``Finding all maximally-matchable edges in a bipartite graph''
Tamir Tassa
Theoretical Computer Science
491
, 2013, pp. 136-136
Finding all maximally-matchable edges in a bipartite graph
Tamir Tassa
Theoretical Computer Science
423
, 2012, pp. 50-58
Characterizing ideal weighted threshold secret sharing
Amos Beimel
,
Tamir Tassa
,
Enav Weinreb
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 360-397
k
-anonymization with minimal loss of information
Aristides Gionis
,
Tamir Tassa
Lecture Notes in Computer Science
4698
, 2007, pp. 439-450
Vector assignment schemes for asymmetric settings
Leah Epstein
,
Tamir Tassa
Acta Informatica
42
(6-7), 2006, pp. 501-514
Optimal preemptive scheduling for general target functions
Leah Epstein
,
Tamir Tassa
Journal of Computer and System Sciences
72
(1), 2006, pp. 132-162
Multipartite secret sharing by bivariate interpolation
Tamir Tassa
,
Nira Dyn
Lecture Notes in Computer Science
4052
, 2006, pp. 288-299
Approximation schemes for the min-max starting time problem
Leah Epstein
,
Tamir Tassa
Acta Informatica
40
(9), 2004, pp. 657-674
Optimal preemptive scheduling for general target functions
Leah Epstein
,
Tamir Tassa
Lecture Notes in Computer Science
3153
, 2004, pp. 562-573
Vector assignment problems: A general framework
Leah Epstein
,
Tamir Tassa
Journal of Algorithms
48
(2), 2003, pp. 360-384
Approximation schemes for the min-max starting time problem
Leah Epstein
,
Tamir Tassa
Lecture Notes in Computer Science
2747
, 2003, pp. 408-418
Vector assignment problems: A general framework
Leah Epstein
,
Tamir Tassa
Lecture Notes in Computer Science
2461
, 2002, pp. 461-472