| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Orna Kupferman, Moshe Y. Vardi |
Weak Alternating Automata Are Not That Weak.  |
ISTCS  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gilles Brassard, Peter Høyer |
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaime Cohen, Claudio L. Lucchesi |
Minimax relations for T-join packing problems. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
minimax relations, T-join packing problems, algorithmic results, structural results, minimum T-cut, maximization problem, theorem proving, polynomial time algorithm, perfect matchings, minimax techniques |
| 1 | Yossi Azar, Leah Epstein |
On-Line Load Balancing of Temporary Tasks on Identical Machines. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Boneh, Richard J. Lipton |
Effect of Operators on Straight Line Complexity. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
straight line complexity, conditional result, explicit linear operators, lower bounds, theorem proving, multivariate polynomials |
| 1 | Vladimir Grebinski, Gregory Kucherov |
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Ishai, Eyal Kushilevitz |
Private Simultaneous Messages Protocols with Applications. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Micah Adler, Yair Bartal, John W. Byers, Michael Luby, Danny Raz |
A Modular Analysis of Network Transmission Protocols. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Ron Shamir, Dekel Tsur |
Faster subtree isomorphism. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
subtree isomorphism problem, graph theory, randomized algorithm, trees, trees (mathematics), computation time, vertices, decision problem |
| 1 | Yefim Dinitz, Tamar Eilam, Shlomo Moran, Shmuel Zaks |
On the totalk-diameter of connection networks. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
k edge-disjoint paths, minimal sum of lengths, fault-tolerant routing problems, k-connected simple graph, total/sub k/-diameter, graph theory, lower bound, ATM networks, upper bound, nodes, compact routing, connection network |
| 1 | Takao Asano |
Approximation Algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Capelle, Michel Habib |
Graph decompositions and factorizing permutations. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
factorizing permutations, decomposition sets, inheritance graph decomposition, optimization, graph theory, vertices, undirected graph, chordal graphs, graph decompositions, decomposition algorithms, linear algorithm, modular decomposition, decomposition tree |
| 1 | Jeffrey C. Jackson, Eli Shamir 0001, Clara Shwartzman |
Learning with Queries Corrupted by Classification Noise. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, Ramat-Gan, Israel, June 17-19, 1997, Proceedings |
ISTCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Mordecai J. Golin, Assaf Schuster |
Optimal point-to-point broadcast algorithms via lopsided trees. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
optimal point-to-point broadcast algorithms, lopsided trees, point-to-point packet-switched processor networks, optimal broadcast algorithms, optimal broadcast algorithm, optical ring, multiport multimedia model, message passing, POSTAL model |
| 1 | Richard Beigel, Richard Chang 0001 |
Commutative Queries. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Shlomi Dolev |
Local Stabilizer. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Robert Krauthgamer |
Stereoscopic families of permutations, and their applications. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Richard Beigel |
Closure Properties of GapP and #P. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bin Fu, Richard Beigel |
A Comparison of Resource-Bounded Molecular Computation Models. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Pat Frankel |
Exact Analysis of Exact Change. |
ISTCS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Cees Witteveen, Wiebe van der Hoek |
Updating Nonmonotonic Databases. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Nancy A. Lynch, Sergio Rajsbaum |
On the Borowsky-Gafni Simulation Algorithm. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Silvia M. Müller, Wolfgang J. Paul |
Making the Original Scoreboard Mechanism Deadlock Free. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin |
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Stuart W. Margolis, Mark V. Sapir, Pascal Weil |
On the Indecomposibility of Certain Language Classes. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Yishay Mansour, Michal Parnas |
On Learning Conjunctions with Malicious Noise. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Richard Zippel |
On Satisfiability. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | William R. Pulleyblank |
The Airline Crew Pairing Optimization Problem. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Frank Thomson Leighton |
How to Pick a Winner Almost Every Time: Provably-Good Algorithms for Decision Making in the Face of Uncertainty. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Micha Sharir |
Arrangements of Curves and Surfaces in Computational Geometry. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Judit Bar-Ilan, Guy Kortsarz, David Peleg |
Generalized Submodular Cover Problems and Applications. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Moni Naor, Sitvanit Ruah |
On the Decisional Complexity of Problems Over the Reals. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim |
On the Parallel Computation of Boolean Functions on Unrelated inputs. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shlomi Dolev, Evangelos Kranakis, Danny Krizanc |
Baked Potato Routing. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Israel A. Wagner, Michael Lindenbaum, Alfred M. Bruckstein |
Smell as a Computational Resource - A Lesson We Can Learn from the Ant. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Shimon Ullman |
Visual Object Recognition. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | |
Fourth Israel Symposium on Theory of Computing and Systems, ISTCS 1996, Jerusalem, Israel, June 10-12, 1996, Proceedings |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Ron Shamir |
Physical Maps and Interval Sandwich Problems: Bounded Degrees Help. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi |
On the Hardness of Approximating Max k-Cut and Its Dual. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Michael Codish, Vitaly Lagoon |
Type Dependencies for Logic Programs Using ACI-Unification. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Pierluigi Crescenzi, Riccardo Silvestri, Luca Trevisan |
To Weight or Not to Weight: Where is the Question? |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Roded Sharan, Avi Wigderson |
A New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf |
Feasibility and Unfeasibility of Off-Line Processing. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Paolo Boldi, Shella Shammah, Sebastiano Vigna, Bruno Codenotti, Peter Gemmell, Janos Simon |
Symmetry Breaking in Anonymous Networks: Characterizations. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Uriel Feige, Yuri Rabinovich |
Deterministic Approximation of the Cover Time. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Thorsten Altenkirch, Martin Hofmann 0001, Thomas Streicher |
Reduction-Free Normalisation for a Polymorphic System. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Benny Chor, Yuval Ishai |
On Privacy and Partition Arguments. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Baruch Awerbuch, Yossi Azar, Amos Fiat |
Packet Routing via Min-Cost Circuit Routing. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Y. B. Karasik |
On Advances in Optical Computational Models and Problems which They Help to Solve. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Amotz Bar-Noy, Hadas Shachnai, Tami Tamir |
On Chromatic Sums and Distributed Resource Allocation. |
ISTCS |
1996 |
DBLP BibTeX RDF |
|
| 1 | Carsten Rössner, Claus-Peter Schnorr |
Computation of Highly Regular Nearby Points. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Czumaj, Friedhelm Meyer auf der Heide, Volker Stemann |
Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolai K. Vereshchagin |
NP-sets are Co-NP-immune Relative to a Random Oracle. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Brit, Shlomo Moran, Gadi Taubenfeld |
Public Data Structures: Counters as a Special Case (Abridged Version). |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain J. Mayer, Moni Naor, Larry J. Stockmeyer |
Local Computations on Static and Dynamic Graphs (Preliminary Version). |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Tal Goldberg, Uri Zwick |
Optimal deterministic approximate parallel prefix sums and their applications. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige |
Observations on Hot Potato Routing. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Third Israel Symposium on Theory of Computing and Systems, ISTCS 1995, Tel Aviv, Israel, January 4-6, 1995, Proceedings |
ISTCS |
1995 |
DBLP BibTeX RDF |
|
| 1 | Mihir Bellare, Uriel Feige, Joe Kilian |
On the Role of Shared Randomness in Two Prover Proof Systems. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Ben-Dor, Amos Israeli, Asaf Shirazi |
Dynamic Counting. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, Michel X. Goemans |
Aproximating the Value of Two Prover Proof Systems, With Applications to MAX 2SAT and MAX DICUT. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Joe Kilian, Moni Naor |
On the Complexity of Statistical Reasoning (extended abtract). |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | David Harel, Eli Singerman |
More on Nonregular PDL: Expressive Power, Finite Models, Fibonacci Programs. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Høyer |
A General Technique for Implementation of Efficient Priority Queues. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rob Gerth, Ruurd Kuiper 0001, Doron A. Peled, Wojciech Penczek |
A Partial Order Approach to Branching Time Logic Model Checking. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikolai K. Vereshchagin |
Lower Bounds for Perceptrons Solving some Separation Problems and Oracle Separation of AM from PP. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon M. Kleinberg, Hagit Attiya, Nancy A. Lynch |
Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran |
Using Approximate Agreement to Obtain Complete Disagreement: The Output Structure of Input-Free Asynchronous Computations. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Avi Wigderson |
Computational Pseudo-Randomness. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz |
Improved Algorithms in Geometric Optimization via Expanders. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Berkman, Phillip B. Gibbons, Yossi Matias |
On the Power of Randomization for the Common PRAM. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yaron Riany, Nir Shavit, Dan Touitou |
Towards A Practical Snapshot Algorithm. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Dor, Uri Zwick |
Finding percentile elements. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos, David A. Mix Barrington |
A Lower Bound on the Mod 6 Degree of the OR Function. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Sgall |
Randomized On-Line Scheduling of Parallel Jobs. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeanette P. Schmidt |
All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Katalin Friedl, Madhu Sudan 0001 |
Some Improvements to Total Degree Tests. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Petersen 0001 |
Automata with Sensing Heads. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Ishai Ben-Aroya, Ilan Newman, Assaf Schuster |
Randomized Single-Target Hot-Potato Routing. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel A. Pevzner, Michael S. Waterman |
Open Combinatorial Problems in Computational Molecular Biology. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | G. Gemünd, M. Jakob, Werner Massonne, Wolfgang J. Paul, B. Spengler |
High Performance Transaction Systems on the SB-PRAM. |
ISTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Juan A. Garay, Inder S. Gopal, Shay Kutten, Yishay Mansour, Moti Yung |
Efficient On-Line Call Control Algorithms. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Diane Hernek |
Random Walks on Colored Graphs. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir |
The Las-Vegas Processor Identity Problem (How and When to Be Unique). |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Zurab Khasidashvili |
On the Equivalence of Persistent Term Rewriting Systems and Recursive Program Schemes. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Lengauer |
Algorithmic Research Problems in Molecular Bioinformatics. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Edith Cohen |
Using Selective Path-Doubling for Parallel Shortest-Path Computations. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Kaisa Sere |
A Formalization of Superposition Refinement. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg, Gideon Schechtman, Avishai Wool |
Approximating Bounded 0-1 Integer Linear Programs. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Alon Efrat, Craig Gotsman |
Subpixel Image Registration Using Circular Fiducials. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihir Bellare |
Interactive Proofs and Approximation: Reduction from Two Provers in One Round. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald I. Greenberg, Jau-Der Shih |
Feasible Offset an Optimal Offset for Single-Layer Channel Routing. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Erez Petrank |
The Hardness of Approximation: Gap Location. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Håstad, Steven J. Phillips, Shmuel Safra |
A Well-Characterized Approximation Problem. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Ben-Dor, Shai Halevi |
Zero-One Permanent is #P-Complete, A Simpler Proof. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Second Israel Symposium on Theory of Computing Systems, ISTCS 1993, Natanya, Israel, June 7-9, 1993, Proceedings |
ISTCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Khanna, Nathan Linial, Shmuel Safra |
On the Hardness of Approximating the Chromatic Number. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Shafi Goldwasser |
Efficient Interactive Proofs and Applications to Approximation. |
ISTCS |
1993 |
DBLP BibTeX RDF |
|
| 1 | Frank A. Stomp |
Structured Design of Self-Stabilizing Programs. |
ISTCS |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license