---
OA_type: closed access
_id: '3499'
abstract:
- lang: eng
text: 'We study infinite stochastic games played by n-players on a finite graph
with goals specified by sets of infinite traces. The games are concurrent (each
player simultaneously and independently chooses an action at each round), stochastic
(the next state is determined by a probability distribution depending on the current
state and the chosen actions), infinite (the game continues for an infinite number
of rounds), nonzero-sum (the players’ goals are not necessarily conflicting),
and undiscounted. We show that if each player has an upward-closed objective,
then there exists an ε-Nash equilibrium in memoryless strategies, for every ε>0;
and exact Nash equilibria need not exist. Upward-closure of an objective means
that if a set Z of infinitely repeating states is winning, then all supersets
of Z of infinitely repeating states are also winning. Memoryless strategies are
strategies that are independent of history of plays and depend only on the current
state. We also study the complexity of finding values (payoff profile) of an ε-Nash
equilibrium. We show that the values of an ε-Nash equilibrium in nonzero-sum concurrent
games with upward-closed objectives for all players can be computed by computing
ε-Nash equilibrium values of nonzero-sum concurrent games with reachability objectives
for all players and a polynomial procedure. As a consequence we establish that
values of an ε-Nash equilibrium can be computed in TFNP (total functional NP),
and hence in EXPTIME. '
acknowledgement: This research was supported in part by the NSF grants CCR-0225610
and CCR- 0234690, and by the SNSF under the Indo-Swiss Joint Research Programme.
alternative_title:
- 'LNCS '
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: 'Chatterjee K. Nash equilibrium for upward-closed objectives. In: Proceedings
of the 20th International Conference on Computer Science Logic. Vol 4207.
Springer Nature; 2006:271-286. doi:10.1007/11874683_18'
apa: 'Chatterjee, K. (2006). Nash equilibrium for upward-closed objectives. In Proceedings
of the 20th international conference on Computer Science Logic (Vol. 4207,
pp. 271–286). Szeged, Hungary: Springer Nature. https://doi.org/10.1007/11874683_18'
chicago: Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives.”
In Proceedings of the 20th International Conference on Computer Science Logic,
4207:271–86. Springer Nature, 2006. https://doi.org/10.1007/11874683_18.
ieee: K. Chatterjee, “Nash equilibrium for upward-closed objectives,” in Proceedings
of the 20th international conference on Computer Science Logic, Szeged, Hungary,
2006, vol. 4207, pp. 271–286.
ista: 'Chatterjee K. 2006. Nash equilibrium for upward-closed objectives. Proceedings
of the 20th international conference on Computer Science Logic. CSL: Computer
Science Logic, LNCS , vol. 4207, 271–286.'
mla: Chatterjee, Krishnendu. “Nash Equilibrium for Upward-Closed Objectives.” Proceedings
of the 20th International Conference on Computer Science Logic, vol. 4207,
Springer Nature, 2006, pp. 271–86, doi:10.1007/11874683_18.
short: K. Chatterjee, in:, Proceedings of the 20th International Conference on Computer
Science Logic, Springer Nature, 2006, pp. 271–286.
conference:
end_date: 2006-09-29
location: Szeged, Hungary
name: 'CSL: Computer Science Logic'
start_date: 2006-09-25
date_created: 2018-12-11T12:03:39Z
date_published: 2006-09-28T00:00:00Z
date_updated: 2026-08-28T11:22:40Z
day: '28'
doi: 10.1007/11874683_18
extern: '1'
fulldoi: https://doi.org/10.1007/11874683_18
intvolume: ' 4207'
language:
- iso: eng
month: '09'
oa_version: None
page: 271 - 286
publication: Proceedings of the 20th international conference on Computer Science
Logic
publication_identifier:
eisbn:
- '9783540454595'
eissn:
- 1611-3349
isbn:
- '9783540454588'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
publist_id: '2888'
status: public
title: Nash equilibrium for upward-closed objectives
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 4207
year: '2006'
...
---
OA_type: closed access
_id: '18319'
abstract:
- lang: eng
text: "The problem of isometry-invariant representation and comparison of surfaces
is of cardinal importance in pattern recognition applications dealing with deformable
objects. Particularly, in three-dimensional face recognition treating facial expressions
as isometries of the facial surface allows to perform robust recognition insensitive
to expressions.\r\nIsometry-invariant representation of surfaces can be constructed
by isometrically embedding them into some convenient space, and carrying out the
comparison in that space. Presented here is a discussion on isometric embedding
into S3, which appears to be superior over the previously used Euclidean space
in sense of the representation accuracy."
alternative_title:
- LNIP
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Isometric embedding of facial surfaces
into S3. In: 5th International Conference on Scale-Space Theories in Computer
Vision. Vol 3459. Springer Berlin Heidelberg; 2005:622-631. doi:10.1007/11408031_53'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2005). Isometric embedding
of facial surfaces into S3. In 5th International Conference on Scale-Space
Theories in Computer Vision (Vol. 3459, pp. 622–631). Hofgeismar, Germany:
Springer Berlin Heidelberg. https://doi.org/10.1007/11408031_53'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Isometric Embedding
of Facial Surfaces into S3.” In 5th International Conference on Scale-Space
Theories in Computer Vision, 3459:622–31. Springer Berlin Heidelberg, 2005.
https://doi.org/10.1007/11408031_53.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Isometric embedding of facial
surfaces into S3,” in 5th International Conference on Scale-Space Theories
in Computer Vision, Hofgeismar, Germany, 2005, vol. 3459, pp. 622–631.
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2005. Isometric embedding of facial
surfaces into S3. 5th International Conference on Scale-Space Theories in Computer
Vision. Scale Space: Conference on Scale-Space Theories in Computer Vision, LNIP,
vol. 3459, 622–631.'
mla: Bronstein, Alex M., et al. “Isometric Embedding of Facial Surfaces into S3.”
5th International Conference on Scale-Space Theories in Computer Vision,
vol. 3459, Springer Berlin Heidelberg, 2005, pp. 622–31, doi:10.1007/11408031_53.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 5th International Conference
on Scale-Space Theories in Computer Vision, Springer Berlin Heidelberg, 2005,
pp. 622–631.
conference:
end_date: 2005-04-09
location: Hofgeismar, Germany
name: 'Scale Space: Conference on Scale-Space Theories in Computer Vision'
start_date: 2005-04-07
date_created: 2024-10-15T11:12:06Z
date_published: 2005-03-31T00:00:00Z
date_updated: 2024-10-22T06:29:06Z
day: '31'
doi: 10.1007/11408031_53
extern: '1'
fulldoi: https://doi.org/10.1007/11408031_53
intvolume: ' 3459'
language:
- iso: eng
month: '03'
oa_version: None
page: 622-631
publication: 5th International Conference on Scale-Space Theories in Computer Vision
publication_identifier:
eisbn:
- '9783540320128'
eissn:
- 1611-3349
isbn:
- '9783540255475'
issn:
- 0302-9743
publication_status: published
publisher: Springer Berlin Heidelberg
quality_controlled: '1'
scopus_import: '1'
status: public
title: Isometric embedding of facial surfaces into S3
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3459
year: '2005'
...
---
_id: '11800'
abstract:
- lang: eng
text: "Web search engines have emerged as one of the central applications on the
Internet. In fact, search has become one of the most important activities that
people engage in on the the Internet. Even beyond becoming the number one source
of information, a growing number of businesses are depending on web search engines
for customer acquisition.\r\n\r\nThe first generation of web search engines used
text-only retrieval techniques. Google revolutionized the field by deploying the
PageRank technology – an eigenvector-based analysis of the hyperlink structure
– to analyze the web in order to produce relevant results. Moving forward, our
goal is to achieve a better understanding of a page with a view towards producing
even more relevant results."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. The past, present, and future of web search engines. In: 31st
International Colloquium on Automata, Languages and Programming. Vol 3142.
Springer Nature; 2004:3. doi:10.1007/978-3-540-27836-8_2'
apa: 'Henzinger, M. (2004). The past, present, and future of web search engines.
In 31st International Colloquium on Automata, Languages and Programming
(Vol. 3142, p. 3). Turku, Finland: Springer Nature. https://doi.org/10.1007/978-3-540-27836-8_2'
chicago: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.”
In 31st International Colloquium on Automata, Languages and Programming,
3142:3. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-27836-8_2.
ieee: M. Henzinger, “The past, present, and future of web search engines,” in 31st
International Colloquium on Automata, Languages and Programming, Turku, Finland,
2004, vol. 3142, p. 3.
ista: 'Henzinger M. 2004. The past, present, and future of web search engines. 31st
International Colloquium on Automata, Languages and Programming. ICALP: International
Colloquium on Automata, Languages, and Programming, LNCS, vol. 3142, 3.'
mla: Henzinger, Monika. “The Past, Present, and Future of Web Search Engines.” 31st
International Colloquium on Automata, Languages and Programming, vol. 3142,
Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-27836-8_2.
short: M. Henzinger, in:, 31st International Colloquium on Automata, Languages and
Programming, Springer Nature, 2004, p. 3.
conference:
end_date: 2004-07-16
location: Turku, Finland
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 2004-07-12
date_created: 2022-08-11T12:38:58Z
date_published: 2004-07-01T00:00:00Z
date_updated: 2024-11-06T08:14:51Z
day: '01'
doi: 10.1007/978-3-540-27836-8_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-27836-8_2
intvolume: ' 3142'
language:
- iso: eng
month: '07'
oa_version: None
page: '3'
publication: 31st International Colloquium on Automata, Languages and Programming
publication_identifier:
eissn:
- 1611-3349
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: The past, present, and future of web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3142
year: '2004'
...
---
_id: '11801'
abstract:
- lang: eng
text: "Web search engines have emerged as one of the central applications on the
internet. In fact, search has become one of the most important activities that
people engage in on the Internet. Even beyond becoming the number one source of
information, a growing number of businesses are depending on web search engines
for customer acquisition. In this talk I will brief review the history of web
search engines: The first generation of web search engines used text-only retrieval
techniques. Google revolutionized the field by deploying the PageRank technology
– an eigenvector-based analysis of the hyperlink structure- to analyze the web
in order to produce relevant results. Moving forward, our goal is to achieve a
better understanding of a page with a view towards producing even more relevant
results.\r\n\r\nGoogle is powered by a large number of PCs. Using this infrastructure
and striving to be as efficient as possible poses challenging systems problems
but also various algorithmic challenges. I will discuss some of them in my talk."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. Algorithmic aspects of web search engines. In: 2th Annual
European Symposium on Algorithms. Vol 3221. Springer Nature; 2004:3. doi:10.1007/978-3-540-30140-0_2'
apa: 'Henzinger, M. (2004). Algorithmic aspects of web search engines. In 2th
Annual European Symposium on Algorithms (Vol. 3221, p. 3). Bergen, Norway:
Springer Nature. https://doi.org/10.1007/978-3-540-30140-0_2'
chicago: Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” In 2th
Annual European Symposium on Algorithms, 3221:3. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30140-0_2.
ieee: M. Henzinger, “Algorithmic aspects of web search engines,” in 2th Annual
European Symposium on Algorithms, Bergen, Norway, 2004, vol. 3221, p. 3.
ista: 'Henzinger M. 2004. Algorithmic aspects of web search engines. 2th Annual
European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS,
vol. 3221, 3.'
mla: Henzinger, Monika. “Algorithmic Aspects of Web Search Engines.” 2th Annual
European Symposium on Algorithms, vol. 3221, Springer Nature, 2004, p. 3,
doi:10.1007/978-3-540-30140-0_2.
short: M. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer
Nature, 2004, p. 3.
conference:
end_date: 2004-09-17
location: Bergen, Norway
name: 'ESA: European Symposium on Algorithms'
start_date: 2004-09-14
date_created: 2022-08-11T13:18:05Z
date_published: 2004-09-01T00:00:00Z
date_updated: 2024-11-06T11:55:33Z
day: '01'
doi: 10.1007/978-3-540-30140-0_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30140-0_2
intvolume: ' 3221'
language:
- iso: eng
month: '09'
oa_version: None
page: '3'
publication: 2th Annual European Symposium on Algorithms
publication_identifier:
eissn:
- 1611-3349
isbn:
- ' 3540230254'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Algorithmic aspects of web search engines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3221
year: '2004'
...
---
OA_type: closed access
_id: '4578'
abstract:
- lang: eng
text: 'BLAST is an automatic verification tool for checking temporal safety properties
of C programs. Blast is based on lazy predicate abstraction driven by interpolation-based
predicate discovery. In this paper, we present the Blast specification language.
The language specifies program properties at two levels of precision. At the lower
level, monitor automata are used to specify temporal safety properties of program
executions (traces). At the higher level, relational reachability queries over
program locations are used to combine lower-level trace properties. The two-level
specification language can be used to break down a verification task into several
independent calls of the model-checking engine. In this way, each call to the
model checker may have to analyze only part of the program, or part of the specification,
and may thus succeed in a reduction of the number of predicates needed for the
analysis. In addition, the two-level specification language provides a means for
structuring and maintaining specifications. '
acknowledgement: This research was supported in part by the NSF grants CCR-0085949,
CCR-0234690, and ITR-0326577.
alternative_title:
- Lecture Notes in Computer Science
article_processing_charge: No
author:
- first_name: Dirk
full_name: Beyer, Dirk
last_name: Beyer
- first_name: Adam
full_name: Chlipala, Adam
last_name: Chlipala
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ranjit
full_name: Jhala, Ranjit
last_name: Jhala
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. The BLAST query language
for software verification. In: Vol 3148. Springer; 2004:2-18. doi:10.1007/978-3-540-27864-1_2'
apa: 'Beyer, D., Chlipala, A., Henzinger, T. A., Jhala, R., & Majumdar, R. (2004).
The BLAST query language for software verification (Vol. 3148, pp. 2–18). Presented
at the SAS: Static Analysis Symposium, Verona, Italy: Springer. https://doi.org/10.1007/978-3-540-27864-1_2'
chicago: Beyer, Dirk, Adam Chlipala, Thomas A Henzinger, Ranjit Jhala, and Ritankar
Majumdar. “The BLAST Query Language for Software Verification,” 3148:2–18. Springer,
2004. https://doi.org/10.1007/978-3-540-27864-1_2.
ieee: 'D. Beyer, A. Chlipala, T. A. Henzinger, R. Jhala, and R. Majumdar, “The BLAST
query language for software verification,” presented at the SAS: Static Analysis
Symposium, Verona, Italy, 2004, vol. 3148, pp. 2–18.'
ista: 'Beyer D, Chlipala A, Henzinger TA, Jhala R, Majumdar R. 2004. The BLAST query
language for software verification. SAS: Static Analysis Symposium, Lecture Notes
in Computer Science, vol. 3148, 2–18.'
mla: Beyer, Dirk, et al. The BLAST Query Language for Software Verification.
Vol. 3148, Springer, 2004, pp. 2–18, doi:10.1007/978-3-540-27864-1_2.
short: D. Beyer, A. Chlipala, T.A. Henzinger, R. Jhala, R. Majumdar, in:, Springer,
2004, pp. 2–18.
conference:
end_date: 2004-08-28
location: Verona, Italy
name: 'SAS: Static Analysis Symposium'
start_date: 2004-08-26
date_created: 2018-12-11T12:09:34Z
date_published: 2004-08-17T00:00:00Z
date_updated: 2026-05-29T08:31:41Z
day: '17'
doi: 10.1007/978-3-540-27864-1_2
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-27864-1_2
intvolume: ' 3148'
language:
- iso: eng
month: '08'
oa_version: None
page: 2 - 18
publication_identifier:
eisbn:
- '9783540278641'
isbn:
- '9783540227915'
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '130'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The BLAST query language for software verification
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 3148
year: '2004'
...
---
_id: '18331'
abstract:
- lang: eng
text: "Recently, a 3D face recognition approach based on geometric invariant signatures,
has been proposed. The key idea is a representation of the facial surface, invariant
to isometric deformations, such as those resulting from facial expressions. One
important stage in the construction of the geometric invariants involves in measuring
geodesic distances on triangulated surfaces, which is carried out by the fast
marching on triangulated domains algorithm.\r\n\r\nProposed here is a method that
uses only the metric tensor of the surface for geodesic distance computation.
That is, the explicit integration of the surface in 3D from its gradients is not
needed for the recognition task. It enables the use of simple and cost-efficient
3D acquisition techniques such as photometric stereo. Avoiding the explicit surface
reconstruction stage saves computational time and reduces numerical errors."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Alon
full_name: Spira, Alon
last_name: Spira
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Spira A, Kimmel R. Face recognition from facial
surface metric. In: 8th European Conference on Computer Vision. Vol 3022.
Springer Nature; 2004:225–237. doi:10.1007/978-3-540-24671-8_18'
apa: 'Bronstein, A. M., Bronstein, M. M., Spira, A., & Kimmel, R. (2004). Face
recognition from facial surface metric. In 8th European Conference on Computer
Vision (Vol. 3022, pp. 225–237). Prageu, Czech Republic: Springer Nature.
https://doi.org/10.1007/978-3-540-24671-8_18'
chicago: Bronstein, Alex M., Michael M. Bronstein, Alon Spira, and Ron Kimmel. “Face
Recognition from Facial Surface Metric.” In 8th European Conference on Computer
Vision, 3022:225–237. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-24671-8_18.
ieee: A. M. Bronstein, M. M. Bronstein, A. Spira, and R. Kimmel, “Face recognition
from facial surface metric,” in 8th European Conference on Computer Vision,
Prageu, Czech Republic, 2004, vol. 3022, pp. 225–237.
ista: 'Bronstein AM, Bronstein MM, Spira A, Kimmel R. 2004. Face recognition from
facial surface metric. 8th European Conference on Computer Vision. ECCV: European
Conference on Computer Vision, LNCS, vol. 3022, 225–237.'
mla: Bronstein, Alex M., et al. “Face Recognition from Facial Surface Metric.” 8th
European Conference on Computer Vision, vol. 3022, Springer Nature, 2004,
pp. 225–237, doi:10.1007/978-3-540-24671-8_18.
short: A.M. Bronstein, M.M. Bronstein, A. Spira, R. Kimmel, in:, 8th European Conference
on Computer Vision, Springer Nature, 2004, pp. 225–237.
conference:
end_date: 2004-05-14
location: Prageu, Czech Republic
name: 'ECCV: European Conference on Computer Vision'
start_date: 2004-05-11
date_created: 2024-10-15T11:20:54Z
date_published: 2004-01-01T00:00:00Z
date_updated: 2024-12-02T14:51:08Z
doi: 10.1007/978-3-540-24671-8_18
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-24671-8_18
intvolume: ' 3022'
language:
- iso: eng
month: '01'
oa_version: None
page: 225–237
publication: 8th European Conference on Computer Vision
publication_identifier:
eissn:
- 1611-3349
- '9783540246718'
isbn:
- '9783540219835'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Face recognition from facial surface metric
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3022
year: '2004'
...
---
_id: '18332'
abstract:
- lang: eng
text: Presented here is a generalization of the modified relative Newton method,
recently proposed in [1] for quasi-maximum likelihood blind source separation.
Special structure of the Hessian matrix allows to perform block-coordinate Newton
descent, which significantly reduces the algorithm computational complexity and
boosts its performance. Simulations based on artificial and real data show that
the separation quality using the proposed algorithm outperforms other accepted
blind source separation methods.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M. Blind source separation using the
block-coordinate relative Newton method. In: 5th International Conference on
Independent Component Analysis and Blind Signal Separation. Vol 3195. Springer
Nature; 2004:406–413. doi:10.1007/978-3-540-30110-3_52'
apa: 'Bronstein, A. M., Bronstein, M. M., & Zibulevsky, M. (2004). Blind source
separation using the block-coordinate relative Newton method. In 5th International
Conference on Independent Component Analysis and Blind Signal Separation (Vol.
3195, pp. 406–413). Granada, Spain: Springer Nature. https://doi.org/10.1007/978-3-540-30110-3_52'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “Blind
Source Separation Using the Block-Coordinate Relative Newton Method.” In 5th
International Conference on Independent Component Analysis and Blind Signal Separation,
3195:406–413. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30110-3_52.
ieee: A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “Blind source separation
using the block-coordinate relative Newton method,” in 5th International Conference
on Independent Component Analysis and Blind Signal Separation, Granada, Spain,
2004, vol. 3195, pp. 406–413.
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M. 2004. Blind source separation using
the block-coordinate relative Newton method. 5th International Conference on Independent
Component Analysis and Blind Signal Separation. ICA: Independent Component Analysis
and Blind Signal Separation, LNCS, vol. 3195, 406–413.'
mla: Bronstein, Alex M., et al. “Blind Source Separation Using the Block-Coordinate
Relative Newton Method.” 5th International Conference on Independent Component
Analysis and Blind Signal Separation, vol. 3195, Springer Nature, 2004, pp.
406–413, doi:10.1007/978-3-540-30110-3_52.
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 5th International Conference
on Independent Component Analysis and Blind Signal Separation, Springer Nature,
2004, pp. 406–413.
conference:
end_date: 2004-09-24
location: Granada, Spain
name: 'ICA: Independent Component Analysis and Blind Signal Separation'
start_date: 2004-09-22
date_created: 2024-10-15T11:20:54Z
date_published: 2004-10-27T00:00:00Z
date_updated: 2024-12-02T14:30:47Z
day: '27'
doi: 10.1007/978-3-540-30110-3_52
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30110-3_52
intvolume: ' 3195'
language:
- iso: eng
month: '10'
oa_version: None
page: 406–413
publication: 5th International Conference on Independent Component Analysis and Blind
Signal Separation
publication_identifier:
eisbn:
- '9783540301103'
eissn:
- 1611-3349
isbn:
- '9783540230564'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blind source separation using the block-coordinate relative Newton method
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3195
year: '2004'
...
---
_id: '18333'
abstract:
- lang: eng
text: The relative Newton algorithm, previously proposed for quasi maximum likelihood
blind source separation and blind deconvolution of one-dimensional signals is
generalized for blind deconvolution of images. Smooth approximation of the absolute
value is used in modelling the log probability density function, which is suitable
for sparse sources. We propose a method of sparsification, which allows blind
deconvolution of sources with arbitrary distribution, and show how to find optimal
sparsifying transformations by training.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
- first_name: Yehoshua Y.
full_name: Zeevi, Yehoshua Y.
last_name: Zeevi
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. Optimal sparse representations
for blind deconvolution of images. In: 5th International Conference on Independent
Component Analysis and Blind Signal Separation. Vol 3195. Springer Nature;
2004:500-507. doi:10.1007/978-3-540-30110-3_64'
apa: 'Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., & Zeevi, Y. Y. (2004).
Optimal sparse representations for blind deconvolution of images. In 5th International
Conference on Independent Component Analysis and Blind Signal Separation (Vol.
3195, pp. 500–507). Granada, Spain: Springer Nature. https://doi.org/10.1007/978-3-540-30110-3_64'
chicago: Bronstein, Alex M., Michael M. Bronstein, Michael Zibulevsky, and Yehoshua
Y. Zeevi. “Optimal Sparse Representations for Blind Deconvolution of Images.”
In 5th International Conference on Independent Component Analysis and Blind
Signal Separation, 3195:500–507. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30110-3_64.
ieee: A. M. Bronstein, M. M. Bronstein, M. Zibulevsky, and Y. Y. Zeevi, “Optimal
sparse representations for blind deconvolution of images,” in 5th International
Conference on Independent Component Analysis and Blind Signal Separation,
Granada, Spain, 2004, vol. 3195, pp. 500–507.
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. 2004. Optimal sparse
representations for blind deconvolution of images. 5th International Conference
on Independent Component Analysis and Blind Signal Separation. ICA: Independent
Component Analysis and Blind Signal Separation, LNCS, vol. 3195, 500–507.'
mla: Bronstein, Alex M., et al. “Optimal Sparse Representations for Blind Deconvolution
of Images.” 5th International Conference on Independent Component Analysis
and Blind Signal Separation, vol. 3195, Springer Nature, 2004, pp. 500–07,
doi:10.1007/978-3-540-30110-3_64.
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, Y.Y. Zeevi, in:, 5th International
Conference on Independent Component Analysis and Blind Signal Separation, Springer
Nature, 2004, pp. 500–507.
conference:
end_date: 2004-09-24
location: Granada, Spain
name: 'ICA: Independent Component Analysis and Blind Signal Separation'
start_date: 2004-09-22
date_created: 2024-10-15T11:20:54Z
date_published: 2004-10-27T00:00:00Z
date_updated: 2024-11-19T14:12:31Z
day: '27'
doi: 10.1007/978-3-540-30110-3_64
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30110-3_64
intvolume: ' 3195'
language:
- iso: eng
month: '10'
oa_version: None
page: 500-507
publication: 5th International Conference on Independent Component Analysis and Blind
Signal Separation
publication_identifier:
eisbn:
- '9783540301103'
eissn:
- 1611-3349
isbn:
- '9783540230564'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal sparse representations for blind deconvolution of images
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3195
year: '2004'
...
---
_id: '18334'
abstract:
- lang: eng
text: We propose a relative optimization framework for quasi maximum likelihood
blind deconvolution and the relative Newton method as its particular instance.
Special Hessian structure allows its fast approximate construction and inversion
with complexity comparable to that of gradient methods. The use of rational IIR
restoration kernels provides a richer family of filters than the traditionally
used FIR kernels. Smoothed absolute value and the smoothed deadzone functions
allow accurate and robust deconvolution of super- and sub-Gaussian sources, respectively.
Simulation results demonstrate the efficiency of the proposed methods.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M. Blind deconvolution using the relative
Newton method. In: 5th International Conference on Independent Component Analysis
and Blind Signal Separation. Vol 3195. Berlin, Heidelberg: Springer Nature;
2004:554–561. doi:10.1007/978-3-540-30110-3_71'
apa: 'Bronstein, A. M., Bronstein, M. M., & Zibulevsky, M. (2004). Blind deconvolution
using the relative Newton method. In 5th International Conference on Independent
Component Analysis and Blind Signal Separation (Vol. 3195, pp. 554–561). Berlin,
Heidelberg: Springer Nature. https://doi.org/10.1007/978-3-540-30110-3_71'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, and Michael Zibulevsky. “Blind
Deconvolution Using the Relative Newton Method.” In 5th International Conference
on Independent Component Analysis and Blind Signal Separation, 3195:554–561.
Berlin, Heidelberg: Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30110-3_71.'
ieee: A. M. Bronstein, M. M. Bronstein, and M. Zibulevsky, “Blind deconvolution
using the relative Newton method,” in 5th International Conference on Independent
Component Analysis and Blind Signal Separation, Granada, Spain, 2004, vol.
3195, pp. 554–561.
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M. 2004. Blind deconvolution using
the relative Newton method. 5th International Conference on Independent Component
Analysis and Blind Signal Separation. ICA: Independent Component Analysis and
Blind Signal Separation, LNCS, vol. 3195, 554–561.'
mla: Bronstein, Alex M., et al. “Blind Deconvolution Using the Relative Newton Method.”
5th International Conference on Independent Component Analysis and Blind Signal
Separation, vol. 3195, Springer Nature, 2004, pp. 554–561, doi:10.1007/978-3-540-30110-3_71.
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, in:, 5th International Conference
on Independent Component Analysis and Blind Signal Separation, Springer Nature,
Berlin, Heidelberg, 2004, pp. 554–561.
conference:
end_date: 2004-09-24
location: Granada, Spain
name: 'ICA: Independent Component Analysis and Blind Signal Separation'
start_date: 2004-09-22
date_created: 2024-10-15T11:20:54Z
date_published: 2004-10-24T00:00:00Z
date_updated: 2024-12-02T14:15:23Z
day: '24'
doi: 10.1007/978-3-540-30110-3_71
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30110-3_71
intvolume: ' 3195'
language:
- iso: eng
month: '10'
oa_version: None
page: 554–561
place: Berlin, Heidelberg
publication: 5th International Conference on Independent Component Analysis and Blind
Signal Separation
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783540230564'
- '9783540301103'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Blind deconvolution using the relative Newton method
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 3195
year: '2004'
...
---
_id: '18335'
abstract:
- lang: eng
text: Blind deconvolution is considered as a problem of quasi maximum likelihood
(QML) estimation of the restoration kernel. Simple closed-form expressions for
the asymptotic estimation error are derived. The asymptotic performance bounds
coincide with the Cramér-Rao bounds, when the true ML estimator is used. Conditions
for asymptotic stability of the QML estimator are derived. Special cases when
the estimator is super-efficient are discussed.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Michael
full_name: Zibulevsky, Michael
last_name: Zibulevsky
- first_name: Yehoshua Y.
full_name: Zeevi, Yehoshua Y.
last_name: Zeevi
citation:
ama: 'Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. QML blind deconvolution:
Asymptotic analysis. In: Proceedings of the 5th International Conference on
Independent Component Analysis and Blind Signal Separation. Vol 3195. Springer
Nature; 2004:677–684. doi:10.1007/978-3-540-30110-3_86'
apa: 'Bronstein, A. M., Bronstein, M. M., Zibulevsky, M., & Zeevi, Y. Y. (2004).
QML blind deconvolution: Asymptotic analysis. In Proceedings of the 5th International
Conference on Independent Component Analysis and Blind Signal Separation (Vol.
3195, pp. 677–684). Granada, Spain: Springer Nature. https://doi.org/10.1007/978-3-540-30110-3_86'
chicago: 'Bronstein, Alex M., Michael M. Bronstein, Michael Zibulevsky, and Yehoshua
Y. Zeevi. “QML Blind Deconvolution: Asymptotic Analysis.” In Proceedings of
the 5th International Conference on Independent Component Analysis and Blind Signal
Separation, 3195:677–684. Springer Nature, 2004. https://doi.org/10.1007/978-3-540-30110-3_86.'
ieee: 'A. M. Bronstein, M. M. Bronstein, M. Zibulevsky, and Y. Y. Zeevi, “QML blind
deconvolution: Asymptotic analysis,” in Proceedings of the 5th International
Conference on Independent Component Analysis and Blind Signal Separation,
Granada, Spain, 2004, vol. 3195, pp. 677–684.'
ista: 'Bronstein AM, Bronstein MM, Zibulevsky M, Zeevi YY. 2004. QML blind deconvolution:
Asymptotic analysis. Proceedings of the 5th International Conference on Independent
Component Analysis and Blind Signal Separation. ICA: Independent Component Analysis
and Blind Signal Separation , LNCS, vol. 3195, 677–684.'
mla: 'Bronstein, Alex M., et al. “QML Blind Deconvolution: Asymptotic Analysis.”
Proceedings of the 5th International Conference on Independent Component Analysis
and Blind Signal Separation, vol. 3195, Springer Nature, 2004, pp. 677–684,
doi:10.1007/978-3-540-30110-3_86.'
short: A.M. Bronstein, M.M. Bronstein, M. Zibulevsky, Y.Y. Zeevi, in:, Proceedings
of the 5th International Conference on Independent Component Analysis and Blind
Signal Separation, Springer Nature, 2004, pp. 677–684.
conference:
end_date: 2004-09-24
location: Granada, Spain
name: 'ICA: Independent Component Analysis and Blind Signal Separation '
start_date: 2004-09-22
date_created: 2024-10-15T11:20:54Z
date_published: 2004-10-27T00:00:00Z
date_updated: 2024-11-19T08:28:11Z
day: '27'
doi: 10.1007/978-3-540-30110-3_86
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30110-3_86
intvolume: ' 3195'
language:
- iso: eng
month: '10'
oa_version: None
page: 677–684
publication: Proceedings of the 5th International Conference on Independent Component
Analysis and Blind Signal Separation
publication_identifier:
isbn:
- '9783540230564'
- '9783540301103'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'QML blind deconvolution: Asymptotic analysis'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3195
year: '2004'
...
---
OA_type: closed access
_id: '3894'
abstract:
- lang: eng
text: We study infinite stochastic games played by n-players on a finite graph with
goals given by sets of infinite traces. The games are stochastic (each player
simultaneously and independently chooses an action at each round, and the next
state is determined by a probability distribution depending on the current state
and the chosen actions), infinite (the game continues for an infinite number of
rounds), nonzero sum (the players' goals are not necessarily conflicting), and
undiscounted. We show that if each player has a reachability objective, that is,
if the goal for each player i is to visit some subset R-i of the states, then
there exists an epsilon-Nash equilibrium in memoryless strategies, for every epsilon
> 0. However, exact Nash equilibria need not exist. We study the complexity
of finding such Nash equilibria, and show that the payoff of some epsilon-Nash
equilibrium in memoryless strategies can be epsilon-approximated in NP. We study
the important subclass of n-player turn-based probabilistic games, where at each
state at most one player has a nontrivial choice of moves. For turn-based probabilistic
games, we show the existence of epsilon-Nash equilibria in pure strategies for
games where the objective of player i is a Borel set B-i of infinite traces. However,
exact Nash equilibria may not exist. For the special case of omega-regular objectives,
we show exact Nash equilibria exist, and can be computed in NP when the omega-regular
objectives are expressed as parity objectives.
acknowledgement: This research was supported in part by the AFOSR MURI grant F49620-00-1-0327,
ONR grant N00014-02-1-0671, NSF grants CCR-9988172 and CCR-0225610
alternative_title:
- 'LNCS '
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Marcin
full_name: Jurdziński, Marcin
last_name: Jurdziński
citation:
ama: 'Chatterjee K, Majumdar R, Jurdziński M. On Nash equilibria in stochastic games.
In: 18th International Workshop, Computer Science Logic 2004, 13th Annual Conference
of the EACSL. Vol 3210. Springer Nature; 2004:26-40. doi:10.1007/978-3-540-30124-0_6'
apa: 'Chatterjee, K., Majumdar, R., & Jurdziński, M. (2004). On Nash equilibria
in stochastic games. In 18th International Workshop, Computer Science Logic
2004, 13th Annual Conference of the EACSL (Vol. 3210, pp. 26–40). Karpacz,
Poland: Springer Nature. https://doi.org/10.1007/978-3-540-30124-0_6'
chicago: Chatterjee, Krishnendu, Ritankar Majumdar, and Marcin Jurdziński. “On Nash
Equilibria in Stochastic Games.” In 18th International Workshop, Computer Science
Logic 2004, 13th Annual Conference of the EACSL, 3210:26–40. Springer Nature,
2004. https://doi.org/10.1007/978-3-540-30124-0_6.
ieee: K. Chatterjee, R. Majumdar, and M. Jurdziński, “On Nash equilibria in stochastic
games,” in 18th International Workshop, Computer Science Logic 2004, 13th Annual
Conference of the EACSL, Karpacz, Poland, 2004, vol. 3210, pp. 26–40.
ista: 'Chatterjee K, Majumdar R, Jurdziński M. 2004. On Nash equilibria in stochastic
games. 18th International Workshop, Computer Science Logic 2004, 13th Annual Conference
of the EACSL. CSL: Computer Science Logic, LNCS , vol. 3210, 26–40.'
mla: Chatterjee, Krishnendu, et al. “On Nash Equilibria in Stochastic Games.” 18th
International Workshop, Computer Science Logic 2004, 13th Annual Conference of
the EACSL, vol. 3210, Springer Nature, 2004, pp. 26–40, doi:10.1007/978-3-540-30124-0_6.
short: K. Chatterjee, R. Majumdar, M. Jurdziński, in:, 18th International Workshop,
Computer Science Logic 2004, 13th Annual Conference of the EACSL, Springer Nature,
2004, pp. 26–40.
conference:
end_date: 2004-09-24
location: Karpacz, Poland
name: 'CSL: Computer Science Logic'
start_date: 2004-09-20
corr_author: '1'
date_created: 2018-12-11T12:05:45Z
date_published: 2004-09-09T00:00:00Z
date_updated: 2026-09-11T09:11:09Z
day: '09'
doi: 10.1007/978-3-540-30124-0_6
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-30124-0_6
intvolume: ' 3210'
language:
- iso: eng
month: '09'
oa_version: None
page: 26 - 40
publication: 18th International Workshop, Computer Science Logic 2004, 13th Annual
Conference of the EACSL
publication_identifier:
eisbn:
- '9783540301240'
eissn:
- 1611-3349
isbn:
- '9783540230243'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
publist_id: '2264'
status: public
title: On Nash equilibria in stochastic games
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 3210
year: '2004'
...
---
OA_type: closed access
_id: '18324'
abstract:
- lang: eng
text: We present a novel 3D face recognition approach based on geometric invariants
introduced by Elad and Kimmel. The key idea of the proposed algorithm is a representation
of the facial surface, invariant to isometric deformations, such as those resulting
from different expressions and postures of the face. The obtained geometric invariants
allow mapping 2D facial texture images into special images that incorporate the
3D geometry of the face. These signature images are then decomposed into their
principal components. The result is an efficient and accurate face recognition
algorithm that is robust to facial expressions. We demonstrate the results of
our method and compare it to existing 2D and 3D face recognition algorithms.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Michael M.
full_name: Bronstein, Michael M.
last_name: Bronstein
- first_name: Ron
full_name: Kimmel, Ron
last_name: Kimmel
citation:
ama: 'Bronstein AM, Bronstein MM, Kimmel R. Expression-invariant 3D face recognition.
In: 4th International Conference on Audio- and Video-Based Biometric Person
Authentication. Vol 2688. Springer Nature; 2003:62-70. doi:10.1007/3-540-44887-x_8'
apa: 'Bronstein, A. M., Bronstein, M. M., & Kimmel, R. (2003). Expression-invariant
3D face recognition. In 4th International Conference on Audio- and Video-Based
Biometric Person Authentication (Vol. 2688, pp. 62–70). Guildford, United
Kingdom: Springer Nature. https://doi.org/10.1007/3-540-44887-x_8'
chicago: Bronstein, Alex M., Michael M. Bronstein, and Ron Kimmel. “Expression-Invariant
3D Face Recognition.” In 4th International Conference on Audio- and Video-Based
Biometric Person Authentication, 2688:62–70. Springer Nature, 2003. https://doi.org/10.1007/3-540-44887-x_8.
ieee: A. M. Bronstein, M. M. Bronstein, and R. Kimmel, “Expression-invariant 3D
face recognition,” in 4th International Conference on Audio- and Video-Based
Biometric Person Authentication, Guildford, United Kingdom, 2003, vol. 2688,
pp. 62–70.
ista: 'Bronstein AM, Bronstein MM, Kimmel R. 2003. Expression-invariant 3D face
recognition. 4th International Conference on Audio- and Video-Based Biometric
Person Authentication. AVBPA: Conference on Audio- and Video-Based Biometric Person
Authentication, LNCS, vol. 2688, 62–70.'
mla: Bronstein, Alex M., et al. “Expression-Invariant 3D Face Recognition.” 4th
International Conference on Audio- and Video-Based Biometric Person Authentication,
vol. 2688, Springer Nature, 2003, pp. 62–70, doi:10.1007/3-540-44887-x_8.
short: A.M. Bronstein, M.M. Bronstein, R. Kimmel, in:, 4th International Conference
on Audio- and Video-Based Biometric Person Authentication, Springer Nature, 2003,
pp. 62–70.
conference:
end_date: 2003-06-11
location: Guildford, United Kingdom
name: 'AVBPA: Conference on Audio- and Video-Based Biometric Person Authentication'
start_date: 2003-06-09
date_created: 2024-10-15T11:20:53Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2024-10-22T07:20:09Z
day: '01'
doi: 10.1007/3-540-44887-x_8
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-44887-x_8
intvolume: ' 2688'
language:
- iso: eng
month: '01'
oa_version: None
page: 62-70
publication: 4th International Conference on Audio- and Video-Based Biometric Person
Authentication
publication_identifier:
eisbn:
- '9783540448877'
eissn:
- 1611-3349
isbn:
- '9783540403029'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Expression-invariant 3D face recognition
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2688
year: '2003'
...
---
_id: '11802'
abstract:
- lang: eng
text: In this paper we survey algorithmic aspects of Web information retrieval.
As an example, we discuss ranking of search engine results using connectivity
analysis.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. Web information retrieval - an algorithmic perspective. In: 8th
Annual European Symposium on Algorithms. Vol 1879. Springer Nature; 2000:1–8.
doi:10.1007/3-540-45253-2_1'
apa: 'Henzinger, M. (2000). Web information retrieval - an algorithmic perspective.
In 8th Annual European Symposium on Algorithms (Vol. 1879, pp. 1–8). Saarbrücken,
Germany: Springer Nature. https://doi.org/10.1007/3-540-45253-2_1'
chicago: Henzinger, Monika. “Web Information Retrieval - an Algorithmic Perspective.”
In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature,
2000. https://doi.org/10.1007/3-540-45253-2_1.
ieee: M. Henzinger, “Web information retrieval - an algorithmic perspective,” in
8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000,
vol. 1879, pp. 1–8.
ista: 'Henzinger M. 2000. Web information retrieval - an algorithmic perspective.
8th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms,
LNCS, vol. 1879, 1–8.'
mla: Henzinger, Monika. “Web Information Retrieval - an Algorithmic Perspective.”
8th Annual European Symposium on Algorithms, vol. 1879, Springer Nature,
2000, pp. 1–8, doi:10.1007/3-540-45253-2_1.
short: M. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer
Nature, 2000, pp. 1–8.
conference:
end_date: 2000-09-08
location: Saarbrücken, Germany
name: 'ESA: European Symposium on Algorithms'
start_date: 2000-09-05
date_created: 2022-08-11T13:25:07Z
date_published: 2000-09-01T00:00:00Z
date_updated: 2024-11-06T11:55:46Z
day: '01'
doi: 10.1007/3-540-45253-2_1
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-45253-2_1
intvolume: ' 1879'
language:
- iso: eng
month: '09'
oa_version: None
page: 1–8
publication: 8th Annual European Symposium on Algorithms
publication_identifier:
eisbn:
- '9783540452539'
eissn:
- 1611-3349
isbn:
- '9783540410041'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Web information retrieval - an algorithmic perspective
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1879
year: '2000'
...
---
_id: '11803'
abstract:
- lang: eng
text: We present the first fully dynamic algorithm for maintaining a minimum spanning
tree in time o(√n) per operation. To be precise, the algorithm uses O(n 1/3 log
n) amortized time per update operation. The algorithm is fairly simple and deterministic.
An immediate consequence is the first fully dynamic deterministic algorithm for
maintaining connectivity and, bipartiteness in amortized time O(n 1/3 log n) per
update, with O(1) worst case time per query.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Valerie
full_name: King, Valerie
last_name: King
citation:
ama: 'Henzinger M, King V. Maintaining minimum spanning trees in dynamic graphs.
In: 24th International Colloquium on Automata, Languages and Programming.
Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214'
apa: 'Henzinger, M., & King, V. (1997). Maintaining minimum spanning trees in
dynamic graphs. In 24th International Colloquium on Automata, Languages and
Programming (Vol. 1256, pp. 594–604). Bologna, Italy: Springer Nature. https://doi.org/10.1007/3-540-63165-8_214'
chicago: Henzinger, Monika, and Valerie King. “Maintaining Minimum Spanning Trees
in Dynamic Graphs.” In 24th International Colloquium on Automata, Languages
and Programming, 1256:594–604. Springer Nature, 1997. https://doi.org/10.1007/3-540-63165-8_214.
ieee: M. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,”
in 24th International Colloquium on Automata, Languages and Programming,
Bologna, Italy, 1997, vol. 1256, pp. 594–604.
ista: 'Henzinger M, King V. 1997. Maintaining minimum spanning trees in dynamic
graphs. 24th International Colloquium on Automata, Languages and Programming.
ICALP: International Colloquium on Automata, Languages, and Programming, LNCS,
vol. 1256, 594–604.'
mla: Henzinger, Monika, and Valerie King. “Maintaining Minimum Spanning Trees in
Dynamic Graphs.” 24th International Colloquium on Automata, Languages and Programming,
vol. 1256, Springer Nature, 1997, pp. 594–604, doi:10.1007/3-540-63165-8_214.
short: M. Henzinger, V. King, in:, 24th International Colloquium on Automata, Languages
and Programming, Springer Nature, 1997, pp. 594–604.
conference:
end_date: 1997-07-11
location: Bologna, Italy
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1997-07-07
date_created: 2022-08-11T13:35:06Z
date_published: 1997-07-01T00:00:00Z
date_updated: 2024-11-06T12:13:35Z
day: '01'
doi: 10.1007/3-540-63165-8_214
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-63165-8_214
intvolume: ' 1256'
language:
- iso: eng
month: '07'
oa_version: None
page: 594–604
publication: 24th International Colloquium on Automata, Languages and Programming
publication_identifier:
eisbn:
- '9783540691945'
eissn:
- 1611-3349
isbn:
- '9783540631651'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Maintaining minimum spanning trees in dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1256
year: '1997'
...
---
_id: '11804'
abstract:
- lang: eng
text: "This paper shows how a general technique, called lock-step search, used in
dynamic graph algorithms, can be used to improve the running time of two problems
arising in program verification and communication protocol design.\r\n(1)We consider
the nonemptiness problem for Streett automata: We are given a directed graph G
= (V, E) with n = ¦V¦ and m = ¦E¦, and a collection of pairs of subsets of vertices,
called Streett pairs,〈L i , U i 〉, i = 1.k. The question is whether G has a cycle
(not necessarily simple) which, for each 1 ≤ i ≤ k, if it contains a vertex from
L i then it also contains a vertex of U i . Let b=Σ i=1..k |L i |+|U i |. The
previously best algorithm takes time O((m + b) min{n, k}). We present an algorithm
that takes time \U0001D442(\U0001D45Amin{\U0001D45A\U0001D459\U0001D45C\U0001D454\U0001D45B,‾‾‾‾‾‾√\U0001D458,\U0001D45B}+\U0001D44F\U0001D45A\U0001D456\U0001D45B{\U0001D459\U0001D45C\U0001D454\U0001D45B,\U0001D458}).\r\n(2)In
communication protocol pruning we are given a directed graph G = (V, E) with l
special vertices. The problem is to efficiently maintain the strongly-connected
components of the special vertices on a restricted set of edge deletions. Let
m i be the number of edges in the strongly connected component of the ith special
vertex. The previously best algorithm repeatedly recomputes the strongly-connected
components which leads to a running time of O(Σ i m 2i). We present an algorithm
with time \U0001D442(\U0001D459√∑\U0001D456\U0001D45A1.5\U0001D456)."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jan Arne
full_name: Telle, Jan Arne
last_name: Telle
citation:
ama: 'Henzinger M, Telle JA. Faster algorithms for the nonemptiness of streett automata
and for communication protocol pruning. In: 5th Scandinavian Workshop on Algorithm
Theory. Vol 1097. Springer Nature; 1996:16–27. doi:10.1007/3-540-61422-2_117'
apa: 'Henzinger, M., & Telle, J. A. (1996). Faster algorithms for the nonemptiness
of streett automata and for communication protocol pruning. In 5th Scandinavian
Workshop on Algorithm Theory (Vol. 1097, pp. 16–27). Reykjavik, Iceland: Springer
Nature. https://doi.org/10.1007/3-540-61422-2_117'
chicago: Henzinger, Monika, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness
of Streett Automata and for Communication Protocol Pruning.” In 5th Scandinavian
Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996. https://doi.org/10.1007/3-540-61422-2_117.
ieee: M. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett
automata and for communication protocol pruning,” in 5th Scandinavian Workshop
on Algorithm Theory, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
ista: 'Henzinger M, Telle JA. 1996. Faster algorithms for the nonemptiness of streett
automata and for communication protocol pruning. 5th Scandinavian Workshop on
Algorithm Theory. SWAT: Scandinavian Workshop on Algorithm Theory, LNCS, vol.
1097, 16–27.'
mla: Henzinger, Monika, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness
of Streett Automata and for Communication Protocol Pruning.” 5th Scandinavian
Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27,
doi:10.1007/3-540-61422-2_117.
short: M. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory,
Springer Nature, 1996, pp. 16–27.
conference:
end_date: 1996-07-05
location: Reykjavik, Iceland
name: 'SWAT: Scandinavian Workshop on Algorithm Theory'
start_date: 1996-07-03
date_created: 2022-08-11T13:42:42Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2024-11-06T12:13:51Z
day: '01'
doi: 10.1007/3-540-61422-2_117
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-61422-2_117
intvolume: ' 1097'
language:
- iso: eng
month: '07'
oa_version: None
page: 16–27
publication: 5th Scandinavian Workshop on Algorithm Theory
publication_identifier:
eisbn:
- '9783540685296'
eissn:
- 1611-3349
isbn:
- '9783540614227'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Faster algorithms for the nonemptiness of streett automata and for communication
protocol pruning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1097
year: '1996'
...
---
_id: '11910'
abstract:
- lang: eng
text: "We state a new sampling lemma and use it to improve the running time of dynamic
graph algorithms.\r\n\r\nFor the dynamic connectivity problem the previously best
randomized algorithm takes expected time O(log3 n) per update, amortized over
Ω(m) updates. Using the new sampling lemma, we improve its running time to O(log2
n). There exists a lower bound in the cell probe model for the time per operation
of Ω(log n/ log log n) for this problem.\r\n\r\nSimilarly improved running times
are achieved for 2-edge connectivity, k-weight minimum spanning tree, and bipartiteness."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Mikkel
full_name: Thorup, Mikkel
last_name: Thorup
citation:
ama: 'Henzinger M, Thorup M. Improved sampling with applications to dynamic graph
algorithms. In: 23rd International Colloquium on Automata, Languages, and Programming.
Vol 1099. Springer Nature; 1996:290-299. doi:10.1007/3-540-61440-0_136'
apa: 'Henzinger, M., & Thorup, M. (1996). Improved sampling with applications
to dynamic graph algorithms. In 23rd International Colloquium on Automata,
Languages, and Programming (Vol. 1099, pp. 290–299). Paderborn, Germany: Springer
Nature. https://doi.org/10.1007/3-540-61440-0_136'
chicago: Henzinger, Monika, and Mikkel Thorup. “Improved Sampling with Applications
to Dynamic Graph Algorithms.” In 23rd International Colloquium on Automata,
Languages, and Programming, 1099:290–99. Springer Nature, 1996. https://doi.org/10.1007/3-540-61440-0_136.
ieee: M. Henzinger and M. Thorup, “Improved sampling with applications to dynamic
graph algorithms,” in 23rd International Colloquium on Automata, Languages,
and Programming, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
ista: 'Henzinger M, Thorup M. 1996. Improved sampling with applications to dynamic
graph algorithms. 23rd International Colloquium on Automata, Languages, and Programming.
ICALP: International Colloquium on Automata, Languages, and Programming, LNCS,
vol. 1099, 290–299.'
mla: Henzinger, Monika, and Mikkel Thorup. “Improved Sampling with Applications
to Dynamic Graph Algorithms.” 23rd International Colloquium on Automata, Languages,
and Programming, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:10.1007/3-540-61440-0_136.
short: M. Henzinger, M. Thorup, in:, 23rd International Colloquium on Automata,
Languages, and Programming, Springer Nature, 1996, pp. 290–299.
conference:
end_date: 1996-07-12
location: Paderborn, Germany
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1996-07-08
date_created: 2022-08-18T06:42:24Z
date_published: 1996-07-01T00:00:00Z
date_updated: 2024-11-06T12:25:11Z
day: '01'
doi: 10.1007/3-540-61440-0_136
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-61440-0_136
intvolume: ' 1099'
language:
- iso: eng
month: '07'
oa_version: None
page: 290-299
publication: 23rd International Colloquium on Automata, Languages, and Programming
publication_identifier:
eisbn:
- '9783540685807'
eissn:
- 1611-3349
isbn:
- '9783540614401'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Improved sampling with applications to dynamic graph algorithms
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 1099
year: '1996'
...
---
_id: '4612'
alternative_title:
- LNCS
article_processing_charge: No
citation:
ama: 'Alur R, Henzinger TA, Sontag ED, eds. Hybrid Systems III: Verification
and Control. Vol 1066. Berlin ; Heidelberg: Springer; 1996. doi:10.1007/BFb0020931'
apa: 'Alur, R., Henzinger, T. A., & Sontag, E. D. (Eds.). (1996). Hybrid
Systems III: Verification and Control (Vol. 1066). Berlin ; Heidelberg: Springer.
https://doi.org/10.1007/BFb0020931'
chicago: 'Alur, Rajeev, Thomas A Henzinger, and Eduardo D Sontag, eds. Hybrid
Systems III: Verification and Control. Vol. 1066. Lecture Notes in Computer
Science. Berlin ; Heidelberg: Springer, 1996. https://doi.org/10.1007/BFb0020931.'
ieee: 'R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., Hybrid Systems III:
Verification and Control, vol. 1066. Berlin ; Heidelberg: Springer, 1996.'
ista: 'Alur R, Henzinger TA, Sontag ED eds. 1996. Hybrid Systems III: Verification
and Control, Berlin ; Heidelberg: Springer, IX, 619p.'
mla: 'Alur, Rajeev, et al., editors. Hybrid Systems III: Verification and Control.
Vol. 1066, Springer, 1996, doi:10.1007/BFb0020931.'
short: 'R. Alur, T.A. Henzinger, E.D. Sontag, eds., Hybrid Systems III: Verification
and Control, Springer, Berlin ; Heidelberg, 1996.'
date_created: 2018-12-11T12:09:45Z
date_published: 1996-01-01T00:00:00Z
date_updated: 2021-12-22T13:57:33Z
day: '01'
doi: 10.1007/BFb0020931
editor:
- first_name: Rajeev
full_name: Alur, Rajeev
last_name: Alur
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Eduardo D
full_name: Sontag, Eduardo D
last_name: Sontag
extern: '1'
fulldoi: https://doi.org/10.1007/BFb0020931
intvolume: ' 1066'
language:
- iso: eng
month: '01'
oa_version: None
page: IX, 619
place: Berlin ; Heidelberg
publication_identifier:
isbn:
- 978-3-540-61155-4
issn:
- 0302-9743
publication_status: published
publisher: Springer
publist_id: '97'
quality_controlled: '1'
series_title: Lecture Notes in Computer Science
status: public
title: 'Hybrid Systems III: Verification and Control'
type: book_editor
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 1066
year: '1996'
...
---
_id: '11805'
abstract:
- lang: eng
text: In this paper, we present sparse certificates for biconnectivity together
with algorithms for updating these certificates. We thus obtain fully-dynamic
algorithms for biconnectivity in graphs that run in O(√n log n log⌈m/n⌉) amortized
time per operation, where m is the number of edges and n is the number of nodes
in the graph. This improves upon the results in [11], in which algorithms were
presented running in O(√m) amortized time, and solves the open problem to find
certificates to speed up biconnectivity, as stated in [2].
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Han
full_name: Poutré, Han
last_name: Poutré
citation:
ama: 'Henzinger M, Poutré H. Certificates and fast algorithms for biconnectivity
in fully-dynamic graphs. In: 3rd Annual European Symposium on Algorithms.
Vol 979. Springer Nature; 1995:171–184. doi:10.1007/3-540-60313-1_142'
apa: 'Henzinger, M., & Poutré, H. (1995). Certificates and fast algorithms for
biconnectivity in fully-dynamic graphs. In 3rd Annual European Symposium on
Algorithms (Vol. 979, pp. 171–184). Corfu, Greece: Springer Nature. https://doi.org/10.1007/3-540-60313-1_142'
chicago: Henzinger, Monika, and Han Poutré. “Certificates and Fast Algorithms for
Biconnectivity in Fully-Dynamic Graphs.” In 3rd Annual European Symposium on
Algorithms, 979:171–184. Springer Nature, 1995. https://doi.org/10.1007/3-540-60313-1_142.
ieee: M. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity
in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms,
Corfu, Greece, 1995, vol. 979, pp. 171–184.
ista: 'Henzinger M, Poutré H. 1995. Certificates and fast algorithms for biconnectivity
in fully-dynamic graphs. 3rd Annual European Symposium on Algorithms. ESA: European
Symposium on Algorithms, LNCS, vol. 979, 171–184.'
mla: Henzinger, Monika, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity
in Fully-Dynamic Graphs.” 3rd Annual European Symposium on Algorithms,
vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.
short: M. Henzinger, H. Poutré, in:, 3rd Annual European Symposium on Algorithms,
Springer Nature, 1995, pp. 171–184.
conference:
end_date: 1995-09-27
location: Corfu, Greece
name: 'ESA: European Symposium on Algorithms'
start_date: 1995-09-25
date_created: 2022-08-11T14:09:52Z
date_published: 1995-09-01T00:00:00Z
date_updated: 2024-11-06T12:16:15Z
day: '01'
doi: 10.1007/3-540-60313-1_142
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-60313-1_142
intvolume: ' 979'
language:
- iso: eng
month: '09'
oa_version: None
page: 171–184
publication: 3rd Annual European Symposium on Algorithms
publication_identifier:
eisbn:
- '9783540449133'
eissn:
- 1611-3349
isbn:
- '9783540603139'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 979
year: '1995'
...
---
_id: '11806'
abstract:
- lang: eng
text: This paper presents insertions-only algorithms for maintaining the exact and
approximate size of the minimum edge cut and the minimum vertex cut of a graph.
The algorithms output the approximate or exact size k in time O(1) or O(log n)
and a cut of size k in time linear in its size. The amortized time per insertion
is O(1/ε 2) for a (2+ε)-approximation, O((log λ)((log n)/ε)2) for a (1+ε)-approximation,
and O(λ log n) for the exact size of the minimum edge cut, where n is the number
of nodes in the graph, λ is the size of the minimum cut and ε>0. The (2+ε)-approximation
algorithm and the exact algorithm are deterministic, the (1+ε)-approximation algorithm
is randomized. The algorithms are optimal in the sense that the time needed for
m insertions matches the time needed by the best static algorithm on a m-edge
graph. We also present a static 2-approximation algorithm for the size κ of the
minimum vertex cut in a graph, which takes time O(n 2 min(√n,κ)). This is a factor
of κ faster than the best algorithm for computing the exact size, which takes
time O(κ 2 n 2 +κ 3 n 1.5). We give an insertionsonly algorithm for maintaining
a (2+ε)-approximation of the minimum vertex cut with amortized insertion time
O(n(logκk)/ε).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: 'Henzinger M. Approximating minimum cuts under insertions. In: 22nd International
Colloquium on Automata, Languages and Programming. Vol 944. Springer Nature;
1995:280–291. doi:10.1007/3-540-60084-1_81'
apa: 'Henzinger, M. (1995). Approximating minimum cuts under insertions. In 22nd
International Colloquium on Automata, Languages and Programming (Vol. 944,
pp. 280–291). Szeged, Hungary: Springer Nature. https://doi.org/10.1007/3-540-60084-1_81'
chicago: Henzinger, Monika. “Approximating Minimum Cuts under Insertions.” In 22nd
International Colloquium on Automata, Languages and Programming, 944:280–291.
Springer Nature, 1995. https://doi.org/10.1007/3-540-60084-1_81.
ieee: M. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International
Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995,
vol. 944, pp. 280–291.
ista: 'Henzinger M. 1995. Approximating minimum cuts under insertions. 22nd International
Colloquium on Automata, Languages and Programming. ICALP: International Colloquium
on Automata, Languages, and Programming, LNCS, vol. 944, 280–291.'
mla: Henzinger, Monika. “Approximating Minimum Cuts under Insertions.” 22nd International
Colloquium on Automata, Languages and Programming, vol. 944, Springer Nature,
1995, pp. 280–291, doi:10.1007/3-540-60084-1_81.
short: M. Henzinger, in:, 22nd International Colloquium on Automata, Languages and
Programming, Springer Nature, 1995, pp. 280–291.
conference:
end_date: 1995-07-14
location: Szeged, Hungary
name: 'ICALP: International Colloquium on Automata, Languages, and Programming'
start_date: 1995-07-10
date_created: 2022-08-11T14:17:33Z
date_published: 1995-07-01T00:00:00Z
date_updated: 2024-11-06T08:23:27Z
day: '01'
doi: 10.1007/3-540-60084-1_81
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-60084-1_81
intvolume: ' 944'
language:
- iso: eng
month: '07'
oa_version: None
page: 280–291
publication: 22nd International Colloquium on Automata, Languages and Programming
publication_identifier:
eisbn:
- '9783540600848'
eissn:
- 1611-3349
isbn:
- '9783540494256'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Approximating minimum cuts under insertions
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 944
year: '1995'
...