---
_id: '11681'
abstract:
- lang: eng
text: We prove lower bounds on the complexity of maintaining fully dynamic k -edge
or k -vertex connectivity in plane graphs and in (k-1) -vertex connected graphs.
We show an amortized lower bound of Ω (log n / {k (log log n} + log b)) per edge
insertion, deletion, or query operation in the cell probe model, where b is the
word size of the machine and n is the number of vertices in G . We also show an
amortized lower bound of Ω (log n /(log log n + log b)) per operation for fully
dynamic planarity testing in embedded graphs. These are the first lower bounds
for fully dynamic connectivity problems.
acknowledgement: .
article_processing_charge: No
article_type: original
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: M. L.
full_name: Fredman, M. L.
last_name: Fredman
citation:
ama: Henzinger MH, Fredman ML. Lower bounds for fully dynamic connectivity problems
in graphs. Algorithmica. 1998;22(3):351-362. doi:10.1007/pl00009228
apa: Henzinger, M. H., & Fredman, M. L. (1998). Lower bounds for fully dynamic
connectivity problems in graphs. Algorithmica. Springer Nature. https://doi.org/10.1007/pl00009228
chicago: Henzinger, Monika H, and M. L. Fredman. “Lower Bounds for Fully Dynamic
Connectivity Problems in Graphs.” Algorithmica. Springer Nature, 1998.
https://doi.org/10.1007/pl00009228.
ieee: M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity
problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp.
351–362, 1998.
ista: Henzinger MH, Fredman ML. 1998. Lower bounds for fully dynamic connectivity
problems in graphs. Algorithmica. 22(3), 351–362.
mla: Henzinger, Monika H., and M. L. Fredman. “Lower Bounds for Fully Dynamic Connectivity
Problems in Graphs.” Algorithmica, vol. 22, no. 3, Springer Nature, 1998,
pp. 351–62, doi:10.1007/pl00009228.
short: M.H. Henzinger, M.L. Fredman, Algorithmica 22 (1998) 351–362.
date_created: 2022-07-28T06:58:36Z
date_published: 1998-11-01T00:00:00Z
date_updated: 2022-09-12T09:03:36Z
day: '01'
doi: 10.1007/pl00009228
extern: '1'
intvolume: ' 22'
issue: '3'
keyword:
- Dynamic planarity testing
- Dynamic connectivity testing
- Lower bounds
- Cell probe model
language:
- iso: eng
month: '11'
oa_version: None
page: 351-362
publication: Algorithmica
publication_identifier:
eissn:
- 1432-0541
issn:
- 0178-4617
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lower bounds for fully dynamic connectivity problems in graphs
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '1998'
...
---
_id: '11682'
abstract:
- lang: eng
text: We consider the parametric minimum spanning tree problem, in which we are
given a graph with edge weights that are linear functions of a parameter /spl
lambda/ and wish to compute the sequence of minimum spanning trees generated as
/spl lambda/ varies. We also consider the kinetic minimum spanning tree problem,
in which /spl lambda/ represents time and the graph is subject in addition to
changes such as edge insertions, deletions, and modifications of the weight functions
as time progresses. We solve both problems in time O(n/sup 2/3/log/sup 4/3/) per
combinatorial change in the tree (or randomized O(n/sup 2/3/log/sup 4/3/ n) per
change). Our time bounds reduce to O(n/sup 1/2/log/sup 3/2/ n) per change (O(n/sup
1/2/log n) randomized) for planar graphs or other minor-closed families of graphs,
and O(n/sup 1/4/log/sup 3/2/ n) per change (O(n/sup 1/4/ log n) randomized) for
planar graphs with weight changes but no insertions or deletions.
article_processing_charge: No
author:
- first_name: P. K.
full_name: Agarwal, P. K.
last_name: Agarwal
- first_name: D.
full_name: EppsteinL. J. Guibas, D.
last_name: EppsteinL. J. Guibas
- 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: 'Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. Parametric and kinetic minimum
spanning trees. In: Proceedings of the 39th Annual Symposium on Foundations
of Computer Science. ; 1998:596-605. doi:10.1109/SFCS.1998.743510'
apa: Agarwal, P. K., EppsteinL. J. Guibas, D., & Henzinger, M. H. (1998). Parametric
and kinetic minimum spanning trees. In Proceedings of the 39th Annual Symposium
on Foundations of Computer Science (pp. 596–605). Palo Alto, CA, United States.
https://doi.org/10.1109/SFCS.1998.743510
chicago: Agarwal, P. K., D. EppsteinL. J. Guibas, and Monika H Henzinger. “Parametric
and Kinetic Minimum Spanning Trees.” In Proceedings of the 39th Annual Symposium
on Foundations of Computer Science, 596–605, 1998. https://doi.org/10.1109/SFCS.1998.743510.
ieee: P. K. Agarwal, D. EppsteinL. J. Guibas, and M. H. Henzinger, “Parametric and
kinetic minimum spanning trees,” in Proceedings of the 39th Annual Symposium
on Foundations of Computer Science, Palo Alto, CA, United States, 1998, pp.
596–605.
ista: Agarwal PK, EppsteinL. J. Guibas D, Henzinger MH. 1998. Parametric and kinetic
minimum spanning trees. Proceedings of the 39th Annual Symposium on Foundations
of Computer Science. Annual IEEE Symposium on Foundations of Computer Science,
596–605.
mla: Agarwal, P. K., et al. “Parametric and Kinetic Minimum Spanning Trees.” Proceedings
of the 39th Annual Symposium on Foundations of Computer Science, 1998, pp.
596–605, doi:10.1109/SFCS.1998.743510.
short: P.K. Agarwal, D. EppsteinL. J. Guibas, M.H. Henzinger, in:, Proceedings of
the 39th Annual Symposium on Foundations of Computer Science, 1998, pp. 596–605.
conference:
end_date: 1998-11-11
location: Palo Alto, CA, United States
name: Annual IEEE Symposium on Foundations of Computer Science
start_date: 1998-11-08
date_created: 2022-07-28T07:21:34Z
date_published: 1998-09-01T00:00:00Z
date_updated: 2023-02-09T11:28:52Z
day: '01'
doi: 10.1109/SFCS.1998.743510
extern: '1'
language:
- iso: eng
month: '09'
oa_version: None
page: 596-605
publication: Proceedings of the 39th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- 0-8186-9172-7
issn:
- 0272-5428
publication_status: published
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parametric and kinetic minimum spanning trees
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1998'
...
---
_id: '1954'
abstract:
- lang: eng
text: "\r\nWe have examined the effects of heat stress on electron transfer in the
thylakoid membrane of an engineered plastid ndh deletion mutant, Δ1, incapable
of performing the Ndh-mediated reduction of the plastoquinone pool in the chloroplast.
Upon heat stress in the dark, the rate of PSII- independent reduction of PSI after
subsequent illumination by far-red light is dramatically enhanced in both Δ1 and
a wild-type control plant (WT). In contrast, in the dark, only the WT shows an
increase in the reduction state of the plastoquinone pool. We conclude that the
heat stress-induced reduction of the intersystem electron transport chain can
be mediated by Ndh- independent pathways in the light but that in the dark the
dominant pathway for reduction of the plastoquinone pool is catalysed by the Ndh
complex. Our results therefore demonstrate a functional role for the Ndh complex
in the dark.\r\n"
acknowledgement: This work was funded by the BBSRC. We would like to thank Professor
Peter Horton (University of Sheffield) for the loan of the ED 800 T unit.
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Paul
full_name: Burrows, Paul
last_name: Burrows
- first_name: Peter
full_name: Nixon, Peter
last_name: Nixon
citation:
ama: Sazanov LA, Burrows P, Nixon P. The chloroplast Ndh complex mediates the dark
reduction of the plastoquinone pool in response to heat stress in tobacco leaves.
FEBS Letters. 1998;429(1):115-118. doi:10.1016/S0014-5793(98)00573-0
apa: Sazanov, L. A., Burrows, P., & Nixon, P. (1998). The chloroplast Ndh complex
mediates the dark reduction of the plastoquinone pool in response to heat stress
in tobacco leaves. FEBS Letters. Elsevier. https://doi.org/10.1016/S0014-5793(98)00573-0
chicago: Sazanov, Leonid A, Paul Burrows, and Peter Nixon. “The Chloroplast Ndh
Complex Mediates the Dark Reduction of the Plastoquinone Pool in Response to Heat
Stress in Tobacco Leaves.” FEBS Letters. Elsevier, 1998. https://doi.org/10.1016/S0014-5793(98)00573-0.
ieee: L. A. Sazanov, P. Burrows, and P. Nixon, “The chloroplast Ndh complex mediates
the dark reduction of the plastoquinone pool in response to heat stress in tobacco
leaves,” FEBS Letters, vol. 429, no. 1. Elsevier, pp. 115–118, 1998.
ista: Sazanov LA, Burrows P, Nixon P. 1998. The chloroplast Ndh complex mediates
the dark reduction of the plastoquinone pool in response to heat stress in tobacco
leaves. FEBS Letters. 429(1), 115–118.
mla: Sazanov, Leonid A., et al. “The Chloroplast Ndh Complex Mediates the Dark Reduction
of the Plastoquinone Pool in Response to Heat Stress in Tobacco Leaves.” FEBS
Letters, vol. 429, no. 1, Elsevier, 1998, pp. 115–18, doi:10.1016/S0014-5793(98)00573-0.
short: L.A. Sazanov, P. Burrows, P. Nixon, FEBS Letters 429 (1998) 115–118.
date_created: 2018-12-11T11:54:54Z
date_published: 1998-06-05T00:00:00Z
date_updated: 2022-09-01T13:12:15Z
day: '05'
doi: 10.1016/S0014-5793(98)00573-0
extern: '1'
external_id:
pmid:
- '9657394 '
intvolume: ' 429'
issue: '1'
language:
- iso: eng
month: '06'
oa_version: None
page: 115 - 118
pmid: 1
publication: FEBS Letters
publication_identifier:
issn:
- 0014-5793
publication_status: published
publisher: Elsevier
publist_id: '5128'
quality_controlled: '1'
status: public
title: The chloroplast Ndh complex mediates the dark reduction of the plastoquinone
pool in response to heat stress in tobacco leaves
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 429
year: '1998'
...
---
_id: '1955'
abstract:
- lang: eng
text: 'The plastid genomes of several plants contain homologues, termed ndh genes,
of genes encoding subunits of the NADH:ubiquinone oxidoreductase or complex I
of mitochondria and eubacteria. The functional significance of the Ndh proteins
in higher plants is uncertain. We show here that tobacco chloroplasts contain
a protein complex of 550 kDa consisting of at least three of the ndh gene products:
NdhI, NdhJ and NdhK. We have constructed mutant tobacco plants with disrupted
ndhC, ndhK and ndhJ plastid genes, indicating that the Ndh complex is dispensible
for plant growth under optimal growth conditions. Chlorophyll fluorescence analysis
shows that in vivo the Ndh complex catalyses the post-illumination reduction of
the plastoquinone pool and in the light optimizes the induction of photosynthesis
under conditions of water stress. We conclude that the Ndh complex catalyses the
reduction of the plastoquinone pool using stromal reductant and so acts as a respiratory
complex. Overall, our data are compatible with the participation of the Ndh complex
in cyclic electron flow around the photosystem I complex in the light and possibly
in a chloroplast respiratory chain in the dark.'
acknowledgement: We thank Professor Süss (Institute of Plant Genetics and Crop Plant
Research, Gatersleben, Germany) for the gift of the anti-FNR antiserum, Professor
Masahiro Sugiura (Nagoya University, Japan) for the gift of plasmid pTB19 and Professor
Peter Horton (University of Sheffield) for the loan of his ED-800T unit. P.B. is
a recipient of a BBSRC studentship and the work was supported by grants from the
BBSRC, The Royal Society (to P.J.N.) and The National Science Foundation (to P.M.).
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Burrows, Paul
last_name: Burrows
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Zóra
full_name: Sváb, Zóra
last_name: Sváb
- first_name: Pàl
full_name: Maliga, Pàl
last_name: Maliga
- first_name: Peter
full_name: Nixon, Peter
last_name: Nixon
citation:
ama: Burrows P, Sazanov LA, Sváb Z, Maliga P, Nixon P. Identification of a functional
respiratory complex in chloroplasts through analysis of tobacco mutants containing
disrupted plastid ndh genes. EMBO Journal. 1998;17(4):868-876. doi:10.1093/emboj/17.4.868
apa: Burrows, P., Sazanov, L. A., Sváb, Z., Maliga, P., & Nixon, P. (1998).
Identification of a functional respiratory complex in chloroplasts through analysis
of tobacco mutants containing disrupted plastid ndh genes. EMBO Journal.
Wiley-Blackwell. https://doi.org/10.1093/emboj/17.4.868
chicago: Burrows, Paul, Leonid A Sazanov, Zóra Sváb, Pàl Maliga, and Peter Nixon.
“Identification of a Functional Respiratory Complex in Chloroplasts through Analysis
of Tobacco Mutants Containing Disrupted Plastid Ndh Genes.” EMBO Journal.
Wiley-Blackwell, 1998. https://doi.org/10.1093/emboj/17.4.868.
ieee: P. Burrows, L. A. Sazanov, Z. Sváb, P. Maliga, and P. Nixon, “Identification
of a functional respiratory complex in chloroplasts through analysis of tobacco
mutants containing disrupted plastid ndh genes,” EMBO Journal, vol. 17,
no. 4. Wiley-Blackwell, pp. 868–876, 1998.
ista: Burrows P, Sazanov LA, Sváb Z, Maliga P, Nixon P. 1998. Identification of
a functional respiratory complex in chloroplasts through analysis of tobacco mutants
containing disrupted plastid ndh genes. EMBO Journal. 17(4), 868–876.
mla: Burrows, Paul, et al. “Identification of a Functional Respiratory Complex in
Chloroplasts through Analysis of Tobacco Mutants Containing Disrupted Plastid
Ndh Genes.” EMBO Journal, vol. 17, no. 4, Wiley-Blackwell, 1998, pp. 868–76,
doi:10.1093/emboj/17.4.868.
short: P. Burrows, L.A. Sazanov, Z. Sváb, P. Maliga, P. Nixon, EMBO Journal 17 (1998)
868–876.
date_created: 2018-12-11T11:54:54Z
date_published: 1998-02-04T00:00:00Z
date_updated: 2022-09-01T13:17:49Z
day: '04'
doi: 10.1093/emboj/17.4.868
extern: '1'
external_id:
pmid:
- '9463365'
intvolume: ' 17'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1170436/
month: '02'
oa: 1
oa_version: None
page: 868 - 876
pmid: 1
publication: EMBO Journal
publication_identifier:
issn:
- 0261-4189
publication_status: published
publisher: Wiley-Blackwell
publist_id: '5129'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Identification of a functional respiratory complex in chloroplasts through
analysis of tobacco mutants containing disrupted plastid ndh genes
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 17
year: '1998'
...
---
_id: '1956'
abstract:
- lang: eng
text: "\r\nThe plastid genomes of several plants contain ndh genes-homologues of
genes encoding subunits of the proton-pumping NADH:ubiquinone oxidoreductase,
or complex I, involved in respiration in mitochondria and eubacteria. From sequence
similarities with these genes, the ndh gene products have been suggested to form
a large protein complex (Ndh complex); however, the structure and function of
this complex remains to be established. Herein we report the isolation of the
Ndh complex from the chloroplasts of the higher plant Pisum sativum. The purification
procedure involved selective solubilization of the thylakoid membrane with dodecyl
maltoside, followed by two anion-exchange chromatography steps and one size-exclusion
chromatography step. The isolated Ndh complex has an apparent total molecular
mass of approximately 550 kDa and according to SDS/PAGE consists of at least 16
subunits including NdhA, NdhI, NdhJ, NdhK, and NdhH, which were identified by
N-terminal sequencing and immunoblotting. The Ndh complex showed an NADH- and
deamino-NADH-specific dehydrogenase activity, characteristic of complex I, when
either ferricyanide or the quinones menadione and duroquinone were used as electron
acceptors. This study describes the isolation of the chloroplast analogue of the
respiratory complex I and provides direct evidence for the function of the plastid
Ndh complex as an NADH:plastoquinone oxidoreductase. Our results are compatible
with a dual role for the Ndh complex in the chloro-respiratory and cyclic photophosphorylation
pathways."
acknowledgement: We gratefully acknowledge Dr. A.Carne (Institute of Cancer Research,
London, U.K.) for help with N-terminal sequencing. We thank Prof. C. J. Leaver (University
of Oxford, U.K.), Prof. K.-H. Süss (Institute of Plant Genetics and Crop Plant Research,
Gatersleben, Germany), and Prof. L. J. Rogers (University of Aberystwyth, U.K.)
for gifts of antiserum against maize mitochondrial cytochrome oxidase subunit 1
and cytochrome bc1 complex, spinach FNR, and spinach ferredoxin, respectively. This
work was supported by grants from The Royal Society and the Biotechnology and Biological
Sciences Research Council.
article_processing_charge: No
article_type: original
author:
- first_name: Leonid A
full_name: Sazanov, Leonid A
id: 338D39FE-F248-11E8-B48F-1D18A9856A87
last_name: Sazanov
orcid: 0000-0002-0977-7989
- first_name: Paul
full_name: Burrows, Paul
last_name: Burrows
- first_name: Peter
full_name: Nixon, Peter
last_name: Nixon
citation:
ama: 'Sazanov LA, Burrows P, Nixon P. The plastid ndh genes code for an NADH-specific
dehydrogenase: Isolation of a complex I analogue from pea thylakoid membranes.
PNAS. 1998;95(3):1319-1324. doi:10.1073/pnas.95.3.1319'
apa: 'Sazanov, L. A., Burrows, P., & Nixon, P. (1998). The plastid ndh genes
code for an NADH-specific dehydrogenase: Isolation of a complex I analogue from
pea thylakoid membranes. PNAS. National Academy of Sciences. https://doi.org/10.1073/pnas.95.3.1319'
chicago: 'Sazanov, Leonid A, Paul Burrows, and Peter Nixon. “The Plastid Ndh Genes
Code for an NADH-Specific Dehydrogenase: Isolation of a Complex I Analogue from
Pea Thylakoid Membranes.” PNAS. National Academy of Sciences, 1998. https://doi.org/10.1073/pnas.95.3.1319.'
ieee: 'L. A. Sazanov, P. Burrows, and P. Nixon, “The plastid ndh genes code for
an NADH-specific dehydrogenase: Isolation of a complex I analogue from pea thylakoid
membranes,” PNAS, vol. 95, no. 3. National Academy of Sciences, pp. 1319–1324,
1998.'
ista: 'Sazanov LA, Burrows P, Nixon P. 1998. The plastid ndh genes code for an NADH-specific
dehydrogenase: Isolation of a complex I analogue from pea thylakoid membranes.
PNAS. 95(3), 1319–1324.'
mla: 'Sazanov, Leonid A., et al. “The Plastid Ndh Genes Code for an NADH-Specific
Dehydrogenase: Isolation of a Complex I Analogue from Pea Thylakoid Membranes.”
PNAS, vol. 95, no. 3, National Academy of Sciences, 1998, pp. 1319–24,
doi:10.1073/pnas.95.3.1319.'
short: L.A. Sazanov, P. Burrows, P. Nixon, PNAS 95 (1998) 1319–1324.
date_created: 2018-12-11T11:54:54Z
date_published: 1998-02-03T00:00:00Z
date_updated: 2022-09-01T13:47:05Z
day: '03'
doi: 10.1073/pnas.95.3.1319
extern: '1'
external_id:
pmid:
- '9448329 '
intvolume: ' 95'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://europepmc.org/article/pmc/18756
month: '02'
oa: 1
oa_version: None
page: 1319 - 1324
pmid: 1
publication: PNAS
publication_identifier:
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
publist_id: '5130'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The plastid ndh genes code for an NADH-specific dehydrogenase: Isolation of
a complex I analogue from pea thylakoid membranes'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 95
year: '1998'
...
---
_id: '4603'
abstract:
- lang: eng
text: Alternating transition systems are a general model for composite systems which
allow the study of collaborative as well as adversarial relationships between
individual system components. Unlike in labeled transition systems, where each
transition corresponds to a possible step of the system (which may involve some
or all components), in alternating transition systems, each transition corresponds
to a possible move in a game between the components. In this paper, we study refinement
relations between alternating transition systems, such as “Does the implementation
refine the set A of specification components without constraining the components
not in A?” In particular, we generalize the definitions of the simulation and
trace containment preorders from labeled transition systems to alternating transition
systems. The generalizations are called alternating simulation and alternating
trace containment. Unlike existing refinement relations, they allow the refinement
of individual components within the context of a composite system description.
We show that, like ordinary simulation, alternating simulation can be checked
in polynomial time using a fixpoint computation algorithm. While ordinary trace
containment is PSPACE-complete, we establish alternating trace containment to
be EXPTIME-complete. Finally, we present logical characterizations for the two
preorders in terms of ATL, a temporal logic capable of referring to games between
system components.
acknowledgement: This work is supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grants CCR-9504469, CCR-9628400,
and CCR-9700061, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341,
by the SRC contract 97-DC-324.041, and by a grant from the Intel Corporation.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
- first_name: Moshe
full_name: Vardi, Moshe
last_name: Vardi
citation:
ama: 'Alur R, Henzinger TA, Kupferman O, Vardi M. Alternating refinement relations.
In: Proceedings of the 9th Interantional Conference on Concurrency Theory.
Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:163-178. doi:10.1007/BFb0055622'
apa: 'Alur, R., Henzinger, T. A., Kupferman, O., & Vardi, M. (1998). Alternating
refinement relations. In Proceedings of the 9th Interantional Conference on
Concurrency Theory (Vol. 1466, pp. 163–178). Nice, France: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055622'
chicago: Alur, Rajeev, Thomas A Henzinger, Orna Kupferman, and Moshe Vardi. “Alternating
Refinement Relations.” In Proceedings of the 9th Interantional Conference on
Concurrency Theory, 1466:163–78. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
1998. https://doi.org/10.1007/BFb0055622.
ieee: R. Alur, T. A. Henzinger, O. Kupferman, and M. Vardi, “Alternating refinement
relations,” in Proceedings of the 9th Interantional Conference on Concurrency
Theory, Nice, France, 1998, vol. 1466, pp. 163–178.
ista: 'Alur R, Henzinger TA, Kupferman O, Vardi M. 1998. Alternating refinement
relations. Proceedings of the 9th Interantional Conference on Concurrency Theory.
CONCUR: Concurrency Theory, LNCS, vol. 1466, 163–178.'
mla: Alur, Rajeev, et al. “Alternating Refinement Relations.” Proceedings of
the 9th Interantional Conference on Concurrency Theory, vol. 1466, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 163–78, doi:10.1007/BFb0055622.
short: R. Alur, T.A. Henzinger, O. Kupferman, M. Vardi, in:, Proceedings of the
9th Interantional Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 1998, pp. 163–178.
conference:
end_date: 1998-09-11
location: Nice, France
name: 'CONCUR: Concurrency Theory'
start_date: 1998-09-08
date_created: 2018-12-11T12:09:42Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T09:50:34Z
day: '01'
doi: 10.1007/BFb0055622
extern: '1'
intvolume: ' 1466'
language:
- iso: eng
month: '01'
oa_version: None
page: 163 - 178
publication: Proceedings of the 9th Interantional Conference on Concurrency Theory
publication_identifier:
isbn:
- 978-3-540-64896-3
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '104'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Alternating refinement relations
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1466
year: '1998'
...
---
_id: '4604'
acknowledgement: This research was supported in part by the ONR YIP award N00014-95-1-0520,
by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the ARO MURI
grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Freddy
full_name: Mang, Freddy
last_name: Mang
- first_name: Shaz
full_name: Qadeer, Shaz
last_name: Qadeer
- first_name: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
- first_name: Serdar
full_name: Tasiran, Serdar
last_name: Tasiran
citation:
ama: 'Alur R, Henzinger TA, Mang F, Qadeer S, Rajamani S, Tasiran S. Mocha: Modularity
in model checking. In: Proceedings of the 10th International Conference on
Computer Aided Verification. Vol 1427. Springer; 1998:521-525. doi:10.1007/BFb0028774'
apa: 'Alur, R., Henzinger, T. A., Mang, F., Qadeer, S., Rajamani, S., & Tasiran,
S. (1998). Mocha: Modularity in model checking. In Proceedings of the 10th
International Conference on Computer Aided Verification (Vol. 1427, pp. 521–525).
Vancouver, Canada: Springer. https://doi.org/10.1007/BFb0028774'
chicago: 'Alur, Rajeev, Thomas A Henzinger, Freddy Mang, Shaz Qadeer, Sriram Rajamani,
and Serdar Tasiran. “Mocha: Modularity in Model Checking.” In Proceedings of
the 10th International Conference on Computer Aided Verification, 1427:521–25.
Springer, 1998. https://doi.org/10.1007/BFb0028774.'
ieee: 'R. Alur, T. A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran,
“Mocha: Modularity in model checking,” in Proceedings of the 10th International
Conference on Computer Aided Verification, Vancouver, Canada, 1998, vol. 1427,
pp. 521–525.'
ista: 'Alur R, Henzinger TA, Mang F, Qadeer S, Rajamani S, Tasiran S. 1998. Mocha:
Modularity in model checking. Proceedings of the 10th International Conference
on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 1427,
521–525.'
mla: 'Alur, Rajeev, et al. “Mocha: Modularity in Model Checking.” Proceedings
of the 10th International Conference on Computer Aided Verification, vol.
1427, Springer, 1998, pp. 521–25, doi:10.1007/BFb0028774.'
short: R. Alur, T.A. Henzinger, F. Mang, S. Qadeer, S. Rajamani, S. Tasiran, in:,
Proceedings of the 10th International Conference on Computer Aided Verification,
Springer, 1998, pp. 521–525.
conference:
end_date: 1998-07-02
location: Vancouver, Canada
name: 'CAV: Computer Aided Verification'
start_date: 1998-06-28
date_created: 2018-12-11T12:09:42Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T09:06:21Z
day: '01'
doi: 10.1007/BFb0028774
extern: '1'
intvolume: ' 1427'
language:
- iso: eng
month: '01'
oa_version: None
page: 521 - 525
publication: Proceedings of the 10th International Conference on Computer Aided Verification
publication_identifier:
isbn:
- '9783540646082'
publication_status: published
publisher: Springer
publist_id: '103'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Mocha: Modularity in model checking'
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1427
year: '1998'
...
---
_id: '4606'
abstract:
- lang: eng
text: "In formal design verification, successful model checking is typically preceded
by a laborious manual process of constructing design abstractions. We present
a methodology for partially—and in some cases, fully—bypassing the abstraction
process. For this purpose, we provide to the designer abstraction operators which,
if used judiciously in the description of a design, structure the corresponding
state space hierarchically. This structure can then be exploited by verification
tools, and makes possible the automatic and exhaustive exploration of state spaces
that would otherwise be out of scope for existing model checkers.\r\nSpecifically,
we present the following contributions:\r\n- \t A temporal abstraction operator
that aggregates transitions and hides intermediate steps. Mathematically, our
abstraction operator is a function that maps a flat transition system into a two-level
hierarchy where each atomic upper-level transition expands into an entire lower-level
transition system. For example, an arithmetic operation may expand into a sequence
of bit operations.\r\n- \t A BDD-based algorithm for the symbolic exploration
of multi-level hierarchies of transition systems. The algorithm traverses a level-n
transition by expanding the corresponding level-(n − 1) transition system on-the-fly.
The level-n successors of a state are determined by computing a level-(n − 1)
reach set, which is then immediately released from memory. In this fashion, we
can exhaustively explore hierarchically structured state spaces whose flat counterparts
cause memory overflows.\r\n- \t We experimentally demonstrate the efficiency of
our method with three examples—a multiplier, a cache coherence protocol, and a
multiprocessor system. In the first two examples, we obtain significant improvements
in run times and peak BDD sizes over traditional state-space search. The third
example cannot be model checked at all using conventional methods (without manual
abstractions), but can be analyzed fully automatically using transition hierarchies."
acknowledgement: "This research was supported in part by the Office of Naval Research
Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER
award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the
Air Force Office of Scientific Research contract F49620-93-1-0056, by the Army Research
Office MURI grant DAAH-04-96-1-0341, by the Advanced Research Projects Agency grant
NAG2-892, and by the Semiconductor Research Corporation contract 95-DC-324.036.\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Sriram
full_name: Rajamani, Sriram
last_name: Rajamani
citation:
ama: 'Alur R, Henzinger TA, Rajamani S. Symbolic exploration of transition hierarchies.
In: Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. Vol 1384. Springer; 1998:330-344.
doi:10.1007/BFb0054181'
apa: 'Alur, R., Henzinger, T. A., & Rajamani, S. (1998). Symbolic exploration
of transition hierarchies. In Proceedings of the 4th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems (Vol.
1384, pp. 330–344). Lisbon, Portugal: Springer. https://doi.org/10.1007/BFb0054181'
chicago: Alur, Rajeev, Thomas A Henzinger, and Sriram Rajamani. “Symbolic Exploration
of Transition Hierarchies.” In Proceedings of the 4th International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, 1384:330–44.
Springer, 1998. https://doi.org/10.1007/BFb0054181.
ieee: R. Alur, T. A. Henzinger, and S. Rajamani, “Symbolic exploration of transition
hierarchies,” in Proceedings of the 4th International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal,
1998, vol. 1384, pp. 330–344.
ista: 'Alur R, Henzinger TA, Rajamani S. 1998. Symbolic exploration of transition
hierarchies. Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for
the Construction and Analysis of Systems, LNCS, vol. 1384, 330–344.'
mla: Alur, Rajeev, et al. “Symbolic Exploration of Transition Hierarchies.” Proceedings
of the 4th International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 1384, Springer, 1998, pp. 330–44, doi:10.1007/BFb0054181.
short: R. Alur, T.A. Henzinger, S. Rajamani, in:, Proceedings of the 4th International
Conference on Tools and Algorithms for the Construction and Analysis of Systems,
Springer, 1998, pp. 330–344.
conference:
end_date: 1998-04-04
location: Lisbon, Portugal
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 1998-03-28
date_created: 2018-12-11T12:09:43Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-23T08:44:36Z
day: '01'
doi: 10.1007/BFb0054181
extern: '1'
intvolume: ' 1384'
language:
- iso: eng
month: '01'
oa_version: None
page: 330 - 344
publication: Proceedings of the 4th International Conference on Tools and Algorithms
for the Construction and Analysis of Systems
publication_identifier:
isbn:
- '9783540643562'
publication_status: published
publisher: Springer
publist_id: '102'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Symbolic exploration of transition hierarchies
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1384
year: '1998'
...
---
_id: '4639'
abstract:
- lang: eng
text: 'An open system can be modeled as a two-player game between the system and
its environment. At each round of the game, player 1 (the system) and player 2
(the environment) independently and simultaneously choose moves, and the two choices
determine the next state of the game. Properties of open systems can be modeled
as objectives of these two-player games. For the basic objective of reachability-can
player 1 force the game to a given set of target states?-there are three types
of winning states, according to the degree of certainty with which player 1 can
reach the target. From type-1 states, player 1 has a deterministic strategy to
always reach the target. From type-2 states, player 1 has a randomized strategy
to reach the target with probability 1. From type-3 states, player 1 has for every
real ε>0 a randomized strategy to reach the target with probability greater
than 1-ε. We show that for finite state spaces, all three sets of winning states
can be computed in polynomial time: type-1 states in linear time, and type-2 and
type-3 states in quadratic time. The algorithms to compute the three sets of winning
states also enable the construction of the winning and spoiling strategies. Finally,
we apply our results by introducing a temporal logic in which all three kinds
of winning conditions can be specified, and which can be model checked in polynomial
time. This logic, called Randomized ATL, is suitable for reasoning about randomized
behavior in open (two-agent) as well as multi-agent systems'
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- 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: Orna
full_name: Kupferman, Orna
last_name: Kupferman
citation:
ama: 'De Alfaro L, Henzinger TA, Kupferman O. Concurrent reachability games. In:
Proceedings 39th Annual Symposium on Foundations of Computer Science.
IEEE; 1998:564-575. doi:10.1109/SFCS.1998.743507
'
apa: 'De Alfaro, L., Henzinger, T. A., & Kupferman, O. (1998). Concurrent reachability
games. In Proceedings 39th Annual Symposium on Foundations of Computer Science
(pp. 564–575). Palo Alto, CA, United States of America: IEEE. https://doi.org/10.1109/SFCS.1998.743507 '
chicago: De Alfaro, Luca, Thomas A Henzinger, and Orna Kupferman. “Concurrent Reachability
Games.” In Proceedings 39th Annual Symposium on Foundations of Computer Science,
564–75. IEEE, 1998. https://doi.org/10.1109/SFCS.1998.743507
.
ieee: L. De Alfaro, T. A. Henzinger, and O. Kupferman, “Concurrent reachability
games,” in Proceedings 39th Annual Symposium on Foundations of Computer Science,
Palo Alto, CA, United States of America, 1998, pp. 564–575.
ista: 'De Alfaro L, Henzinger TA, Kupferman O. 1998. Concurrent reachability games. Proceedings
39th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of
Computer Science, 564–575.'
mla: De Alfaro, Luca, et al. “Concurrent Reachability Games.” Proceedings 39th
Annual Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–75,
doi:10.1109/SFCS.1998.743507
.
short: L. De Alfaro, T.A. Henzinger, O. Kupferman, in:, Proceedings 39th Annual
Symposium on Foundations of Computer Science, IEEE, 1998, pp. 564–575.
conference:
end_date: 1998-11-11
location: Palo Alto, CA, United States of America
name: 'FOCS: Foundations of Computer Science'
start_date: 1998-11-08
date_created: 2018-12-11T12:09:53Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2022-08-22T14:09:02Z
day: '01'
doi: '10.1109/SFCS.1998.743507 '
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 564 - 575
publication: ' Proceedings 39th Annual Symposium on Foundations of Computer Science'
publication_identifier:
isbn:
- '0818691727'
publication_status: published
publisher: IEEE
publist_id: '68'
quality_controlled: '1'
status: public
title: Concurrent reachability games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
year: '1998'
...
---
_id: '6160'
abstract:
- lang: eng
text: Natural isolates of C. elegans exhibit either solitary or social feeding behavior.
Solitary foragers move slowly on a bacterial lawn and disperse across it, while
social foragers move rapidly on bacteria and aggregate together. A loss-of-function
mutation in the npr-1 gene, which encodes a predicted G protein–coupled receptor
similar to neuropeptide Y receptors, causes a solitary strain to take on social
behavior. Two isoforms of NPR-1 that differ at a single residue occur in the wild.
One isoform, NPR-1 215F, is found exclusively in social strains, while the other
isoform, NPR-1 215V, is found exclusively in solitary strains. An NPR-1 215V transgene
can induce solitary feeding behavior in a wild social strain. Thus, isoforms of
a putative neuropeptide receptor generate natural variation in C. elegans feeding
behavior.
author:
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
- first_name: Cornelia I
full_name: Bargmann, Cornelia I
last_name: Bargmann
citation:
ama: de Bono M, Bargmann CI. Natural variation in a neuropeptide Y receptor homolog
modifies social behavior and food response in C. elegans. Cell. 1998;94(5):679-689.
doi:10.1016/s0092-8674(00)81609-8
apa: de Bono, M., & Bargmann, C. I. (1998). Natural variation in a neuropeptide
Y receptor homolog modifies social behavior and food response in C. elegans. Cell.
Elsevier. https://doi.org/10.1016/s0092-8674(00)81609-8
chicago: Bono, Mario de, and Cornelia I Bargmann. “Natural Variation in a Neuropeptide
Y Receptor Homolog Modifies Social Behavior and Food Response in C. Elegans.”
Cell. Elsevier, 1998. https://doi.org/10.1016/s0092-8674(00)81609-8.
ieee: M. de Bono and C. I. Bargmann, “Natural variation in a neuropeptide Y receptor
homolog modifies social behavior and food response in C. elegans,” Cell,
vol. 94, no. 5. Elsevier, pp. 679–689, 1998.
ista: de Bono M, Bargmann CI. 1998. Natural variation in a neuropeptide Y receptor
homolog modifies social behavior and food response in C. elegans. Cell. 94(5),
679–689.
mla: de Bono, Mario, and Cornelia I. Bargmann. “Natural Variation in a Neuropeptide
Y Receptor Homolog Modifies Social Behavior and Food Response in C. Elegans.”
Cell, vol. 94, no. 5, Elsevier, 1998, pp. 679–89, doi:10.1016/s0092-8674(00)81609-8.
short: M. de Bono, C.I. Bargmann, Cell 94 (1998) 679–689.
date_created: 2019-03-21T10:32:06Z
date_published: 1998-09-04T00:00:00Z
date_updated: 2021-01-12T08:06:28Z
day: '04'
doi: 10.1016/s0092-8674(00)81609-8
extern: '1'
external_id:
pmid:
- '9741632'
intvolume: ' 94'
issue: '5'
language:
- iso: eng
month: '09'
oa_version: None
page: 679-689
pmid: 1
publication: Cell
publication_identifier:
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Natural variation in a neuropeptide Y receptor homolog modifies social behavior
and food response in C. elegans
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 94
year: '1998'
...
---
_id: '1449'
abstract:
- lang: eng
text: In this paper we consider a canonical compactification of M, the moduli space
of stable Higgs bundles with fixed determinant of odd degree over a Riemann surface
Σ, producing a projective variety M̄ = M ∪ Z. We give a detailed study of the
spaces M̄, Z and M. In doing so we reprove some assertions of Laumon and Thaddeus
on the nilpotent cone.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: Hausel T. Compactification of moduli of Higgs bundles. Journal fur die Reine
und Angewandte Mathematik. 1998;1998(503):169-192. doi:10.1515/crll.1998.096
apa: Hausel, T. (1998). Compactification of moduli of Higgs bundles. Journal
Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter. https://doi.org/10.1515/crll.1998.096
chicago: Hausel, Tamás. “Compactification of Moduli of Higgs Bundles.” Journal
Fur Die Reine Und Angewandte Mathematik. Walter de Gruyter, 1998. https://doi.org/10.1515/crll.1998.096.
ieee: T. Hausel, “Compactification of moduli of Higgs bundles,” Journal fur die
Reine und Angewandte Mathematik, vol. 1998, no. 503. Walter de Gruyter, pp.
169–192, 1998.
ista: Hausel T. 1998. Compactification of moduli of Higgs bundles. Journal fur die
Reine und Angewandte Mathematik. 1998(503), 169–192.
mla: Hausel, Tamás. “Compactification of Moduli of Higgs Bundles.” Journal Fur
Die Reine Und Angewandte Mathematik, vol. 1998, no. 503, Walter de Gruyter,
1998, pp. 169–92, doi:10.1515/crll.1998.096.
short: T. Hausel, Journal Fur Die Reine Und Angewandte Mathematik 1998 (1998) 169–192.
date_created: 2018-12-11T11:52:05Z
date_published: 1998-10-01T00:00:00Z
date_updated: 2022-09-01T13:51:07Z
day: '01'
doi: 10.1515/crll.1998.096
extern: '1'
external_id:
arxiv:
- math/9804083
intvolume: ' 1998'
issue: '503'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math/9804083
month: '10'
oa: 1
oa_version: Preprint
page: 169 - 192
publication: Journal fur die Reine und Angewandte Mathematik
publication_identifier:
issn:
- 1435-5345
publication_status: published
publisher: Walter de Gruyter
publist_id: '5746'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Compactification of moduli of Higgs bundles
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 1998
year: '1998'
...
---
_id: '1450'
abstract:
- lang: eng
text: In this paper we consider the topological side of a problem which is the analogue
of Sen's S-duality testing conjecture for Hitchin's moduli space M of rank 2 stable
Higgs bundles of fixed determinant of odd degree over a Riemann surface ∑. We
prove that all intersection numbers in the compactly supported cohomology of M
vanish, i.e. "there are no topological L2 harmonic forms on M". This
result generalizes the well known vanishing of the Euler characteristic of the
moduli space of rank 2 stable bundles N of fixed determinant of odd degree over
∑. Our proof shows that the vanishing of all intersection numbers of H* cpt(M)
is given by relations analogous to the Mumford relations in the cohomology ring
of N.
acknowledgement: "First of all I would like to thank my supervisor Nigel Hitchin for
suggesting Problem 1, and for his help and \r\n encouragement. I am grateful to
Michael Thaddeus for his inspiring paper [Thai], enlightening communications and
his constant interest in my work. I am also indebted to Manfred Lehn for the idea
of the proof of Theorem 6.2. I have found\r\nconversations with Michael Atiyah,
Frances Kirwan and Graeme Segal very stimulating. I thank the Mathematical Institute
and St. Catherine's College, Oxford for their hospitality during the preparation
of this work. Finally I thank Trinity College, Cambridge for financial support."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Tamas
full_name: Hausel, Tamas
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
citation:
ama: Hausel T. Vanishing of intersection numbers on the moduli space of Higgs bundles.
Advances in Theoretical and Mathematical Physics. 1998;2(5):1011-1040.
doi:10.4310/ATMP.1998.v2.n5.a3
apa: Hausel, T. (1998). Vanishing of intersection numbers on the moduli space of
Higgs bundles. Advances in Theoretical and Mathematical Physics. International
Press. https://doi.org/10.4310/ATMP.1998.v2.n5.a3
chicago: Hausel, Tamás. “Vanishing of Intersection Numbers on the Moduli Space of
Higgs Bundles.” Advances in Theoretical and Mathematical Physics. International
Press, 1998. https://doi.org/10.4310/ATMP.1998.v2.n5.a3.
ieee: T. Hausel, “Vanishing of intersection numbers on the moduli space of Higgs
bundles,” Advances in Theoretical and Mathematical Physics, vol. 2, no.
5. International Press, pp. 1011–1040, 1998.
ista: Hausel T. 1998. Vanishing of intersection numbers on the moduli space of Higgs
bundles. Advances in Theoretical and Mathematical Physics. 2(5), 1011–1040.
mla: Hausel, Tamás. “Vanishing of Intersection Numbers on the Moduli Space of Higgs
Bundles.” Advances in Theoretical and Mathematical Physics, vol. 2, no.
5, International Press, 1998, pp. 1011–40, doi:10.4310/ATMP.1998.v2.n5.a3.
short: T. Hausel, Advances in Theoretical and Mathematical Physics 2 (1998) 1011–1040.
date_created: 2018-12-11T11:52:06Z
date_published: 1998-09-01T00:00:00Z
date_updated: 2022-09-01T14:09:49Z
day: '01'
doi: 10.4310/ATMP.1998.v2.n5.a3
extern: '1'
external_id:
arxiv:
- math/9805071
intvolume: ' 2'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/math/9805071
month: '09'
oa: 1
oa_version: Preprint
page: 1011 - 1040
publication: Advances in Theoretical and Mathematical Physics
publication_identifier:
issn:
- 1095-0761
publication_status: published
publisher: International Press
publist_id: '5747'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Vanishing of intersection numbers on the moduli space of Higgs bundles
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2
year: '1998'
...
---
_id: '11926'
abstract:
- lang: eng
text: "We present the first polylog-competitive online algorithm for the general
multicast problem in the throughput model. The ratio of the number of requests
accepted by the optimum offline alaorithm to the exoected number of reauests accepted
by our algorithm is O(jlog n + log log M)(log n + log M) log n), where M is the
number of multicast groups and n is the number of nodes in the nraoh. We show
that this is close to optimum by presenting-an*R(log nlog M) lower\r\nbound on
this ratio for anv randomized online algorithm against an oblivious adversary,
when M is much lar&r than the link capacities. Our lower bound applies even in
the restricted case where the link capacities are much larger than bandwidth requested
by a single multicast. We also present a simple proof showing that it is impossible
to be competitive against an adaptive online adversary. As in the previous online
routing algorithms, our algorithm uses edge-costs when deciding on which is the
best path to use. In contrast to the nrevious comnetitive aleorithms in the throughput
modei, our cost is-not a direct function of the edne load. The new cost definition
allows us to decouple the effects of routing and admission decisions of different
multicast groups. "
article_processing_charge: No
author:
- first_name: Ashish
full_name: Goel, Ashish
last_name: Goel
- 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: Serge
full_name: Plotkin, Serge
last_name: Plotkin
citation:
ama: 'Goel A, Henzinger MH, Plotkin S. An online throughput-competitive algorithm
for multicast routing and admission control. In: 9th Annual ACM SIAM Symposium
on Discrete Algorithms. Society for Industrial and Applied Mathematics; 1998:97-106.'
apa: 'Goel, A., Henzinger, M. H., & Plotkin, S. (1998). An online throughput-competitive
algorithm for multicast routing and admission control. In 9th Annual ACM SIAM
Symposium on Discrete Algorithms (pp. 97–106). San Francisco, CA, United States:
Society for Industrial and Applied Mathematics.'
chicago: Goel, Ashish, Monika H Henzinger, and Serge Plotkin. “An Online Throughput-Competitive
Algorithm for Multicast Routing and Admission Control.” In 9th Annual ACM SIAM
Symposium on Discrete Algorithms, 97–106. Society for Industrial and Applied
Mathematics, 1998.
ieee: A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive
algorithm for multicast routing and admission control,” in 9th Annual ACM SIAM
Symposium on Discrete Algorithms, San Francisco, CA, United States, 1998,
pp. 97–106.
ista: 'Goel A, Henzinger MH, Plotkin S. 1998. An online throughput-competitive algorithm
for multicast routing and admission control. 9th Annual ACM SIAM Symposium on
Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 97–106.'
mla: Goel, Ashish, et al. “An Online Throughput-Competitive Algorithm for Multicast
Routing and Admission Control.” 9th Annual ACM SIAM Symposium on Discrete Algorithms,
Society for Industrial and Applied Mathematics, 1998, pp. 97–106.
short: A. Goel, M.H. Henzinger, S. Plotkin, in:, 9th Annual ACM SIAM Symposium on
Discrete Algorithms, Society for Industrial and Applied Mathematics, 1998, pp.
97–106.
conference:
end_date: 1998-01-27
location: San Francisco, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 1998-01-25
date_created: 2022-08-19T06:22:30Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2023-02-21T16:27:22Z
day: '01'
extern: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 97-106
publication: 9th Annual ACM SIAM Symposium on Discrete Algorithms
publication_identifier:
isbn:
- '0898714109'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '11763'
relation: later_version
status: public
scopus_import: '1'
status: public
title: An online throughput-competitive algorithm for multicast routing and admission
control
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '1998'
...
---
_id: '3487'
abstract:
- lang: eng
text: It is widely accepted that individual neurons in the central nervous system
release only a single fast transmitter. The possibility of corelease of fast neurotransmitters
was examined by making paired recordings from synaptically connected neurons in
spinal cord slices. Unitary inhibitory postsynaptic currents generated at interneuron-motoneuron
synapses consisted of a strychnine-sensitive, glycine receptor-mediated component
and a bicuculline-sensitive, γ-aminobutyric acid (GABA)(A) receptor-mediated component.
These results indicate that spinal interneurons release both glycine and GABA
to activate functionally distinct receptors in their postsynaptic target cells.
A subset of miniature synaptic currents also showed both components, consistent
with corelease from individual synaptic vesicles.
acknowledgement: "See comment by Nicoll RA, Malenka RC (1998) Science 281:360-361\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
- first_name: Joseph
full_name: Bischofberger, Joseph
last_name: Bischofberger
- first_name: Jürgen
full_name: Sandkühler, Jürgen
last_name: Sandkühler
citation:
ama: Jonas PM, Bischofberger J, Sandkühler J. Corelease of two fast neurotransmitters
at a central synapse. Science. 1998;281(5375):419-424. doi:10.1126/science.281.5375.419
apa: Jonas, P. M., Bischofberger, J., & Sandkühler, J. (1998). Corelease of
two fast neurotransmitters at a central synapse. Science. American Association
for the Advancement of Science. https://doi.org/10.1126/science.281.5375.419
chicago: Jonas, Peter M, Joseph Bischofberger, and Jürgen Sandkühler. “Corelease
of Two Fast Neurotransmitters at a Central Synapse.” Science. American
Association for the Advancement of Science, 1998. https://doi.org/10.1126/science.281.5375.419.
ieee: P. M. Jonas, J. Bischofberger, and J. Sandkühler, “Corelease of two fast neurotransmitters
at a central synapse,” Science, vol. 281, no. 5375. American Association
for the Advancement of Science, pp. 419–424, 1998.
ista: Jonas PM, Bischofberger J, Sandkühler J. 1998. Corelease of two fast neurotransmitters
at a central synapse. Science. 281(5375), 419–424.
mla: Jonas, Peter M., et al. “Corelease of Two Fast Neurotransmitters at a Central
Synapse.” Science, vol. 281, no. 5375, American Association for the Advancement
of Science, 1998, pp. 419–24, doi:10.1126/science.281.5375.419.
short: P.M. Jonas, J. Bischofberger, J. Sandkühler, Science 281 (1998) 419–424.
date_created: 2018-12-11T12:03:35Z
date_published: 1998-07-17T00:00:00Z
date_updated: 2022-08-29T14:52:38Z
day: '17'
doi: 10.1126/science.281.5375.419
extern: '1'
external_id:
pmid:
- '9665886 '
intvolume: ' 281'
issue: '5375'
language:
- iso: eng
month: '07'
oa_version: None
page: 419 - 424
pmid: 1
publication: Science
publication_identifier:
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '2900'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Corelease of two fast neurotransmitters at a central synapse
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 281
year: '1998'
...
---
_id: '3488'
abstract:
- lang: eng
text: We have examined gating and pharmacological characteristics of somatic K+
channels in fast-spiking interneurons and regularly spiking principal neurons
of hippocampal slices. In nucleated patches isolated from basket cells of the
dentate gyrus, a fast delayed rectifier K+ current component that was highly sensitive
to tetraethylammonium (TEA) and 4-aminopyridine (4- AP) (half-maximal inhibitory
concentrations <0.1 mM) predominated, contributing an average of 58% to the
total K+ current in these cells. By contrast, in pyramidal neurons of the CA1
region a rapidly inactivating A- type K+ current component that was TEA-resistant
prevailed, contributing 61% to the total K+ current. Both types of neurons also
showed small amounts of the K+ current component mainly found in the other type
of neuron and, in addition, a slow delayed rectifier K+ current component with
intermediate properties (sow inactivation, intermediate sensitivity to TEA). Single-cell
RT-PCR analysis of mRNA revealed that Kv3 (Kv3.1, Kv3.2) subunit transcripts were
expressed in almost all (89%) of the interneurons but only in 17% of the pyramidal
neurons. In contrast, Kv4 (Kv4.2, Kv4.3) subunit mRNAs were present in 87% of
pyramidal neurons but only in 55% of interneurons. Selective block of fast delayed
rectifier K+ channels, presumably assembled from Kv3 subunits, by 4-AP reduced
substantially the action potential frequency in interneurons. These results indicate
that the differential expression of Kv3 and Kv4 subunits shapes the action potential
phenotypes of principal neurons and interneurons in the cortex.
acknowledgement: Supported by German Israeli Foundation Grant I 0352–073.01/94 to
P.J. and Deutsche Forschungsgemeinschaft Grant Mo 432/3–1 to H.M. We thank Drs.
L. Y. Jan, D. McKinnon, O. Pongs, L. Salkoff, S. H. Snyder, and J. S. Trimmer for
providing plasmids, Dr. D. J. Surmeier for sharing unpublished data, and Drs. J.
Bischofberger and J. R. P. Geiger for critically reading this manuscript. M.M. and
J.H.S. contributed equally to this work.
article_processing_charge: No
article_type: original
author:
- first_name: Marco
full_name: Martina, Marco
last_name: Martina
- first_name: Jobst
full_name: Schultz, Jobst
last_name: Schultz
- first_name: Heimo
full_name: Ehmke, Heimo
last_name: Ehmke
- first_name: Hannah
full_name: Monyer, Hannah
last_name: Monyer
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Martina M, Schultz J, Ehmke H, Monyer H, Jonas PM. Functional and molecular
differences between voltage-gated K+ channels of fast-spiking interneurons and
pyramidal neurons of rat hippocampus. Journal of Neuroscience. 1998;18(20):8111-8125.
doi:10.1523/JNEUROSCI.18-20-08111.1998
apa: Martina, M., Schultz, J., Ehmke, H., Monyer, H., & Jonas, P. M. (1998).
Functional and molecular differences between voltage-gated K+ channels of fast-spiking
interneurons and pyramidal neurons of rat hippocampus. Journal of Neuroscience.
Society for Neuroscience. https://doi.org/10.1523/JNEUROSCI.18-20-08111.1998
chicago: Martina, Marco, Jobst Schultz, Heimo Ehmke, Hannah Monyer, and Peter M
Jonas. “Functional and Molecular Differences between Voltage-Gated K+ Channels
of Fast-Spiking Interneurons and Pyramidal Neurons of Rat Hippocampus.” Journal
of Neuroscience. Society for Neuroscience, 1998. https://doi.org/10.1523/JNEUROSCI.18-20-08111.1998.
ieee: M. Martina, J. Schultz, H. Ehmke, H. Monyer, and P. M. Jonas, “Functional
and molecular differences between voltage-gated K+ channels of fast-spiking interneurons
and pyramidal neurons of rat hippocampus,” Journal of Neuroscience, vol.
18, no. 20. Society for Neuroscience, pp. 8111–8125, 1998.
ista: Martina M, Schultz J, Ehmke H, Monyer H, Jonas PM. 1998. Functional and molecular
differences between voltage-gated K+ channels of fast-spiking interneurons and
pyramidal neurons of rat hippocampus. Journal of Neuroscience. 18(20), 8111–8125.
mla: Martina, Marco, et al. “Functional and Molecular Differences between Voltage-Gated
K+ Channels of Fast-Spiking Interneurons and Pyramidal Neurons of Rat Hippocampus.”
Journal of Neuroscience, vol. 18, no. 20, Society for Neuroscience, 1998,
pp. 8111–25, doi:10.1523/JNEUROSCI.18-20-08111.1998.
short: M. Martina, J. Schultz, H. Ehmke, H. Monyer, P.M. Jonas, Journal of Neuroscience
18 (1998) 8111–8125.
date_created: 2018-12-11T12:03:35Z
date_published: 1998-10-15T00:00:00Z
date_updated: 2022-08-29T14:20:39Z
day: '15'
doi: 10.1523/JNEUROSCI.18-20-08111.1998
extern: '1'
external_id:
pmid:
- '9763458'
intvolume: ' 18'
issue: '20'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6792860/
month: '10'
oa: 1
oa_version: None
page: 8111 - 8125
pmid: 1
publication: Journal of Neuroscience
publication_identifier:
issn:
- 0270-6474
publication_status: published
publisher: Society for Neuroscience
publist_id: '2899'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Functional and molecular differences between voltage-gated K+ channels of fast-spiking
interneurons and pyramidal neurons of rat hippocampus
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 18
year: '1998'
...
---
_id: '3506'
abstract:
- lang: eng
text: A method of geometric morphing between a first object having a first shape
and a second object having a second shape. The method includes the steps of generating
a first Delaunay complex corresponding to the first shape and a second Delaunay
complex corresponding to the second shape and generating a plurality of intermediary
Delaunay complexes defined by a continuous family of mixed shapes corresponding
to a mixing of the first shape and the second shape. The method further includes
the steps of constructing a first skin corresponding to the first Delaunay complex
and a second skin corresponding to the second Delaunay complex and constructing
a plurality of intermediary skins corresponding to the plurality of intermediary
Delaunay complexes. The first skin, second skin and plurality of intermediary
skins may be visually displayed on an output device.
applicant:
- Raindrop Geomagic, Inc.
article_processing_charge: No
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Ping
full_name: Fu, Ping
last_name: Fu
citation:
ama: Edelsbrunner H, Fu P. Apparatus and method for geometric morphing. 1998.
apa: Edelsbrunner, H., & Fu, P. (1998). Apparatus and method for geometric morphing.
chicago: Edelsbrunner, Herbert, and Ping Fu. “Apparatus and Method for Geometric
Morphing,” 1998.
ieee: H. Edelsbrunner and P. Fu, “Apparatus and method for geometric morphing.”
1998.
ista: Edelsbrunner H, Fu P. 1998. Apparatus and method for geometric morphing.
mla: Edelsbrunner, Herbert, and Ping Fu. Apparatus and Method for Geometric Morphing.
1998.
short: H. Edelsbrunner, P. Fu, (1998).
date_created: 2018-12-11T12:03:41Z
date_published: 1998-12-15T00:00:00Z
date_updated: 2022-01-05T15:16:35Z
day: '15'
extern: '1'
ipc: G06T13/20 ; G06T2210/44
ipn: US5850229A
main_file_link:
- open_access: '1'
url: https://patents.google.com/patent/US5850229A
month: '12'
oa: 1
oa_version: Published Version
publication_date: 1998-12-15
publist_id: '2881'
status: public
title: Apparatus and method for geometric morphing
type: patent
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '1998'
...
---
_id: '3521'
abstract:
- lang: eng
text: Spike transmission probability between pyramidal cells and interneurons in
the CA1 pyramidal layer was investigated in the behaving rat by the simultaneous
recording of neuronal ensembles. Population synchrony was strongest during sharp
wave (SPW) bursts. However, the increase was three times larger for pyramidal
cells than for interneurons. The contribution of single pyramidal cells to the
discharge of interneurons was often large (up to 0.6 probability), as assessed
by the presence of significant (<3 ms) peaks in the cross-correlogram. Complex-spike
bursts were more effective than single spikes. Single cell contribution was higher
between SPW bursts than during SPWs or theta activity. Hence, single pyramidal
cells can reliably discharge interneurons, and the probability of spike transmission
is behavior dependent.
acknowledgement: We thank C. King, R. Miles, M. Recce, and the anonymous reviewers
for their constructive comments on the manuscript. This work was supported by the
National Institutes of Health (NS34994, MH54671 1P41RR09754), the Human Frontier
Science Program, and the Whitehall Foundation.
article_processing_charge: No
article_type: original
author:
- first_name: Jozsef L
full_name: Csicsvari, Jozsef L
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: András
full_name: Czurkó, András
last_name: Czurkó
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: 'Csicsvari JL, Hirase H, Czurkó A, Buzsáki G. Reliability and state dependence
of pyramidal cell-interneuron synapses in the hippocampus: an ensemble approach
in the behaving rat. Neuron. 1998;21(1):179-189. doi:10.1016/S0896-6273(00)80525-5'
apa: 'Csicsvari, J. L., Hirase, H., Czurkó, A., & Buzsáki, G. (1998). Reliability
and state dependence of pyramidal cell-interneuron synapses in the hippocampus:
an ensemble approach in the behaving rat. Neuron. Elsevier. https://doi.org/10.1016/S0896-6273(00)80525-5'
chicago: 'Csicsvari, Jozsef L, Hajima Hirase, András Czurkó, and György Buzsáki.
“Reliability and State Dependence of Pyramidal Cell-Interneuron Synapses in the
Hippocampus: An Ensemble Approach in the Behaving Rat.” Neuron. Elsevier,
1998. https://doi.org/10.1016/S0896-6273(00)80525-5.'
ieee: 'J. L. Csicsvari, H. Hirase, A. Czurkó, and G. Buzsáki, “Reliability and state
dependence of pyramidal cell-interneuron synapses in the hippocampus: an ensemble
approach in the behaving rat,” Neuron, vol. 21, no. 1. Elsevier, pp. 179–189,
1998.'
ista: 'Csicsvari JL, Hirase H, Czurkó A, Buzsáki G. 1998. Reliability and state
dependence of pyramidal cell-interneuron synapses in the hippocampus: an ensemble
approach in the behaving rat. Neuron. 21(1), 179–189.'
mla: 'Csicsvari, Jozsef L., et al. “Reliability and State Dependence of Pyramidal
Cell-Interneuron Synapses in the Hippocampus: An Ensemble Approach in the Behaving
Rat.” Neuron, vol. 21, no. 1, Elsevier, 1998, pp. 179–89, doi:10.1016/S0896-6273(00)80525-5.'
short: J.L. Csicsvari, H. Hirase, A. Czurkó, G. Buzsáki, Neuron 21 (1998) 179–189.
date_created: 2018-12-11T12:03:46Z
date_published: 1998-07-01T00:00:00Z
date_updated: 2022-08-29T14:03:55Z
day: '01'
doi: 10.1016/S0896-6273(00)80525-5
extern: '1'
external_id:
pmid:
- '9697862 '
intvolume: ' 21'
issue: '1'
language:
- iso: eng
month: '07'
oa_version: None
page: 179 - 189
pmid: 1
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
publist_id: '2865'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Reliability and state dependence of pyramidal cell-interneuron synapses in
the hippocampus: an ensemble approach in the behaving rat'
type: journal_article
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 21
year: '1998'
...
---
_id: '3525'
author:
- first_name: Zoltán
full_name: Nádasdy, Zoltán
last_name: Nádasdy
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: András
full_name: Czurkó, András
last_name: Czurkó
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Nádasdy Z, Csicsvari JL, Hirase H, Czurkó A, Buzsáki G. Persistence and temporal
compression of spike sequences during fast field oscillation in the hippocampus.
European Journal of Neuroscience. 1998;10(Suppl. 10):9409-9409.
apa: Nádasdy, Z., Csicsvari, J. L., Hirase, H., Czurkó, A., & Buzsáki, G. (1998).
Persistence and temporal compression of spike sequences during fast field oscillation
in the hippocampus. European Journal of Neuroscience. Wiley-Blackwell.
chicago: Nádasdy, Zoltán, Jozsef L Csicsvari, Hajima Hirase, András Czurkó, and
György Buzsáki. “Persistence and Temporal Compression of Spike Sequences during
Fast Field Oscillation in the Hippocampus.” European Journal of Neuroscience.
Wiley-Blackwell, 1998.
ieee: Z. Nádasdy, J. L. Csicsvari, H. Hirase, A. Czurkó, and G. Buzsáki, “Persistence
and temporal compression of spike sequences during fast field oscillation in the
hippocampus,” European Journal of Neuroscience, vol. 10, no. Suppl. 10.
Wiley-Blackwell, pp. 9409–9409, 1998.
ista: Nádasdy Z, Csicsvari JL, Hirase H, Czurkó A, Buzsáki G. 1998. Persistence
and temporal compression of spike sequences during fast field oscillation in the
hippocampus. European Journal of Neuroscience. 10(Suppl. 10), 9409–9409.
mla: Nádasdy, Zoltán, et al. “Persistence and Temporal Compression of Spike Sequences
during Fast Field Oscillation in the Hippocampus.” European Journal of Neuroscience,
vol. 10, no. Suppl. 10, Wiley-Blackwell, 1998, pp. 9409–9409.
short: Z. Nádasdy, J.L. Csicsvari, H. Hirase, A. Czurkó, G. Buzsáki, European Journal
of Neuroscience 10 (1998) 9409–9409.
date_created: 2018-12-11T12:03:47Z
date_published: 1998-06-01T00:00:00Z
date_updated: 2021-01-12T07:44:04Z
day: '01'
extern: 1
intvolume: ' 10'
issue: Suppl. 10
month: '06'
page: 9409 - 9409
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2861'
quality_controlled: 0
status: public
title: Persistence and temporal compression of spike sequences during fast field oscillation
in the hippocampus
type: journal_article
volume: 10
year: '1998'
...
---
_id: '3527'
author:
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: András
full_name: Czurkó, András
last_name: Czurkó
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: Csicsvari JL, Czurkó A, Hirase H, Buzsáki G. Monosynaptic interactions between
CA1 Pyramidal cells and interneuron in the behaving rat. European Journal of
Neuroscience. 1998;10(Suppl. 10):2553-2553.
apa: Csicsvari, J. L., Czurkó, A., Hirase, H., & Buzsáki, G. (1998). Monosynaptic
interactions between CA1 Pyramidal cells and interneuron in the behaving rat.
European Journal of Neuroscience. Wiley-Blackwell.
chicago: Csicsvari, Jozsef L, András Czurkó, Hajima Hirase, and György Buzsáki.
“Monosynaptic Interactions between CA1 Pyramidal Cells and Interneuron in the
Behaving Rat.” European Journal of Neuroscience. Wiley-Blackwell, 1998.
ieee: J. L. Csicsvari, A. Czurkó, H. Hirase, and G. Buzsáki, “Monosynaptic interactions
between CA1 Pyramidal cells and interneuron in the behaving rat,” European
Journal of Neuroscience, vol. 10, no. Suppl. 10. Wiley-Blackwell, pp. 2553–2553,
1998.
ista: Csicsvari JL, Czurkó A, Hirase H, Buzsáki G. 1998. Monosynaptic interactions
between CA1 Pyramidal cells and interneuron in the behaving rat. European Journal
of Neuroscience. 10(Suppl. 10), 2553–2553.
mla: Csicsvari, Jozsef L., et al. “Monosynaptic Interactions between CA1 Pyramidal
Cells and Interneuron in the Behaving Rat.” European Journal of Neuroscience,
vol. 10, no. Suppl. 10, Wiley-Blackwell, 1998, pp. 2553–2553.
short: J.L. Csicsvari, A. Czurkó, H. Hirase, G. Buzsáki, European Journal of Neuroscience
10 (1998) 2553–2553.
date_created: 2018-12-11T12:03:48Z
date_published: 1998-06-01T00:00:00Z
date_updated: 2021-01-12T07:44:05Z
day: '01'
extern: 1
intvolume: ' 10'
issue: Suppl. 10
month: '06'
page: 2553 - 2553
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2858'
quality_controlled: 0
status: public
title: Monosynaptic interactions between CA1 Pyramidal cells and interneuron in the
behaving rat
type: journal_article
volume: 10
year: '1998'
...
---
_id: '3535'
author:
- first_name: Hajima
full_name: Hirase, Hajima
last_name: Hirase
- first_name: András
full_name: Czurkó, András
last_name: Czurkó
- first_name: Jozsef L
full_name: Jozsef Csicsvari
id: 3FA14672-F248-11E8-B48F-1D18A9856A87
last_name: Csicsvari
orcid: 0000-0002-5193-4036
- first_name: György
full_name: Buzsáki, György
last_name: Buzsáki
citation:
ama: 'Hirase H, Czurkó A, Csicsvari JL, Buzsáki G. Hippocampal pyramidal neutrons
“space-clamped” in a running wheel task: Place cells or path integrators? European
Journal of Neuroscience. 1998;10(Suppl. 10):9932-9932.'
apa: 'Hirase, H., Czurkó, A., Csicsvari, J. L., & Buzsáki, G. (1998). Hippocampal
pyramidal neutrons “space-clamped” in a running wheel task: Place cells or path
integrators? European Journal of Neuroscience. Wiley-Blackwell.'
chicago: 'Hirase, Hajima, András Czurkó, Jozsef L Csicsvari, and György Buzsáki.
“Hippocampal Pyramidal Neutrons ‘Space-Clamped’ in a Running Wheel Task: Place
Cells or Path Integrators?” European Journal of Neuroscience. Wiley-Blackwell,
1998.'
ieee: 'H. Hirase, A. Czurkó, J. L. Csicsvari, and G. Buzsáki, “Hippocampal pyramidal
neutrons ‘space-clamped’ in a running wheel task: Place cells or path integrators?,”
European Journal of Neuroscience, vol. 10, no. Suppl. 10. Wiley-Blackwell,
pp. 9932–9932, 1998.'
ista: 'Hirase H, Czurkó A, Csicsvari JL, Buzsáki G. 1998. Hippocampal pyramidal
neutrons “space-clamped” in a running wheel task: Place cells or path integrators?
European Journal of Neuroscience. 10(Suppl. 10), 9932–9932.'
mla: 'Hirase, Hajima, et al. “Hippocampal Pyramidal Neutrons ‘Space-Clamped’ in
a Running Wheel Task: Place Cells or Path Integrators?” European Journal of
Neuroscience, vol. 10, no. Suppl. 10, Wiley-Blackwell, 1998, pp. 9932–9932.'
short: H. Hirase, A. Czurkó, J.L. Csicsvari, G. Buzsáki, European Journal of Neuroscience
10 (1998) 9932–9932.
date_created: 2018-12-11T12:03:50Z
date_published: 1998-01-01T00:00:00Z
date_updated: 2021-01-12T07:44:08Z
day: '01'
extern: 1
intvolume: ' 10'
issue: Suppl. 10
month: '01'
page: 9932 - 9932
publication: European Journal of Neuroscience
publication_status: published
publisher: Wiley-Blackwell
publist_id: '2850'
quality_controlled: 0
status: public
title: 'Hippocampal pyramidal neutrons “space-clamped” in a running wheel task: Place
cells or path integrators?'
type: journal_article
volume: 10
year: '1998'
...